diff --git a/src/math/lp/lp_bound_propagator.cpp b/src/math/lp/lp_bound_propagator.cpp
index 98ecda018..2242d63e5 100644
--- a/src/math/lp/lp_bound_propagator.cpp
+++ b/src/math/lp/lp_bound_propagator.cpp
@@ -22,9 +22,6 @@ void lp_bound_propagator::try_add_bound(mpq const& v, unsigned j, bool is_low, b
     if (strict)
         kind = static_cast<lconstraint_kind>(kind / 2);
     
-//    static unsigned s_count = 0, a_count = 0;
-//    ++a_count;
-//    if ((a_count % 100000) == 0) std::cout << s_count << " / " << a_count << "\n";
     if (!bound_is_interesting(j, kind, v))
         return;
      unsigned k; // index to ibounds
@@ -32,12 +29,10 @@ void lp_bound_propagator::try_add_bound(mpq const& v, unsigned j, bool is_low, b
          if (try_get_value(m_improved_lower_bounds, j, k)) {
              auto & found_bound = m_ibounds[k];
              if (v > found_bound.m_bound || (v == found_bound.m_bound && found_bound.m_strict == false && strict)) {
-//                 ++s_count;
                  found_bound = implied_bound(v, j, is_low, coeff_before_j_is_pos, row_or_term_index, strict);
                  TRACE("try_add_bound", m_lar_solver.print_implied_bound(found_bound, tout););
              }
          } else {
-//             ++s_count;
              m_improved_lower_bounds[j] = m_ibounds.size();
              m_ibounds.push_back(implied_bound(v, j, is_low, coeff_before_j_is_pos, row_or_term_index, strict));
              TRACE("try_add_bound", m_lar_solver.print_implied_bound(m_ibounds.back(), tout););
@@ -46,12 +41,10 @@ void lp_bound_propagator::try_add_bound(mpq const& v, unsigned j, bool is_low, b
          if (try_get_value(m_improved_upper_bounds, j, k)) {
              auto & found_bound = m_ibounds[k];
              if (v < found_bound.m_bound || (v == found_bound.m_bound && found_bound.m_strict == false && strict)) {
-//                 ++s_count;
                  found_bound = implied_bound(v, j, is_low, coeff_before_j_is_pos, row_or_term_index, strict);
                  TRACE("try_add_bound", m_lar_solver.print_implied_bound(found_bound, tout););
              }
          } else {
-//             ++s_count;
              m_improved_upper_bounds[j] = m_ibounds.size();
              m_ibounds.push_back(implied_bound(v, j, is_low, coeff_before_j_is_pos, row_or_term_index, strict));
              TRACE("try_add_bound", m_lar_solver.print_implied_bound(m_ibounds.back(), tout););
diff --git a/src/smt/smt_context.cpp b/src/smt/smt_context.cpp
index 35c05cb15..b58d77f81 100644
--- a/src/smt/smt_context.cpp
+++ b/src/smt/smt_context.cpp
@@ -161,7 +161,6 @@ namespace smt {
         src_ctx.pop_to_base_lvl();
 
         if (!override_base && src_ctx.m_base_lvl > 0) {
-            INVOKE_DEBUGGER();
             throw default_exception("Cloning contexts within a user-scope is not allowed");
         }
         SASSERT(src_ctx.m_base_lvl == 0 || override_base);
@@ -285,8 +284,7 @@ namespace smt {
         // m_false_enode->mark_as_interpreted();
     }
 
-    void context::set_progress_callback(progress_callback *cb)
-    {
+    void context::set_progress_callback(progress_callback *cb) {
         m_progress_callback = cb;
     }
 
diff --git a/src/smt/theory_seq.cpp b/src/smt/theory_seq.cpp
index 790ca250d..01c55e6cb 100644
--- a/src/smt/theory_seq.cpp
+++ b/src/smt/theory_seq.cpp
@@ -3470,7 +3470,7 @@ bool theory_seq::solve_nc(unsigned idx) {
 
     if (m.is_eq(c, a, b)) {
         literal eq = mk_eq(a, b, false);
-        propagate_lit(deps, 0, nullptr, ~eq);
+        propagate_lit(deps, 0, nullptr, ~eq);        
         return true;
     }