mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-03 18:00:23 +00:00
Code Activity

remove debug_location parameter

Browse source
This commit is contained in:
Lev Nachmanson 2025-06-26 09:17:11 -07:00 • committed by Lev Nachmanson
parent 5caa7f1a29
commit f32066762c
4 changed files with 12 additions and 12 deletions
Download patch file Download diff file Expand all files Collapse all files

6
src/math/lp/nla_monotone_lemmas.cpp
View file

@ -12,7 +12,7 @@ namespace nla {
monotone::monotone(core * c) : common(c) {}
bool monotone::throttle_monotone(const monic& m, bool is_lt, const std::string& debug_location) {
bool monotone::throttle_monotone(const monic& m, bool is_lt) {
// Check if throttling is enabled
if (!c().params().arith_nl_thrl())
return false;
@ -22,7 +22,7 @@ bool monotone::throttle_monotone(const monic& m, bool is_lt, const std::string&
// Check if this combination has already been processed
if (m_processed_monotone.contains(key)) {
TRACE(nla_solver, tout << "throttled monotonicity_lemma at " << debug_location << "\n";);
TRACE(nla_solver, tout << "throttled monotonicity_lemma\n";);
return true;
}
@ -52,7 +52,7 @@ void monotone::monotonicity_lemma(monic const& m) {
bool is_lt = m_val < prod_val;
// Check if this specific combination should be throttled
if (throttle_monotone(m, is_lt, __FUNCTION__))
if (throttle_monotone(m, is_lt))
return;
if (is_lt)

2
src/math/lp/nla_monotone_lemmas.h
View file

@ -41,7 +41,7 @@ namespace nla {
private:
hashtable<monotone_key, monotone_key_hash, default_eq<monotone_key>> m_processed_monotone;
bool throttle_monotone(const monic& m, bool is_lt, const std::string& debug_location);
bool throttle_monotone(const monic& m, bool is_lt);
void monotonicity_lemma(monic const& m);
void monotonicity_lemma_gt(const monic& m);

12
src/math/lp/nla_order_lemmas.cpp
View file

@ -89,7 +89,7 @@ void order::order_lemma_on_binomial_sign(const monic& xy, lpvar x, lpvar y, int
SASSERT(!_().mon_has_zero(xy.vars()));
int sy = rat_sign(val(y));
// throttle here
if (throttle_binomial_sign(xy, x, y, sign, sy, __FUNCTION__))
if (throttle_binomial_sign(xy, x, y, sign, sy))
return;
lemma_builder lemma(c(), __FUNCTION__);
@ -100,7 +100,7 @@ void order::order_lemma_on_binomial_sign(const monic& xy, lpvar x, lpvar y, int
bool order::throttle_mon_ol(const monic& ac, lpvar a, const rational& c_sign, lpvar c_var,
const monic& bd, const factor& b, const rational& d_sign,
lpvar d, llc ab_cmp, const std::string& debug_location) {
lpvar d, llc ab_cmp) {
// Check if throttling is enabled
if (!c().params().arith_nl_thrl())
return false;
@ -110,7 +110,7 @@ bool order::throttle_mon_ol(const monic& ac, lpvar a, const rational& c_sign, lp
// Check if this combination has already been processed
if (m_processed_mon_ol.contains(key)) {
TRACE(nla_solver, tout << "throttled generate_mon_ol at " << debug_location << "\n";);
TRACE(nla_solver, tout << "throttled generate_mon_ol\n";);
return true;
}
@ -120,7 +120,7 @@ bool order::throttle_mon_ol(const monic& ac, lpvar a, const rational& c_sign, lp
return false;
}
bool order::throttle_binomial_sign(const monic& xy, lpvar x, lpvar y, int sign, int sy, const std::string& debug_location) {
bool order::throttle_binomial_sign(const monic& xy, lpvar x, lpvar y, int sign, int sy) {
// Check if throttling is enabled
if (!c().params().arith_nl_thrl())
return false;
@ -130,7 +130,7 @@ bool order::throttle_binomial_sign(const monic& xy, lpvar x, lpvar y, int sign,
// Check if this combination has already been processed
if (m_processed_binomial_sign.contains(key)) {
TRACE(nla_solver, tout << "throttled order_lemma_on_binomial_sign at " << debug_location << "\n";);
TRACE(nla_solver, tout << "throttled order_lemma_on_binomial_sign\n";);
return true;
}
@ -217,7 +217,7 @@ void order::generate_mon_ol(const monic& ac,
SASSERT(ab_cmp != llc::GT || (var_val(ac) <= var_val(bd) && val(a)*c_sign > val(b)*d_sign));
// Check if this specific combination should be throttled
if (throttle_mon_ol(ac, a, c_sign, c, bd, b, d_sign, d, ab_cmp, __FUNCTION__))
if (throttle_mon_ol(ac, a, c_sign, c, bd, b, d_sign, d, ab_cmp))
return;
lemma_builder lemma(_(), __FUNCTION__);

4
src/math/lp/nla_order_lemmas.h
View file

@ -70,7 +70,7 @@ public:
hashtable<mon_ol_key, mon_ol_key_hash, default_eq<mon_ol_key>> m_processed_mon_ol;
bool throttle_mon_ol(const monic& ac, lpvar a, const rational& c_sign, lpvar c_var,
const monic& bd, const factor& b, const rational& d_sign,
lpvar d, llc ab_cmp, const std::string& debug_location);
lpvar d, llc ab_cmp);
// Structure to represent the key parameters for throttling order_lemma_on_binomial_sign
// Optimized for memory efficiency with packed fields
@ -108,7 +108,7 @@ public:
};
hashtable<binomial_sign_key, binomial_sign_key_hash, default_eq<binomial_sign_key>> m_processed_binomial_sign;
bool throttle_binomial_sign(const monic& xy, lpvar x, lpvar y, int sign, int sy, const std::string& debug_location);
bool throttle_binomial_sign(const monic& xy, lpvar x, lpvar y, int sign, int sy);
private: