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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
|
/********************* */
/*! \file theory_bv.cpp
** \verbatim
** Top contributors (to current version):
** Liana Hadarean, Andrew Reynolds, Aina Niemetz
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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.\endverbatim
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "theory/bv/theory_bv.h"
#include "options/bv_options.h"
#include "theory/bv/bv_solver_lazy.h"
#include "theory/bv/theory_bv_utils.h"
namespace CVC4 {
namespace theory {
namespace bv {
TheoryBV::TheoryBV(context::Context* c,
context::UserContext* u,
OutputChannel& out,
Valuation valuation,
const LogicInfo& logicInfo,
ProofNodeManager* pnm,
std::string name)
: Theory(THEORY_BV, c, u, out, valuation, logicInfo, pnm, name),
d_internal(nullptr),
d_ufDivByZero(),
d_ufRemByZero(),
d_rewriter(),
d_state(c, u, valuation),
d_inferMgr(*this, d_state, pnm)
{
d_internal.reset(new BVSolverLazy(*this, c, u, pnm, name));
d_theoryState = &d_state;
d_inferManager = &d_inferMgr;
}
TheoryBV::~TheoryBV() {}
TheoryRewriter* TheoryBV::getTheoryRewriter() { return &d_rewriter; }
bool TheoryBV::needsEqualityEngine(EeSetupInfo& esi)
{
return d_internal->needsEqualityEngine(esi);
}
void TheoryBV::finishInit()
{
// these kinds are semi-evaluated in getModelValue (applications of this
// kind are treated as variables)
getValuation().setSemiEvaluatedKind(kind::BITVECTOR_ACKERMANNIZE_UDIV);
getValuation().setSemiEvaluatedKind(kind::BITVECTOR_ACKERMANNIZE_UREM);
d_internal->finishInit();
}
Node TheoryBV::getUFDivByZero(Kind k, unsigned width)
{
NodeManager* nm = NodeManager::currentNM();
if (k == kind::BITVECTOR_UDIV)
{
if (d_ufDivByZero.find(width) == d_ufDivByZero.end())
{
// lazily create the function symbols
std::ostringstream os;
os << "BVUDivByZero_" << width;
Node divByZero =
nm->mkSkolem(os.str(),
nm->mkFunctionType(nm->mkBitVectorType(width),
nm->mkBitVectorType(width)),
"partial bvudiv",
NodeManager::SKOLEM_EXACT_NAME);
d_ufDivByZero[width] = divByZero;
}
return d_ufDivByZero[width];
}
else if (k == kind::BITVECTOR_UREM)
{
if (d_ufRemByZero.find(width) == d_ufRemByZero.end())
{
std::ostringstream os;
os << "BVURemByZero_" << width;
Node divByZero =
nm->mkSkolem(os.str(),
nm->mkFunctionType(nm->mkBitVectorType(width),
nm->mkBitVectorType(width)),
"partial bvurem",
NodeManager::SKOLEM_EXACT_NAME);
d_ufRemByZero[width] = divByZero;
}
return d_ufRemByZero[width];
}
Unreachable();
}
TrustNode TheoryBV::expandDefinition(Node node)
{
Debug("bitvector-expandDefinition")
<< "TheoryBV::expandDefinition(" << node << ")" << std::endl;
Node ret;
switch (node.getKind())
{
case kind::BITVECTOR_SDIV:
case kind::BITVECTOR_SREM:
case kind::BITVECTOR_SMOD:
ret = TheoryBVRewriter::eliminateBVSDiv(node);
break;
case kind::BITVECTOR_UDIV:
case kind::BITVECTOR_UREM:
{
NodeManager* nm = NodeManager::currentNM();
unsigned width = node.getType().getBitVectorSize();
if (options::bitvectorDivByZeroConst())
{
Kind kind = node.getKind() == kind::BITVECTOR_UDIV
? kind::BITVECTOR_UDIV_TOTAL
: kind::BITVECTOR_UREM_TOTAL;
ret = nm->mkNode(kind, node[0], node[1]);
break;
}
TNode num = node[0], den = node[1];
Node den_eq_0 = nm->mkNode(kind::EQUAL, den, utils::mkZero(width));
Node divTotalNumDen = nm->mkNode(node.getKind() == kind::BITVECTOR_UDIV
? kind::BITVECTOR_UDIV_TOTAL
: kind::BITVECTOR_UREM_TOTAL,
num,
den);
Node divByZero = getUFDivByZero(node.getKind(), width);
Node divByZeroNum = nm->mkNode(kind::APPLY_UF, divByZero, num);
ret = nm->mkNode(kind::ITE, den_eq_0, divByZeroNum, divTotalNumDen);
}
break;
default: break;
}
if (!ret.isNull() && node != ret)
{
return TrustNode::mkTrustRewrite(node, ret, nullptr);
}
return TrustNode::null();
}
void TheoryBV::preRegisterTerm(TNode node)
{
d_internal->preRegisterTerm(node);
}
bool TheoryBV::preCheck(Effort e) { return d_internal->preCheck(e); }
bool TheoryBV::needsCheckLastEffort()
{
return d_internal->needsCheckLastEffort();
}
bool TheoryBV::collectModelValues(TheoryModel* m, const std::set<Node>& termSet)
{
return d_internal->collectModelValues(m, termSet);
}
void TheoryBV::propagate(Effort e) { return d_internal->propagate(e); }
Theory::PPAssertStatus TheoryBV::ppAssert(TNode in,
SubstitutionMap& outSubstitutions)
{
return d_internal->ppAssert(in, outSubstitutions);
}
TrustNode TheoryBV::ppRewrite(TNode t) { return d_internal->ppRewrite(t); }
void TheoryBV::presolve() { d_internal->presolve(); }
TrustNode TheoryBV::explain(TNode node) { return d_internal->explain(node); }
void TheoryBV::notifySharedTerm(TNode t)
{
d_internal->notifySharedTerm(t);
// temporary, will be built into Theory::addSharedTerm
if (d_equalityEngine != nullptr)
{
d_equalityEngine->addTriggerTerm(t, THEORY_BV);
}
}
void TheoryBV::ppStaticLearn(TNode in, NodeBuilder<>& learned)
{
d_internal->ppStaticLearn(in, learned);
}
bool TheoryBV::applyAbstraction(const std::vector<Node>& assertions,
std::vector<Node>& new_assertions)
{
return d_internal->applyAbstraction(assertions, new_assertions);
}
} // namespace bv
} // namespace theory
} // namespace CVC4
|
