tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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