1 |
|
/****************************************************************************** |
2 |
|
* Top contributors (to current version): |
3 |
|
* Liana Hadarean, Mathias Preiner, Alex Ozdemir |
4 |
|
* |
5 |
|
* This file is part of the cvc5 project. |
6 |
|
* |
7 |
|
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS |
8 |
|
* in the top-level source directory and their institutional affiliations. |
9 |
|
* All rights reserved. See the file COPYING in the top-level source |
10 |
|
* directory for licensing information. |
11 |
|
* **************************************************************************** |
12 |
|
* |
13 |
|
* Wrapper around the SAT solver used for bitblasting. |
14 |
|
*/ |
15 |
|
|
16 |
|
#include "cvc5_private.h" |
17 |
|
|
18 |
|
#ifndef CVC5__THEORY__BV__BITBLAST__BITBLASTER_H |
19 |
|
#define CVC5__THEORY__BV__BITBLAST__BITBLASTER_H |
20 |
|
|
21 |
|
#include <unordered_map> |
22 |
|
#include <unordered_set> |
23 |
|
#include <vector> |
24 |
|
|
25 |
|
#include "expr/node.h" |
26 |
|
#include "prop/cnf_stream.h" |
27 |
|
#include "prop/registrar.h" |
28 |
|
#include "prop/sat_solver.h" |
29 |
|
#include "prop/sat_solver_types.h" |
30 |
|
#include "smt/solver_engine_scope.h" |
31 |
|
#include "theory/bv/bitblast/bitblast_strategies_template.h" |
32 |
|
#include "theory/rewriter.h" |
33 |
|
#include "theory/theory.h" |
34 |
|
#include "theory/valuation.h" |
35 |
|
#include "util/resource_manager.h" |
36 |
|
|
37 |
|
namespace cvc5 { |
38 |
|
namespace theory { |
39 |
|
namespace bv { |
40 |
|
|
41 |
|
typedef std::unordered_set<Node> NodeSet; |
42 |
|
typedef std::unordered_set<TNode> TNodeSet; |
43 |
|
|
44 |
|
/** |
45 |
|
* The Bitblaster that manages the mapping between Nodes |
46 |
|
* and their bitwise definition |
47 |
|
* |
48 |
|
*/ |
49 |
|
|
50 |
|
template <class T> |
51 |
|
class TBitblaster |
52 |
|
{ |
53 |
|
protected: |
54 |
|
typedef std::vector<T> Bits; |
55 |
|
typedef std::unordered_map<Node, Bits> TermDefMap; |
56 |
|
typedef std::unordered_set<TNode> TNodeSet; |
57 |
|
typedef std::unordered_map<Node, Node> ModelCache; |
58 |
|
|
59 |
|
typedef void (*TermBBStrategy)(TNode, Bits&, TBitblaster<T>*); |
60 |
|
typedef T (*AtomBBStrategy)(TNode, TBitblaster<T>*); |
61 |
|
|
62 |
|
// caches and mappings |
63 |
|
TermDefMap d_termCache; |
64 |
|
ModelCache d_modelCache; |
65 |
|
// sat solver used for bitblasting and associated CnfStream |
66 |
|
std::unique_ptr<context::Context> d_nullContext; |
67 |
|
std::unique_ptr<prop::CnfStream> d_cnfStream; |
68 |
|
|
69 |
|
void initAtomBBStrategies(); |
70 |
|
void initTermBBStrategies(); |
71 |
|
|
72 |
|
protected: |
73 |
|
/// function tables for the various bitblasting strategies indexed by node |
74 |
|
/// kind |
75 |
|
TermBBStrategy d_termBBStrategies[kind::LAST_KIND]; |
76 |
|
AtomBBStrategy d_atomBBStrategies[kind::LAST_KIND]; |
77 |
|
virtual Node getModelFromSatSolver(TNode node, bool fullModel) = 0; |
78 |
|
virtual prop::SatSolver* getSatSolver() = 0; |
79 |
|
|
80 |
|
|
81 |
|
public: |
82 |
|
TBitblaster(); |
83 |
16845 |
virtual ~TBitblaster() {} |
84 |
|
virtual void bbAtom(TNode node) = 0; |
85 |
|
virtual void bbTerm(TNode node, Bits& bits) = 0; |
86 |
|
virtual void makeVariable(TNode node, Bits& bits) = 0; |
87 |
|
virtual T getBBAtom(TNode atom) const = 0; |
88 |
|
virtual bool hasBBAtom(TNode atom) const = 0; |
89 |
|
virtual void storeBBAtom(TNode atom, T atom_bb) = 0; |
90 |
|
|
91 |
|
bool hasBBTerm(TNode node) const; |
92 |
|
void getBBTerm(TNode node, Bits& bits) const; |
93 |
|
virtual void storeBBTerm(TNode term, const Bits& bits); |
94 |
|
|
95 |
|
/** |
96 |
|
* Return a constant representing the value of a in the model. |
97 |
|
* If fullModel is true set unconstrained bits to 0. If not return |
98 |
|
* NullNode() for a fully or partially unconstrained. |
99 |
|
* |
100 |
|
*/ |
101 |
|
Node getTermModel(TNode node, bool fullModel); |
102 |
|
void invalidateModelCache(); |
103 |
|
}; |
104 |
|
|
105 |
|
// Bitblaster implementation |
106 |
|
|
107 |
|
template <class T> |
108 |
16850 |
void TBitblaster<T>::initAtomBBStrategies() |
109 |
|
{ |
110 |
5560500 |
for (int i = 0; i < kind::LAST_KIND; ++i) |
111 |
|
{ |
112 |
5543650 |
d_atomBBStrategies[i] = UndefinedAtomBBStrategy<T>; |
113 |
|
} |
114 |
|
/// setting default bb strategies for atoms |
115 |
16850 |
d_atomBBStrategies[kind::EQUAL] = DefaultEqBB<T>; |
116 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_ULT] = DefaultUltBB<T>; |
117 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_ULE] = DefaultUleBB<T>; |
118 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_UGT] = DefaultUgtBB<T>; |
119 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_UGE] = DefaultUgeBB<T>; |
120 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_SLT] = DefaultSltBB<T>; |
121 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_SLE] = DefaultSleBB<T>; |
122 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_SGT] = DefaultSgtBB<T>; |
123 |
16850 |
d_atomBBStrategies[kind::BITVECTOR_SGE] = DefaultSgeBB<T>; |
124 |
16850 |
} |
125 |
|
|
126 |
|
template <class T> |
127 |
16850 |
void TBitblaster<T>::initTermBBStrategies() |
128 |
|
{ |
129 |
5560500 |
for (int i = 0; i < kind::LAST_KIND; ++i) |
130 |
|
{ |
131 |
5543650 |
d_termBBStrategies[i] = DefaultVarBB<T>; |
132 |
|
} |
133 |
|
/// setting default bb strategies for terms: |
134 |
16850 |
d_termBBStrategies[kind::CONST_BITVECTOR] = DefaultConstBB<T>; |
135 |
16850 |
d_termBBStrategies[kind::BITVECTOR_NOT] = DefaultNotBB<T>; |
136 |
16850 |
d_termBBStrategies[kind::BITVECTOR_CONCAT] = DefaultConcatBB<T>; |
137 |
16850 |
d_termBBStrategies[kind::BITVECTOR_AND] = DefaultAndBB<T>; |
138 |
16850 |
d_termBBStrategies[kind::BITVECTOR_OR] = DefaultOrBB<T>; |
139 |
16850 |
d_termBBStrategies[kind::BITVECTOR_XOR] = DefaultXorBB<T>; |
140 |
16850 |
d_termBBStrategies[kind::BITVECTOR_XNOR] = DefaultXnorBB<T>; |
141 |
16850 |
d_termBBStrategies[kind::BITVECTOR_NAND] = DefaultNandBB<T>; |
142 |
16850 |
d_termBBStrategies[kind::BITVECTOR_NOR] = DefaultNorBB<T>; |
143 |
16850 |
d_termBBStrategies[kind::BITVECTOR_COMP] = DefaultCompBB<T>; |
144 |
16850 |
d_termBBStrategies[kind::BITVECTOR_MULT] = DefaultMultBB<T>; |
145 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ADD] = DefaultAddBB<T>; |
146 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SUB] = DefaultSubBB<T>; |
147 |
16850 |
d_termBBStrategies[kind::BITVECTOR_NEG] = DefaultNegBB<T>; |
148 |
16850 |
d_termBBStrategies[kind::BITVECTOR_UDIV] = DefaultUdivBB<T>; |
149 |
16850 |
d_termBBStrategies[kind::BITVECTOR_UREM] = DefaultUremBB<T>; |
150 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SDIV] = UndefinedTermBBStrategy<T>; |
151 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SREM] = UndefinedTermBBStrategy<T>; |
152 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SMOD] = UndefinedTermBBStrategy<T>; |
153 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SHL] = DefaultShlBB<T>; |
154 |
16850 |
d_termBBStrategies[kind::BITVECTOR_LSHR] = DefaultLshrBB<T>; |
155 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ASHR] = DefaultAshrBB<T>; |
156 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ULTBV] = DefaultUltbvBB<T>; |
157 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SLTBV] = DefaultSltbvBB<T>; |
158 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ITE] = DefaultIteBB<T>; |
159 |
16850 |
d_termBBStrategies[kind::BITVECTOR_EXTRACT] = DefaultExtractBB<T>; |
160 |
16850 |
d_termBBStrategies[kind::BITVECTOR_REPEAT] = DefaultRepeatBB<T>; |
161 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ZERO_EXTEND] = DefaultZeroExtendBB<T>; |
162 |
16850 |
d_termBBStrategies[kind::BITVECTOR_SIGN_EXTEND] = DefaultSignExtendBB<T>; |
163 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ROTATE_RIGHT] = DefaultRotateRightBB<T>; |
164 |
16850 |
d_termBBStrategies[kind::BITVECTOR_ROTATE_LEFT] = DefaultRotateLeftBB<T>; |
165 |
16850 |
} |
166 |
|
|
167 |
|
template <class T> |
168 |
16850 |
TBitblaster<T>::TBitblaster() |
169 |
|
: d_termCache(), |
170 |
|
d_modelCache(), |
171 |
16850 |
d_nullContext(new context::Context()), |
172 |
33700 |
d_cnfStream() |
173 |
|
{ |
174 |
16850 |
initAtomBBStrategies(); |
175 |
16850 |
initTermBBStrategies(); |
176 |
16850 |
} |
177 |
|
|
178 |
|
template <class T> |
179 |
603200 |
bool TBitblaster<T>::hasBBTerm(TNode node) const |
180 |
|
{ |
181 |
603200 |
return d_termCache.find(node) != d_termCache.end(); |
182 |
|
} |
183 |
|
template <class T> |
184 |
240658 |
void TBitblaster<T>::getBBTerm(TNode node, Bits& bits) const |
185 |
|
{ |
186 |
240658 |
Assert(hasBBTerm(node)); |
187 |
240658 |
bits = d_termCache.find(node)->second; |
188 |
240658 |
} |
189 |
|
|
190 |
|
template <class T> |
191 |
|
void TBitblaster<T>::storeBBTerm(TNode node, const Bits& bits) |
192 |
|
{ |
193 |
|
d_termCache.insert(std::make_pair(node, bits)); |
194 |
|
} |
195 |
|
|
196 |
|
template <class T> |
197 |
|
void TBitblaster<T>::invalidateModelCache() |
198 |
|
{ |
199 |
|
d_modelCache.clear(); |
200 |
|
} |
201 |
|
|
202 |
|
} // namespace bv |
203 |
|
} // namespace theory |
204 |
|
} // namespace cvc5 |
205 |
|
|
206 |
|
#endif /* CVC5__THEORY__BV__BITBLAST__BITBLASTER_H */ |