blob: aea2554bd18b63845c807fe2fa4ed98688e1c95e (
plain)
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
|
/********************* */
/*! \file assertion_pipeline.h
** \verbatim
** Top contributors (to current version):
** Andres Noetzli, Justin Xu, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 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 "cvc4_private.h"
#ifndef __CVC4__PREPROCESSING__ASSERTION_PIPELINE_H
#define __CVC4__PREPROCESSING__ASSERTION_PIPELINE_H
#include <vector>
#include "expr/node.h"
#include "smt/term_formula_removal.h"
namespace CVC4 {
namespace preprocessing {
/**
* Assertion Pipeline stores a list of assertions modified by preprocessing
* passes. It is assumed that all assertions after d_realAssertionsEnd were
* generated by ITE removal. Hence, d_iteSkolemMap maps into only these.
*/
class AssertionPipeline
{
public:
AssertionPipeline();
size_t size() const { return d_nodes.size(); }
void resize(size_t n) { d_nodes.resize(n); }
/**
* Clear the list of assertions and assumptions.
*/
void clear();
Node& operator[](size_t i) { return d_nodes[i]; }
const Node& operator[](size_t i) const { return d_nodes[i]; }
/**
* Adds an assertion/assumption to be preprocessed.
*
* @param n The assertion/assumption
* @param isAssumption If true, records that \p n is an assumption. Note that
* all assumptions have to be added contiguously.
*/
void push_back(Node n, bool isAssumption = false);
std::vector<Node>& ref() { return d_nodes; }
const std::vector<Node>& ref() const { return d_nodes; }
std::vector<Node>::const_iterator begin() const { return d_nodes.cbegin(); }
std::vector<Node>::const_iterator end() const { return d_nodes.cend(); }
/*
* Replaces assertion i with node n and records the dependency between the
* original assertion and its replacement.
*/
void replace(size_t i, Node n);
/*
* Replaces assertion i with node n and records that this replacement depends
* on assertion i and the nodes listed in addnDeps. The dependency
* information is used for unsat cores and proofs.
*/
void replace(size_t i, Node n, const std::vector<Node>& addnDeps);
/*
* Replaces an assertion with a vector of assertions and records the
* dependencies.
*/
void replace(size_t i, const std::vector<Node>& ns);
IteSkolemMap& getIteSkolemMap() { return d_iteSkolemMap; }
const IteSkolemMap& getIteSkolemMap() const { return d_iteSkolemMap; }
size_t getRealAssertionsEnd() const { return d_realAssertionsEnd; }
/** @return The index of the first assumption */
size_t getAssumptionsStart() const { return d_assumptionsStart; }
/** @return The number of assumptions */
size_t getNumAssumptions() const { return d_numAssumptions; }
void updateRealAssertionsEnd() { d_realAssertionsEnd = d_nodes.size(); }
private:
/** The list of current assertions */
std::vector<Node> d_nodes;
/**
* Map from skolem variables to index in d_assertions containing
* corresponding introduced Boolean ite
*/
IteSkolemMap d_iteSkolemMap;
/** Size of d_nodes when preprocessing starts */
size_t d_realAssertionsEnd;
/** Index of the first assumption */
size_t d_assumptionsStart;
/** The number of assumptions */
size_t d_numAssumptions;
}; /* class AssertionPipeline */
} // namespace preprocessing
} // namespace CVC4
#endif /* __CVC4__PREPROCESSING__ASSERTION_PIPELINE_H */
|
