forked from qingkaishi/z3
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sat_config.cpp
263 lines (227 loc) · 10.4 KB
/
sat_config.cpp
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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
sat_config.cpp
Abstract:
SAT configuration options
Author:
Leonardo de Moura (leonardo) 2011-05-21.
Revision History:
--*/
#include "sat/sat_config.h"
#include "sat/sat_types.h"
#include "sat/sat_params.hpp"
#include "sat/sat_simplifier_params.hpp"
namespace sat {
config::config(params_ref const & p) {
m_incremental = false; // ad-hoc parameter
updt_params(p);
}
void config::updt_params(params_ref const & _p) {
sat_params p(_p);
m_max_memory = megabytes_to_bytes(p.max_memory());
symbol s = p.restart();
if (s == symbol("luby"))
m_restart = RS_LUBY;
else if (s == symbol("geometric"))
m_restart = RS_GEOMETRIC;
else if (s == symbol("ema"))
m_restart = RS_EMA;
else if (s == symbol("static"))
m_restart = RS_STATIC;
else
throw sat_param_exception("invalid restart strategy");
m_fast_glue_avg = p.restart_emafastglue();
m_slow_glue_avg = p.restart_emaslowglue();
m_restart_margin = p.restart_margin();
m_restart_fast = p.restart_fast();
s = p.phase();
if (s == symbol("always_false"))
m_phase = PS_ALWAYS_FALSE;
else if (s == symbol("always_true"))
m_phase = PS_ALWAYS_TRUE;
else if (s == symbol("basic_caching"))
m_phase = PS_BASIC_CACHING;
else if (s == symbol("caching"))
m_phase = PS_SAT_CACHING;
else if (s == symbol("random"))
m_phase = PS_RANDOM;
else if (s == symbol("frozen"))
m_phase = PS_FROZEN;
else
throw sat_param_exception("invalid phase selection strategy: always_false, always_true, basic_caching, caching, random");
m_rephase_base = p.rephase_base();
m_reorder_base = p.reorder_base();
m_reorder_itau = p.reorder_itau();
m_activity_scale = p.reorder_activity_scale();
m_search_sat_conflicts = p.search_sat_conflicts();
m_search_unsat_conflicts = p.search_unsat_conflicts();
m_phase_sticky = p.phase_sticky();
m_restart_initial = p.restart_initial();
m_restart_factor = p.restart_factor();
m_restart_max = p.restart_max();
m_propagate_prefetch = p.propagate_prefetch();
m_inprocess_max = p.inprocess_max();
m_inprocess_out = p.inprocess_out();
m_random_freq = p.random_freq();
m_random_seed = p.random_seed();
if (m_random_seed == 0) {
m_random_seed = _p.get_uint("random_seed", 0);
}
m_burst_search = p.burst_search();
m_enable_pre_simplify = p.enable_pre_simplify();
m_max_conflicts = p.max_conflicts();
m_num_threads = p.threads();
m_ddfw_search = p.ddfw_search();
m_ddfw_threads = p.ddfw_threads();
m_prob_search = p.prob_search();
m_local_search = p.local_search();
m_local_search_threads = p.local_search_threads();
if (p.local_search_mode() == symbol("gsat"))
m_local_search_mode = local_search_mode::gsat;
else
m_local_search_mode = local_search_mode::wsat;
m_local_search_dbg_flips = p.local_search_dbg_flips();
//m_binspr = p.binspr();
m_binspr = false; // prevent adventurous users from trying feature that isn't ready
m_anf_simplify = p.anf();
m_anf_delay = p.anf_delay();
m_anf_exlin = p.anf_exlin();
m_cut_simplify = p.cut();
m_cut_delay = p.cut_delay();
m_cut_aig = p.cut_aig();
m_cut_lut = p.cut_lut();
m_cut_xor = p.cut_xor();
m_cut_npn3 = p.cut_npn3();
m_cut_dont_cares = p.cut_dont_cares();
m_cut_redundancies = p.cut_redundancies();
m_cut_force = p.cut_force();
m_lookahead_simplify = p.lookahead_simplify();
m_lookahead_double = p.lookahead_double();
m_lookahead_simplify_bca = p.lookahead_simplify_bca();
if (p.lookahead_reward() == symbol("heule_schur"))
m_lookahead_reward = heule_schur_reward;
else if (p.lookahead_reward() == symbol("heuleu"))
m_lookahead_reward = heule_unit_reward;
else if (p.lookahead_reward() == symbol("ternary"))
m_lookahead_reward = ternary_reward;
else if (p.lookahead_reward() == symbol("unit"))
m_lookahead_reward = unit_literal_reward;
else if (p.lookahead_reward() == symbol("march_cu"))
m_lookahead_reward = march_cu_reward;
else
throw sat_param_exception("invalid reward type supplied: accepted heuristics are 'ternary', 'heuleu', 'unit' or 'heule_schur'");
if (p.lookahead_cube_cutoff() == symbol("depth"))
m_lookahead_cube_cutoff = depth_cutoff;
else if (p.lookahead_cube_cutoff() == symbol("freevars"))
m_lookahead_cube_cutoff = freevars_cutoff;
else if (p.lookahead_cube_cutoff() == symbol("psat"))
m_lookahead_cube_cutoff = psat_cutoff;
else if (p.lookahead_cube_cutoff() == symbol("adaptive_freevars"))
m_lookahead_cube_cutoff = adaptive_freevars_cutoff;
else if (p.lookahead_cube_cutoff() == symbol("adaptive_psat"))
m_lookahead_cube_cutoff = adaptive_psat_cutoff;
else
throw sat_param_exception("invalid cutoff type supplied: accepted cutoffs are 'depth', 'freevars', 'psat', 'adaptive_freevars' and 'adaptive_psat'");
m_lookahead_cube_fraction = p.lookahead_cube_fraction();
m_lookahead_cube_depth = p.lookahead_cube_depth();
m_lookahead_cube_freevars = p.lookahead_cube_freevars();
m_lookahead_cube_psat_var_exp = p.lookahead_cube_psat_var_exp();
m_lookahead_cube_psat_clause_base = p.lookahead_cube_psat_clause_base();
m_lookahead_cube_psat_trigger = p.lookahead_cube_psat_trigger();
m_lookahead_global_autarky = p.lookahead_global_autarky();
m_lookahead_delta_fraction = p.lookahead_delta_fraction();
m_lookahead_use_learned = p.lookahead_use_learned();
if (m_lookahead_delta_fraction < 0 || m_lookahead_delta_fraction > 1.0) {
throw sat_param_exception("invalid value for delta fraction. It should be a number in the interval 0 to 1");
}
// These parameters are not exposed
m_next_simplify1 = _p.get_uint("next_simplify", 90000);
m_simplify_mult2 = _p.get_double("simplify_mult2", 1.5);
m_simplify_max = _p.get_uint("simplify_max", 1000000);
// --------------------------------
m_simplify_delay = p.simplify_delay();
s = p.gc();
if (s == symbol("dyn_psm"))
m_gc_strategy = GC_DYN_PSM;
else if (s == symbol("glue_psm"))
m_gc_strategy = GC_GLUE_PSM;
else if (s == symbol("glue"))
m_gc_strategy = GC_GLUE;
else if (s == symbol("psm"))
m_gc_strategy = GC_PSM;
else if (s == symbol("psm_glue"))
m_gc_strategy = GC_PSM_GLUE;
else
throw sat_param_exception("invalid gc strategy");
m_gc_initial = p.gc_initial();
m_gc_increment = p.gc_increment();
m_gc_small_lbd = p.gc_small_lbd();
m_gc_k = std::min(255u, p.gc_k());
m_gc_burst = p.gc_burst();
m_gc_defrag = p.gc_defrag();
m_force_cleanup = p.force_cleanup();
m_backtrack_scopes = p.backtrack_scopes();
m_backtrack_init_conflicts = p.backtrack_conflicts();
m_minimize_lemmas = p.minimize_lemmas();
m_core_minimize = p.core_minimize();
m_core_minimize_partial = p.core_minimize_partial();
m_drat_check_unsat = p.drat_check_unsat();
m_drat_check_sat = p.drat_check_sat();
m_drat_file = p.drat_file();
m_drat = (m_drat_check_unsat || m_drat_file.is_non_empty_string() || m_drat_check_sat) && p.threads() == 1;
m_drat_binary = p.drat_binary();
m_drat_activity = p.drat_activity();
m_dyn_sub_res = p.dyn_sub_res();
// Parameters used in Liang, Ganesh, Poupart, Czarnecki AAAI 2016.
m_branching_heuristic = BH_VSIDS;
if (p.branching_heuristic() == symbol("vsids"))
m_branching_heuristic = BH_VSIDS;
else if (p.branching_heuristic() == symbol("chb"))
m_branching_heuristic = BH_CHB;
else
throw sat_param_exception("invalid branching heuristic: accepted heuristics are 'vsids' or 'chb'");
m_anti_exploration = p.branching_anti_exploration();
m_step_size_init = 0.40;
m_step_size_dec = 0.000001;
m_step_size_min = 0.06;
m_reward_multiplier = 0.9;
m_reward_offset = 1000000.0;
m_variable_decay = p.variable_decay();
// PB parameters
s = p.pb_solver();
if (s != symbol("circuit") &&
s != symbol("sorting") &&
s != symbol("totalizer") &&
s != symbol("solver") &&
s != symbol("segmented") &&
s != symbol("binary_merge")) {
throw sat_param_exception("invalid PB solver: solver, totalizer, circuit, sorting, segmented, binary_merge");
}
s = p.pb_resolve();
if (s == "cardinality")
m_pb_resolve = PB_CARDINALITY;
else if (s == "rounding")
m_pb_resolve = PB_ROUNDING;
else
throw sat_param_exception("invalid PB resolve: 'cardinality' or 'rounding' expected");
s = p.pb_lemma_format();
if (s == "cardinality")
m_pb_lemma_format = PB_LEMMA_CARDINALITY;
else if (s == "pb")
m_pb_lemma_format = PB_LEMMA_PB;
else
throw sat_param_exception("invalid PB lemma format: 'cardinality' or 'pb' expected");
m_card_solver = p.cardinality_solver();
m_xor_solver = false; // prevent users from playing with this option
sat_simplifier_params sp(_p);
m_elim_vars = sp.elim_vars();
#if 0
if (m_drat && (m_xor_solver || m_card_solver))
throw sat_param_exception("DRAT checking only works for pure CNF");
#endif
}
void config::collect_param_descrs(param_descrs & r) {
sat_params::collect_param_descrs(r);
}
};