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
|
/********************* */
/*! \file assertion_pipeline.cpp
** \verbatim
** Top contributors (to current version):
** Andres Noetzli, Andrew Reynolds, Haniel Barbosa
** 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
**
** \brief AssertionPipeline stores a list of assertions modified by
** preprocessing passes
**/
#include "preprocessing/assertion_pipeline.h"
#include "expr/node_manager.h"
#include "options/smt_options.h"
#include "proof/proof_manager.h"
#include "theory/builtin/proof_checker.h"
#include "theory/rewriter.h"
namespace CVC4 {
namespace preprocessing {
AssertionPipeline::AssertionPipeline()
: d_realAssertionsEnd(0),
d_storeSubstsInAsserts(false),
d_substsIndex(0),
d_assumptionsStart(0),
d_numAssumptions(0),
d_pppg(nullptr)
{
}
void AssertionPipeline::clear()
{
d_nodes.clear();
d_realAssertionsEnd = 0;
d_assumptionsStart = 0;
d_numAssumptions = 0;
}
void AssertionPipeline::push_back(Node n,
bool isAssumption,
bool isInput,
ProofGenerator* pgen)
{
d_nodes.push_back(n);
if (isAssumption)
{
Assert(pgen == nullptr);
if (d_numAssumptions == 0)
{
d_assumptionsStart = d_nodes.size() - 1;
}
// Currently, we assume that assumptions are all added one after another
// and that we store them in the same vector as the assertions. Once we
// split the assertions up into multiple vectors (see issue #2473), we will
// not have this limitation anymore.
Assert(d_assumptionsStart + d_numAssumptions == d_nodes.size() - 1);
d_numAssumptions++;
}
if (isProofEnabled())
{
if (!isInput)
{
// notice this is always called, regardless of whether pgen is nullptr
d_pppg->notifyNewAssert(n, pgen);
}
else
{
Trace("smt-pppg") << "...input assertion " << n << std::endl;
}
}
}
void AssertionPipeline::pushBackTrusted(theory::TrustNode trn)
{
Assert(trn.getKind() == theory::TrustNodeKind::LEMMA);
// push back what was proven
push_back(trn.getProven(), false, false, trn.getGenerator());
}
void AssertionPipeline::replace(size_t i, Node n, ProofGenerator* pgen)
{
if (n == d_nodes[i])
{
// no change, skip
return;
}
Trace("smt-pppg-repl") << "Replace " << d_nodes[i] << " with " << n
<< std::endl;
if (options::unsatCores())
{
ProofManager::currentPM()->addDependence(n, d_nodes[i]);
}
if (isProofEnabled())
{
d_pppg->notifyPreprocessed(d_nodes[i], n, pgen);
}
d_nodes[i] = n;
}
void AssertionPipeline::replaceTrusted(size_t i, theory::TrustNode trn)
{
Assert(trn.getKind() == theory::TrustNodeKind::REWRITE);
replace(i, trn.getNode(), trn.getGenerator());
}
void AssertionPipeline::setProofGenerator(smt::PreprocessProofGenerator* pppg)
{
d_pppg = pppg;
}
bool AssertionPipeline::isProofEnabled() const { return d_pppg != nullptr; }
void AssertionPipeline::enableStoreSubstsInAsserts()
{
d_storeSubstsInAsserts = true;
d_substsIndex = d_nodes.size();
d_nodes.push_back(NodeManager::currentNM()->mkConst<bool>(true));
}
void AssertionPipeline::disableStoreSubstsInAsserts()
{
d_storeSubstsInAsserts = false;
}
void AssertionPipeline::addSubstitutionNode(Node n, ProofGenerator* pg)
{
Assert(d_storeSubstsInAsserts);
Assert(n.getKind() == kind::EQUAL);
conjoin(d_substsIndex, n, pg);
}
void AssertionPipeline::conjoin(size_t i, Node n, ProofGenerator* pg)
{
NodeManager* nm = NodeManager::currentNM();
Node newConj = nm->mkNode(kind::AND, d_nodes[i], n);
Node newConjr = theory::Rewriter::rewrite(newConj);
if (newConjr == d_nodes[i])
{
// trivial, skip
return;
}
if (isProofEnabled())
{
// ---------- from pppg --------- from pg
// d_nodes[i] n
// -------------------------------- AND_INTRO
// d_nodes[i] ^ n
// -------------------------------- MACRO_SR_PRED_TRANSFORM
// rewrite( d_nodes[i] ^ n )
// allocate a fresh proof which will act as the proof generator
LazyCDProof* lcp = d_pppg->allocateHelperProof();
lcp->addLazyStep(d_nodes[i], d_pppg, false);
lcp->addLazyStep(
n, pg, false, "AssertionPipeline::conjoin", false, PfRule::PREPROCESS);
lcp->addStep(newConj, PfRule::AND_INTRO, {d_nodes[i], n}, {});
if (newConjr != newConj)
{
lcp->addStep(
newConjr, PfRule::MACRO_SR_PRED_TRANSFORM, {newConj}, {newConjr});
}
// Notice we have constructed a proof of a new assertion, where d_pppg
// is referenced in the lazy proof above. If alternatively we had
// constructed a proof of d_nodes[i] = rewrite( d_nodes[i] ^ n ), we would
// have used notifyPreprocessed. However, it is simpler to make the
// above proof.
d_pppg->notifyNewAssert(newConjr, lcp);
}
if (options::unsatCores())
{
ProofManager::currentPM()->addDependence(newConjr, d_nodes[i]);
}
d_nodes[i] = newConjr;
Assert(theory::Rewriter::rewrite(newConjr) == newConjr);
}
} // namespace preprocessing
} // namespace CVC4
|
