tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1986 @@
1
+ import {
2
+ SmtCanceledError,
3
+ SmtParseError,
4
+ SmtTacticError,
5
+ SmtUnsupportedError,
6
+ } from "../../../errors";
7
+ import {
8
+ type AstManager,
9
+ KIND_APP,
10
+ OP_DIV0,
11
+ OP_IDIV0,
12
+ OP_ITE,
13
+ OP_MOD0,
14
+ OP_POWER0,
15
+ SORT_BOOL,
16
+ } from "./ast";
17
+ import { createQfufbvAckrTactic, runAckermannizeBv } from "./ackermannize-bv-tactic";
18
+ import { AssertedFormulas } from "./asserted-formulas";
19
+ import { createAigTactic } from "./aig-tactic";
20
+ import { card2bv } from "./card2bv";
21
+ import { Context, MBQI_MAX_ITERATIONS } from "./context";
22
+ import { ctxSimplify } from "./ctx-simplify";
23
+ import { createCtxSolverSimplify } from "./ctx-solver-simplify";
24
+ import {
25
+ type Definition,
26
+ type Dependency,
27
+ Goal,
28
+ getDependencyValues,
29
+ joinDependencies,
30
+ mkDependencyLeaf,
31
+ } from "./goal";
32
+ import type { AckrSolver } from "./lackr";
33
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
34
+ import { DerRewriter } from "./der";
35
+ import { fixDlVar } from "./fix-dl-var";
36
+ import { runFpa2Bv } from "./fpa2bv-tactic";
37
+ import { type BitBlasterRewriter, runBitBlast } from "./bit-blast-tactic";
38
+ import { runMaxBvSharing } from "./max-bv-sharing-tactic";
39
+ import { runBvBoundChk } from "./bv-bound-chk";
40
+ import { runBvDivremBounds } from "./bv-divrem-bounds";
41
+ import { runBv1Blast } from "./bv1-blast";
42
+ import { runReduceBvSize } from "./reduce-bv-size";
43
+ import { createSatTactic } from "./sat/sat-tactic";
44
+ import { mkThSolver } from "./euf/th-solvers";
45
+ import { createFdTactic } from "./fd-solver";
46
+ import { elimUncnstr } from "./elim-uncnstr";
47
+ import { rewriteUfbv } from "./demodulator";
48
+ import { distributeForall } from "./distribute-forall";
49
+ import { createDt2BvTactic } from "./dt2bv-tactic";
50
+ import { createEq2BvTactic } from "./eq2bv-tactic";
51
+ import { runElimSmallBv } from "./elim-small-bv-tactic";
52
+ import { domSimplify } from "./dom-simplify";
53
+ import { factor } from "./factor";
54
+ import { findGoalMacros } from "./macro-finder";
55
+ import { findQuasiMacros } from "./quasi-macros";
56
+ import { reduceArgs } from "./reduce-args";
57
+ import { DefinedNames, NNF_FULL, NNF_QUANT, NNF_SKOLEM, Nnf } from "./nnf";
58
+ import { normalizeBounds } from "./normalize-bounds";
59
+ import { propagateIneqs } from "./bound-simplifier";
60
+ import { diffNeq } from "./diff-neq";
61
+ import { lia2pb } from "./lia2pb";
62
+ import { runPb2Bv } from "./pb2bv-tactic";
63
+ import { fm } from "./fm-tactic";
64
+ import { addBounds } from "./add-bounds-tactic";
65
+ import { cofactorTermIte } from "./cofactor-elim-term-ite";
66
+ import { nla2bv } from "./nla2bv-tactic";
67
+ import { Rational } from "./rational";
68
+ import { runNlsat } from "./nlsat-tactic";
69
+ import { runNlqsat } from "./nlqsat";
70
+ import { occf } from "./occf";
71
+ import { propagateValues } from "./propagate-values";
72
+ import { purifyArith } from "./purify-arith";
73
+ import { ModelEvaluator } from "./model-evaluator";
74
+ import { FuncInterp, ProtoModel } from "./proto-model";
75
+ import { isMbqiByFeatures, type SmtSetup } from "./smt-setup";
76
+ import { compileProbe, formatProbeValue, isQfufbv, type Probe } from "./probes";
77
+ import { runHorn } from "./muz/horn-tactic";
78
+ import { runQe } from "./qe";
79
+ import { applyQeLite } from "./qe-lite";
80
+ import { QSAT_QE, QSAT_QE_REC, QSAT_SAT, runQsat } from "./qsat";
81
+ import { simplifyGoal } from "./quant-tactics";
82
+ import { SolveEqs } from "./solve-eqs";
83
+ import { RefVector } from "./ref-vector";
84
+ import { type RewriterOptions, TACTIC_REWRITER_OPTIONS } from "./rewriter";
85
+ import { lia2card } from "./lia2card";
86
+ import { LOGIC_TACTICS, QFAUFBV, QFUFBV_ACKR_PREAMBLE } from "./logic-tactics";
87
+ import {
88
+ createCommandReader,
89
+ isSymbol,
90
+ type SExpr,
91
+ type SmtList,
92
+ type SmtToken,
93
+ } from "./smtlib-parser";
94
+ import { solveParallel } from "./parallel-tactic";
95
+ import { solveAssuming, solveGoal } from "./solver";
96
+ import { tseitinCnf } from "./tseitin-cnf";
97
+
98
+ const PARAM_BOOL = 0;
99
+ const PARAM_UINT = 1;
100
+ const PARAM_SYMBOL = 2;
101
+ const PARAM_NUMERAL = 3;
102
+
103
+ export type TacticParam = boolean | number | string;
104
+ export type TacticParams = ReadonlyMap<string, TacticParam>;
105
+
106
+ interface ParamDescr {
107
+ kind: number;
108
+ module: string;
109
+ defaultValue: TacticParam;
110
+ isPorted: boolean;
111
+ }
112
+
113
+ type ParamDescrs = ReadonlyMap<string, ParamDescr>;
114
+
115
+ export interface Tactic {
116
+ (goal: Goal): Goal[];
117
+ }
118
+
119
+ export interface TacticEnvironment {
120
+ manager: AstManager;
121
+ isMbqi: boolean;
122
+ mbqiMaxIterations: number;
123
+ isFindingMacros: boolean;
124
+ setup: SmtSetup;
125
+ write: (text: string, isDiagnostic: boolean) => void;
126
+ parameters: ReadonlyMap<string, string>;
127
+ hasDefinitions: () => boolean;
128
+ }
129
+
130
+ // A tactic that tracks dependencies keeps the dependency of every formula it changes, so the goal
131
+ // gets the assertion names only for those.
132
+ interface TacticBuilder {
133
+ descrs: ParamDescrs;
134
+ isRejectingUnknown: boolean;
135
+ isTrackingDependencies: boolean;
136
+ build: (params: TacticParams) => Tactic;
137
+ }
138
+
139
+ interface NamedTactic {
140
+ descrs: ParamDescrs;
141
+ isRejectingUnknown?: boolean;
142
+ isTrackingDependencies?: boolean;
143
+ build: (environment: TacticEnvironment, params: TacticParams) => Tactic;
144
+ }
145
+
146
+ const getDescrs = (module: string, entries: [string, number, TacticParam, boolean?][]) =>
147
+ new Map(
148
+ entries.map(([name, kind, defaultValue, isPorted]) => [
149
+ name,
150
+ { kind, module, defaultValue, isPorted: isPorted ?? false },
151
+ ]),
152
+ );
153
+
154
+ const UINT_MAX = 4294967295;
155
+
156
+ const REWRITER_DESCRS = getDescrs("rewriter", [
157
+ ["ite_extra_rules", PARAM_BOOL, true],
158
+ ["flat", PARAM_BOOL, true, true],
159
+ ["flat_and_or", PARAM_BOOL, true, true],
160
+ ["sort_disjunctions", PARAM_BOOL, true],
161
+ ["elim_and", PARAM_BOOL, false, true],
162
+ ["elim_ite", PARAM_BOOL, true],
163
+ ["local_ctx", PARAM_BOOL, false, true],
164
+ ["local_ctx_limit", PARAM_UINT, UINT_MAX, true],
165
+ ["blast_distinct", PARAM_BOOL, false, true],
166
+ ["blast_distinct_threshold", PARAM_UINT, UINT_MAX, true],
167
+ ["som", PARAM_BOOL, false, true],
168
+ ["som_blowup", PARAM_UINT, 10],
169
+ ["hoist_mul", PARAM_BOOL, false, true],
170
+ ["hoist_ite", PARAM_BOOL, false, true],
171
+ ["algebraic_number_evaluator", PARAM_BOOL, true, true],
172
+ ["mul_to_power", PARAM_BOOL, false],
173
+ ["expand_power", PARAM_BOOL, false, true],
174
+ ["expand_tan", PARAM_BOOL, false, true],
175
+ ["max_degree", PARAM_UINT, 64, true],
176
+ ["sort_sums", PARAM_BOOL, false, true],
177
+ ["gcd_rounding", PARAM_BOOL, false, true],
178
+ ["arith_lhs", PARAM_BOOL, false, true],
179
+ ["arith_ineq_lhs", PARAM_BOOL, false],
180
+ ["elim_to_real", PARAM_BOOL, false],
181
+ ["push_to_real", PARAM_BOOL, true],
182
+ ["eq2ineq", PARAM_BOOL, false],
183
+ ["elim_rem", PARAM_BOOL, false],
184
+ ["split_concat_eq", PARAM_BOOL, false, true],
185
+ ["bit2bool", PARAM_BOOL, true],
186
+ ["blast_eq_value", PARAM_BOOL, false],
187
+ ["elim_sign_ext", PARAM_BOOL, true],
188
+ ["hi_div0", PARAM_BOOL, true, true],
189
+ ["mul2concat", PARAM_BOOL, false, true],
190
+ ["bv_sort_ac", PARAM_BOOL, true],
191
+ ["bv_extract_prop", PARAM_BOOL, false],
192
+ ["bv_not_simpl", PARAM_BOOL, false],
193
+ ["bv_ite2id", PARAM_BOOL, false],
194
+ ["bv_le_extra", PARAM_BOOL, false],
195
+ ["bv_le2extract", PARAM_BOOL, true],
196
+ ["expand_select_store", PARAM_BOOL, false],
197
+ ["blast_select_store", PARAM_BOOL, false],
198
+ ["expand_nested_stores", PARAM_BOOL, false],
199
+ ["expand_select_ite", PARAM_BOOL, false],
200
+ ["expand_store_eq", PARAM_BOOL, false],
201
+ ["sort_store", PARAM_BOOL, false, true],
202
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
203
+ ["max_steps", PARAM_UINT, UINT_MAX],
204
+ ["push_ite_arith", PARAM_BOOL, false],
205
+ ["push_ite_bv", PARAM_BOOL, false, true],
206
+ ["pull_cheap_ite", PARAM_BOOL, false, true],
207
+ ["bv_ineq_consistency_test_max", PARAM_UINT, 0, true],
208
+ ["unfold_recursive_functions", PARAM_BOOL, false],
209
+ ["cache_all", PARAM_BOOL, false],
210
+ ["enable_der", PARAM_BOOL, true],
211
+ ["rewrite_patterns", PARAM_BOOL, false],
212
+ ["ignore_patterns_on_ground_qbody", PARAM_BOOL, true],
213
+ ]);
214
+
215
+ const BOOL_REWRITER_PARAMS = [
216
+ "ite_extra_rules",
217
+ "flat_and_or",
218
+ "sort_disjunctions",
219
+ "elim_ite",
220
+ "local_ctx",
221
+ "local_ctx_limit",
222
+ "blast_distinct",
223
+ "blast_distinct_threshold",
224
+ ];
225
+
226
+ const getBool = (params: TacticParams, name: string, defaultValue: boolean) => {
227
+ const value = params.get(name);
228
+ return typeof value === "boolean" ? value : defaultValue;
229
+ };
230
+
231
+ const getUint = (params: TacticParams, name: string, defaultValue: number) => {
232
+ const value = params.get(name);
233
+ return typeof value === "number" ? value : defaultValue;
234
+ };
235
+
236
+ const getNumeral = (params: TacticParams, name: string, defaultValue: string) => {
237
+ const value = params.get(name);
238
+ const parts = (typeof value === "string" ? value : defaultValue).split(".");
239
+ const fraction = parts[1] ?? "";
240
+ return Rational.of(BigInt(parts[0] + fraction), 10n ** BigInt(fraction.length));
241
+ };
242
+
243
+ export const getRewriterOptions = (manager: AstManager, params: TacticParams): RewriterOptions => ({
244
+ ...TACTIC_REWRITER_OPTIONS,
245
+ isEliminatingAnd: getBool(params, "elim_and", false),
246
+ isFlatAndOr: getBool(params, "flat_and_or", true),
247
+ isSortingStore: getBool(params, "sort_store", false),
248
+ isPullingCheapIte: getBool(params, "pull_cheap_ite", false),
249
+ isPushingIteBv: getBool(params, "push_ite_bv", false),
250
+ isKeepingDistinct: !getBool(params, "blast_distinct", false),
251
+ blastDistinctThreshold: getUint(params, "blast_distinct_threshold", UINT_MAX),
252
+ localCtxLimit: getBool(params, "local_ctx", false)
253
+ ? getUint(params, "local_ctx_limit", UINT_MAX)
254
+ : undefined,
255
+ arith: {
256
+ isSom: getBool(params, "flat", true) && getBool(params, "som", false),
257
+ isSortSums: getBool(params, "sort_sums", false),
258
+ isArithIneqLhs: getBool(params, "arith_lhs", false),
259
+ isGcdRounding: getBool(params, "gcd_rounding", false),
260
+ isAnumSimp: getBool(params, "algebraic_number_evaluator", true),
261
+ isExpandPower: getBool(params, "expand_power", false),
262
+ isExpandTan: getBool(params, "expand_tan", false),
263
+ isHoistIte: getBool(params, "hoist_ite", false),
264
+ isHoistMul:
265
+ !(getBool(params, "flat", true) && getBool(params, "som", false)) &&
266
+ getBool(params, "hoist_mul", false),
267
+ isFlat: getBool(params, "flat", true),
268
+ isElimRem: getBool(params, "elim_rem", false),
269
+ maxDegree: getUint(params, "max_degree", 64),
270
+ },
271
+ bv: {
272
+ isHiDiv0: getBool(params, "hi_div0", manager.isHiDiv0),
273
+ isMul2concat: getBool(params, "mul2concat", false),
274
+ isSplitConcatEq: getBool(params, "split_concat_eq", false),
275
+ },
276
+ });
277
+
278
+ // arith.nl.rounds only bounds arith.solver 2, which the port does not use.
279
+ const SMT_DESCRS = getDescrs("smt", [
280
+ ["mbqi", PARAM_BOOL, true, true],
281
+ ["mbqi.max_iterations", PARAM_UINT, MBQI_MAX_ITERATIONS, true],
282
+ ["arith.nl.rounds", PARAM_UINT, 1024, true],
283
+ ]);
284
+
285
+ // The dependencies are assertion names, which are Boolean constants, so each one is its own
286
+ // assumption.
287
+ const getKernelParams = (environment: TacticEnvironment, params: TacticParams, goal: Goal) => {
288
+ const manager = environment.manager;
289
+ const hasQuantifiers = goal.forms.items.some((form) => manager.hasQuantifierFlags[form]);
290
+ return {
291
+ isMbqi:
292
+ getBool(params, "mbqi", environment.isMbqi) ||
293
+ isMbqiByFeatures(environment.setup, hasQuantifiers),
294
+ mbqiMaxIterations: getUint(params, "mbqi.max_iterations", environment.mbqiMaxIterations),
295
+ isFindingMacros: environment.isFindingMacros,
296
+ setup: environment.setup,
297
+ };
298
+ };
299
+
300
+ // extract_clauses_and_dependencies: each form's clause gets the negations of its dependencies.
301
+ const extractClauses = (manager: AstManager, goal: Goal) => {
302
+ const assumptions: number[] = [];
303
+ const clauses = new RefVector(manager);
304
+ for (const [index, form] of goal.forms.items.entries()) {
305
+ const values = getDependencyValues(goal.getDependency(index));
306
+ for (const value of values) if (!assumptions.includes(value)) assumptions.push(value);
307
+ clauses.pushOwned(
308
+ manager.withTemporaries(() =>
309
+ manager.mkOr([form, ...values.map((value) => manager.mkNot(value))]),
310
+ ),
311
+ );
312
+ }
313
+ return { clauses, assumptions };
314
+ };
315
+
316
+ const mkCoreDependency = (core: number[]) =>
317
+ core.reduce<Dependency | undefined>(
318
+ (dependency, value) => joinDependencies(dependency, mkDependencyLeaf(value)),
319
+ undefined,
320
+ );
321
+
322
+ export const getSatParams = (parameters: ReadonlyMap<string, string>) =>
323
+ new Map(
324
+ [...parameters]
325
+ .filter((entry) => entry[0].startsWith("sat."))
326
+ .map((entry) => {
327
+ const value = entry[1];
328
+ const number = Number(value);
329
+ return [
330
+ entry[0].slice(4),
331
+ value === "true"
332
+ ? true
333
+ : value === "false"
334
+ ? false
335
+ : Number.isNaN(number)
336
+ ? value
337
+ : number,
338
+ ];
339
+ }),
340
+ );
341
+
342
+ // sat_params reads what using-params leaves unset from the sat module's global parameters.
343
+ const getSatTacticParams = (environment: TacticEnvironment, params: TacticParams) =>
344
+ new Map([...getSatParams(environment.parameters), ...params]);
345
+
346
+ const runSmt = (environment: TacticEnvironment, params: TacticParams) => (goal: Goal) => {
347
+ const manager = environment.manager;
348
+ // mk_smt_tactic: with sat.euf, the smt tactic is the sat tactic.
349
+ if (environment.parameters.get("sat.euf") === "true")
350
+ return createSatTactic(manager, getSatParams(environment.parameters), mkThSolver)(goal);
351
+ const kernelParams = getKernelParams(environment, params, goal);
352
+ const extracted = extractClauses(manager, goal);
353
+ const solved =
354
+ extracted.assumptions.length === 0
355
+ ? solveGoal(manager, goal.forms.items, kernelParams)
356
+ : solveAssuming(manager, extracted.clauses.items, extracted.assumptions, kernelParams);
357
+ extracted.clauses.reset();
358
+ if (solved.result === L_UNDEF) throw new SmtTacticError(solved.context.getLastFailureMessage());
359
+ goal.reset();
360
+ if (solved.result === L_FALSE)
361
+ goal.assert(environment.manager.falseExpr, mkCoreDependency(solved.context.unsatCore));
362
+ else goal.model = solved.context.getModel();
363
+ return [goal];
364
+ };
365
+
366
+ const getParameter = (environment: TacticEnvironment, name: string, defaultValue: string) =>
367
+ environment.parameters.get(name) ?? defaultValue;
368
+
369
+ const runParallelSmt = (environment: TacticEnvironment) => (goal: Goal) => {
370
+ if (goal.isProofsEnabled)
371
+ throw new SmtTacticError("parallel_tactic does not support proof production");
372
+ const manager = environment.manager;
373
+ const extracted = extractClauses(manager, goal);
374
+ const solved = solveParallel(
375
+ manager,
376
+ getKernelParams(environment, new Map(), goal),
377
+ {
378
+ threadsMax: Number(getParameter(environment, "parallel.threads.max", "10000")),
379
+ numBbThreads: Number(getParameter(environment, "parallel.num_bb_threads", "2")),
380
+ isAblatingBacktracking:
381
+ getParameter(environment, "parallel.ablate_backtracking", "false") === "true",
382
+ },
383
+ extracted.clauses.items,
384
+ extracted.assumptions,
385
+ );
386
+ extracted.clauses.reset();
387
+ if (solved.status === L_TRUE) {
388
+ goal.reset();
389
+ goal.model = solved.model;
390
+ }
391
+ if (solved.status === L_FALSE)
392
+ goal.assert(
393
+ manager.falseExpr,
394
+ mkCoreDependency(solved.core.filter((literal) => extracted.assumptions.includes(literal))),
395
+ );
396
+ if (solved.status === L_UNDEF && !manager.limit.inc()) throw new SmtCanceledError();
397
+ return [goal];
398
+ };
399
+
400
+ const createTacticSolver = (manager: AstManager, getTactic: () => Tactic): AckrSolver => {
401
+ const assertions = new RefVector(manager);
402
+ let model: ProtoModel | undefined;
403
+ return {
404
+ assert: (expr) => assertions.push(expr),
405
+ check: () => {
406
+ model?.decRef();
407
+ model = undefined;
408
+ const goal = new Goal(manager);
409
+ for (const assertion of assertions.items) goal.assert(assertion);
410
+ const checked = checkSatUsing(getTactic(), goal);
411
+ model = checked.model;
412
+ model?.incRef();
413
+ return checked.status;
414
+ },
415
+ getModel: () => model as ProtoModel,
416
+ release: () => {
417
+ model?.decRef();
418
+ assertions.reset();
419
+ },
420
+ };
421
+ };
422
+
423
+ // Each clause gets a fresh context, where Z3 pushes a scope on one context.
424
+ const runUnitSubsume = (environment: TacticEnvironment) => (goal: Goal) => {
425
+ const manager = environment.manager;
426
+ const clauses = goal.forms.items.map(() => manager.mkFreshConst("#clause", SORT_BOOL));
427
+ const definitions = goal.forms.items.map((form, index) => manager.mkEq(clauses[index], form));
428
+ for (const expr of [...clauses, ...definitions]) manager.incRef(expr);
429
+ const deleted: number[] = [];
430
+ for (const [index, clause] of clauses.entries()) {
431
+ const asserted = new AssertedFormulas(manager);
432
+ const context = new Context(manager, {
433
+ isMbqi: environment.isMbqi,
434
+ mbqiMaxIterations: environment.mbqiMaxIterations,
435
+ relevancyLevel: 2,
436
+ });
437
+ for (const definition of definitions) asserted.assertExpr(definition);
438
+ for (const [other, otherClause] of clauses.entries())
439
+ if (other === index) asserted.assertExpr(manager.mkNot(clause));
440
+ else if (!deleted.includes(other)) asserted.assertExpr(otherClause);
441
+ // The context has no logic, so setup_default picks setup_unknown.
442
+ context.setupContext(undefined, false, asserted);
443
+ context.internalizeAssertions(asserted);
444
+ if (!context.isInconsistent()) context.propagate();
445
+ if (context.isInconsistent()) deleted.push(index);
446
+ }
447
+ for (const index of deleted) goal.update(index, manager.trueExpr);
448
+ goal.elimTrue();
449
+ for (const expr of [...clauses, ...definitions]) manager.decRef(expr);
450
+ return [goal];
451
+ };
452
+
453
+ const inPlace = (run: (goal: Goal) => void) => (goal: Goal) => {
454
+ run(goal);
455
+ return [goal];
456
+ };
457
+
458
+ const runDer = (manager: AstManager) => (goal: Goal) => {
459
+ const rewriter = new DerRewriter(manager);
460
+ const size = goal.forms.size;
461
+ for (let index = 0; !goal.isInconsistent && index < size; index++) {
462
+ const result = rewriter.rewrite(goal.forms.items[index]);
463
+ goal.update(index, result);
464
+ manager.decRef(result);
465
+ }
466
+ goal.elimTrue();
467
+ goal.elimRedundancies();
468
+ goal.depth++;
469
+ rewriter.der.release();
470
+ rewriter.release();
471
+ return [goal];
472
+ };
473
+
474
+ const NNF_MODES = new Map([
475
+ ["skolem", NNF_SKOLEM],
476
+ ["quantifiers", NNF_QUANT],
477
+ ["full", NNF_FULL],
478
+ ]);
479
+
480
+ const NNF_DESCRS = getDescrs("nnf", [
481
+ ["mode", PARAM_SYMBOL, "skolem", true],
482
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
483
+ ["sk_hack", PARAM_BOOL, false],
484
+ ["ignore_labels", PARAM_BOOL, false, true],
485
+ ]);
486
+
487
+ const NLSAT_DESCRS = getDescrs("nlsat", [
488
+ ["seed", PARAM_UINT, 0, true],
489
+ ["factor", PARAM_BOOL, true, true],
490
+ ["shuffle_vars", PARAM_BOOL, false, true],
491
+ ["variable_ordering_strategy", PARAM_UINT, 0, true],
492
+ ]);
493
+
494
+ const TSEITIN_DESCRS = getDescrs("", [
495
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
496
+ ["common_patterns", PARAM_BOOL, true],
497
+ ["distributivity", PARAM_BOOL, true],
498
+ ["distributivity_blowup", PARAM_UINT, 32],
499
+ ["ite_chaing", PARAM_BOOL, true],
500
+ ["ite_extra", PARAM_BOOL, true],
501
+ ]);
502
+
503
+ const runNnf = (manager: AstManager, params: TacticParams) => (goal: Goal) => {
504
+ const mode = NNF_MODES.get(String(params.get("mode") ?? "skolem"));
505
+ if (mode === undefined) throw new SmtUnsupportedError("an invalid NNF mode");
506
+ const names = new DefinedNames(manager);
507
+ const nnf = new Nnf(manager, names, mode, getBool(params, "ignore_labels", false));
508
+ const definitions = new RefVector(manager);
509
+ const size = goal.forms.size;
510
+ for (let index = 0; !goal.isInconsistent && index < size; index++) {
511
+ const result = nnf.apply(goal.forms.items[index], definitions);
512
+ goal.update(index, result);
513
+ manager.decRef(result);
514
+ }
515
+ for (const definition of definitions.items) {
516
+ if (goal.isInconsistent) break;
517
+ goal.assert(definition);
518
+ }
519
+ goal.depth++;
520
+ if (!goal.isInconsistent)
521
+ for (let index = 0; index < names.numNames; index++)
522
+ goal.addConverter(names.getNameDecl(index));
523
+ definitions.reset();
524
+ nnf.release();
525
+ names.release();
526
+ return [goal];
527
+ };
528
+
529
+ const SAT_DESCRS = getDescrs("sat", [
530
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
531
+ ["ite_extra", PARAM_BOOL, true, true],
532
+ ["learned", PARAM_BOOL, false],
533
+ ["restart", PARAM_SYMBOL, "ema", true],
534
+ ["restart.fast", PARAM_BOOL, true, true],
535
+ ["phase", PARAM_SYMBOL, "caching", true],
536
+ ["rephase.base", PARAM_UINT, 1000, true],
537
+ ["search.sat.conflicts", PARAM_UINT, 400, true],
538
+ ["search.unsat.conflicts", PARAM_UINT, 400, true],
539
+ ["restart.initial", PARAM_UINT, 2, true],
540
+ ["restart.max", PARAM_UINT, UINT_MAX, true],
541
+ ["inprocess.max", PARAM_UINT, UINT_MAX, true],
542
+ ["random_seed", PARAM_UINT, 0, true],
543
+ ["burst_search", PARAM_UINT, 100, true],
544
+ ["enable_pre_simplify", PARAM_BOOL, false, true],
545
+ ["max_conflicts", PARAM_UINT, UINT_MAX, true],
546
+ ["simplify.delay", PARAM_UINT, 0, true],
547
+ ["gc", PARAM_SYMBOL, "glue_psm", true],
548
+ ["gc.initial", PARAM_UINT, 20000, true],
549
+ ["gc.increment", PARAM_UINT, 500, true],
550
+ ["gc.small_lbd", PARAM_UINT, 3, true],
551
+ ["gc.k", PARAM_UINT, 7, true],
552
+ ["gc.burst", PARAM_BOOL, false, true],
553
+ ["gc.defrag", PARAM_BOOL, true, true],
554
+ ["force_cleanup", PARAM_BOOL, false, true],
555
+ ["backtrack.scopes", PARAM_UINT, 100, true],
556
+ ["backtrack.conflicts", PARAM_UINT, 4000, true],
557
+ ["minimize_lemmas", PARAM_BOOL, true, true],
558
+ ["dyn_sub_res", PARAM_BOOL, true, true],
559
+ ["variable_decay", PARAM_UINT, 110, true],
560
+ ["scc", PARAM_BOOL, true, true],
561
+ ["scc.tr", PARAM_BOOL, true, true],
562
+ ["abce", PARAM_BOOL, false, true],
563
+ ["acce", PARAM_BOOL, false, true],
564
+ ["ate", PARAM_BOOL, true, true],
565
+ ["bce", PARAM_BOOL, false, true],
566
+ ["cce", PARAM_BOOL, false, true],
567
+ ["bce_at", PARAM_UINT, 2, true],
568
+ ["bce_delay", PARAM_UINT, 2, true],
569
+ ["blocked_clause_limit", PARAM_UINT, 100000000, true],
570
+ ["elim_vars", PARAM_BOOL, true, true],
571
+ ["subsumption", PARAM_BOOL, true, true],
572
+ ["subsumption.limit", PARAM_UINT, 100000000, true],
573
+ ["override_incremental", PARAM_BOOL, false, true],
574
+ ["resolution.limit", PARAM_UINT, 500000000, true],
575
+ ["resolution.occ_cutoff", PARAM_UINT, 10, true],
576
+ ["resolution.occ_cutoff_range1", PARAM_UINT, 8, true],
577
+ ["resolution.occ_cutoff_range2", PARAM_UINT, 5, true],
578
+ ["resolution.occ_cutoff_range3", PARAM_UINT, 3, true],
579
+ ["resolution.lit_cutoff_range1", PARAM_UINT, 700, true],
580
+ ["resolution.lit_cutoff_range2", PARAM_UINT, 400, true],
581
+ ["resolution.lit_cutoff_range3", PARAM_UINT, 300, true],
582
+ ["resolution.cls_cutoff1", PARAM_UINT, 100000000, true],
583
+ ["resolution.cls_cutoff2", PARAM_UINT, 700000000, true],
584
+ ["asymm_branch", PARAM_BOOL, true, true],
585
+ ["asymm_branch.rounds", PARAM_UINT, 2, true],
586
+ ["asymm_branch.delay", PARAM_UINT, 1, true],
587
+ ["asymm_branch.sampled", PARAM_BOOL, true, true],
588
+ ["asymm_branch.limit", PARAM_UINT, 100000000, true],
589
+ ["asymm_branch.all", PARAM_BOOL, false, true],
590
+ ["probing", PARAM_BOOL, true, true],
591
+ ["probing_limit", PARAM_UINT, 5000000, true],
592
+ ["probing_cache", PARAM_BOOL, true, true],
593
+ ["probing_cache_limit", PARAM_UINT, 1024, true],
594
+ ["probing_binary", PARAM_BOOL, true, true],
595
+ ["local_search", PARAM_BOOL, false],
596
+ ["threads", PARAM_UINT, 1],
597
+ ["euf", PARAM_BOOL, false],
598
+ ["cardinality.solver", PARAM_BOOL, true],
599
+ ]);
600
+
601
+ const NAMED_TACTICS = new Map<string, NamedTactic>([
602
+ [
603
+ "simplify",
604
+ {
605
+ descrs: REWRITER_DESCRS,
606
+ isTrackingDependencies: true,
607
+ build: (environment, params) =>
608
+ inPlace((goal) =>
609
+ simplifyGoal(environment.manager, goal, getRewriterOptions(environment.manager, params)),
610
+ ),
611
+ },
612
+ ],
613
+ [
614
+ "elim-and",
615
+ {
616
+ descrs: REWRITER_DESCRS,
617
+ isTrackingDependencies: true,
618
+ build: (environment, params) =>
619
+ inPlace((goal) =>
620
+ simplifyGoal(environment.manager, goal, {
621
+ ...getRewriterOptions(environment.manager, params),
622
+ isEliminatingAnd: true,
623
+ }),
624
+ ),
625
+ },
626
+ ],
627
+ [
628
+ "propagate-values",
629
+ {
630
+ descrs: new Map([
631
+ ...REWRITER_DESCRS,
632
+ ...getDescrs("", [["max_rounds", PARAM_UINT, 4, true]]),
633
+ ]),
634
+ isTrackingDependencies: true,
635
+ build: (environment, params) =>
636
+ inPlace((goal) =>
637
+ propagateValues(environment.manager, goal, getUint(params, "max_rounds", 4)),
638
+ ),
639
+ },
640
+ ],
641
+ [
642
+ "ctx-simplify",
643
+ {
644
+ descrs: getDescrs("", [
645
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
646
+ ["max_steps", PARAM_UINT, UINT_MAX, true],
647
+ ["max_depth", PARAM_UINT, 1024, true],
648
+ ["propagate_eq", PARAM_BOOL, false],
649
+ ]),
650
+ build: (environment, params) =>
651
+ inPlace((goal) =>
652
+ ctxSimplify(
653
+ environment.manager,
654
+ goal,
655
+ getUint(params, "max_depth", 1024),
656
+ getUint(params, "max_steps", UINT_MAX),
657
+ ),
658
+ ),
659
+ },
660
+ ],
661
+ [
662
+ "ctx-solver-simplify",
663
+ {
664
+ descrs: SMT_DESCRS,
665
+ isRejectingUnknown: false,
666
+ build: (environment, params) =>
667
+ inPlace(
668
+ createCtxSolverSimplify(environment.manager, {
669
+ isMbqi: getBool(params, "mbqi", environment.isMbqi),
670
+ mbqiMaxIterations: getUint(
671
+ params,
672
+ "mbqi.max_iterations",
673
+ environment.mbqiMaxIterations,
674
+ ),
675
+ isFindingMacros: environment.isFindingMacros,
676
+ }),
677
+ ),
678
+ },
679
+ ],
680
+ ["unit-subsume-simplify", { descrs: new Map(), build: runUnitSubsume }],
681
+ [
682
+ "purify-arith",
683
+ {
684
+ descrs: new Map([
685
+ ...REWRITER_DESCRS,
686
+ ...getDescrs("", [
687
+ ["complete", PARAM_BOOL, true, true],
688
+ ["elim_root_objects", PARAM_BOOL, true, true],
689
+ ["elim_inverses", PARAM_BOOL, true, true],
690
+ ]),
691
+ ]),
692
+ build: (environment, params) => {
693
+ const manager = environment.manager;
694
+ const snf = runNnf(manager, new Map());
695
+ const elimRemParams = new Map([...params, ["elim_rem", true]]);
696
+ return (goal) => {
697
+ snf(goal);
698
+ simplifyGoal(manager, goal, getRewriterOptions(manager, elimRemParams));
699
+ purifyArith(manager, goal, {
700
+ isComplete: getBool(params, "complete", true),
701
+ isElimRootObjects: getBool(params, "elim_root_objects", true),
702
+ isElimInverses: getBool(params, "elim_inverses", true),
703
+ });
704
+ simplifyGoal(manager, goal, getRewriterOptions(manager, params));
705
+ return [goal];
706
+ };
707
+ },
708
+ },
709
+ ],
710
+ [
711
+ "elim-term-ite",
712
+ {
713
+ descrs: getDescrs("", [["max_memory", PARAM_UINT, UINT_MAX, true]]),
714
+ build: (environment) =>
715
+ inPlace((goal) => {
716
+ const manager = environment.manager;
717
+ const seen = new Set<number>();
718
+ const todo = [...goal.forms.items];
719
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
720
+ if (seen.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
721
+ seen.add(expr);
722
+ if (manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL)
723
+ throw new SmtUnsupportedError("elim-term-ite on a goal it changes");
724
+ manager.pushArgs(expr, todo);
725
+ }
726
+ goal.depth++;
727
+ }),
728
+ },
729
+ ],
730
+ [
731
+ "tseitin-cnf-core",
732
+ {
733
+ descrs: TSEITIN_DESCRS,
734
+ build: (environment) => inPlace((goal) => tseitinCnf(environment.manager, goal)),
735
+ },
736
+ ],
737
+ [
738
+ "tseitin-cnf",
739
+ {
740
+ descrs: TSEITIN_DESCRS,
741
+ build: (environment, params) =>
742
+ inPlace((goal) => {
743
+ const manager = environment.manager;
744
+ const original = new RefVector(manager);
745
+ for (const form of goal.forms.items) original.push(form);
746
+ try {
747
+ tseitinCnf(manager, goal);
748
+ } catch (error) {
749
+ if (!(error instanceof SmtTacticError)) throw error;
750
+ simplifyGoal(manager, goal, {
751
+ ...getRewriterOptions(manager, params),
752
+ isEliminatingAnd: true,
753
+ isKeepingDistinct: false,
754
+ });
755
+ tseitinCnf(manager, goal);
756
+ } finally {
757
+ original.reset();
758
+ }
759
+ }),
760
+ },
761
+ ],
762
+ [
763
+ "qe-light",
764
+ {
765
+ descrs: new Map(),
766
+ build: (environment) =>
767
+ inPlace((goal) => {
768
+ if (!goal.isProofsEnabled) applyQeLite(environment.manager, goal);
769
+ else {
770
+ goal.elimTrue();
771
+ goal.elimRedundancies();
772
+ }
773
+ goal.depth++;
774
+ }),
775
+ },
776
+ ],
777
+ [
778
+ "solve-eqs",
779
+ {
780
+ // Z3 never counts the occurrences that solve_eqs_max_occs bounds, so the bound has no effect.
781
+ descrs: getDescrs("", [
782
+ ["solve_eqs_max_occs", PARAM_UINT, UINT_MAX, true],
783
+ ["theory_solver", PARAM_BOOL, true, true],
784
+ ["ite_solver", PARAM_BOOL, true, true],
785
+ ["context_solve", PARAM_BOOL, false, true],
786
+ ["eliminate_mod", PARAM_BOOL, true, true],
787
+ ]),
788
+ build: (environment, params) =>
789
+ inPlace((goal) => {
790
+ checkParams(REWRITER_DESCRS, params);
791
+ const solver = new SolveEqs(environment.manager, goal, {
792
+ isTheorySolver: getBool(params, "theory_solver", true),
793
+ isIteSolver: getBool(params, "ite_solver", true),
794
+ isContextSolve: getBool(params, "context_solve", true),
795
+ isEliminatingMod: getBool(params, "eliminate_mod", true),
796
+ rewriter: getRewriterOptions(environment.manager, params),
797
+ });
798
+ solver.reduce();
799
+ solver.release();
800
+ }),
801
+ },
802
+ ],
803
+ [
804
+ "elim-uncnstr",
805
+ {
806
+ descrs: getDescrs("", [
807
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
808
+ ["max_steps", PARAM_UINT, UINT_MAX],
809
+ ]),
810
+ build: (environment) => {
811
+ const bodies = new RefVector(environment.manager);
812
+ return inPlace((goal) => elimUncnstr(environment.manager, goal, bodies));
813
+ },
814
+ },
815
+ ],
816
+ [
817
+ "lia2card",
818
+ {
819
+ isTrackingDependencies: true,
820
+ descrs: getDescrs("", [["compile_equality", PARAM_BOOL, true, true]]),
821
+ build: (environment, params) =>
822
+ inPlace((goal) =>
823
+ lia2card(
824
+ environment.manager,
825
+ goal,
826
+ getUint(params, "lia2card.max_range", 100),
827
+ getUint(params, "lia2card.max_ite_nesting", 4),
828
+ getBool(params, "compile_equality", true),
829
+ ),
830
+ ),
831
+ },
832
+ ],
833
+ [
834
+ "card2bv",
835
+ {
836
+ descrs: getDescrs("", [
837
+ ["keep_cardinality_constraints", PARAM_BOOL, false, true],
838
+ ["pb.solver", PARAM_SYMBOL, "solver", true],
839
+ ["cardinality.encoding", PARAM_SYMBOL, "none", true],
840
+ ]),
841
+ build: (environment, params) =>
842
+ inPlace((goal) => {
843
+ checkParams(REWRITER_DESCRS, params);
844
+ card2bv(environment.manager, goal, getRewriterOptions(environment.manager, params));
845
+ }),
846
+ },
847
+ ],
848
+ [
849
+ "normalize-bounds",
850
+ {
851
+ descrs: getDescrs("", [
852
+ ["produce_models", PARAM_BOOL, false, true],
853
+ ["norm_int_only", PARAM_BOOL, true, true],
854
+ ]),
855
+ build: (environment, params) =>
856
+ inPlace((goal) => {
857
+ checkParams(REWRITER_DESCRS, params);
858
+ normalizeBounds(
859
+ environment.manager,
860
+ goal,
861
+ getRewriterOptions(environment.manager, params),
862
+ getBool(params, "norm_int_only", true),
863
+ );
864
+ }),
865
+ },
866
+ ],
867
+ [
868
+ "propagate-ineqs",
869
+ {
870
+ descrs: getDescrs("", [["bound_max_refinements", PARAM_UINT, 16, true]]),
871
+ build: (environment) => inPlace((goal) => propagateIneqs(environment.manager, goal)),
872
+ },
873
+ ],
874
+ [
875
+ "lia2pb",
876
+ {
877
+ descrs: new Map([
878
+ ...REWRITER_DESCRS,
879
+ ...getDescrs("", [
880
+ ["lia2pb_partial", PARAM_BOOL, false, true],
881
+ ["lia2pb_max_bits", PARAM_UINT, 32, true],
882
+ ["lia2pb_total_bits", PARAM_UINT, 2048, true],
883
+ ]),
884
+ ]),
885
+ isTrackingDependencies: true,
886
+ build: (environment, params) =>
887
+ inPlace((goal) =>
888
+ lia2pb(environment.manager, goal, {
889
+ isPartial: getBool(params, "lia2pb_partial", false),
890
+ maxBits: getUint(params, "lia2pb_max_bits", 32),
891
+ totalBits: getUint(params, "lia2pb_total_bits", 2048),
892
+ rewriter: getRewriterOptions(environment.manager, params),
893
+ }),
894
+ ),
895
+ },
896
+ ],
897
+ [
898
+ "pb2bv",
899
+ {
900
+ descrs: new Map([
901
+ ...[...REWRITER_DESCRS].filter(([name]) => BOOL_REWRITER_PARAMS.includes(name)),
902
+ ...getDescrs("", [
903
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
904
+ ["pb2bv_all_clauses_limit", PARAM_UINT, 8, true],
905
+ ["pb2bv_cardinality_limit", PARAM_UINT, UINT_MAX, true],
906
+ ["keep_cardinality_constraints", PARAM_BOOL, false, true],
907
+ ["pb.solver", PARAM_SYMBOL, "solver", true],
908
+ ["cardinality.encoding", PARAM_SYMBOL, "none", true],
909
+ ]),
910
+ ]),
911
+ build: (environment, params) =>
912
+ runPb2Bv(environment.manager, params, getRewriterOptions(environment.manager, params)),
913
+ },
914
+ ],
915
+ [
916
+ "diff-neq",
917
+ {
918
+ descrs: getDescrs("", [["diff_neq_max_k", PARAM_UINT, 1024, true]]),
919
+ build: (environment, params) =>
920
+ inPlace((goal) =>
921
+ diffNeq(environment.manager, goal, getUint(params, "diff_neq_max_k", 1024)),
922
+ ),
923
+ },
924
+ ],
925
+ [
926
+ "fm",
927
+ {
928
+ isTrackingDependencies: true,
929
+ descrs: new Map([
930
+ ...REWRITER_DESCRS,
931
+ ...getDescrs("", [
932
+ ["produce_models", PARAM_BOOL, false, true],
933
+ ["fm_real_only", PARAM_BOOL, true, true],
934
+ ["fm_occ", PARAM_BOOL, false, true],
935
+ ["fm_limit", PARAM_UINT, 5000000, true],
936
+ ["fm_cutoff1", PARAM_UINT, 8, true],
937
+ ["fm_cutoff2", PARAM_UINT, 256, true],
938
+ ["fm_extra", PARAM_UINT, 0, true],
939
+ ]),
940
+ ]),
941
+ build: (environment, params) =>
942
+ inPlace((goal) => {
943
+ const manager = environment.manager;
944
+ simplifyGoal(
945
+ manager,
946
+ goal,
947
+ getRewriterOptions(
948
+ manager,
949
+ new Map([...params, ["arith_lhs", true], ["elim_and", true], ["som", true]]),
950
+ ),
951
+ );
952
+ // and_then stops at a decided goal.
953
+ if (goal.isDecided()) return;
954
+ fm(manager, goal, {
955
+ isRealOnly: getBool(params, "fm_real_only", true),
956
+ limit: getUint(params, "fm_limit", 5000000),
957
+ cutoff1: getUint(params, "fm_cutoff1", 8),
958
+ cutoff2: getUint(params, "fm_cutoff2", 256),
959
+ extra: getUint(params, "fm_extra", 0),
960
+ isOcc: getBool(params, "fm_occ", false),
961
+ });
962
+ }),
963
+ },
964
+ ],
965
+ [
966
+ "add-bounds",
967
+ {
968
+ descrs: getDescrs("", [
969
+ ["add_bound_lower", PARAM_NUMERAL, "-2", true],
970
+ ["add_bound_upper", PARAM_NUMERAL, "2", true],
971
+ ]),
972
+ build: (environment, params) =>
973
+ inPlace((goal) =>
974
+ addBounds(
975
+ environment.manager,
976
+ goal,
977
+ getNumeral(params, "add_bound_lower", "-2"),
978
+ getNumeral(params, "add_bound_upper", "2"),
979
+ ),
980
+ ),
981
+ },
982
+ ],
983
+ [
984
+ "cofactor-term-ite",
985
+ {
986
+ descrs: getDescrs("", [["cofactor_equalities", PARAM_BOOL, true, true]]),
987
+ build: (environment, params) =>
988
+ inPlace((goal) =>
989
+ cofactorTermIte(
990
+ environment.manager,
991
+ goal,
992
+ getRewriterOptions(environment.manager, params),
993
+ getBool(params, "cofactor_equalities", true),
994
+ ),
995
+ ),
996
+ },
997
+ ],
998
+ [
999
+ "nla2bv",
1000
+ {
1001
+ descrs: getDescrs("", [
1002
+ ["nla2bv_max_bv_size", PARAM_UINT, UINT_MAX, true],
1003
+ ["nla2bv_bv_size", PARAM_UINT, 4, true],
1004
+ ["nla2bv_root", PARAM_UINT, 2, true],
1005
+ ["nla2bv_divisor", PARAM_UINT, 2, true],
1006
+ ]),
1007
+ build: (environment, params) =>
1008
+ inPlace((goal) =>
1009
+ nla2bv(environment.manager, goal, {
1010
+ maxBvSize: getUint(params, "nla2bv_max_bv_size", UINT_MAX),
1011
+ bvSize: getUint(params, "nla2bv_bv_size", 4),
1012
+ root: getUint(params, "nla2bv_root", 2),
1013
+ divisor: getUint(params, "nla2bv_divisor", 2),
1014
+ }),
1015
+ ),
1016
+ },
1017
+ ],
1018
+ [
1019
+ "fix-dl-var",
1020
+ {
1021
+ isTrackingDependencies: true,
1022
+ descrs: REWRITER_DESCRS,
1023
+ build: (environment, params) =>
1024
+ inPlace((goal) =>
1025
+ fixDlVar(environment.manager, goal, getRewriterOptions(environment.manager, params)),
1026
+ ),
1027
+ },
1028
+ ],
1029
+ [
1030
+ "factor",
1031
+ {
1032
+ isTrackingDependencies: true,
1033
+ descrs: getDescrs("", [
1034
+ ["split_factors", PARAM_BOOL, true, true],
1035
+ ["max_search_size", PARAM_UINT, UINT_MAX],
1036
+ ["max_prime", PARAM_UINT, UINT_MAX],
1037
+ ["num_primes", PARAM_UINT, 4],
1038
+ ]),
1039
+ build: (environment, params) =>
1040
+ inPlace((goal) =>
1041
+ factor(environment.manager, goal, getBool(params, "split_factors", true)),
1042
+ ),
1043
+ },
1044
+ ],
1045
+ ["der", { descrs: new Map(), build: (environment) => runDer(environment.manager) }],
1046
+ [
1047
+ "distribute-forall",
1048
+ {
1049
+ descrs: new Map(),
1050
+ build: (environment) => inPlace((goal) => distributeForall(environment.manager, goal)),
1051
+ },
1052
+ ],
1053
+ [
1054
+ "quasi-macros",
1055
+ {
1056
+ descrs: getDescrs("", [
1057
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1058
+ ["produce_models", PARAM_BOOL, false, true],
1059
+ ["produce_proofs", PARAM_BOOL, false, true],
1060
+ ]),
1061
+ build: (environment) =>
1062
+ inPlace((goal) => {
1063
+ if (!environment.hasDefinitions()) findQuasiMacros(environment.manager, goal);
1064
+ }),
1065
+ },
1066
+ ],
1067
+ [
1068
+ "ufbv-rewriter",
1069
+ {
1070
+ descrs: getDescrs("", [
1071
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1072
+ ["produce_models", PARAM_BOOL, false, true],
1073
+ ]),
1074
+ build: (environment) => inPlace((goal) => rewriteUfbv(environment.manager, goal)),
1075
+ },
1076
+ ],
1077
+ [
1078
+ "reduce-args",
1079
+ {
1080
+ descrs: new Map(),
1081
+ build: (environment) => inPlace((goal) => reduceArgs(environment.manager, goal)),
1082
+ },
1083
+ ],
1084
+ [
1085
+ "macro-finder",
1086
+ {
1087
+ descrs: getDescrs("", [
1088
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1089
+ ["produce_models", PARAM_BOOL, false, true],
1090
+ ["produce_proofs", PARAM_BOOL, false, true],
1091
+ ["elim_and", PARAM_BOOL, false, true],
1092
+ ]),
1093
+ isTrackingDependencies: true,
1094
+ build: (environment) =>
1095
+ inPlace((goal) => {
1096
+ if (!environment.hasDefinitions()) findGoalMacros(environment.manager, goal);
1097
+ }),
1098
+ },
1099
+ ],
1100
+ [
1101
+ "dom-simplify",
1102
+ {
1103
+ descrs: new Map(),
1104
+ build: (environment) => inPlace((goal) => domSimplify(environment.manager, goal)),
1105
+ },
1106
+ ],
1107
+ [
1108
+ "occf",
1109
+ {
1110
+ descrs: new Map(),
1111
+ build: (environment) => inPlace((goal) => occf(environment.manager, goal)),
1112
+ },
1113
+ ],
1114
+ [
1115
+ "fpa2bv",
1116
+ {
1117
+ descrs: new Map(),
1118
+ isTrackingDependencies: true,
1119
+ build: (environment) => runFpa2Bv(environment.manager),
1120
+ },
1121
+ ],
1122
+ [
1123
+ "elim-small-bv",
1124
+ {
1125
+ descrs: getDescrs("", [
1126
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1127
+ ["max_steps", PARAM_UINT, UINT_MAX, true],
1128
+ ["max_bits", PARAM_UINT, 4, true],
1129
+ ]),
1130
+ build: (environment, params) =>
1131
+ runElimSmallBv(
1132
+ environment.manager,
1133
+ getUint(params, "max_bits", 4),
1134
+ getUint(params, "max_steps", UINT_MAX),
1135
+ ),
1136
+ },
1137
+ ],
1138
+ ["dt2bv", { descrs: new Map(), build: (environment) => createDt2BvTactic(environment.manager) }],
1139
+ ["eq2bv", { descrs: new Map(), build: (environment) => createEq2BvTactic(environment.manager) }],
1140
+ [
1141
+ "bit-blast",
1142
+ {
1143
+ descrs: getDescrs("", [
1144
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1145
+ ["max_steps", PARAM_UINT, UINT_MAX],
1146
+ ["blast_mul", PARAM_BOOL, true, true],
1147
+ ["blast_add", PARAM_BOOL, true, true],
1148
+ ["blast_quant", PARAM_BOOL, false, true],
1149
+ ["blast_full", PARAM_BOOL, false, true],
1150
+ ]),
1151
+ build: (environment, params) =>
1152
+ runBitBlast(environment.manager, {
1153
+ isBlastingMul: getBool(params, "blast_mul", true),
1154
+ isBlastingAdd: getBool(params, "blast_add", true),
1155
+ isBlastingQuant: getBool(params, "blast_quant", false),
1156
+ isBlastingFull: getBool(params, "blast_full", false),
1157
+ }),
1158
+ },
1159
+ ],
1160
+ [
1161
+ "max-bv-sharing",
1162
+ { descrs: new Map(), build: (environment) => runMaxBvSharing(environment.manager) },
1163
+ ],
1164
+ [
1165
+ "bv_bound_chk",
1166
+ {
1167
+ descrs: new Map(),
1168
+ build: (environment, params) =>
1169
+ runBvBoundChk(environment.manager, getUint(params, "bv_ineq_consistency_test_max", 0)),
1170
+ },
1171
+ ],
1172
+ [
1173
+ "bv-divrem-bounds",
1174
+ { descrs: new Map(), build: (environment) => runBvDivremBounds(environment.manager) },
1175
+ ],
1176
+ [
1177
+ "reduce-bv-size",
1178
+ { descrs: new Map(), build: (environment) => runReduceBvSize(environment.manager) },
1179
+ ],
1180
+ [
1181
+ "bv1-blast",
1182
+ {
1183
+ descrs: getDescrs("", [
1184
+ ["max_memory", PARAM_UINT, UINT_MAX, true],
1185
+ ["max_steps", PARAM_UINT, UINT_MAX],
1186
+ ]),
1187
+ build: (environment) => runBv1Blast(environment.manager),
1188
+ },
1189
+ ],
1190
+ [
1191
+ "ackermannize_bv",
1192
+ {
1193
+ descrs: getDescrs("rewriter", [["div0_ackermann_limit", PARAM_UINT, 1000, true]]),
1194
+ build: (environment, params) =>
1195
+ runAckermannizeBv(
1196
+ environment.manager,
1197
+ getRewriterOptions(environment.manager, new Map()),
1198
+ getUint(params, "div0_ackermann_limit", 1000),
1199
+ ),
1200
+ },
1201
+ ],
1202
+ [
1203
+ "qfufbv_ackr",
1204
+ {
1205
+ descrs: new Map([...REWRITER_DESCRS, ...SMT_DESCRS]),
1206
+ isRejectingUnknown: false,
1207
+ build: (environment, params) => {
1208
+ const manager = environment.manager;
1209
+ const preamble = createCommandReader(QFUFBV_ACKR_PREAMBLE).read() as SmtList;
1210
+ return runAndThen(
1211
+ compile(environment, preamble, preamble.end, true).build(params),
1212
+ runCond(
1213
+ isQfufbv,
1214
+ createQfufbvAckrTactic(manager, getRewriterOptions(manager, new Map()), true, () =>
1215
+ createTacticSolver(manager, () => compileInternalTactic(environment, QFAUFBV)),
1216
+ ),
1217
+ runSmt(environment, params),
1218
+ ),
1219
+ );
1220
+ },
1221
+ },
1222
+ ],
1223
+ [
1224
+ "smt",
1225
+ {
1226
+ descrs: SMT_DESCRS,
1227
+ isRejectingUnknown: false,
1228
+ isTrackingDependencies: true,
1229
+ build: runSmt,
1230
+ },
1231
+ ],
1232
+ [
1233
+ "psmt",
1234
+ {
1235
+ descrs: new Map(),
1236
+ isTrackingDependencies: true,
1237
+ build: runParallelSmt,
1238
+ },
1239
+ ],
1240
+ [
1241
+ "nlsat",
1242
+ {
1243
+ descrs: NLSAT_DESCRS,
1244
+ isRejectingUnknown: false,
1245
+ build: (environment, params) =>
1246
+ runNlsat(environment.manager, {
1247
+ seed: getUint(params, "seed", 0),
1248
+ isFactoring: getBool(params, "factor", true),
1249
+ isShufflingVars: getBool(params, "shuffle_vars", false),
1250
+ variableOrderingStrategy: getUint(params, "variable_ordering_strategy", 0),
1251
+ }),
1252
+ },
1253
+ ],
1254
+ [
1255
+ "nlqsat",
1256
+ {
1257
+ descrs: new Map(),
1258
+ build: (environment, params) =>
1259
+ runNlqsat(
1260
+ environment.manager,
1261
+ getUint(params, "seed", 0),
1262
+ compileInternalTactic(environment, "tseitin-cnf"),
1263
+ ),
1264
+ },
1265
+ ],
1266
+ [
1267
+ "horn",
1268
+ {
1269
+ descrs: new Map(),
1270
+ isRejectingUnknown: false,
1271
+ build: (environment) =>
1272
+ runHorn(
1273
+ environment.manager,
1274
+ environment.parameters,
1275
+ getRewriterOptions(environment.manager, new Map()),
1276
+ ),
1277
+ },
1278
+ ],
1279
+ [
1280
+ "qe",
1281
+ {
1282
+ descrs: new Map(),
1283
+ isRejectingUnknown: false,
1284
+ build: (environment) => runQe(environment.manager),
1285
+ },
1286
+ ],
1287
+ [
1288
+ "qsat",
1289
+ {
1290
+ descrs: new Map(),
1291
+ isRejectingUnknown: false,
1292
+ build: (environment) => runQsat(environment.manager, QSAT_SAT),
1293
+ },
1294
+ ],
1295
+ [
1296
+ "qe2",
1297
+ {
1298
+ descrs: new Map(),
1299
+ isRejectingUnknown: false,
1300
+ build: (environment) => runQsat(environment.manager, QSAT_QE),
1301
+ },
1302
+ ],
1303
+ [
1304
+ "qe_rec",
1305
+ {
1306
+ descrs: new Map(),
1307
+ isRejectingUnknown: false,
1308
+ build: (environment) => runQsat(environment.manager, QSAT_QE_REC),
1309
+ },
1310
+ ],
1311
+ [
1312
+ "sat",
1313
+ {
1314
+ descrs: SAT_DESCRS,
1315
+ isRejectingUnknown: false,
1316
+ build: (environment, params) =>
1317
+ createSatTactic(environment.manager, getSatTacticParams(environment, params)),
1318
+ },
1319
+ ],
1320
+ [
1321
+ "qffd",
1322
+ {
1323
+ descrs: SAT_DESCRS,
1324
+ isRejectingUnknown: false,
1325
+ build: (environment, params) =>
1326
+ createFdTactic(environment.manager, getSatTacticParams(environment, params)),
1327
+ },
1328
+ ],
1329
+ [
1330
+ "psat",
1331
+ {
1332
+ descrs: SAT_DESCRS,
1333
+ isRejectingUnknown: false,
1334
+ build: (environment, params) =>
1335
+ createSatTactic(environment.manager, getSatTacticParams(environment, params)),
1336
+ },
1337
+ ],
1338
+ [
1339
+ "snf",
1340
+ { descrs: NNF_DESCRS, build: (environment, params) => runNnf(environment.manager, params) },
1341
+ ],
1342
+ [
1343
+ "nnf",
1344
+ {
1345
+ descrs: NNF_DESCRS,
1346
+ build: (environment, params) =>
1347
+ runNnf(environment.manager, new Map([...params, ["mode", "full"]])),
1348
+ },
1349
+ ],
1350
+ [
1351
+ "aig",
1352
+ {
1353
+ descrs: getDescrs("", [["max_memory", PARAM_UINT, UINT_MAX, true]]),
1354
+ isTrackingDependencies: true,
1355
+ build: (environment) => createAigTactic(environment.manager),
1356
+ },
1357
+ ],
1358
+ ["skip", { descrs: new Map(), isTrackingDependencies: true, build: () => (goal) => [goal] }],
1359
+ [
1360
+ "fail",
1361
+ {
1362
+ descrs: new Map(),
1363
+ isTrackingDependencies: true,
1364
+ build: () => () => {
1365
+ throw new SmtTacticError("fail tactic");
1366
+ },
1367
+ },
1368
+ ],
1369
+ [
1370
+ "fail-if-undecided",
1371
+ {
1372
+ descrs: new Map(),
1373
+ isTrackingDependencies: true,
1374
+ build: () => (goal) => {
1375
+ if (!goal.isDecided()) throw new SmtTacticError("undecided");
1376
+ return [goal];
1377
+ },
1378
+ },
1379
+ ],
1380
+ ]);
1381
+
1382
+ const UNPORTED_TACTICS = new Set(
1383
+ (
1384
+ "blast-term-ite " +
1385
+ "bv-slice bvarray2uf collect-statistics " +
1386
+ "degree-shift demodulator " +
1387
+ "elim-predicates elim-uncnstr2 " +
1388
+ "euf-completion ff-sat ff-simplify ff-solve ff-unique ff2bv fold-unfold fpa2bv " +
1389
+ "horn-simplify injectivity pb-preprocess pqffd propagate-bv-bounds " +
1390
+ "propagate-bv-bounds2 propagate-values2 qfbv-sls qfufbv recover-01 reduce-args2 " +
1391
+ "sat-preprocess sls-smt smtfd solver-subsumption special-relations " +
1392
+ "split-clause subpaving symmetry-reduce"
1393
+ ).split(" "),
1394
+ );
1395
+
1396
+ const isUnsigned = (sexpr: SExpr | undefined): sexpr is SmtToken =>
1397
+ sexpr?.kind === "numeral" && BigInt(sexpr.text) <= BigInt(UINT_MAX);
1398
+
1399
+ const getParamName = (keyword: string) =>
1400
+ keyword.replace(/^:/, "").toLowerCase().replaceAll("-", "_");
1401
+
1402
+ const findParam = (descrs: ParamDescrs, name: string) => {
1403
+ const descr = descrs.get(name);
1404
+ if (descr !== undefined) return { name, descr };
1405
+ const period = name.indexOf(".");
1406
+ if (period === -1) return undefined;
1407
+ const suffix = name.slice(period + 1);
1408
+ const suffixDescr = descrs.get(suffix);
1409
+ return suffixDescr?.module === name.slice(0, period)
1410
+ ? { name: suffix, descr: suffixDescr }
1411
+ : undefined;
1412
+ };
1413
+
1414
+ const parseParamValue = (kind: number, value: SExpr) =>
1415
+ kind === PARAM_BOOL
1416
+ ? isSymbol(value, "true") || (isSymbol(value, "false") ? false : undefined)
1417
+ : kind === PARAM_UINT
1418
+ ? isUnsigned(value)
1419
+ ? Number(value.text)
1420
+ : undefined
1421
+ : kind === PARAM_NUMERAL
1422
+ ? value.kind === "numeral" || value.kind === "decimal"
1423
+ ? value.text
1424
+ : undefined
1425
+ : isSymbol(value)
1426
+ ? value.text
1427
+ : undefined;
1428
+
1429
+ const getUntypedParamValue = (value: SExpr) =>
1430
+ value.kind === "list"
1431
+ ? undefined
1432
+ : value.kind === "numeral"
1433
+ ? Number(value.text)
1434
+ : value.text === "true" || (value.text === "false" ? false : value.text);
1435
+
1436
+ const isUnportedParam = (descr: ParamDescr, value: TacticParam) =>
1437
+ !descr.isPorted && value !== descr.defaultValue;
1438
+
1439
+ const checkParams = (descrs: ParamDescrs, params: TacticParams) => {
1440
+ for (const [name, value] of params) {
1441
+ const descr = descrs.get(name);
1442
+ if (descr !== undefined && isUnportedParam(descr, value))
1443
+ throw new SmtUnsupportedError(`the parameter ${name} of the tactic`);
1444
+ }
1445
+ };
1446
+
1447
+ const getParams = (
1448
+ builder: TacticBuilder,
1449
+ items: SExpr[],
1450
+ end: SmtToken,
1451
+ isInternal: boolean,
1452
+ ): Map<string, TacticParam> => {
1453
+ const params = new Map<string, TacticParam>();
1454
+ for (let index = 2; index < items.length; index += 2) {
1455
+ const keyword = items[index];
1456
+ if (keyword.kind !== "keyword")
1457
+ throw new SmtParseError("invalid using-params combinator, keyword expected", end);
1458
+ const value = items[index + 1];
1459
+ if (value === undefined)
1460
+ throw new SmtParseError("invalid using-params combinator, parameter value expected", end);
1461
+ const found = findParam(builder.descrs, getParamName(keyword.text));
1462
+ if (isInternal) {
1463
+ const parsed =
1464
+ found === undefined
1465
+ ? getUntypedParamValue(value)
1466
+ : parseParamValue(found.descr.kind, value);
1467
+ if (parsed === undefined) throw new SmtParseError("invalid parameter value", end);
1468
+ params.set(found?.name ?? getParamName(keyword.text), parsed);
1469
+ continue;
1470
+ }
1471
+ if (found === undefined) {
1472
+ if (!builder.isRejectingUnknown)
1473
+ throw new SmtUnsupportedError(`the parameter ${keyword.text} of the tactic`);
1474
+ throw new SmtParseError(
1475
+ `invalid using-params combinator, unknown parameter ${getParamName(keyword.text)}`,
1476
+ end,
1477
+ );
1478
+ }
1479
+ const parsed = parseParamValue(found.descr.kind, value);
1480
+ if (parsed === undefined)
1481
+ throw new SmtParseError(
1482
+ found.descr.kind === PARAM_BOOL
1483
+ ? "invalid parameter value, true or false expected"
1484
+ : found.descr.kind === PARAM_UINT
1485
+ ? "invalid parameter value, unsigned integer expected"
1486
+ : found.descr.kind === PARAM_NUMERAL
1487
+ ? "invalid parameter value, numeral expected"
1488
+ : "invalid parameter value, symbol expected",
1489
+ end,
1490
+ );
1491
+ if (isUnportedParam(found.descr, parsed))
1492
+ throw new SmtUnsupportedError(`the parameter ${found.name} of the tactic`);
1493
+ params.set(found.name, parsed);
1494
+ }
1495
+ return params;
1496
+ };
1497
+
1498
+ const mergeDescrs = (builders: TacticBuilder[]) => ({
1499
+ descrs: new Map(builders.flatMap((builder) => [...builder.descrs])),
1500
+ isRejectingUnknown: builders.every((builder) => builder.isRejectingUnknown),
1501
+ isTrackingDependencies: builders.every((builder) => builder.isTrackingDependencies),
1502
+ });
1503
+
1504
+ const isDecidedSat = (goals: Goal[]) => goals.length === 1 && goals[0].isDecidedSat();
1505
+
1506
+ const isDecidedUnsat = (goals: Goal[]) => goals.length === 1 && goals[0].isDecidedUnsat();
1507
+
1508
+ const runAndThen = (first: Tactic, second: Tactic) => (goal: Goal) => {
1509
+ const goals = first(goal);
1510
+ if (goals.length === 1) return goals[0].isDecided() ? goals : second(goals[0]);
1511
+ const results: Goal[] = [];
1512
+ for (const subgoal of goals) {
1513
+ const subresults = second(subgoal);
1514
+ if (isDecidedSat(subresults)) return subresults;
1515
+ if (!isDecidedUnsat(subresults)) results.push(...subresults);
1516
+ }
1517
+ if (results.length > 0) return results;
1518
+ goal.resetAll();
1519
+ goal.assert(goal.manager.falseExpr);
1520
+ return [goal];
1521
+ };
1522
+
1523
+ const runOrElse = (tactics: Tactic[]) => (goal: Goal) => {
1524
+ const original = goal.copy();
1525
+ for (const tactic of tactics.slice(0, -1)) {
1526
+ try {
1527
+ return tactic(goal);
1528
+ } catch (error) {
1529
+ if (!(error instanceof SmtTacticError)) throw error;
1530
+ }
1531
+ goal.resetAll();
1532
+ goal.copyFrom(original);
1533
+ }
1534
+ return (tactics.at(-1) as Tactic)(goal);
1535
+ };
1536
+
1537
+ const isEqualGoal = (first: Goal, second: Goal) => {
1538
+ if (first.forms.size !== second.forms.size) return false;
1539
+ const firstForms = new Set(first.forms.items);
1540
+ const secondForms = new Set(second.forms.items);
1541
+ return (
1542
+ firstForms.size === secondForms.size && [...secondForms].every((form) => firstForms.has(form))
1543
+ );
1544
+ };
1545
+
1546
+ const runRepeat = (tactic: Tactic, maxDepth: number) => {
1547
+ const run = (depth: number, goal: Goal): Goal[] => {
1548
+ if (depth > maxDepth) return [goal];
1549
+ const original = goal.copy();
1550
+ const goals = tactic(goal);
1551
+ if (goals.length === 1 && isEqualGoal(original, goals[0])) return goals;
1552
+ if (goals.length === 1) return goals[0].isDecided() ? goals : run(depth + 1, goals[0]);
1553
+ const results: Goal[] = [];
1554
+ for (const subgoal of goals) {
1555
+ const subresults = run(depth + 1, subgoal);
1556
+ if (isDecidedSat(subresults)) return subresults;
1557
+ if (!isDecidedUnsat(subresults)) results.push(...subresults);
1558
+ }
1559
+ if (results.length > 0) return results;
1560
+ goal.resetAll();
1561
+ goal.assert(goal.manager.falseExpr);
1562
+ return [goal];
1563
+ };
1564
+ return (goal: Goal) => run(0, goal);
1565
+ };
1566
+
1567
+ const runCond = (probe: Probe, onTrue: Tactic, onFalse: Tactic) => (goal: Goal) =>
1568
+ probe(goal) === 0 ? onFalse(goal) : onTrue(goal);
1569
+
1570
+ const checkHasArgument = (list: SmtList, combinator: string, end: SmtToken) => {
1571
+ if (list.items.length < 2)
1572
+ throw new SmtParseError(
1573
+ `invalid ${combinator} combinator, at least one argument expected`,
1574
+ end,
1575
+ );
1576
+ };
1577
+
1578
+ const compile = (
1579
+ environment: TacticEnvironment,
1580
+ sexpr: SExpr,
1581
+ end: SmtToken,
1582
+ isInternal: boolean,
1583
+ ): TacticBuilder => {
1584
+ if (sexpr.kind !== "list") {
1585
+ if (!isSymbol(sexpr)) throw new SmtParseError("invalid tactic, unexpected input", end);
1586
+ const named = NAMED_TACTICS.get(sexpr.text);
1587
+ if (named !== undefined)
1588
+ return {
1589
+ descrs: named.descrs,
1590
+ isRejectingUnknown: named.isRejectingUnknown ?? true,
1591
+ isTrackingDependencies: named.isTrackingDependencies ?? false,
1592
+ build: (params) => {
1593
+ const tactic = named.build(environment, params);
1594
+ if (!isInternal) return tactic;
1595
+ return (goal) => {
1596
+ checkParams(named.descrs, params);
1597
+ return tactic(goal);
1598
+ };
1599
+ },
1600
+ };
1601
+ const strategy = LOGIC_TACTICS.get(sexpr.text);
1602
+ if (strategy !== undefined)
1603
+ return compile(environment, createCommandReader(strategy).read() as SmtList, end, true);
1604
+ if (UNPORTED_TACTICS.has(sexpr.text)) {
1605
+ const error = new SmtUnsupportedError(`the tactic ${sexpr.text}`);
1606
+ if (!isInternal) throw error;
1607
+ return {
1608
+ descrs: new Map(),
1609
+ isRejectingUnknown: false,
1610
+ isTrackingDependencies: false,
1611
+ build: () => () => {
1612
+ throw error;
1613
+ },
1614
+ };
1615
+ }
1616
+ throw new SmtParseError(`invalid tactic, unknown tactic ${sexpr.text}`, end);
1617
+ }
1618
+ const head = sexpr.items[0];
1619
+ if (head === undefined) throw new SmtParseError("invalid tactic, arguments expected", end);
1620
+ if (!isSymbol(head)) throw new SmtParseError("invalid tactic, symbol expected", end);
1621
+ const compileChildren = (combinator: string) => {
1622
+ checkHasArgument(sexpr, combinator, end);
1623
+ return sexpr.items.slice(1).map((child) => compile(environment, child, end, isInternal));
1624
+ };
1625
+ switch (head.text) {
1626
+ case "then":
1627
+ case "and-then": {
1628
+ const children = compileChildren("and-then");
1629
+ return {
1630
+ ...mergeDescrs(children),
1631
+ build: (params) =>
1632
+ children
1633
+ .map((child) => child.build(params))
1634
+ .reduceRight((second, first) => runAndThen(first, second)),
1635
+ };
1636
+ }
1637
+ case "or-else": {
1638
+ const children = compileChildren("or-else");
1639
+ if (children.length === 1) return children[0];
1640
+ return {
1641
+ ...mergeDescrs(children),
1642
+ build: (params) => runOrElse(children.map((child) => child.build(params))),
1643
+ };
1644
+ }
1645
+ // Z3 runs these children in threads, and running them in order is one schedule it may pick.
1646
+ case "par":
1647
+ case "par-or": {
1648
+ const children = compileChildren("par-or");
1649
+ if (children.length === 1) return children[0];
1650
+ return {
1651
+ ...mergeDescrs(children),
1652
+ build: (params) => runOrElse(children.map((child) => child.build(params))),
1653
+ };
1654
+ }
1655
+ case "par-then": {
1656
+ const children = compileChildren("par-then");
1657
+ if (children.length === 1) return children[0];
1658
+ return {
1659
+ ...mergeDescrs(children),
1660
+ build: (params) =>
1661
+ children
1662
+ .map((child) => child.build(params))
1663
+ .reduceRight((second, first) => (goal) => {
1664
+ if (goal.isProofsEnabled)
1665
+ throw new SmtTacticError("par_and_then does not support proof production");
1666
+ return runAndThen(first, second)(goal);
1667
+ }),
1668
+ };
1669
+ }
1670
+ // The timeout is not ported, so the child runs to the end.
1671
+ case "try-for": {
1672
+ if (sexpr.items.length !== 3)
1673
+ throw new SmtParseError("invalid try-for combinator, two arguments expected", end);
1674
+ if (!isUnsigned(sexpr.items[2]))
1675
+ throw new SmtParseError(
1676
+ "invalid try-for combinator, second argument must be an unsigned integer",
1677
+ end,
1678
+ );
1679
+ return compile(environment, sexpr.items[1], end, isInternal);
1680
+ }
1681
+ case "fail-if-branching": {
1682
+ if (sexpr.items.length !== 3 && sexpr.items.length !== 2)
1683
+ throw new SmtParseError(
1684
+ "invalid fail-if-branching combinator, one or two arguments expected",
1685
+ end,
1686
+ );
1687
+ const bound = sexpr.items[2];
1688
+ if (bound !== undefined && !isUnsigned(bound))
1689
+ throw new SmtParseError(
1690
+ "invalid fail-if-branching combinator, second argument must be an unsigned integer",
1691
+ end,
1692
+ );
1693
+ const child = compile(environment, sexpr.items[1], end, isInternal);
1694
+ const threshold = bound === undefined ? 1 : Number(bound.text);
1695
+ return {
1696
+ ...mergeDescrs([child]),
1697
+ build: (params) => {
1698
+ const tactic = child.build(params);
1699
+ return (goal) => {
1700
+ const goals = tactic(goal);
1701
+ if (goals.length > threshold) throw new SmtTacticError("failed-if-branching tactical");
1702
+ return goals;
1703
+ };
1704
+ },
1705
+ };
1706
+ }
1707
+ case "if-no-proofs":
1708
+ case "if-no-unsat-cores":
1709
+ case "if-no-models": {
1710
+ if (sexpr.items.length !== 2)
1711
+ throw new SmtParseError(`invalid ${head.text} combinator, one argument expected`, end);
1712
+ const child = compile(environment, sexpr.items[1], end, isInternal);
1713
+ const isSkipping = (goal: Goal) =>
1714
+ head.text === "if-no-models" ||
1715
+ (head.text === "if-no-proofs" ? goal.isProofsEnabled : goal.isCoresEnabled);
1716
+ return {
1717
+ ...mergeDescrs([child]),
1718
+ build: (params) => {
1719
+ const tactic = child.build(params);
1720
+ return (goal) => (isSkipping(goal) ? [goal] : tactic(goal));
1721
+ },
1722
+ };
1723
+ }
1724
+ case "repeat": {
1725
+ if (sexpr.items.length !== 3 && sexpr.items.length !== 2)
1726
+ throw new SmtParseError("invalid repeat combinator, one or two arguments expected", end);
1727
+ const bound = sexpr.items[2];
1728
+ if (bound !== undefined && !isUnsigned(bound))
1729
+ throw new SmtParseError(
1730
+ "invalid repeat combinator, second argument must be an unsigned integer",
1731
+ end,
1732
+ );
1733
+ const child = compile(environment, sexpr.items[1], end, isInternal);
1734
+ const maxDepth = bound === undefined ? UINT_MAX : Number(bound.text);
1735
+ return {
1736
+ ...mergeDescrs([child]),
1737
+ build: (params) => runRepeat(child.build(params), maxDepth),
1738
+ };
1739
+ }
1740
+ case "!":
1741
+ case "using-params":
1742
+ case "with": {
1743
+ checkHasArgument(sexpr, "using-params", end);
1744
+ const child = compile(environment, sexpr.items[1], end, isInternal);
1745
+ if (sexpr.items.length === 2) return child;
1746
+ const own = getParams(child, sexpr.items, end, isInternal);
1747
+ return {
1748
+ ...mergeDescrs([child]),
1749
+ build: (params) => child.build(new Map([...params, ...own])),
1750
+ };
1751
+ }
1752
+ case "skip-if-failed": {
1753
+ if (sexpr.items.length !== 2)
1754
+ throw new SmtParseError("invalid skip-if-failed combinator, one argument expected", end);
1755
+ const child = compile(environment, sexpr.items[1], end, isInternal);
1756
+ return {
1757
+ ...mergeDescrs([child]),
1758
+ build: (params) => runOrElse([child.build(params), (goal) => [goal]]),
1759
+ };
1760
+ }
1761
+ case "if":
1762
+ case "ite":
1763
+ case "cond": {
1764
+ if (sexpr.items.length !== 4)
1765
+ throw new SmtParseError("invalid if/conditional combinator, three arguments expected", end);
1766
+ const probe = compileProbe(sexpr.items[1], end, isInternal);
1767
+ const children = sexpr.items
1768
+ .slice(2)
1769
+ .map((child) => compile(environment, child, end, isInternal));
1770
+ return {
1771
+ ...mergeDescrs(children),
1772
+ build: (params) => runCond(probe, children[0].build(params), children[1].build(params)),
1773
+ };
1774
+ }
1775
+ case "when": {
1776
+ if (sexpr.items.length !== 3)
1777
+ throw new SmtParseError("invalid when combinator, two arguments expected", end);
1778
+ const probe = compileProbe(sexpr.items[1], end, isInternal);
1779
+ const child = compile(environment, sexpr.items[2], end, isInternal);
1780
+ return {
1781
+ ...mergeDescrs([child]),
1782
+ build: (params) => runCond(probe, child.build(params), (goal) => [goal]),
1783
+ };
1784
+ }
1785
+ case "fail-if": {
1786
+ if (sexpr.items.length !== 2)
1787
+ throw new SmtParseError("invalid fail-if tactic, one argument expected", end);
1788
+ const probe = compileProbe(sexpr.items[1], end, isInternal);
1789
+ return {
1790
+ descrs: new Map(),
1791
+ isRejectingUnknown: true,
1792
+ isTrackingDependencies: true,
1793
+ build: () => (goal) => {
1794
+ if (probe(goal) !== 0) throw new SmtTacticError("fail-if tactic");
1795
+ return [goal];
1796
+ },
1797
+ };
1798
+ }
1799
+ case "echo": {
1800
+ if (sexpr.items.length < 2)
1801
+ throw new SmtParseError("invalid echo tactic, must have at least one argument", end);
1802
+ const pieces = sexpr.items.slice(1).map((piece, index, all): Tactic => {
1803
+ const newline = index === all.length - 1 ? "\n" : "";
1804
+ if (piece.kind === "string")
1805
+ return (goal) => {
1806
+ environment.write(piece.text + newline, false);
1807
+ return [goal];
1808
+ };
1809
+ const probe = compileProbe(piece, end, isInternal);
1810
+ return (goal) => {
1811
+ environment.write(formatProbeValue(probe(goal)) + newline, true);
1812
+ return [goal];
1813
+ };
1814
+ });
1815
+ return {
1816
+ descrs: new Map(),
1817
+ isRejectingUnknown: true,
1818
+ isTrackingDependencies: true,
1819
+ build: () => pieces.reduceRight((second, first) => runAndThen(first, second)),
1820
+ };
1821
+ }
1822
+ default:
1823
+ throw new SmtParseError(`invalid tactic, unknown tactic combinator ${head.text}`, end);
1824
+ }
1825
+ };
1826
+
1827
+ // inc_sat_solver's init_preprocess, with sat.euf.
1828
+ export const mkIncSatEufPreprocess = (manager: AstManager) =>
1829
+ runAndThen(
1830
+ inPlace((goal) => simplifyGoal(manager, goal, getRewriterOptions(manager, new Map()))),
1831
+ inPlace((goal) => propagateValues(manager, goal)),
1832
+ );
1833
+
1834
+ // inc_sat_solver's init_preprocess, without sat.euf.
1835
+ export const mkIncSatPreprocess = (manager: AstManager, bitBlaster: BitBlasterRewriter) =>
1836
+ [
1837
+ inPlace((goal) => simplifyGoal(manager, goal, getRewriterOptions(manager, new Map()))),
1838
+ inPlace((goal) => propagateValues(manager, goal)),
1839
+ inPlace((goal) => card2bv(manager, goal, getRewriterOptions(manager, new Map()))),
1840
+ inPlace((goal) =>
1841
+ simplifyGoal(
1842
+ manager,
1843
+ goal,
1844
+ getRewriterOptions(
1845
+ manager,
1846
+ new Map<string, TacticParam>([
1847
+ ["som", true],
1848
+ ["pull_cheap_ite", true],
1849
+ ["push_ite_bv", false],
1850
+ ["local_ctx", true],
1851
+ ["local_ctx_limit", 10000000],
1852
+ ["flat", true],
1853
+ ["hoist_mul", false],
1854
+ ["elim_and", true],
1855
+ ["blast_distinct", true],
1856
+ ]),
1857
+ ),
1858
+ ),
1859
+ ),
1860
+ runMaxBvSharing(manager),
1861
+ runBitBlast(
1862
+ manager,
1863
+ { isBlastingMul: true, isBlastingAdd: true, isBlastingQuant: false, isBlastingFull: false },
1864
+ bitBlaster,
1865
+ ),
1866
+ inPlace((goal) =>
1867
+ simplifyGoal(manager, goal, getRewriterOptions(manager, new Map([["flat", false]]))),
1868
+ ),
1869
+ ].reduceRight((second, first) => runAndThen(first, second));
1870
+
1871
+ export const compileTactic = (environment: TacticEnvironment, sexpr: SExpr, end: SmtToken) =>
1872
+ compile(environment, sexpr, end, false);
1873
+
1874
+ export const compileInternalTactic = (environment: TacticEnvironment, text: string) => {
1875
+ const list = createCommandReader(`(${text})`).read() as SmtList;
1876
+ return compile(environment, list.items[0], list.end, true).build(new Map());
1877
+ };
1878
+
1879
+ interface TacticCheck {
1880
+ status: number;
1881
+ model: ProtoModel | undefined;
1882
+ core: Dependency | undefined;
1883
+ // What check_sat leaves in reason_unknown, or undefined where the port does not track it.
1884
+ reasonUnknown: string | undefined;
1885
+ }
1886
+
1887
+ // The port's declarations of division by zero leave out their domain; Z3's have two arguments.
1888
+ const DIVISION_BY_ZERO_DECLS = new Set([OP_DIV0, OP_IDIV0, OP_MOD0, OP_POWER0]);
1889
+
1890
+ // A constant of an uninterpreted sort the model lacks puts its value in that sort's universe.
1891
+ const applyDefinitions = (definitions: Definition[], model: ProtoModel) => {
1892
+ const manager = model.manager;
1893
+ const universe: number[] = [];
1894
+ let evaluator = new ModelEvaluator(manager, model);
1895
+ evaluator.setModelCompletion(true);
1896
+ for (let index = definitions.length - 1; index >= 0; index--) {
1897
+ const definition = definitions[index];
1898
+ if (definition.def === -1) {
1899
+ model.unregisterDecl(definition.decl);
1900
+ continue;
1901
+ }
1902
+ const value = evaluator.rewrite(definition.def);
1903
+ const arity = DIVISION_BY_ZERO_DECLS.has(definition.decl)
1904
+ ? 2
1905
+ : manager.funcDecls[definition.decl].domain.length;
1906
+ if (arity > 0) {
1907
+ const oldInterp = model.funcInterps.get(definition.decl);
1908
+ const isChanged = oldInterp?.elseExpr !== value;
1909
+ if (isChanged) {
1910
+ const interp = new FuncInterp(manager, arity);
1911
+ interp.setElse(value);
1912
+ model.registerFunc(definition.decl, interp);
1913
+ }
1914
+ manager.decRef(value);
1915
+ if (oldInterp !== undefined && isChanged) {
1916
+ evaluator.release();
1917
+ evaluator = new ModelEvaluator(manager, model);
1918
+ evaluator.setModelCompletion(true);
1919
+ }
1920
+ continue;
1921
+ }
1922
+ const old = model.constInterps.get(definition.decl);
1923
+ if (old !== value) model.registerConst(definition.decl, value);
1924
+ const sort = manager.sorts[value];
1925
+ if (
1926
+ manager.isUninterpretedSort(sort) &&
1927
+ !model.getUninterpretedSorts().includes(sort) &&
1928
+ !universe.includes(value)
1929
+ )
1930
+ universe.push(value);
1931
+ manager.decRef(value);
1932
+ if (old !== undefined && old !== value) {
1933
+ evaluator.release();
1934
+ evaluator = new ModelEvaluator(manager, model);
1935
+ evaluator.setModelCompletion(true);
1936
+ }
1937
+ }
1938
+ evaluator.release();
1939
+ for (const value of universe) model.registerValue(value);
1940
+ return model;
1941
+ };
1942
+
1943
+ export const convertModel = (goal: Goal, model: ProtoModel) =>
1944
+ goal.converters.reduceRight((converted, entry) => {
1945
+ if ("convert" in entry) return entry.convert(converted);
1946
+ if ("definitions" in entry) return applyDefinitions(entry.definitions, converted);
1947
+ converted.unregisterDecl(entry.decl);
1948
+ return converted;
1949
+ }, model);
1950
+
1951
+ export const checkSatUsing = (tactic: Tactic, goal: Goal): TacticCheck => {
1952
+ const undecided = { status: L_UNDEF, model: undefined, core: undefined };
1953
+ const goals = (() => {
1954
+ try {
1955
+ return tactic(goal);
1956
+ } catch (error) {
1957
+ if (error instanceof SmtTacticError) return error.message;
1958
+ if (error instanceof SmtCanceledError) return undefined;
1959
+ throw error;
1960
+ }
1961
+ })();
1962
+ if (typeof goals === "string") return { ...undecided, reasonUnknown: goals };
1963
+ if (goals !== undefined && isDecidedSat(goals)) {
1964
+ const model = convertModel(goals[0], goals[0].model ?? new ProtoModel(goal.manager));
1965
+ return goal.manager.limit.inc()
1966
+ ? { status: L_TRUE, model, core: undefined, reasonUnknown: "" }
1967
+ : { ...undecided, model, reasonUnknown: "canceled" };
1968
+ }
1969
+ if (goals !== undefined && isDecidedUnsat(goals))
1970
+ return {
1971
+ status: L_FALSE,
1972
+ model: undefined,
1973
+ core: goals[0].getDependency(0),
1974
+ reasonUnknown: "",
1975
+ };
1976
+ return { ...undecided, reasonUnknown: undefined };
1977
+ };
1978
+
1979
+ export const applyTactic = (tactic: Tactic, goal: Goal) => {
1980
+ try {
1981
+ return tactic(goal);
1982
+ } catch (error) {
1983
+ if (error instanceof SmtCanceledError) throw new SmtTacticError("canceled");
1984
+ throw error;
1985
+ }
1986
+ };