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,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/random_updater_def.h, and shift_var and
2
- // get_freedom_interval_for_column in src/math/lp/int_solver.cpp), MIT license, see z3-license.txt.
3
1
  import { getLcm, Rational } from "../rational";
4
2
  import { IndexedUintSet } from "./containers";
5
3
  import type { LarSolver } from "./lar-solver";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/static_matrix.h, src/math/lp/static_matrix_def.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import type { LarTerm } from "./lar-term";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/trail.h, src/util/union_find.h), MIT license, see z3-license.txt.
2
1
  import { shrink } from "../array";
3
2
 
4
3
  export class TrailStack {
@@ -21,7 +20,12 @@ export class TrailStack {
21
20
  }
22
21
  }
23
22
 
23
+ interface UnionFindTrail {
24
+ push(undo: () => void): void;
25
+ }
26
+
24
27
  export interface UnionFindHandler {
28
+ mergeEh?: (r2: number, r1: number, v2: number, v1: number) => void;
25
29
  afterMergeEh?: (r2: number, r1: number, v2: number, v1: number) => void;
26
30
  unmergeEh?: (r2: number, r1: number) => void;
27
31
  }
@@ -33,7 +37,7 @@ export class UnionFind {
33
37
 
34
38
  handler: UnionFindHandler = {};
35
39
 
36
- constructor(private trail: TrailStack) {}
40
+ constructor(private trail: UnionFindTrail) {}
37
41
 
38
42
  get numVars() {
39
43
  return this.finds.length;
@@ -71,6 +75,7 @@ export class UnionFind {
71
75
  const r2 = isSwapped ? root1 : root2;
72
76
  const v1 = isSwapped ? inputV2 : inputV1;
73
77
  const v2 = isSwapped ? inputV1 : inputV2;
78
+ this.handler.mergeEh?.(r2, r1, v2, v1);
74
79
  this.finds[r1] = r2;
75
80
  this.sizes[r2] += this.sizes[r1];
76
81
  this.swapNexts(r1, r2);
@@ -0,0 +1,530 @@
1
+ import {
2
+ FAMILY_USER,
3
+ KIND_APP,
4
+ KIND_QUANTIFIER,
5
+ OP_ADD,
6
+ OP_ARRAY_MAP,
7
+ OP_AS_ARRAY,
8
+ OP_EQ,
9
+ OP_GE,
10
+ OP_ITE,
11
+ OP_LE,
12
+ OP_NOT,
13
+ SORT_BOOL,
14
+ type AstManager,
15
+ QUANTIFIER_FORALL,
16
+ } from "./ast";
17
+ import { isAppOf } from "./ast-util";
18
+ import { getSubterms } from "./recfun-decl-plugin";
19
+ import { type Dependency, type Goal, joinDependencies } from "./goal";
20
+ import { isMacroHead, normalizeMacroDef, setElseInterp } from "./model-macro-solver";
21
+ import type { ProtoModel } from "./proto-model";
22
+ import { Rational } from "./rational";
23
+ import { RefVector } from "./ref-vector";
24
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
25
+ import { RewriterTpl } from "./rewriter-tpl";
26
+ import { VarSubst } from "./var-subst";
27
+
28
+ interface MacroScope {
29
+ numDecls: number;
30
+ numForbidden: number;
31
+ }
32
+
33
+ interface HeadDef {
34
+ head: number;
35
+ def: number;
36
+ }
37
+
38
+ interface JustifiedForms {
39
+ forms: RefVector;
40
+ dependencies: (Dependency | undefined)[];
41
+ }
42
+
43
+ interface PseudoHead {
44
+ head: number;
45
+ value: number;
46
+ }
47
+
48
+ const isForall = (manager: AstManager, expr: number) =>
49
+ manager.kinds[expr] === KIND_QUANTIFIER && manager.getQuantifier(expr).kind === QUANTIFIER_FORALL;
50
+
51
+ const collectUserDecls = (manager: AstManager, expr: number, decls: Set<number>) => {
52
+ const visited = new Set<number>();
53
+ const todo = [expr];
54
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
55
+ if (visited.has(current)) continue;
56
+ visited.add(current);
57
+ if (manager.kinds[current] === KIND_QUANTIFIER) {
58
+ const data = manager.getQuantifier(current);
59
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
60
+ continue;
61
+ }
62
+ if (manager.kinds[current] !== KIND_APP || manager.getNumArgs(current) === 0) continue;
63
+ const decl = manager.decls[current];
64
+ if (manager.funcDecls[decl].family === FAMILY_USER) decls.add(decl);
65
+ todo.push(...manager.getArgs(current));
66
+ }
67
+ };
68
+
69
+ // The definition comes with a reference, which the caller releases.
70
+ const getHeadDef = (manager: AstManager, quantifier: number, decl: number): HeadDef => {
71
+ const body = manager.getQuantifier(quantifier).body;
72
+ const isNegated = isAppOf(manager, body, OP_NOT);
73
+ const eq = isNegated ? manager.getArg(body, 0) : body;
74
+ const lhs = manager.getArg(eq, 0);
75
+ const rhs = manager.getArg(eq, 1);
76
+ const isLeft = manager.kinds[lhs] === KIND_APP && manager.decls[lhs] === decl;
77
+ const side = isLeft ? rhs : lhs;
78
+ const def = isNegated ? manager.mkApp(OP_NOT, [side], SORT_BOOL) : side;
79
+ manager.incRef(def);
80
+ return { head: isLeft ? lhs : rhs, def };
81
+ };
82
+
83
+ class MacroExpander extends RewriterTpl {
84
+ readonly trail: RefVector;
85
+ private subst: VarSubst;
86
+ usedDependencies: Dependency | undefined;
87
+
88
+ constructor(
89
+ manager: AstManager,
90
+ private macros: MacroManager,
91
+ ) {
92
+ super(manager);
93
+ this.trail = new RefVector(manager);
94
+ this.subst = new VarSubst(manager, true);
95
+ }
96
+
97
+ isRewritingPatterns() {
98
+ return false;
99
+ }
100
+
101
+ getSubst(expr: number) {
102
+ const manager = this.manager;
103
+ if (manager.kinds[expr] !== KIND_APP) return undefined;
104
+ const decl = manager.decls[expr];
105
+ const quantifier = this.macros.getMacro(decl);
106
+ if (quantifier === undefined) {
107
+ const op = manager.getOp(expr);
108
+ if (op !== OP_AS_ARRAY && op !== OP_ARRAY_MAP) return undefined;
109
+ const target = manager.funcDecls[decl].parameters[0];
110
+ if (this.macros.getMacro(target) !== undefined) this.macros.unsafe.add(target);
111
+ return undefined;
112
+ }
113
+ const headDef = getHeadDef(manager, quantifier, decl);
114
+ const numArgs = manager.getNumArgs(expr);
115
+ const args = Array.from({ length: numArgs }, () => -1);
116
+ for (let index = 0; index < numArgs; index++)
117
+ args[numArgs - manager.values[manager.getArg(headDef.head, index)] - 1] = manager.getArg(
118
+ expr,
119
+ index,
120
+ );
121
+ const result = this.subst.apply(headDef.def, args);
122
+ this.trail.pushOwned(result);
123
+ manager.decRef(headDef.def);
124
+ this.usedDependencies = joinDependencies(
125
+ this.usedDependencies,
126
+ this.macros.getMacroDependency(decl),
127
+ );
128
+ return result;
129
+ }
130
+
131
+ release() {
132
+ super.release();
133
+ this.subst.release();
134
+ this.trail.reset();
135
+ }
136
+ }
137
+
138
+ export class MacroManager {
139
+ private decls: number[] = [];
140
+ private macros: number[] = [];
141
+ private decl2macro = new Map<number, number>();
142
+ private decl2dependency = new Map<number, Dependency | undefined>();
143
+ private deps = new Map<number, Set<number>>();
144
+ private forbidden = new Set<number>();
145
+ private forbiddenTrail: number[] = [];
146
+ private scopes: MacroScope[] = [];
147
+ readonly unsafe = new Set<number>();
148
+
149
+ constructor(private manager: AstManager) {}
150
+
151
+ hasMacros() {
152
+ return this.decls.length > 0;
153
+ }
154
+
155
+ getMacro(decl: number) {
156
+ return this.decl2macro.get(decl);
157
+ }
158
+
159
+ getMacroDependency(decl: number) {
160
+ return this.decl2dependency.get(decl);
161
+ }
162
+
163
+ pushScope() {
164
+ this.scopes.push({ numDecls: this.decls.length, numForbidden: this.forbiddenTrail.length });
165
+ }
166
+
167
+ popScope() {
168
+ const scope = this.scopes.pop();
169
+ if (scope === undefined) return;
170
+ for (const decl of this.decls.splice(scope.numDecls)) {
171
+ this.deps.delete(decl);
172
+ this.decl2macro.delete(decl);
173
+ this.decl2dependency.delete(decl);
174
+ }
175
+ for (const quantifier of this.macros.splice(scope.numDecls)) this.manager.decRef(quantifier);
176
+ for (const decl of this.forbiddenTrail.splice(scope.numForbidden)) this.forbidden.delete(decl);
177
+ }
178
+
179
+ markForbidden(formulas: number[]) {
180
+ const decls = new Set<number>();
181
+ for (const formula of formulas) collectUserDecls(this.manager, formula, decls);
182
+ for (const decl of decls) {
183
+ if (this.forbidden.has(decl)) continue;
184
+ this.forbidden.add(decl);
185
+ this.forbiddenTrail.push(decl);
186
+ }
187
+ }
188
+
189
+ release() {
190
+ for (const quantifier of this.macros) this.manager.decRef(quantifier);
191
+ }
192
+
193
+ registerInterpretations(model: ProtoModel) {
194
+ for (const [index, decl] of this.decls.entries()) {
195
+ const def = this.getInterpretation(index);
196
+ setElseInterp(this.manager, model, decl, def);
197
+ this.manager.decRef(def);
198
+ }
199
+ }
200
+
201
+ find(formulas: number[]) {
202
+ this.unsafe.clear();
203
+ const current = this.expandRounds(formulas, [], Infinity).forms;
204
+ for (const [index, decl] of this.decls.entries())
205
+ if (this.unsafe.has(decl)) current.push(this.macros[index]);
206
+ this.unsafe.clear();
207
+ return current;
208
+ }
209
+
210
+ // The tactic stops after one round per formula, and keeps unsafe macros out of the result.
211
+ findInGoal(formulas: number[], dependencies: (Dependency | undefined)[]) {
212
+ return this.expandRounds(formulas, dependencies, formulas.length);
213
+ }
214
+
215
+ // The definitions come with a reference, which the caller releases.
216
+ getInterpretations() {
217
+ return this.decls.map((decl, index) => ({ decl, def: this.getInterpretation(index) }));
218
+ }
219
+
220
+ private getInterpretation(index: number) {
221
+ const manager = this.manager;
222
+ return manager.withTemporaries(
223
+ () => {
224
+ const headDef = getHeadDef(manager, this.macros[index], this.decls[index]);
225
+ const def = normalizeMacroDef(manager, headDef.head, headDef.def);
226
+ manager.incRef(def);
227
+ manager.decRef(headDef.def);
228
+ return def;
229
+ },
230
+ () => [],
231
+ );
232
+ }
233
+
234
+ private expandRounds(
235
+ formulas: number[],
236
+ dependencies: (Dependency | undefined)[],
237
+ maxRounds: number,
238
+ ) {
239
+ let current: JustifiedForms = { forms: new RefVector(this.manager), dependencies: [] };
240
+ let isFound = this.expandFormulas(formulas, dependencies, current);
241
+ for (let round = 0; isFound && round < maxRounds; round++) {
242
+ const next = { forms: new RefVector(this.manager), dependencies: [] };
243
+ isFound = this.expandFormulas(current.forms.items, current.dependencies, next);
244
+ current.forms.reset();
245
+ current = next;
246
+ }
247
+ return current;
248
+ }
249
+
250
+ private expandFormulas(
251
+ formulas: number[],
252
+ dependencies: (Dependency | undefined)[],
253
+ result: JustifiedForms,
254
+ ) {
255
+ const manager = this.manager;
256
+ let isFound = false;
257
+ for (const [index, formula] of formulas.entries()) {
258
+ const expanded = this.expandJustified(formula, dependencies[index]);
259
+ if (
260
+ this.insertSimpleMacro(expanded.expr, expanded.dependency) ||
261
+ this.findArithMacro(expanded.expr, expanded.dependency, result) ||
262
+ this.findPseudoPredicateMacro(expanded.expr, expanded.dependency, result)
263
+ )
264
+ isFound = true;
265
+ else {
266
+ result.forms.push(expanded.expr);
267
+ result.dependencies.push(expanded.dependency);
268
+ }
269
+ manager.decRef(expanded.expr);
270
+ }
271
+ return isFound;
272
+ }
273
+
274
+ // The result comes with a reference, which the caller releases.
275
+ expand(expr: number) {
276
+ return this.expandJustified(expr, undefined).expr;
277
+ }
278
+
279
+ private expandJustified(expr: number, dependency: Dependency | undefined) {
280
+ const manager = this.manager;
281
+ manager.incRef(expr);
282
+ if (!this.hasMacros()) return { expr, dependency };
283
+ let current = expr;
284
+ let currentDependency = dependency;
285
+ for (;;) {
286
+ const expander = new MacroExpander(manager, this);
287
+ const result = expander.rewrite(current);
288
+ currentDependency = joinDependencies(currentDependency, expander.usedDependencies);
289
+ const isChanged = result !== current;
290
+ manager.decRef(current);
291
+ current = result;
292
+ expander.release();
293
+ if (!isChanged)
294
+ return {
295
+ expr: current === expr ? current : this.simplify(current),
296
+ dependency: currentDependency,
297
+ };
298
+ }
299
+ }
300
+
301
+ private simplify(expr: number) {
302
+ const rewriter = new Rewriter(this.manager, TACTIC_REWRITER_OPTIONS);
303
+ const result = rewriter.rewrite(expr);
304
+ this.manager.decRef(expr);
305
+ rewriter.release();
306
+ return result;
307
+ }
308
+
309
+ insert(decl: number, quantifier: number, dependency?: Dependency) {
310
+ const manager = this.manager;
311
+ if (this.decl2macro.has(decl)) return false;
312
+ // The recfun theory unfolds a recursive definition, which the expansion of the macro does not
313
+ // reach.
314
+ for (const def of manager.recFunDefs.values())
315
+ if (
316
+ !def.isMacro &&
317
+ def.rhs !== -1 &&
318
+ getSubterms(manager, def.rhs).some(
319
+ (term) => manager.kinds[term] === KIND_APP && manager.decls[term] === decl,
320
+ )
321
+ )
322
+ return false;
323
+ const headDef = getHeadDef(manager, quantifier, decl);
324
+ const deps = new Set<number>();
325
+ collectUserDecls(manager, headDef.def, deps);
326
+ manager.decRef(headDef.def);
327
+ if (this.isReaching(deps, decl)) return false;
328
+ this.deps.set(decl, deps);
329
+ manager.incRef(quantifier);
330
+ this.decl2macro.set(decl, quantifier);
331
+ this.decl2dependency.set(decl, dependency);
332
+ this.decls.push(decl);
333
+ this.macros.push(quantifier);
334
+ return true;
335
+ }
336
+
337
+ private isReaching(deps: Set<number>, target: number) {
338
+ const visited = new Set<number>();
339
+ const todo = [...deps];
340
+ for (let decl = todo.pop(); decl !== undefined; decl = todo.pop()) {
341
+ if (decl === target) return true;
342
+ if (visited.has(decl)) continue;
343
+ visited.add(decl);
344
+ todo.push(...(this.deps.get(decl) ?? []));
345
+ }
346
+ return false;
347
+ }
348
+
349
+ private isHead(expr: number, numDecls: number, other: number) {
350
+ const manager = this.manager;
351
+ return (
352
+ isMacroHead(manager, expr, numDecls) &&
353
+ !this.forbidden.has(manager.decls[expr]) &&
354
+ !manager.isOccurring(manager.decls[expr], other)
355
+ );
356
+ }
357
+
358
+ private insertSimpleMacro(expr: number, dependency: Dependency | undefined) {
359
+ const manager = this.manager;
360
+ if (!isForall(manager, expr)) return false;
361
+ const data = manager.getQuantifier(expr);
362
+ const numDecls = data.sorts.length;
363
+ const isNegatedBoolEq =
364
+ isAppOf(manager, data.body, OP_NOT) &&
365
+ isAppOf(manager, manager.getArg(data.body, 0), OP_EQ) &&
366
+ manager.isBool(manager.getArg(manager.getArg(data.body, 0), 0));
367
+ const eq = isNegatedBoolEq ? manager.getArg(data.body, 0) : data.body;
368
+ if (!isAppOf(manager, eq, OP_EQ)) return false;
369
+ const lhs = manager.getArg(eq, 0);
370
+ const rhs = manager.getArg(eq, 1);
371
+ const head = this.isHead(lhs, numDecls, rhs)
372
+ ? lhs
373
+ : this.isHead(rhs, numDecls, lhs)
374
+ ? rhs
375
+ : undefined;
376
+ return head !== undefined && this.insert(manager.decls[head], expr, dependency);
377
+ }
378
+
379
+ private isArithHead(expr: number, numDecls: number, poly: number, exception: number) {
380
+ const manager = this.manager;
381
+ if (!isMacroHead(manager, expr, numDecls) || this.forbidden.has(manager.decls[expr]))
382
+ return false;
383
+ const decl = manager.decls[expr];
384
+ return manager
385
+ .getArgs(poly)
386
+ .every((arg) => arg === exception || !manager.isOccurring(decl, arg));
387
+ }
388
+
389
+ private findArithMacro(expr: number, dependency: Dependency | undefined, result: JustifiedForms) {
390
+ const manager = this.manager;
391
+ if (!isForall(manager, expr)) return false;
392
+ const data = manager.getQuantifier(expr);
393
+ const body = data.body;
394
+ const op = manager.kinds[body] === KIND_APP ? manager.getOp(body) : -1;
395
+ if (op !== OP_LE && op !== OP_GE && op !== OP_EQ) return false;
396
+ const lhs = manager.getArg(body, 0);
397
+ const rhs = manager.getArg(body, 1);
398
+ if (!isAppOf(manager, lhs, OP_ADD) || !manager.isNumeral(rhs)) return false;
399
+ const numDecls = data.sorts.length;
400
+ let head: number | undefined;
401
+ let isInverted = false;
402
+ const rest: number[] = [];
403
+ for (const arg of manager.getArgs(lhs)) {
404
+ const negated = manager.getTimesMinusOneArg(arg);
405
+ if (head === undefined && this.isArithHead(arg, numDecls, lhs, arg)) head = arg;
406
+ else if (
407
+ head === undefined &&
408
+ negated !== undefined &&
409
+ this.isArithHead(negated, numDecls, lhs, arg)
410
+ ) {
411
+ head = negated;
412
+ isInverted = true;
413
+ } else rest.push(arg);
414
+ }
415
+ if (head === undefined) return false;
416
+ const macroHead = head;
417
+ return manager.withTemporaries(
418
+ () => {
419
+ const sort = manager.sorts[lhs];
420
+ const sum = rest.length === 1 ? rest[0] : manager.mkApp(OP_ADD, rest, sort);
421
+ const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
422
+ const def = isInverted ? rewriter.mkSub(sum, rhs) : rewriter.mkSub(rhs, sum);
423
+ rewriter.release();
424
+ const decl = manager.decls[macroHead];
425
+ const funcDecl = manager.funcDecls[decl];
426
+ if (this.decl2macro.has(decl) || funcDecl.isSkolem) return false;
427
+ const newOp = !isInverted || op === OP_EQ ? op : op === OP_LE ? OP_GE : OP_LE;
428
+ const macro = manager.mkQuantifier({
429
+ ...data,
430
+ body: manager.mkApp(newOp, [macroHead, def], SORT_BOOL),
431
+ });
432
+ if (op === OP_EQ) return this.insert(decl, macro, dependency);
433
+ const fresh = manager.mkFreshFuncDecl(funcDecl.name, funcDecl.domain, funcDecl.range);
434
+ const freshApp = manager.mkApp(fresh, manager.getArgs(macroHead), funcDecl.range);
435
+ const macroData = manager.getQuantifier(macro);
436
+ result.forms.push(
437
+ manager.mkQuantifier({
438
+ ...macroData,
439
+ body: manager.mkEq(macroHead, manager.mkApp(OP_ADD, [def, freshApp], sort)),
440
+ }),
441
+ );
442
+ result.forms.push(
443
+ manager.mkQuantifier({
444
+ ...macroData,
445
+ body: manager.mkApp(
446
+ newOp,
447
+ [freshApp, manager.mkNumeralOfSort(Rational.zero, funcDecl.range)],
448
+ SORT_BOOL,
449
+ ),
450
+ patterns: [manager.mkPattern([freshApp])],
451
+ }),
452
+ );
453
+ result.dependencies.push(dependency, dependency);
454
+ return true;
455
+ },
456
+ () => [],
457
+ );
458
+ }
459
+
460
+ private getPseudoHead(expr: number, numDecls: number): PseudoHead | undefined {
461
+ const manager = this.manager;
462
+ if (!isAppOf(manager, expr, OP_EQ)) return undefined;
463
+ const lhs = manager.getArg(expr, 0);
464
+ const rhs = manager.getArg(expr, 1);
465
+ if (!manager.isGroundApp(lhs) && !manager.isGroundApp(rhs)) return undefined;
466
+ const sort = manager.sorts[lhs];
467
+ if (manager.isUninterpretedSort(sort) || manager.getSortSize(sort) === 1n) return undefined;
468
+ if (isMacroHead(manager, lhs, numDecls)) return { head: lhs, value: rhs };
469
+ if (isMacroHead(manager, rhs, numDecls)) return { head: rhs, value: lhs };
470
+ return undefined;
471
+ }
472
+
473
+ private findPseudoPredicateMacro(
474
+ expr: number,
475
+ dependency: Dependency | undefined,
476
+ result: JustifiedForms,
477
+ ) {
478
+ const manager = this.manager;
479
+ if (!isForall(manager, expr)) return false;
480
+ const data = manager.getQuantifier(expr);
481
+ const body = data.body;
482
+ if (!isAppOf(manager, body, OP_EQ) || !manager.isBool(manager.getArg(body, 0))) return false;
483
+ const numDecls = data.sorts.length;
484
+ const getMacro = (side: number, other: number) => {
485
+ const pseudo = this.getPseudoHead(side, numDecls);
486
+ if (pseudo === undefined) return undefined;
487
+ const decl = manager.decls[pseudo.head];
488
+ return this.forbidden.has(decl) || manager.isOccurring(decl, other) ? undefined : pseudo;
489
+ };
490
+ const lhs = manager.getArg(body, 0);
491
+ const rhs = manager.getArg(body, 1);
492
+ const fromLhs = getMacro(lhs, rhs);
493
+ const pseudo = fromLhs ?? getMacro(rhs, lhs);
494
+ if (pseudo === undefined) return false;
495
+ const def = fromLhs === undefined ? lhs : rhs;
496
+ manager.withTemporaries(
497
+ () => {
498
+ const funcDecl = manager.funcDecls[manager.decls[pseudo.head]];
499
+ const fresh = manager.mkFreshFuncDecl(funcDecl.name, funcDecl.domain, funcDecl.range);
500
+ const freshApp = manager.mkApp(fresh, manager.getArgs(pseudo.head), funcDecl.range);
501
+ const ite = manager.mkApp(OP_ITE, [def, pseudo.value, freshApp], funcDecl.range);
502
+ result.forms.push(manager.mkQuantifier({ ...data, body: manager.mkEq(pseudo.head, ite) }));
503
+ result.forms.push(
504
+ manager.mkQuantifier({
505
+ ...data,
506
+ body: manager.mkApp(OP_NOT, [manager.mkEq(freshApp, pseudo.value)], SORT_BOOL),
507
+ patterns: [manager.mkPattern([freshApp])],
508
+ }),
509
+ );
510
+ result.dependencies.push(dependency, dependency);
511
+ },
512
+ () => [],
513
+ );
514
+ return true;
515
+ }
516
+ }
517
+
518
+ export const findGoalMacros = (manager: AstManager, goal: Goal) => {
519
+ const macros = new MacroManager(manager);
520
+ const found = macros.findInGoal([...goal.forms.items], goal.dependencies);
521
+ goal.reset();
522
+ for (const [index, form] of found.forms.items.entries())
523
+ goal.assert(form, found.dependencies[index]);
524
+ found.forms.reset();
525
+ const definitions = macros.getInterpretations();
526
+ goal.addDefinitions(definitions);
527
+ for (const definition of definitions) manager.decRef(definition.def);
528
+ macros.release();
529
+ goal.depth++;
530
+ };