mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-12-15 08:48:58 +00:00
Code Activity

output

Browse source
This commit is contained in:
Jakob Rath 2023-01-09 17:19:58 +01:00
parent 181995a4fb
commit b6ea9e31e5
3 changed files with 15 additions and 16 deletions
Download patch file Download diff file Expand all files Collapse all files

11
src/math/polysat/umul_ovfl_constraint.cpp
View file

@ -106,8 +106,9 @@ namespace polysat {
/**
* if p constant, q, propagate inequality
*/
bool umul_ovfl_constraint::narrow_bound(solver& s, bool is_positive,
pdd const& p0, pdd const& q0, pdd const& p, pdd const& q) {
bool umul_ovfl_constraint::narrow_bound(solver& s, bool is_positive, pdd const& p0, pdd const& q0, pdd const& p, pdd const& q) {
LOG("p: " << p0 << " := " << p);
LOG("q: " << q0 << " := " << q);
if (!p.is_val())
return false;
@ -142,9 +143,9 @@ namespace polysat {
return true;
}
bool umul_ovfl_constraint::try_viable(
solver& s, bool is_positive,
pdd const& p0, pdd const& q0, pdd const& p, pdd const& q) {
bool umul_ovfl_constraint::try_viable(solver& s, bool is_positive, pdd const& p0, pdd const& q0, pdd const& p, pdd const& q) {
LOG("p: " << p0 << " := " << p);
LOG("q: " << q0 << " := " << q);
signed_constraint sc(this, is_positive);
return s.m_viable.intersect(p0, q0, sc);
}