//! Kani harnesses for `crate::linalg`.
use crate;
/// `lu_decompose` on a symbolic 3×3 matrix with finite entries either
/// returns `Err` or a factorization whose entries are all finite.
// The bound must exceed the trip count of the longest loop. The nine-element
// fill below runs nine times, so ten is the smallest value that lets the
// unwinding assertion discharge; at six it fails outright, which is what this
// harness did from the day it was written.