diff options
author | Andres Noetzli <andres.noetzli@gmail.com> | 2020-06-24 00:06:23 -0700 |
---|---|---|
committer | Andres Noetzli <andres.noetzli@gmail.com> | 2020-06-24 00:16:19 -0700 |
commit | b422b152b4a21400f200cc5133e43fc7073a08a1 (patch) | |
tree | 415a032372b68c4de093a5b493ed71b8a7fc6d3d /proofs/lfsc_checker | |
parent | feea2d248ebe0c024c9c5ed14a9f0bf34b06c146 (diff) |
[unconstrained] Fix gathering of visited-once varsfix4644
Fixes #4644. This commit fixes an issue where the set `d_unconstrained`
in the unconstrained simplification pass was not computed correctly. The
problem was that visiting the same term multiple times did not remove
the variables appearing in that term from the visited-once set. A simple
example that triggers the issue is the following:
```
(set-logic ALL)
(declare-fun a () Bool)
(declare-fun b () Bool)
(assert (not (= a b)))
(assert (= a (= a b)))
(check-sat)
```
After running `UnconstrainedSimplifier::visitAll()` on both assertions,
we end up with `[b]` as our `d_unconstrained` set. We end up inferring
the substitution `(= a b) --> b` and get `(not b)` and `b`, which is
unsat even though the original problem is sat.
This commit fixes the issue by visiting all the children of a node if we
visit a node for a second time. This makes sure that we remove any
children from the visisted-once set.
Diffstat (limited to 'proofs/lfsc_checker')
0 files changed, 0 insertions, 0 deletions