1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
/******************************************************************************
* Top contributors (to current version):
* Mathias Preiner, Gereon Kremer, Haniel Barbosa
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* Simple bit-blast solver that sends bitblast lemmas directly to MiniSat.
*/
#include "theory/bv/bv_solver_simple.h"
#include "expr/term_conversion_proof_generator.h"
#include "theory/bv/theory_bv.h"
#include "theory/bv/theory_bv_utils.h"
#include "theory/theory_model.h"
namespace cvc5 {
namespace theory {
namespace bv {
/* -------------------------------------------------------------------------- */
namespace {
bool isBVAtom(TNode n)
{
return (n.getKind() == kind::EQUAL && n[0].getType().isBitVector())
|| n.getKind() == kind::BITVECTOR_ULT
|| n.getKind() == kind::BITVECTOR_ULE
|| n.getKind() == kind::BITVECTOR_SLT
|| n.getKind() == kind::BITVECTOR_SLE;
}
/* Traverse Boolean nodes and collect BV atoms. */
void collectBVAtoms(TNode n, std::unordered_set<Node, NodeHashFunction>& atoms)
{
std::vector<TNode> visit;
std::unordered_set<TNode, TNodeHashFunction> visited;
visit.push_back(n);
do
{
TNode cur = visit.back();
visit.pop_back();
if (visited.find(cur) != visited.end() || !cur.getType().isBoolean())
continue;
visited.insert(cur);
if (isBVAtom(cur))
{
atoms.insert(cur);
continue;
}
visit.insert(visit.end(), cur.begin(), cur.end());
} while (!visit.empty());
}
} // namespace
BVSolverSimple::BVSolverSimple(TheoryState* s,
TheoryInferenceManager& inferMgr,
ProofNodeManager* pnm)
: BVSolver(*s, inferMgr),
d_tcpg(pnm ? new TConvProofGenerator(
pnm,
nullptr,
/* ONCE to visit each term only once, post-order. FIXPOINT
* could lead to infinite loops due to terms being rewritten
* to terms that contain themselves */
TConvPolicy::ONCE,
/* STATIC to get the same ProofNode for a shared subterm. */
TConvCachePolicy::STATIC,
"BVSolverSimple::TConvProofGenerator",
nullptr,
false)
: nullptr),
d_bitblaster(new BBProof(s, pnm, d_tcpg.get()))
{
}
void BVSolverSimple::addBBLemma(TNode fact)
{
if (!d_bitblaster->hasBBAtom(fact))
{
d_bitblaster->bbAtom(fact);
}
NodeManager* nm = NodeManager::currentNM();
Node atom_bb = d_bitblaster->getStoredBBAtom(fact);
Node lemma = nm->mkNode(kind::EQUAL, fact, atom_bb);
if (d_tcpg == nullptr)
{
d_im.lemma(lemma, InferenceId::BV_SIMPLE_BITBLAST_LEMMA);
}
else
{
TrustNode tlem = TrustNode::mkTrustLemma(lemma, d_tcpg.get());
d_im.trustedLemma(tlem, InferenceId::BV_SIMPLE_BITBLAST_LEMMA);
}
}
bool BVSolverSimple::preNotifyFact(
TNode atom, bool pol, TNode fact, bool isPrereg, bool isInternal)
{
if (fact.getKind() == kind::NOT)
{
fact = fact[0];
}
if (isBVAtom(fact))
{
addBBLemma(fact);
}
else if (fact.getKind() == kind::BITVECTOR_EAGER_ATOM)
{
TNode n = fact[0];
NodeManager* nm = NodeManager::currentNM();
Node lemma = nm->mkNode(kind::EQUAL, fact, n);
if (d_tcpg == nullptr)
{
d_im.lemma(lemma, InferenceId::BV_SIMPLE_LEMMA);
}
else
{
TrustNode tlem = TrustNode::mkTrustLemma(lemma, d_tcpg.get());
d_im.trustedLemma(tlem, InferenceId::BV_SIMPLE_LEMMA);
}
std::unordered_set<Node, NodeHashFunction> bv_atoms;
collectBVAtoms(n, bv_atoms);
for (const Node& nn : bv_atoms)
{
addBBLemma(nn);
}
}
return true;
}
bool BVSolverSimple::collectModelValues(TheoryModel* m,
const std::set<Node>& termSet)
{
return d_bitblaster->collectModelValues(m, termSet);
}
BVProofRuleChecker* BVSolverSimple::getProofChecker() { return &d_checker; }
} // namespace bv
} // namespace theory
} // namespace cvc5
|
