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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Haniel Barbosa, Diego Della Rocca de Camargos
*
* 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.
* ****************************************************************************
*
* The proof manager of the SMT engine.
*/
#include "smt/proof_manager.h"
#include "options/base_options.h"
#include "options/proof_options.h"
#include "options/smt_options.h"
#include "proof/dot/dot_printer.h"
#include "proof/proof_checker.h"
#include "proof/proof_node_algorithm.h"
#include "proof/proof_node_manager.h"
#include "smt/assertions.h"
#include "smt/preprocess_proof_generator.h"
#include "smt/proof_post_processor.h"
namespace cvc5 {
namespace smt {
PfManager::PfManager(context::UserContext* u, SmtEngine* smte)
: d_pchecker(new ProofChecker(options::proofPedantic())),
d_pnm(new ProofNodeManager(d_pchecker.get())),
d_pppg(new PreprocessProofGenerator(
d_pnm.get(), u, "smt::PreprocessProofGenerator")),
d_pfpp(new ProofPostproccess(
d_pnm.get(),
smte,
d_pppg.get(),
// by default the post-processor will update all assumptions, which
// can lead to SCOPE subproofs of the form
// A
// ...
// B1 B2
// ... ...
// ------------
// C
// ------------- SCOPE [B1, B2]
// B1 ^ B2 => C
//
// where A is an available assumption from outside the scope (note
// that B1 was an assumption of this SCOPE subproof but since it could
// be inferred from A, it was updated). This shape is problematic for
// the veriT reconstruction, so we disable the update of scoped
// assumptions (which would disable the update of B1 in this case).
options::proofFormatMode() != options::ProofFormatMode::VERIT)),
d_finalProof(nullptr)
{
// add rules to eliminate here
if (options::proofGranularityMode() != options::ProofGranularityMode::OFF)
{
d_pfpp->setEliminateRule(PfRule::MACRO_SR_EQ_INTRO);
d_pfpp->setEliminateRule(PfRule::MACRO_SR_PRED_INTRO);
d_pfpp->setEliminateRule(PfRule::MACRO_SR_PRED_ELIM);
d_pfpp->setEliminateRule(PfRule::MACRO_SR_PRED_TRANSFORM);
d_pfpp->setEliminateRule(PfRule::MACRO_RESOLUTION_TRUST);
d_pfpp->setEliminateRule(PfRule::MACRO_RESOLUTION);
d_pfpp->setEliminateRule(PfRule::MACRO_ARITH_SCALE_SUM_UB);
if (options::proofGranularityMode()
!= options::ProofGranularityMode::REWRITE)
{
d_pfpp->setEliminateRule(PfRule::SUBS);
d_pfpp->setEliminateRule(PfRule::REWRITE);
if (options::proofGranularityMode()
!= options::ProofGranularityMode::THEORY_REWRITE)
{
// this eliminates theory rewriting steps with finer-grained DSL rules
d_pfpp->setEliminateRule(PfRule::THEORY_REWRITE);
}
}
}
d_false = NodeManager::currentNM()->mkConst(false);
}
PfManager::~PfManager() {}
void PfManager::setFinalProof(std::shared_ptr<ProofNode> pfn, Assertions& as)
{
// Note this assumes that setFinalProof is only called once per unsat
// response. This method would need to cache its result otherwise.
Trace("smt-proof") << "SmtEngine::setFinalProof(): get proof body...\n";
if (Trace.isOn("smt-proof-debug"))
{
Trace("smt-proof-debug")
<< "SmtEngine::setFinalProof(): Proof node for false:\n";
Trace("smt-proof-debug") << *pfn.get() << std::endl;
Trace("smt-proof-debug") << "=====" << std::endl;
}
std::vector<Node> assertions;
getAssertions(as, assertions);
if (Trace.isOn("smt-proof"))
{
Trace("smt-proof") << "SmtEngine::setFinalProof(): get free assumptions..."
<< std::endl;
std::vector<Node> fassumps;
expr::getFreeAssumptions(pfn.get(), fassumps);
Trace("smt-proof")
<< "SmtEngine::setFinalProof(): initial free assumptions are:\n";
for (const Node& a : fassumps)
{
Trace("smt-proof") << "- " << a << std::endl;
}
Trace("smt-proof") << "SmtEngine::setFinalProof(): assertions are:\n";
for (const Node& n : assertions)
{
Trace("smt-proof") << "- " << n << std::endl;
}
Trace("smt-proof") << "=====" << std::endl;
}
Trace("smt-proof") << "SmtEngine::setFinalProof(): postprocess...\n";
Assert(d_pfpp != nullptr);
d_pfpp->process(pfn);
Trace("smt-proof") << "SmtEngine::setFinalProof(): make scope...\n";
// Now make the final scope, which ensures that the only open leaves of the
// proof are the assertions, unless we are doing proofs to generate unsat
// cores, in which case we do not care.
d_finalProof = d_pnm->mkScope(pfn, assertions, !options::unsatCores());
Trace("smt-proof") << "SmtEngine::setFinalProof(): finished.\n";
}
void PfManager::printProof(std::ostream& out,
std::shared_ptr<ProofNode> pfn,
Assertions& as)
{
Trace("smt-proof") << "PfManager::printProof: start" << std::endl;
std::shared_ptr<ProofNode> fp = getFinalProof(pfn, as);
// if we are in incremental mode, we don't want to invalidate the proof
// nodes in fp, since these may be reused in further check-sat calls
if (options::incrementalSolving()
&& options::proofFormatMode() != options::ProofFormatMode::NONE)
{
fp = d_pnm->clone(fp);
}
// TODO (proj #37) according to the proof format, post process the proof node
// TODO (proj #37) according to the proof format, print the proof node
if (options::proofFormatMode() == options::ProofFormatMode::DOT)
{
proof::DotPrinter::print(out, fp.get());
}
else
{
out << "(proof\n";
out << *fp;
out << "\n)\n";
}
}
void PfManager::checkProof(std::shared_ptr<ProofNode> pfn, Assertions& as)
{
Trace("smt-proof") << "PfManager::checkProof: start" << std::endl;
std::shared_ptr<ProofNode> fp = getFinalProof(pfn, as);
Trace("smt-proof-debug") << "PfManager::checkProof: returned " << *fp.get()
<< std::endl;
}
ProofChecker* PfManager::getProofChecker() const { return d_pchecker.get(); }
ProofNodeManager* PfManager::getProofNodeManager() const { return d_pnm.get(); }
smt::PreprocessProofGenerator* PfManager::getPreprocessProofGenerator() const
{
return d_pppg.get();
}
std::shared_ptr<ProofNode> PfManager::getFinalProof(
std::shared_ptr<ProofNode> pfn, Assertions& as)
{
setFinalProof(pfn, as);
Assert(d_finalProof);
return d_finalProof;
}
void PfManager::getAssertions(Assertions& as,
std::vector<Node>& assertions)
{
context::CDList<Node>* al = as.getAssertionList();
Assert(al != nullptr);
for (context::CDList<Node>::const_iterator i = al->begin(); i != al->end();
++i)
{
assertions.push_back(*i);
}
}
} // namespace smt
} // namespace cvc5
|
