One measure of the stability of a matrix

is the distance to the nearest unstable matrix

. Recently Van Loan presented an algorithm to compute

which depended on a conjecture about the location of its eigenvalues. We provide a counterexample to this conjecture which shows that the algorithm may overestimate the distance to

by an arbitrary amount. The same counterexample invalidates another conjecture and algorithm of the author.