tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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