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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Gereon Kremer, Morgan Deters
*
* 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 module for processing assertions for an SMT engine.
*/
#include "cvc5_private.h"
#ifndef CVC5__SMT__PROCESS_ASSERTIONS_H
#define CVC5__SMT__PROCESS_ASSERTIONS_H
#include <unordered_map>
#include "context/cdlist.h"
#include "expr/node.h"
#include "smt/env_obj.h"
#include "util/resource_manager.h"
namespace cvc5 {
namespace preprocessing {
class AssertionPipeline;
class PreprocessingPass;
class PreprocessingPassContext;
}
namespace smt {
class Assertions;
struct SolverEngineStatistics;
/**
* Module in charge of processing assertions for an SMT engine.
*
* Its main features are:
* (1) apply(AssertionsPipeline&), which updates the assertions based on our
* preprocessing steps,
* (2) expandDefinitions(TNode, ...), which returns the expanded formula of a
* term.
* The method finishInit(...) must be called before these methods are called.
*
* It is designed to be agnostic to whether we are in incremental mode. That is,
* it processes assertions in a way that assumes that apply(...) could be
* applied multiple times to different sets of assertions.
*/
class ProcessAssertions : protected EnvObj
{
/** The types for the recursive function definitions */
typedef context::CDList<Node> NodeList;
typedef std::unordered_map<Node, bool> NodeToBoolHashMap;
public:
ProcessAssertions(Env& env, SolverEngineStatistics& stats);
~ProcessAssertions();
/** Finish initialize
*
* This initializes the preprocessing passes owned by this module.
*/
void finishInit(preprocessing::PreprocessingPassContext* pc);
/** Cleanup
*
* This deletes the processing passes owned by this module.
*/
void cleanup();
/**
* Process the formulas in as. Returns true if there was no conflict when
* processing the assertions.
*
* @param as The assertions.
*/
bool apply(Assertions& as);
private:
/** Reference to the SMT stats */
SolverEngineStatistics& d_smtStats;
/** The preprocess context */
preprocessing::PreprocessingPassContext* d_preprocessingPassContext;
/** True node */
Node d_true;
/**
* Map of preprocessing pass instances, mapping from names to preprocessing
* pass instance
*/
std::unordered_map<std::string,
std::unique_ptr<preprocessing::PreprocessingPass>>
d_passes;
/**
* Number of calls of simplify assertions active.
*/
unsigned d_simplifyAssertionsDepth;
/** Spend resource r by the resource manager of this class. */
void spendResource(Resource r);
/**
* Perform non-clausal simplification of a Node. This involves
* Theory implementations, but does NOT involve the SAT solver in
* any way.
*
* Returns false if the formula simplifies to "false"
*/
bool simplifyAssertions(Assertions& as);
/**
* Dump assertions. Print the current assertion list to the dump
* assertions:`key` if it is enabled.
*/
void dumpAssertions(const char* key, Assertions& as);
};
} // namespace smt
} // namespace cvc5
#endif
|
