mirror of
https://github.com/Z3Prover/z3
synced 2025-04-15 21:38:44 +00:00
do not register equality terms created in lar_solver
Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
This commit is contained in:
parent
285ff9540d
commit
a0251ac745
|
@ -1705,16 +1705,16 @@ bool lar_solver::all_vars_are_registered(const vector<std::pair<mpq, var_index>>
|
|||
return true;
|
||||
}
|
||||
|
||||
// do not register this term if ext_i == -1
|
||||
var_index lar_solver::add_term(const vector<std::pair<mpq, var_index>> & coeffs, unsigned ext_i) {
|
||||
TRACE("lar_solver_terms", print_linear_combination_of_column_indices_only(coeffs, tout) << ", ext_i =" << ext_i << "\n";);
|
||||
|
||||
m_term_register.add_var(ext_i, term_is_int(coeffs));
|
||||
if (ext_i + 1)
|
||||
m_term_register.add_var(ext_i, term_is_int(coeffs));
|
||||
lp_assert(all_vars_are_registered(coeffs));
|
||||
if (strategy_is_undecided())
|
||||
return add_term_undecided(coeffs);
|
||||
lar_term * t = new lar_term(coeffs);
|
||||
push_term(t);
|
||||
SASSERT(m_term_register.size() == m_terms.size());
|
||||
unsigned adjusted_term_index = m_terms.size() - 1;
|
||||
var_index ret = m_terms_start_index + adjusted_term_index;
|
||||
if (use_tableau() && !coeffs.empty()) {
|
||||
|
@ -2370,10 +2370,7 @@ std::pair<constraint_index, constraint_index> lar_solver::add_equality(lpvar j,
|
|||
vector<std::pair<mpq, var_index>> coeffs;
|
||||
coeffs.push_back(std::make_pair(mpq(1),j));
|
||||
coeffs.push_back(std::make_pair(mpq(-1),k));
|
||||
unsigned ext_term_index = m_terms.size();
|
||||
while (m_term_register.external_is_used(ext_term_index))
|
||||
ext_term_index *= 2;
|
||||
unsigned term_index = add_term(coeffs, ext_term_index);
|
||||
unsigned term_index = add_term(coeffs, -1); // -1 to not register the term: only external terms are registered
|
||||
return std::pair<constraint_index, constraint_index>(
|
||||
add_var_bound(term_index, lconstraint_kind::LE, mpq(0)),
|
||||
add_var_bound(term_index, lconstraint_kind::GE, mpq(0)));
|
||||
|
|
|
@ -66,10 +66,17 @@ public:
|
|||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
|
||||
// returns -1 if
|
||||
unsigned local_to_external(unsigned local_var) const {
|
||||
SASSERT(local_var >= m_local_offset);
|
||||
return m_local_to_external[local_var - m_local_offset].external_j();
|
||||
if (local_var + 1 == 0) // local_var == -1
|
||||
return -1;
|
||||
if (local_var < m_local_offset)
|
||||
return -1;
|
||||
unsigned k = local_var - m_local_offset;
|
||||
if (k >= m_local_to_external.size())
|
||||
return -1;
|
||||
return m_local_to_external[k].external_j();
|
||||
}
|
||||
unsigned size() const {
|
||||
return m_local_to_external.size();
|
||||
|
|
|
@ -2364,7 +2364,7 @@ public:
|
|||
if (v == null_theory_var) {
|
||||
return false;
|
||||
}
|
||||
if (m_unassigned_bounds[v] == 0 || m_bounds.size() <= static_cast<unsigned>(v)) {
|
||||
if (m_bounds.size() <= static_cast<unsigned>(v) || m_unassigned_bounds[v] == 0) {
|
||||
return false;
|
||||
}
|
||||
for (lp_api::bound* b : m_bounds[v]) {
|
||||
|
|
Loading…
Reference in a new issue