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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
|
/********************* */
/*! \file theory_proxy.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Haniel Barbosa, Dejan Jovanovic
** This file is part of the CVC4 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.\endverbatim
**
** \brief [[ Add one-line brief description here ]]
**
** [[ Add lengthier description here ]]
** \todo document this file
**/
#include "prop/theory_proxy.h"
#include "context/context.h"
#include "decision/decision_engine.h"
#include "options/decision_options.h"
#include "options/smt_options.h"
#include "proof/cnf_proof.h"
#include "prop/cnf_stream.h"
#include "prop/prop_engine.h"
#include "smt/smt_statistics_registry.h"
#include "theory/rewriter.h"
#include "theory/theory_engine.h"
#include "util/statistics_registry.h"
namespace CVC4 {
namespace prop {
TheoryProxy::TheoryProxy(PropEngine* propEngine,
TheoryEngine* theoryEngine,
DecisionEngine* decisionEngine,
context::Context* context,
context::UserContext* userContext,
ProofNodeManager* pnm)
: d_propEngine(propEngine),
d_cnfStream(nullptr),
d_decisionEngine(decisionEngine),
d_theoryEngine(theoryEngine),
d_queue(context),
d_tpp(*theoryEngine, userContext, pnm),
d_skdm(new SkolemDefManager(context, userContext))
{
}
TheoryProxy::~TheoryProxy() {
/* nothing to do for now */
}
void TheoryProxy::finishInit(CnfStream* cnfStream) { d_cnfStream = cnfStream; }
void TheoryProxy::notifyPreprocessedAssertions(
const std::vector<Node>& assertions)
{
d_theoryEngine->notifyPreprocessedAssertions(assertions);
for (const Node& assertion : assertions)
{
d_decisionEngine->addAssertion(assertion);
}
}
void TheoryProxy::notifyAssertion(Node lem, TNode skolem)
{
if (skolem.isNull())
{
d_decisionEngine->addAssertion(lem);
}
else
{
d_skdm->notifySkolemDefinition(skolem, lem);
d_decisionEngine->addSkolemDefinition(lem, skolem);
}
}
void TheoryProxy::variableNotify(SatVariable var) {
d_theoryEngine->preRegister(getNode(SatLiteral(var)));
}
void TheoryProxy::theoryCheck(theory::Theory::Effort effort) {
while (!d_queue.empty()) {
TNode assertion = d_queue.front();
d_queue.pop();
d_theoryEngine->assertFact(assertion);
}
d_theoryEngine->check(effort);
}
void TheoryProxy::theoryPropagate(std::vector<SatLiteral>& output) {
// Get the propagated literals
std::vector<TNode> outputNodes;
d_theoryEngine->getPropagatedLiterals(outputNodes);
for (unsigned i = 0, i_end = outputNodes.size(); i < i_end; ++ i) {
Debug("prop-explain") << "theoryPropagate() => " << outputNodes[i] << std::endl;
output.push_back(d_cnfStream->getLiteral(outputNodes[i]));
}
}
void TheoryProxy::explainPropagation(SatLiteral l, SatClause& explanation) {
TNode lNode = d_cnfStream->getNode(l);
Debug("prop-explain") << "explainPropagation(" << lNode << ")" << std::endl;
theory::TrustNode tte = d_theoryEngine->getExplanation(lNode);
Node theoryExplanation = tte.getNode();
if (CVC4::options::produceProofs())
{
d_propEngine->getProofCnfStream()->convertPropagation(tte);
}
else if (options::unsatCores())
{
ProofManager::getCnfProof()->pushCurrentAssertion(theoryExplanation);
}
Debug("prop-explain") << "explainPropagation() => " << theoryExplanation
<< std::endl;
explanation.push_back(l);
if (theoryExplanation.getKind() == kind::AND)
{
for (const Node& n : theoryExplanation)
{
explanation.push_back(~d_cnfStream->getLiteral(n));
}
}
else
{
explanation.push_back(~d_cnfStream->getLiteral(theoryExplanation));
}
if (Trace.isOn("sat-proof"))
{
std::stringstream ss;
ss << "TheoryProxy::explainPropagation: clause for lit is ";
for (unsigned i = 0, size = explanation.size(); i < size; ++i)
{
ss << explanation[i] << " [" << d_cnfStream->getNode(explanation[i])
<< "] ";
}
Trace("sat-proof") << ss.str() << "\n";
}
}
void TheoryProxy::enqueueTheoryLiteral(const SatLiteral& l) {
Node literalNode = d_cnfStream->getNode(l);
Debug("prop") << "enqueueing theory literal " << l << " " << literalNode << std::endl;
Assert(!literalNode.isNull());
d_queue.push(literalNode);
}
SatLiteral TheoryProxy::getNextTheoryDecisionRequest() {
TNode n = d_theoryEngine->getNextDecisionRequest();
return n.isNull() ? undefSatLiteral : d_cnfStream->getLiteral(n);
}
SatLiteral TheoryProxy::getNextDecisionEngineRequest(bool &stopSearch) {
Assert(d_decisionEngine != NULL);
Assert(stopSearch != true);
SatLiteral ret = d_decisionEngine->getNext(stopSearch);
if(stopSearch) {
Trace("decision") << " *** Decision Engine stopped search *** " << std::endl;
}
return options::decisionStopOnly() ? undefSatLiteral : ret;
}
bool TheoryProxy::theoryNeedCheck() const {
return d_theoryEngine->needCheck();
}
TNode TheoryProxy::getNode(SatLiteral lit) {
return d_cnfStream->getNode(lit);
}
void TheoryProxy::notifyRestart() {
d_propEngine->spendResource(ResourceManager::Resource::RestartStep);
d_theoryEngine->notifyRestart();
}
void TheoryProxy::spendResource(ResourceManager::Resource r)
{
d_theoryEngine->spendResource(r);
}
bool TheoryProxy::isDecisionRelevant(SatVariable var) { return true; }
bool TheoryProxy::isDecisionEngineDone() {
return d_decisionEngine->isDone();
}
SatValue TheoryProxy::getDecisionPolarity(SatVariable var) {
return SAT_VALUE_UNKNOWN;
}
CnfStream* TheoryProxy::getCnfStream() { return d_cnfStream; }
theory::TrustNode TheoryProxy::preprocessLemma(
theory::TrustNode trn,
std::vector<theory::TrustNode>& newLemmas,
std::vector<Node>& newSkolems)
{
return d_tpp.preprocessLemma(trn, newLemmas, newSkolems);
}
theory::TrustNode TheoryProxy::preprocess(
TNode node,
std::vector<theory::TrustNode>& newLemmas,
std::vector<Node>& newSkolems)
{
return d_tpp.preprocess(node, newLemmas, newSkolems);
}
theory::TrustNode TheoryProxy::removeItes(
TNode node,
std::vector<theory::TrustNode>& newLemmas,
std::vector<Node>& newSkolems)
{
RemoveTermFormulas& rtf = d_tpp.getRemoveTermFormulas();
return rtf.run(node, newLemmas, newSkolems, true);
}
void TheoryProxy::getSkolems(TNode node,
std::vector<Node>& skAsserts,
std::vector<Node>& sks)
{
std::unordered_set<Node, NodeHashFunction> skolems;
d_skdm->getSkolems(node, skolems);
for (const Node& k : skolems)
{
sks.push_back(k);
skAsserts.push_back(d_skdm->getDefinitionForSkolem(k));
}
}
void TheoryProxy::preRegister(Node n) { d_theoryEngine->preRegister(n); }
}/* CVC4::prop namespace */
}/* CVC4 namespace */
|
