blob: 49c9dc944f593864ea2b7192f80cc5306fdb2bb5 (
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
|
/********************* */
/*! \file bool_to_bv.h
** \verbatim
** Top contributors (to current version):
** Yoni Zohar
** This file is part of the CVC4 project.
** Copyright (c) 2009-2018 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 The BoolToBv preprocessing pass
**
**/
#include "cvc4_private.h"
#ifndef __CVC4__PREPROCESSING__PASSES__BOOL_TO_BV_H
#define __CVC4__PREPROCESSING__PASSES__BOOL_TO_BV_H
#include "preprocessing/passes/bv_to_bool.h"
#include "preprocessing/preprocessing_pass.h"
#include "preprocessing/preprocessing_pass_context.h"
#include "util/statistics_registry.h"
namespace CVC4 {
namespace preprocessing {
namespace passes {
class BoolToBV : public PreprocessingPass
{
public:
BoolToBV(PreprocessingPassContext* preprocContext);
protected:
PreprocessingPassResult applyInternal(
AssertionPipeline* assertionsToPreprocess) override;
private:
struct Statistics
{
IntStat d_numTermsLowered;
IntStat d_numAtomsLowered;
IntStat d_numTermsForcedLowered;
Statistics();
~Statistics();
};
void lowerBoolToBv(const std::vector<Node>& assertions,
std::vector<Node>& new_assertions);
void addToLowerCache(TNode term, Node new_term);
Node getLowerCache(TNode term) const;
bool hasLowerCache(TNode term) const;
Node lowerNode(TNode current, bool topLevel = false);
NodeNodeMap d_lowerCache;
Node d_one;
Node d_zero;
Statistics d_statistics;
}; // class
} // namespace passes
} // namespace preprocessing
} // namespace CVC4
#endif /* __CVC4__PREPROCESSING__PASSES__BOOL_TO_BV_H */
|
