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
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_model_finder.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import { OP_ITE, OP_LT, SORT_BOOL, SORT_INT, isArithSort, type AstManager } from "./ast";
4
3
  import { combineHash } from "./hash";
@@ -0,0 +1,582 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_BASIC,
5
+ FAMILY_BV,
6
+ FAMILY_USER,
7
+ getSymbolName,
8
+ KIND_APP,
9
+ KIND_QUANTIFIER,
10
+ OP_BADD,
11
+ OP_BAND,
12
+ OP_BASHR,
13
+ OP_BIT2BOOL,
14
+ OP_BLSHR,
15
+ OP_BMUL,
16
+ OP_BNOT,
17
+ OP_BOR,
18
+ OP_BREDAND,
19
+ OP_BREDOR,
20
+ OP_BSDIV,
21
+ OP_BSDIV0,
22
+ OP_BSDIV_I,
23
+ OP_BSHL,
24
+ OP_BSMOD,
25
+ OP_BSMOD0,
26
+ OP_BSMOD_I,
27
+ OP_BSMUL_NO_OVFL,
28
+ OP_BSMUL_NO_UDFL,
29
+ OP_BSREM,
30
+ OP_BSREM0,
31
+ OP_BSREM_I,
32
+ OP_BUDIV,
33
+ OP_BUDIV0,
34
+ OP_BUDIV_I,
35
+ OP_BUMUL_NO_OVFL,
36
+ OP_BUREM,
37
+ OP_BUREM0,
38
+ OP_BUREM_I,
39
+ OP_BXOR,
40
+ OP_CONCAT,
41
+ OP_EQ,
42
+ OP_EXT_ROTATE_LEFT,
43
+ OP_EXT_ROTATE_RIGHT,
44
+ OP_EXTRACT,
45
+ OP_INT2BV,
46
+ OP_ITE,
47
+ OP_MKBV,
48
+ OP_SBV2INT,
49
+ OP_SIGN_EXT,
50
+ OP_SLEQ,
51
+ OP_UBV2INT,
52
+ OP_ULEQ,
53
+ SORT_BOOL,
54
+ type SmtSymbol,
55
+ } from "./ast";
56
+ import { BitBlaster } from "./bit-blaster";
57
+ import { mkBvApp } from "./bv-decl-plugin";
58
+ import { release } from "./expr-ref";
59
+ import type { Goal } from "./goal";
60
+ import { ObjMap } from "./hashtable";
61
+ import { ProtoModel } from "./proto-model";
62
+ import { RefVector } from "./ref-vector";
63
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
64
+ import { type Rewrite, RewriterTpl, VarShifter } from "./rewriter-tpl";
65
+
66
+ export interface BitBlastParams {
67
+ isBlastingMul: boolean;
68
+ isBlastingAdd: boolean;
69
+ isBlastingQuant: boolean;
70
+ isBlastingFull: boolean;
71
+ }
72
+
73
+ type Bits = readonly number[];
74
+
75
+ interface BlastedConst {
76
+ decl: number;
77
+ bits: number;
78
+ }
79
+
80
+ export class BitBlasterRewriter extends RewriterTpl {
81
+ private blaster: BitBlaster;
82
+ private in1: RefVector;
83
+ private in2: RefVector;
84
+ private out: RefVector;
85
+ private const2bits = new Map<number, number>();
86
+ private quantBindings: RefVector;
87
+ private quantShifts: number[] = [];
88
+ readonly keys: number[] = [];
89
+ readonly values: RefVector;
90
+ readonly newbits: number[] = [];
91
+
92
+ constructor(
93
+ manager: AstManager,
94
+ private params: BitBlastParams,
95
+ ) {
96
+ super(manager);
97
+ this.blaster = new BitBlaster(manager, true);
98
+ this.in1 = new RefVector(manager);
99
+ this.in2 = new RefVector(manager);
100
+ this.out = new RefVector(manager);
101
+ this.quantBindings = new RefVector(manager);
102
+ this.values = new RefVector(manager);
103
+ }
104
+
105
+ private getBits(expr: number, bits: RefVector) {
106
+ const manager = this.manager;
107
+ if (manager.getOp(expr) === OP_MKBV) {
108
+ for (const arg of manager.getArgs(expr)) bits.push(arg);
109
+ return;
110
+ }
111
+ const size = manager.getBvSize(manager.sorts[expr]);
112
+ for (let index = 0; index < size; index++)
113
+ bits.push(mkBvApp(manager, OP_BIT2BOOL, [expr], [index]));
114
+ }
115
+
116
+ private mkMkbv(bits: Bits) {
117
+ const result = mkBvApp(this.manager, OP_MKBV, [...bits]);
118
+ this.manager.incRef(result);
119
+ return result;
120
+ }
121
+
122
+ getConstBits(decl: number) {
123
+ return this.const2bits.get(decl);
124
+ }
125
+
126
+ private mkConst(decl: number) {
127
+ const manager = this.manager;
128
+ const existing = this.const2bits.get(decl);
129
+ if (existing !== undefined) {
130
+ manager.incRef(existing);
131
+ return existing;
132
+ }
133
+ const size = manager.getBvSize(manager.funcDecls[decl].range);
134
+ this.out.reset();
135
+ for (let index = 0; index < size; index++) {
136
+ const bit = manager.mkFreshConst(null, SORT_BOOL);
137
+ this.out.push(bit);
138
+ this.newbits.push(manager.decls[bit]);
139
+ manager.incDeclRef(manager.decls[bit]);
140
+ }
141
+ const result = this.mkMkbv(this.out.items);
142
+ this.const2bits.set(decl, result);
143
+ this.keys.push(decl);
144
+ manager.incDeclRef(decl);
145
+ this.values.push(result);
146
+ return result;
147
+ }
148
+
149
+ private reduceUnary(arg: number, blast: (bits: Bits, out: number[]) => void) {
150
+ this.in1.reset();
151
+ this.getBits(arg, this.in1);
152
+ this.out.reset();
153
+ blast(this.in1.items, this.out.items);
154
+ return this.mkMkbv(this.out.items);
155
+ }
156
+
157
+ private reduceBinary(
158
+ first: number,
159
+ second: number,
160
+ blast: (firstBits: Bits, secondBits: Bits, out: number[]) => void,
161
+ ) {
162
+ this.in1.reset();
163
+ this.in2.reset();
164
+ this.getBits(first, this.in1);
165
+ this.getBits(second, this.in2);
166
+ this.out.reset();
167
+ blast(this.in1.items, this.in2.items, this.out.items);
168
+ return this.mkMkbv(this.out.items);
169
+ }
170
+
171
+ private reduceAc(
172
+ args: number[],
173
+ blast: (firstBits: Bits, secondBits: Bits, out: number[]) => void,
174
+ ) {
175
+ const manager = this.manager;
176
+ let result = args[0];
177
+ manager.incRef(result);
178
+ let newResult = -1;
179
+ for (let index = 1; index < args.length; index++) {
180
+ const next = this.reduceBinary(result, args[index], blast);
181
+ release(manager, newResult);
182
+ newResult = next;
183
+ manager.incRef(newResult);
184
+ manager.decRef(result);
185
+ result = newResult;
186
+ }
187
+ release(manager, newResult);
188
+ return result;
189
+ }
190
+
191
+ private reducePredicate(
192
+ first: number,
193
+ second: number,
194
+ blast: (firstBits: Bits, secondBits: Bits) => number,
195
+ ) {
196
+ this.in1.reset();
197
+ this.in2.reset();
198
+ this.getBits(first, this.in1);
199
+ this.getBits(second, this.in2);
200
+ return blast(this.in1.items, this.in2.items);
201
+ }
202
+
203
+ private reduceConcat(args: number[]) {
204
+ this.out.reset();
205
+ for (let index = args.length - 1; index >= 0; index--) {
206
+ this.in1.reset();
207
+ this.getBits(args[index], this.in1);
208
+ for (const bit of this.in1.items) this.out.push(bit);
209
+ }
210
+ return this.mkMkbv(this.out.items);
211
+ }
212
+
213
+ private reduceExtract(start: number, end: number, arg: number) {
214
+ this.in1.reset();
215
+ this.getBits(arg, this.in1);
216
+ this.out.reset();
217
+ for (let index = start; index <= end; index++) this.out.push(this.in1.items[index]);
218
+ return this.mkMkbv(this.out.items);
219
+ }
220
+
221
+ private blastBvTerm(term: number) {
222
+ const manager = this.manager;
223
+ const size = manager.getBvSize(manager.sorts[term]);
224
+ const bits: number[] = [];
225
+ for (let index = 0; index < size; index++)
226
+ bits.push(mkBvApp(manager, OP_BIT2BOOL, [term], [index]));
227
+ return this.mkMkbv(bits);
228
+ }
229
+
230
+ private throwUnsupported(decl: number): never {
231
+ throw new SmtTacticError(
232
+ `operator ${this.manager.funcDecls[decl].name} is not supported, you must simplify the goal before applying bit-blasting`,
233
+ );
234
+ }
235
+
236
+ // A numeral's declaration carries no value here, so reduce_num substitutes the numeral.
237
+ getSubst(expr: number) {
238
+ const manager = this.manager;
239
+ if (!manager.isBvNumeral(expr)) return undefined;
240
+ this.out.reset();
241
+ this.blaster.num2bits(
242
+ manager.getBvNumeralValue(expr),
243
+ manager.getBvSize(manager.sorts[expr]),
244
+ this.out.items,
245
+ );
246
+ return mkBvApp(manager, OP_MKBV, [...this.out.items]);
247
+ }
248
+
249
+ reduceApp(decl: number, args: number[], sort: number): number | Rewrite {
250
+ const manager = this.manager;
251
+ const funcDecl = manager.funcDecls[decl];
252
+ const blaster = this.blaster;
253
+ const params = this.params;
254
+ if (args.length === 0 && funcDecl.family === FAMILY_USER && manager.isBvSort(funcDecl.range))
255
+ return this.mkConst(decl);
256
+ if (funcDecl.family === FAMILY_BASIC && funcDecl.op === OP_EQ)
257
+ return manager.isBvSort(manager.sorts[args[0]])
258
+ ? this.reducePredicate(args[0], args[1], (first, second) => blaster.mkEq(first, second))
259
+ : -1;
260
+ if (funcDecl.family === FAMILY_BASIC && funcDecl.op === OP_ITE) {
261
+ if (!manager.isBvSort(manager.sorts[args[1]])) return -1;
262
+ this.in1.reset();
263
+ this.in2.reset();
264
+ this.getBits(args[1], this.in1);
265
+ this.getBits(args[2], this.in2);
266
+ this.out.reset();
267
+ blaster.mkMultiplexer(args[0], this.in1.items, this.in2.items, this.out.items);
268
+ return this.mkMkbv(this.out.items);
269
+ }
270
+ if (funcDecl.family === FAMILY_BV)
271
+ switch (funcDecl.op) {
272
+ case OP_BADD:
273
+ return params.isBlastingAdd
274
+ ? this.reduceAc(args, (first, second, out) => blaster.mkAdder(first, second, out))
275
+ : -1;
276
+ case OP_BMUL:
277
+ return params.isBlastingMul
278
+ ? this.reduceAc(args, (first, second, out) => blaster.mkMultiplier(first, second, out))
279
+ : -1;
280
+ case OP_BSDIV:
281
+ case OP_BUDIV:
282
+ case OP_BSREM:
283
+ case OP_BUREM:
284
+ case OP_BSMOD:
285
+ if (params.isBlastingMul) this.throwUnsupported(decl);
286
+ return -1;
287
+ case OP_BSDIV0:
288
+ case OP_BUDIV0:
289
+ case OP_BSREM0:
290
+ case OP_BUREM0:
291
+ case OP_BSMOD0:
292
+ return -1;
293
+ case OP_BSDIV_I:
294
+ return params.isBlastingMul
295
+ ? this.reduceBinary(args[0], args[1], (first, second, out) =>
296
+ blaster.mkSdiv(first, second, out),
297
+ )
298
+ : -1;
299
+ case OP_BUDIV_I:
300
+ return params.isBlastingMul
301
+ ? this.reduceBinary(args[0], args[1], (first, second, out) =>
302
+ blaster.mkUdiv(first, second, out),
303
+ )
304
+ : -1;
305
+ case OP_BSREM_I:
306
+ return params.isBlastingMul
307
+ ? this.reduceBinary(args[0], args[1], (first, second, out) =>
308
+ blaster.mkSrem(first, second, out),
309
+ )
310
+ : -1;
311
+ case OP_BUREM_I:
312
+ return params.isBlastingMul
313
+ ? this.reduceBinary(args[0], args[1], (first, second, out) =>
314
+ blaster.mkUrem(first, second, out),
315
+ )
316
+ : -1;
317
+ case OP_BSMOD_I:
318
+ return params.isBlastingMul
319
+ ? this.reduceBinary(args[0], args[1], (first, second, out) =>
320
+ blaster.mkSmod(first, second, out),
321
+ )
322
+ : -1;
323
+ case OP_ULEQ:
324
+ return this.reducePredicate(args[0], args[1], (first, second) =>
325
+ blaster.mkUle(first, second),
326
+ );
327
+ case OP_SLEQ:
328
+ return this.reducePredicate(args[0], args[1], (first, second) =>
329
+ blaster.mkSle(first, second),
330
+ );
331
+ case OP_BAND:
332
+ return this.reduceAc(args, (first, second, out) => blaster.mkAndBits(first, second, out));
333
+ case OP_BOR:
334
+ return this.reduceAc(args, (first, second, out) => blaster.mkOrBits(first, second, out));
335
+ case OP_BNOT:
336
+ return this.reduceUnary(args[0], (bits, out) => blaster.mkNotBits(bits, out));
337
+ case OP_BXOR:
338
+ return this.reduceAc(args, (first, second, out) => blaster.mkXorBits(first, second, out));
339
+ case OP_CONCAT:
340
+ return this.reduceConcat(args);
341
+ case OP_SIGN_EXT:
342
+ return this.reduceUnary(args[0], (bits, out) =>
343
+ blaster.mkSignExtend(bits, funcDecl.parameters[0], out),
344
+ );
345
+ case OP_EXTRACT:
346
+ return this.reduceExtract(funcDecl.parameters[1], funcDecl.parameters[0], args[0]);
347
+ case OP_BREDOR:
348
+ return this.reduceUnary(args[0], (bits, out) => blaster.mkRedor(bits, out));
349
+ case OP_BREDAND:
350
+ return this.reduceUnary(args[0], (bits, out) => blaster.mkRedand(bits, out));
351
+ case OP_BSHL:
352
+ return this.reduceBinary(args[0], args[1], (first, second, out) =>
353
+ blaster.mkShl(first, second, out),
354
+ );
355
+ case OP_BLSHR:
356
+ return this.reduceBinary(args[0], args[1], (first, second, out) =>
357
+ blaster.mkLshr(first, second, out),
358
+ );
359
+ case OP_BASHR:
360
+ return this.reduceBinary(args[0], args[1], (first, second, out) =>
361
+ blaster.mkAshr(first, second, out),
362
+ );
363
+ case OP_EXT_ROTATE_LEFT:
364
+ return this.reduceBinary(args[0], args[1], (first, second, out) =>
365
+ blaster.mkExtRotateLeft(first, second, out),
366
+ );
367
+ case OP_EXT_ROTATE_RIGHT:
368
+ return this.reduceBinary(args[0], args[1], (first, second, out) =>
369
+ blaster.mkExtRotateRight(first, second, out),
370
+ );
371
+ case OP_BUMUL_NO_OVFL:
372
+ return this.reducePredicate(args[0], args[1], (first, second) =>
373
+ blaster.mkUmulNoOverflow(first, second),
374
+ );
375
+ case OP_BSMUL_NO_OVFL:
376
+ return this.reducePredicate(args[0], args[1], (first, second) =>
377
+ blaster.mkSmulNoOverflow(first, second),
378
+ );
379
+ case OP_BSMUL_NO_UDFL:
380
+ return this.reducePredicate(args[0], args[1], (first, second) =>
381
+ blaster.mkSmulNoUnderflow(first, second),
382
+ );
383
+ case OP_BIT2BOOL:
384
+ case OP_MKBV:
385
+ case OP_INT2BV:
386
+ case OP_UBV2INT:
387
+ case OP_SBV2INT:
388
+ return -1;
389
+ default: {
390
+ const term = manager.mkApp(decl, args, sort);
391
+ manager.incRef(term);
392
+ const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
393
+ const result = rewriter.rewrite(term);
394
+ rewriter.release();
395
+ manager.decRef(term);
396
+ if (manager.kinds[result] !== KIND_APP || manager.decls[result] !== decl)
397
+ return { expr: result, depth: Infinity };
398
+ manager.decRef(result);
399
+ this.throwUnsupported(decl);
400
+ }
401
+ }
402
+ if (params.isBlastingFull && manager.isBvSort(funcDecl.range))
403
+ return this.blastBvTerm(manager.mkApp(decl, args, sort));
404
+ return -1;
405
+ }
406
+
407
+ preVisit(expr: number) {
408
+ const manager = this.manager;
409
+ if (!this.params.isBlastingQuant || manager.kinds[expr] !== KIND_QUANTIFIER) return true;
410
+ const sorts = manager.getQuantifier(expr).sorts;
411
+ const bindings: number[] = [];
412
+ let next = 0;
413
+ for (let index = sorts.length - 1; index >= 0; index--) {
414
+ const sort = sorts[index];
415
+ if (!manager.isBvSort(sort)) {
416
+ bindings.push(manager.mkVar(next++, sort));
417
+ continue;
418
+ }
419
+ const bits: number[] = [];
420
+ for (let bit = 0; bit < manager.getBvSize(sort); bit++)
421
+ bits.push(manager.mkVar(next++, SORT_BOOL));
422
+ bindings.push(mkBvApp(manager, OP_MKBV, bits));
423
+ }
424
+ const shift =
425
+ next + (this.quantShifts.length === 0 ? 0 : this.quantShifts[this.quantShifts.length - 1]);
426
+ for (let index = bindings.length - 1; index >= 0; index--) {
427
+ this.quantBindings.push(bindings[index]);
428
+ this.quantShifts.push(shift);
429
+ }
430
+ return true;
431
+ }
432
+
433
+ reduceVar(variable: number) {
434
+ const manager = this.manager;
435
+ const sort = manager.sorts[variable];
436
+ if (this.params.isBlastingQuant) {
437
+ const size = this.quantBindings.size;
438
+ if (size === 0 || !manager.isBvSort(sort)) return -1;
439
+ const index = manager.values[variable];
440
+ const shift = this.quantShifts[this.quantShifts.length - 1];
441
+ if (index >= size) {
442
+ if (shift === 0) return -1;
443
+ const result = manager.mkVar(index + shift, sort);
444
+ manager.incRef(result);
445
+ return result;
446
+ }
447
+ const offset = size - index - 1;
448
+ const binding = this.quantBindings.items[offset];
449
+ const amount = shift - this.quantShifts[offset];
450
+ if (amount === 0) {
451
+ manager.incRef(binding);
452
+ return binding;
453
+ }
454
+ const shifter = new VarShifter(manager);
455
+ const result = shifter.shift(binding, 0, amount, 0);
456
+ shifter.release();
457
+ return result;
458
+ }
459
+ return this.params.isBlastingFull && manager.isBvSort(sort) ? this.blastBvTerm(variable) : -1;
460
+ }
461
+
462
+ reduceQuantifier(expr: number, body: number, patterns: number[]) {
463
+ const manager = this.manager;
464
+ if (!this.params.isBlastingQuant) return -1;
465
+ const data = manager.getQuantifier(expr);
466
+ const sorts: number[] = [];
467
+ const names: SmtSymbol[] = [];
468
+ for (let index = 0; index < data.sorts.length; index++) {
469
+ const sort = data.sorts[index];
470
+ if (!manager.isBvSort(sort)) {
471
+ sorts.push(sort);
472
+ names.push(data.names[index]);
473
+ continue;
474
+ }
475
+ for (let bit = 0; bit < manager.getBvSize(sort); bit++) {
476
+ sorts.push(SORT_BOOL);
477
+ names.push(`${getSymbolName(data.names[index])}.${bit}`);
478
+ }
479
+ }
480
+ const result = manager.mkQuantifier({ ...data, sorts, names, body, patterns, noPatterns: [] });
481
+ manager.incRef(result);
482
+ const size = this.quantBindings.size - data.sorts.length;
483
+ this.quantBindings.shrink(size);
484
+ this.quantShifts.length = size;
485
+ return result;
486
+ }
487
+
488
+ // ~blaster_rewriter_cfg, after the tactic's cleanup of the rewriter.
489
+ releaseCfg() {
490
+ const manager = this.manager;
491
+ for (const decl of this.newbits) manager.decDeclRef(decl);
492
+ this.values.reset();
493
+ for (const decl of this.keys) manager.decDeclRef(decl);
494
+ this.quantBindings.reset();
495
+ this.out.reset();
496
+ this.in2.reset();
497
+ this.in1.reset();
498
+ }
499
+ }
500
+
501
+ const convertModel = (manager: AstManager, consts: BlastedConst[], source: ProtoModel) => {
502
+ const target = new ProtoModel(manager).mkModel();
503
+ const bitDecls = new Set<number>();
504
+ for (const blasted of consts)
505
+ for (const bit of manager.getArgs(blasted.bits)) bitDecls.add(manager.decls[bit]);
506
+ for (const decl of source.getConstDecls())
507
+ if (!bitDecls.has(decl)) target.registerConst(decl, source.constInterps.get(decl) as number);
508
+ for (const entry of source.funcInterps) target.registerFunc(entry[0], entry[1].copy());
509
+ for (const sort of source.getUninterpretedSorts())
510
+ for (const value of source.getKnownUniverse(sort)) target.registerValue(value);
511
+ for (const blasted of consts) {
512
+ const existing = source.constInterps.get(blasted.decl);
513
+ if (existing !== undefined) {
514
+ target.registerConst(blasted.decl, existing);
515
+ continue;
516
+ }
517
+ const bits = manager.getArgs(blasted.bits);
518
+ const values = bits.map((bit) => source.constInterps.get(manager.decls[bit]));
519
+ const isBool = values.every(
520
+ (value) => value === undefined || manager.isTrue(value) || manager.isFalse(value),
521
+ );
522
+ if (!isBool) {
523
+ target.registerConst(
524
+ blasted.decl,
525
+ mkBvApp(
526
+ manager,
527
+ OP_MKBV,
528
+ values.map((value) => value ?? manager.falseExpr),
529
+ ),
530
+ );
531
+ continue;
532
+ }
533
+ let value = 0n;
534
+ for (let index = bits.length - 1; index >= 0; index--)
535
+ value = value * 2n + (values[index] === manager.trueExpr ? 1n : 0n);
536
+ target.registerConst(blasted.decl, manager.mkBvNumeral(value, bits.length));
537
+ }
538
+ return target;
539
+ };
540
+
541
+ // inc_sat_solver passes a rewriter that keeps its bits across calls; each call converts the
542
+ // constants it blasts.
543
+ export const runBitBlast =
544
+ (manager: AstManager, params: BitBlastParams, persistent?: BitBlasterRewriter) =>
545
+ (goal: Goal) => {
546
+ if (goal.isProofsEnabled && params.isBlastingQuant)
547
+ throw new SmtTacticError("quantified variable blasting does not support proof generation");
548
+ const rewriter = persistent ?? new BitBlasterRewriter(manager, params);
549
+ const keyPos = rewriter.keys.length;
550
+ let rewritten = -1;
551
+ let isChanged = false;
552
+ const size = goal.forms.size;
553
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
554
+ const form = goal.forms.items[index];
555
+ const next = rewriter.rewrite(form);
556
+ release(manager, rewritten);
557
+ rewritten = next;
558
+ if (form === rewritten) continue;
559
+ isChanged = true;
560
+ goal.update(index, rewritten);
561
+ }
562
+ if (isChanged && rewriter.keys.length > keyPos) {
563
+ const const2bits = new ObjMap<number>((decl) => manager.getDeclHash(decl));
564
+ for (let index = keyPos; index < rewriter.keys.length; index++)
565
+ const2bits.set(rewriter.keys[index], rewriter.values.items[index]);
566
+ const consts: BlastedConst[] = [];
567
+ for (const entry of const2bits) {
568
+ manager.incDeclRef(entry[0]);
569
+ manager.incRef(entry[1]);
570
+ consts.push({ decl: entry[0], bits: entry[1] });
571
+ }
572
+ for (const decl of rewriter.newbits) manager.incDeclRef(decl);
573
+ goal.addModelConversion((model) => convertModel(manager, consts, model));
574
+ }
575
+ goal.depth++;
576
+ rewriter.cleanup();
577
+ release(manager, rewritten);
578
+ if (persistent !== undefined) return [goal];
579
+ rewriter.releaseCfg();
580
+ rewriter.release();
581
+ return [goal];
582
+ };