diff --git a/dune/tnnmg/problem-classes/bisection.hh b/dune/tnnmg/problem-classes/bisection.hh
index f315f289cc54797c3123f6564f981244753f3079..2a7d14ba94de03d7fe5cbecceffae4aa5ed84963 100644
--- a/dune/tnnmg/problem-classes/bisection.hh
+++ b/dune/tnnmg/problem-classes/bisection.hh
@@ -74,7 +74,11 @@ class Bisection
             J.subDiff(x, DJ);
             ++count;
             if (DJ.containsZero(safety_))
+            {
+                if (verbosity > 0)
+                    std::cout << "Bisection: initial iterate " << x << " accepted, DJ = " << DJ << std::endl;
                 return x;
+            }
 
             // compute initial interval
             // if quadratic part is strictly positive we can compute one bound from the other