tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c

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 (509) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +4 -1
  5. package/dist/index.d.ts +4 -1
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +143 -55
  11. package/dist/run.cjs +43 -43
  12. package/dist/run.js +45 -45
  13. package/dist/transfer.cjs +29 -26
  14. package/dist/transfer.js +43 -40
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/bags.ts +46 -28
  20. package/src/check-trace.ts +2 -16
  21. package/src/check.ts +336 -88
  22. package/src/cli/runtime-invariants.ts +20 -56
  23. package/src/cli/tlapm.ts +261 -68
  24. package/src/cli/tlc-arguments.ts +2 -2
  25. package/src/cli/tlc-output.ts +4 -5
  26. package/src/cli/tlc-usage.ts +0 -1
  27. package/src/cli/tlc.ts +26 -7
  28. package/src/dependencies.ts +23 -2
  29. package/src/dfid.ts +9 -2
  30. package/src/environment.ts +27 -5
  31. package/src/errors.ts +1 -1
  32. package/src/evaluate.ts +9 -3
  33. package/src/exit-codes.ts +5 -2
  34. package/src/instances.ts +1 -1
  35. package/src/levels.ts +134 -86
  36. package/src/liveness-checker.ts +572 -204
  37. package/src/liveness.ts +47 -32
  38. package/src/obligations/action.ts +0 -2
  39. package/src/obligations/anonymize.ts +2 -6
  40. package/src/obligations/equality.ts +0 -2
  41. package/src/obligations/expression.ts +0 -2
  42. package/src/obligations/format.ts +0 -2
  43. package/src/obligations/generate.ts +0 -2
  44. package/src/obligations/index.ts +5 -3
  45. package/src/obligations/levels.ts +0 -2
  46. package/src/obligations/module.ts +0 -2
  47. package/src/obligations/normalize.ts +0 -2
  48. package/src/obligations/operators.ts +0 -2
  49. package/src/obligations/pragma.ts +2 -2
  50. package/src/obligations/printer.ts +0 -2
  51. package/src/obligations/proof.ts +0 -2
  52. package/src/obligations/regroup.ts +0 -2
  53. package/src/obligations/simplify.ts +0 -2
  54. package/src/obligations/subexpression.ts +0 -2
  55. package/src/obligations/substitution.ts +0 -2
  56. package/src/obligations/temporal.ts +0 -2
  57. package/src/obligations/tuples.ts +0 -2
  58. package/src/parallel-worker.ts +8 -2
  59. package/src/parallel.ts +7 -2
  60. package/src/parser.ts +224 -82
  61. package/src/pretty-print.ts +1 -1
  62. package/src/prover/deciders.ts +1 -8
  63. package/src/prover/isabelle/encode.ts +0 -2
  64. package/src/prover/isabelle/isar/attrib.ts +86 -49
  65. package/src/prover/isabelle/isar/context.ts +25 -26
  66. package/src/prover/isabelle/isar/induct.ts +2 -9
  67. package/src/prover/isabelle/isar/method.ts +5 -9
  68. package/src/prover/isabelle/isar/proof.ts +33 -18
  69. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  70. package/src/prover/isabelle/isar/theory.ts +16 -17
  71. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  72. package/src/prover/isabelle/isar/type-check.ts +0 -2
  73. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  74. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  75. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  76. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  77. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  78. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  79. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  80. package/src/prover/isabelle/provers/classical.ts +1 -3
  81. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  82. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  83. package/src/prover/isabelle/pure/consts.ts +0 -2
  84. package/src/prover/isabelle/pure/conv.ts +0 -2
  85. package/src/prover/isabelle/pure/drule.ts +0 -2
  86. package/src/prover/isabelle/pure/envir.ts +0 -2
  87. package/src/prover/isabelle/pure/goal.ts +0 -2
  88. package/src/prover/isabelle/pure/logic.ts +0 -2
  89. package/src/prover/isabelle/pure/name.ts +0 -2
  90. package/src/prover/isabelle/pure/net.ts +0 -2
  91. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  92. package/src/prover/isabelle/pure/pattern.ts +0 -2
  93. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  94. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  95. package/src/prover/isabelle/pure/search.ts +0 -2
  96. package/src/prover/isabelle/pure/seq.ts +0 -2
  97. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  98. package/src/prover/isabelle/pure/table.ts +0 -2
  99. package/src/prover/isabelle/pure/tactic.ts +0 -2
  100. package/src/prover/isabelle/pure/tactical.ts +0 -2
  101. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  102. package/src/prover/isabelle/pure/term.ts +0 -2
  103. package/src/prover/isabelle/pure/thm.ts +0 -2
  104. package/src/prover/isabelle/pure/type.ts +0 -2
  105. package/src/prover/isabelle/pure/unify.ts +0 -2
  106. package/src/prover/isabelle/pure/variable.ts +0 -2
  107. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  108. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  109. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  110. package/src/prover/ocaml.ts +4 -1
  111. package/src/prover/prep/action.ts +1 -0
  112. package/src/prover/prep/methods.ts +50 -3
  113. package/src/prover/prep/normalize.ts +4 -1
  114. package/src/prover/prove.ts +58 -32
  115. package/src/prover/ptl/decide.ts +43 -63
  116. package/src/prover/smt/data.ts +51 -45
  117. package/src/prover/smt/encode.ts +1 -2
  118. package/src/prover/smt/rewrite.ts +3 -7
  119. package/src/prover/smt/simplify.ts +1 -1
  120. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  121. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  122. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  123. package/src/prover/smt/solver/act-cache.ts +0 -1
  124. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  125. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  126. package/src/prover/smt/solver/aig.ts +2 -3
  127. package/src/prover/smt/solver/arith-rewriter.ts +3 -6
  128. package/src/prover/smt/solver/arith-terms.ts +0 -2
  129. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  130. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  131. package/src/prover/smt/solver/asserted-formulas.ts +9 -3
  132. package/src/prover/smt/solver/ast-lt.ts +1 -2
  133. package/src/prover/smt/solver/ast-util.ts +3 -3
  134. package/src/prover/smt/solver/ast.ts +112 -156
  135. package/src/prover/smt/solver/auf-solver.ts +0 -1
  136. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  137. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  138. package/src/prover/smt/solver/bound-manager.ts +39 -29
  139. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  140. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  141. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  142. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  143. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  144. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  145. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  146. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  147. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  148. package/src/prover/smt/solver/card2bv.ts +1 -4
  149. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  150. package/src/prover/smt/solver/cg-table.ts +19 -16
  151. package/src/prover/smt/solver/check-logic.ts +6 -2
  152. package/src/prover/smt/solver/clause.ts +0 -1
  153. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  154. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  155. package/src/prover/smt/solver/context.ts +41 -14
  156. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  157. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  158. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  159. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/demodulator.ts +2 -5
  161. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  162. package/src/prover/smt/solver/der.ts +0 -1
  163. package/src/prover/smt/solver/diff-neq.ts +1 -3
  164. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  165. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  166. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  167. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  168. package/src/prover/smt/solver/e-matching.ts +6 -7
  169. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  170. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  171. package/src/prover/smt/solver/enode.ts +15 -2
  172. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  173. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  174. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  175. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  176. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  177. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  178. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  179. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  180. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  182. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  183. package/src/prover/smt/solver/euf/egraph.ts +68 -43
  184. package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
  185. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  186. package/src/prover/smt/solver/euf/mam.ts +7 -55
  187. package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
  188. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  189. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  190. package/src/prover/smt/solver/euf/q-solver.ts +2 -2
  191. package/src/prover/smt/solver/euf/th-solver.ts +1 -10
  192. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  193. package/src/prover/smt/solver/expr-ref.ts +0 -1
  194. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  195. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  196. package/src/prover/smt/solver/factor.ts +37 -26
  197. package/src/prover/smt/solver/fd-solver.ts +3 -5
  198. package/src/prover/smt/solver/fingerprints.ts +0 -1
  199. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  200. package/src/prover/smt/solver/flat-literals.ts +0 -1
  201. package/src/prover/smt/solver/fm-tactic.ts +19 -14
  202. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  203. package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
  204. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  205. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  206. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  207. package/src/prover/smt/solver/goal.ts +3 -2
  208. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  209. package/src/prover/smt/solver/guard-set.ts +0 -1
  210. package/src/prover/smt/solver/hash.ts +0 -1
  211. package/src/prover/smt/solver/hashtable.ts +0 -1
  212. package/src/prover/smt/solver/inf-eps.ts +1 -2
  213. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  214. package/src/prover/smt/solver/internalizer.ts +41 -3
  215. package/src/prover/smt/solver/lackr.ts +0 -2
  216. package/src/prover/smt/solver/lbool.ts +0 -1
  217. package/src/prover/smt/solver/lia2card.ts +0 -1
  218. package/src/prover/smt/solver/lia2pb.ts +18 -5
  219. package/src/prover/smt/solver/literal.ts +0 -1
  220. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  221. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  222. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  223. package/src/prover/smt/solver/lp/containers.ts +7 -2
  224. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  225. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  226. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  227. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  228. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  229. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  230. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  231. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  232. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  233. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  234. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  235. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  236. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  237. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  238. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  239. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  240. package/src/prover/smt/solver/lp/nex.ts +2 -2
  241. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  243. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  244. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  245. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  246. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  247. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  248. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  249. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  250. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  253. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  254. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  255. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  256. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  257. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  258. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  260. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  261. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  262. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  263. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  264. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  265. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  266. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  267. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  268. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  269. package/src/prover/smt/solver/macro-finder.ts +1 -4
  270. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  271. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  272. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  273. package/src/prover/smt/solver/max-cliques.ts +0 -2
  274. package/src/prover/smt/solver/maxcore.ts +5 -14
  275. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  276. package/src/prover/smt/solver/maxlex.ts +0 -8
  277. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  278. package/src/prover/smt/solver/maxsmt.ts +0 -1
  279. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  280. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  281. package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
  282. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  283. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  284. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  285. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  286. package/src/prover/smt/solver/model-checker.ts +0 -1
  287. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  288. package/src/prover/smt/solver/model-finder.ts +0 -1
  289. package/src/prover/smt/solver/model-generator.ts +3 -2
  290. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  291. package/src/prover/smt/solver/model-printer.ts +0 -1
  292. package/src/prover/smt/solver/mpf.ts +2 -5
  293. package/src/prover/smt/solver/mus.ts +1 -3
  294. package/src/prover/smt/solver/muz/dl-context.ts +67 -9
  295. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  296. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  297. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  298. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  299. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  300. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  301. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  302. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  303. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  304. package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
  305. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  306. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  307. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  308. package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
  309. package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
  310. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
  311. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  312. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  313. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  314. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
  315. package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
  316. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  317. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  318. package/src/prover/smt/solver/nlqsat.ts +4 -4
  319. package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
  320. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  321. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  322. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  323. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  324. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  325. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  326. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  327. package/src/prover/smt/solver/nlsat/solver.ts +112 -99
  328. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  329. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  330. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  331. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  332. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  333. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  334. package/src/prover/smt/solver/nnf.ts +0 -1
  335. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  336. package/src/prover/smt/solver/occf.ts +0 -1
  337. package/src/prover/smt/solver/opt-context.ts +15 -10
  338. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  339. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  340. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  341. package/src/prover/smt/solver/opt-solver.ts +22 -11
  342. package/src/prover/smt/solver/opt-value.ts +0 -1
  343. package/src/prover/smt/solver/optsmt.ts +13 -12
  344. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  345. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  346. package/src/prover/smt/solver/pb-rewriter.ts +14 -20
  347. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  348. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  349. package/src/prover/smt/solver/probes.ts +4 -7
  350. package/src/prover/smt/solver/propagate-values.ts +4 -1
  351. package/src/prover/smt/solver/proto-model.ts +6 -7
  352. package/src/prover/smt/solver/pull-quant.ts +0 -1
  353. package/src/prover/smt/solver/purify-arith.ts +50 -16
  354. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  355. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  356. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  357. package/src/prover/smt/solver/qe-lite.ts +0 -1
  358. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  359. package/src/prover/smt/solver/qe.ts +48 -57
  360. package/src/prover/smt/solver/qel.ts +0 -1
  361. package/src/prover/smt/solver/qi-queue.ts +0 -1
  362. package/src/prover/smt/solver/qsat.ts +70 -91
  363. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  364. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  365. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  366. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  367. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  368. package/src/prover/smt/solver/random-gen.ts +0 -1
  369. package/src/prover/smt/solver/rational.ts +17 -1
  370. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  371. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  372. package/src/prover/smt/solver/reduce-args.ts +0 -1
  373. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  374. package/src/prover/smt/solver/ref-vector.ts +0 -1
  375. package/src/prover/smt/solver/relevancy.ts +0 -1
  376. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  377. package/src/prover/smt/solver/rewriter.ts +1 -2
  378. package/src/prover/smt/solver/rlimit.ts +13 -1
  379. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  380. package/src/prover/smt/solver/sat/big.ts +0 -1
  381. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  382. package/src/prover/smt/solver/sat/clause.ts +1 -6
  383. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  384. package/src/prover/smt/solver/sat/config.ts +4 -7
  385. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  386. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  387. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  388. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
  389. package/src/prover/smt/solver/sat/model-converter.ts +2 -18
  390. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  391. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  392. package/src/prover/smt/solver/sat/probing.ts +22 -21
  393. package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
  394. package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
  395. package/src/prover/smt/solver/sat/scc.ts +0 -1
  396. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  397. package/src/prover/smt/solver/sat/solver.ts +45 -68
  398. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  399. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  400. package/src/prover/smt/solver/search-tree.ts +0 -1
  401. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  402. package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
  403. package/src/prover/smt/solver/seq-derive.ts +9 -15
  404. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  405. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  406. package/src/prover/smt/solver/seq-factory.ts +0 -1
  407. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  408. package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
  409. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
  410. package/src/prover/smt/solver/seq-re-util.ts +2 -5
  411. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  412. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  413. package/src/prover/smt/solver/seq-rewriter.ts +31 -34
  414. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  415. package/src/prover/smt/solver/seq-subset.ts +0 -1
  416. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  417. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  418. package/src/prover/smt/solver/smt-kernel.ts +8 -3
  419. package/src/prover/smt/solver/smt-logics.ts +0 -1
  420. package/src/prover/smt/solver/smt-setup.ts +18 -14
  421. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  422. package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
  423. package/src/prover/smt/solver/smtlib-script.ts +957 -750
  424. package/src/prover/smt/solver/solve-eqs.ts +11 -19
  425. package/src/prover/smt/solver/solver.ts +1 -2
  426. package/src/prover/smt/solver/static-features.ts +0 -2
  427. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  428. package/src/prover/smt/solver/tactic.ts +77 -18
  429. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  430. package/src/prover/smt/solver/theory-array.ts +25 -60
  431. package/src/prover/smt/solver/theory-bv.ts +15 -54
  432. package/src/prover/smt/solver/theory-char.ts +0 -1
  433. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  434. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  435. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  436. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  437. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  438. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
  439. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  440. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  441. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
  442. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  443. package/src/prover/smt/solver/theory-lra.ts +0 -2
  444. package/src/prover/smt/solver/theory-pb.ts +12 -11
  445. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  446. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  447. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  448. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  449. package/src/prover/smt/solver/theory-seq-state.ts +8 -26
  450. package/src/prover/smt/solver/theory-seq.ts +32 -55
  451. package/src/prover/smt/solver/theory.ts +16 -2
  452. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  453. package/src/prover/smt/solver/var-subst.ts +2 -3
  454. package/src/prover/smt/table.ts +3 -2
  455. package/src/prover/zenon/decide.ts +9 -13
  456. package/src/prover/zenon/encode.ts +0 -2
  457. package/src/prover/zenon/eqrel.ts +0 -2
  458. package/src/prover/zenon/equality-rules.ts +24 -2
  459. package/src/prover/zenon/expr.ts +21 -2
  460. package/src/prover/zenon/index-table.ts +7 -4
  461. package/src/prover/zenon/isar-case.ts +1 -3
  462. package/src/prover/zenon/isar.ts +2 -4
  463. package/src/prover/zenon/llproof.ts +0 -2
  464. package/src/prover/zenon/mltoll.ts +0 -2
  465. package/src/prover/zenon/node.ts +12 -13
  466. package/src/prover/zenon/parse.ts +0 -2
  467. package/src/prover/zenon/phrase.ts +1 -3
  468. package/src/prover/zenon/proof.ts +0 -2
  469. package/src/prover/zenon/propositional-rules.ts +0 -2
  470. package/src/prover/zenon/rules.ts +2 -3
  471. package/src/prover/zenon/search.ts +0 -2
  472. package/src/prover/zenon/tla/functions.ts +0 -2
  473. package/src/prover/zenon/tla/llproof.ts +0 -2
  474. package/src/prover/zenon/tla/records.ts +0 -2
  475. package/src/prover/zenon/tla/rewrites.ts +0 -2
  476. package/src/prover/zenon/tla/sets.ts +1 -3
  477. package/src/prover/zenon/tla/terms.ts +0 -2
  478. package/src/prover/zenon/tla/tla.ts +0 -2
  479. package/src/resolve.ts +264 -77
  480. package/src/runtime.ts +6 -0
  481. package/src/sany/generation.ts +1 -13
  482. package/src/sany/generator-definitions.ts +2 -1
  483. package/src/sany/generator-expressions.ts +30 -27
  484. package/src/sany/generator-proofs.ts +1 -1
  485. package/src/sany/generator.ts +2 -1
  486. package/src/sany/levels.ts +0 -2
  487. package/src/sany/linter.ts +0 -2
  488. package/src/sany/nodes.ts +1 -1
  489. package/src/sany/selectors.ts +6 -5
  490. package/src/search.ts +198 -45
  491. package/src/simulate.ts +3 -0
  492. package/src/standard-definitions.ts +4 -0
  493. package/src/state-graph.ts +0 -2
  494. package/src/subexpressions.ts +165 -78
  495. package/src/successors.ts +1 -1
  496. package/src/symmetry.ts +2 -2
  497. package/src/tableau.ts +2 -2
  498. package/src/tlc/fingerprint.ts +81 -9
  499. package/src/tlc/jar-data.ts +12 -0
  500. package/src/tlc/order.ts +14 -3
  501. package/src/tlc/summary.ts +29 -14
  502. package/src/tlc/tlcext-operators.ts +61 -16
  503. package/src/tlc/trace-spec.ts +2 -3
  504. package/src/typed-tier.ts +6541 -0
  505. package/src/typescript/types.ts +2 -2
  506. package/src/values.ts +1 -1
  507. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  508. package/src/prover/smt/solver/z3-license.txt +0 -10
  509. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- import { TlaSyntaxError } from "../../errors";
2
1
  import type { DecideOptions, Verdict } from "../verdict";
3
2
  import { getSatisfiability, type BinaryKind, type PtlFormula } from "./tableau";
4
3
 
@@ -39,90 +38,71 @@ const RESERVED = /^(skolem|hidden|constant|NV_V\w*|NVV\w*)$/;
39
38
 
40
39
  const MAX_LS4_IDENTIFIER = 31;
41
40
 
42
- const parseLs4 = (text: string): PtlFormula => {
41
+ // ptl_to_trp and LS4 reach no verdict on text that this reads as undefined.
42
+ const parseLs4 = (text: string): PtlFormula | undefined => {
43
43
  const tokens = text.replace(/;.*/g, "").match(/<=>|<->|=>|->|[A-Za-z]\w*|\S/g) ?? [];
44
44
  let position = 0;
45
- const reject = (reason: string): never => {
46
- throw new TlaSyntaxError(`LS4 reaches no verdict: ${reason}`);
47
- };
48
- const peek = () => tokens[position] ?? "";
49
- const take = (expected?: string) => {
50
- const token = tokens[position++];
51
- if (token === undefined || (expected !== undefined && token !== expected))
52
- return reject(`expected ${expected ?? "a formula"}, found ${token ?? "the end"}`);
53
- return token;
54
- };
55
- const checkIdentifier = (token: string) => {
56
- if (!/^[A-Za-z]/.test(token) || KEYWORDS.has(token))
57
- reject(`expected an identifier, found ${token}`);
58
- if (RESERVED.test(token)) reject(`${token} is reserved`);
59
- return token;
60
- };
61
- const takeIdentifier = () => checkIdentifier(take());
45
+ const isIdentifier = (token: string | undefined): token is string =>
46
+ token !== undefined && /^[A-Za-z]/.test(token) && !KEYWORDS.has(token) && !RESERVED.test(token);
62
47
  const takeList = () => {
63
- const items = [takeIdentifier()];
64
- while (peek() === ",") {
65
- take();
66
- items.push(takeIdentifier());
48
+ const items: string[] = [];
49
+ for (;;) {
50
+ const token = tokens[position++];
51
+ if (!isIdentifier(token)) return undefined;
52
+ items.push(token);
53
+ if (tokens[position] !== ",") return items;
54
+ position += 1;
67
55
  }
68
- return items;
69
56
  };
70
- const parsePrefix = (): PtlFormula => {
71
- const token = take();
57
+ const parsePrefix = (): PtlFormula | undefined => {
58
+ const token = tokens[position++];
59
+ if (token === undefined) return undefined;
72
60
  const prefix = PREFIX_OPERATORS.get(token);
73
61
  if (prefix !== undefined) {
74
62
  const body = parsePrefix();
75
- return prefix === "Past"
76
- ? reject(`ptl_to_trp does not translate ${token}`)
77
- : { kind: prefix, body };
63
+ // ptl_to_trp does not translate the past operators.
64
+ return body === undefined || prefix === "Past" ? undefined : { kind: prefix, body };
78
65
  }
79
66
  if (token === "!" || token === "?") {
80
- take("[");
81
- // foyacc.mly checks only that the last variable of the list is uppercase.
67
+ if (tokens[position++] !== "[") return undefined;
82
68
  const variables = takeList();
83
- if (!/^[A-Z]/.test(variables[variables.length - 1]))
84
- reject(`${variables[variables.length - 1]} is not uppercase`);
85
- take("]");
86
- return parsePrefix();
69
+ // foyacc.mly checks only that the last variable of the list is uppercase.
70
+ return variables !== undefined &&
71
+ /^[A-Z]/.test(variables[variables.length - 1]) &&
72
+ tokens[position++] === "]"
73
+ ? parsePrefix()
74
+ : undefined;
87
75
  }
88
76
  if (token === "(") {
89
77
  const inner = parseBinary(0);
90
- take(")");
91
- return inner;
78
+ return tokens[position++] === ")" ? inner : undefined;
92
79
  }
93
80
  if (token === "True" || token === "False") return { kind: "Constant", value: token === "True" };
94
- const name = checkIdentifier(token);
95
- if (peek() === "(") {
96
- take();
97
- takeList();
98
- take(")");
99
- reject(`LS4 does not read the predicate ${name} with arguments`);
100
- }
101
- if (name.length > MAX_LS4_IDENTIFIER) reject(`the identifier ${name} is too long`);
102
- return { kind: "Atom", name };
81
+ // LS4 reads no predicate with arguments and no identifier longer than 31 characters.
82
+ return isIdentifier(token) && tokens[position] !== "(" && token.length <= MAX_LS4_IDENTIFIER
83
+ ? { kind: "Atom", name: token }
84
+ : undefined;
103
85
  };
104
- const parseOperators = (level: number, left: PtlFormula): PtlFormula => {
105
- const kind = BINARY_LEVELS[level].get(peek());
106
- if (kind === undefined) return left;
107
- take();
108
- return parseOperators(level, { kind, left, right: parseBinary(level + 1) });
86
+ const parseOperators = (level: number, left: PtlFormula | undefined): PtlFormula | undefined => {
87
+ const kind = BINARY_LEVELS[level].get(tokens[position] ?? "");
88
+ if (left === undefined || kind === undefined) return left;
89
+ position += 1;
90
+ const right = parseBinary(level + 1);
91
+ return right === undefined ? undefined : parseOperators(level, { kind, left, right });
109
92
  };
110
- const parseBinary = (level: number): PtlFormula =>
93
+ const parseBinary = (level: number): PtlFormula | undefined =>
111
94
  level === BINARY_LEVELS.length ? parsePrefix() : parseOperators(level, parseBinary(level + 1));
112
95
  const formula = parseBinary(0);
113
- if (position < tokens.length) reject(`expected the end, found ${peek()}`);
114
- return formula;
96
+ return position < tokens.length ? undefined : formula;
115
97
  };
116
98
 
117
99
  export const decidePtl = (text: string, options: DecideOptions): Verdict => {
118
100
  const deadline = performance.now() + options.timeLimitMs;
119
- try {
120
- return getSatisfiability(
121
- parseLs4(text),
122
- () => options.signal?.aborted === true || performance.now() > deadline,
123
- );
124
- } catch (error) {
125
- if (error instanceof TlaSyntaxError) return "unknown";
126
- throw error;
127
- }
101
+ const formula = parseLs4(text);
102
+ return formula === undefined
103
+ ? "unknown"
104
+ : getSatisfiability(
105
+ formula,
106
+ () => options.signal?.aborted === true || performance.now() > deadline,
107
+ );
128
108
  };
@@ -46,6 +46,7 @@ import {
46
46
  UNION,
47
47
  } from "./format";
48
48
  import { getUntypedSpec } from "./arithmetic";
49
+ import type { SmtEncoding } from "./rewrite";
49
50
  import { axiom, type Axiom } from "./table";
50
51
  import { getTypeKey, getTypeName, IDV, type Type } from "./types";
51
52
 
@@ -58,12 +59,11 @@ export interface SymbolSpec {
58
59
  }
59
60
 
60
61
  export interface CollectState {
61
- isArithmetic: boolean;
62
- isSetExtensional: boolean;
62
+ encoding: SmtEncoding;
63
63
  recordFields: Map<string, string[]>;
64
64
  setTypes: Map<string, Type>;
65
65
  strings: string[];
66
- integers: number[];
66
+ integers: string[];
67
67
  isFunConstr: boolean;
68
68
  isFunSet: boolean;
69
69
  isExcept: boolean;
@@ -434,7 +434,8 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
434
434
  axiom("SetOfIntro", [count], undefined),
435
435
  axiom("SetOfElim", [count], undefined),
436
436
  ];
437
- if (!state.isSetExtensional) return createSpec(getOmittedDeclaration(name), ["Mem"], axioms);
437
+ if (!state.encoding.isSetExtensional)
438
+ return createSpec(getOmittedDeclaration(name), ["Mem"], axioms);
438
439
  return createSpec(
439
440
  getOmittedDeclaration(name),
440
441
  ["Mem", "IsSetOf"],
@@ -466,23 +467,27 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
466
467
  }
467
468
  const integer = /^IntLit_(\d+)$/.exec(name);
468
469
  if (integer) {
469
- const value = Number(integer[1]);
470
+ const value = integer[1];
470
471
  const distinct = state.integers.map((other) =>
471
- axiom("IntLitDistinct", [other, value], `(distinct ${tla(`IntLit_${other}`)} ${symbol})`),
472
+ axiom(
473
+ "IntLitDistinct",
474
+ [BigInt(other), BigInt(value)],
475
+ `(distinct ${tla(`IntLit_${other}`)} ${symbol})`,
476
+ ),
472
477
  );
473
478
  state.integers.push(value);
474
479
  const zero = tla("IntLit_0");
475
- const isPositivityNeeded = value === 0 && !state.isArithmetic;
480
+ const isPositivityNeeded = value === "0" && !state.encoding.isArithmetic;
476
481
  return declareSpec(
477
482
  name,
478
483
  0,
479
484
  ["Mem", "IntSet", "IntLit_0", "IntLteq", ...(isPositivityNeeded ? ["IntLit_1"] : [])],
480
485
  [
481
- axiom("IntLitIsint", [value], `(${MEM} ${symbol} ${INT_SET})`),
486
+ axiom("IntLitIsint", [BigInt(value)], `(${MEM} ${symbol} ${INT_SET})`),
482
487
  axiom(
483
488
  "IntLitZeroCmp",
484
- [value],
485
- value === 0 ? `(${INT_LTEQ} ${symbol} ${zero})` : `(${INT_LTEQ} ${zero} ${symbol})`,
489
+ [BigInt(value)],
490
+ value === "0" ? `(${INT_LTEQ} ${symbol} ${zero})` : `(${INT_LTEQ} ${zero} ${symbol})`,
486
491
  ),
487
492
  ...distinct,
488
493
  ...(isPositivityNeeded
@@ -501,7 +506,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
501
506
  if (tuple) {
502
507
  const count = Number(tuple[1]);
503
508
  state.tuples.push(count);
504
- const indexes = state.isArithmetic
509
+ const indexes = state.encoding.isArithmetic
505
510
  ? ["Cast_Int"]
506
511
  : count === 0
507
512
  ? ["IntLit_0"]
@@ -514,7 +519,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
514
519
  name,
515
520
  count,
516
521
  deps,
517
- getTupleAxioms(count, state.isExcept, state.isArithmetic),
522
+ getTupleAxioms(count, state.isExcept, state.encoding.isArithmetic),
518
523
  );
519
524
  }
520
525
  const product = /^Product_(\d+)$/.exec(name);
@@ -527,14 +532,14 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
527
532
  "Mem",
528
533
  `Tuple_${count}`,
529
534
  "FunApp",
530
- ...(state.isArithmetic ? ["Cast_Int", "Proj_Int"] : getLiteralNames(count)),
535
+ ...(state.encoding.isArithmetic ? ["Cast_Int", "Proj_Int"] : getLiteralNames(count)),
531
536
  ],
532
537
  getComponentSet(
533
538
  "Product",
534
539
  [count],
535
540
  symbol,
536
541
  tla(`Tuple_${count}`),
537
- getIntegers(count, state.isArithmetic),
542
+ getIntegers(count, state.encoding.isArithmetic),
538
543
  "t",
539
544
  ),
540
545
  );
@@ -590,7 +595,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
590
595
  }
591
596
  const anonymous = state.anonymous.get(name);
592
597
  if (anonymous !== undefined) return declareSpec(name, anonymous, [], []);
593
- const untyped = state.isArithmetic ? undefined : getUntypedSpec(name);
598
+ const untyped = state.encoding.isArithmetic ? undefined : getUntypedSpec(name);
594
599
  if (untyped) return untyped;
595
600
  const known = STATIC_SPECS.get(name);
596
601
  if (known) return known;
@@ -617,7 +622,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
617
622
  "IntSet",
618
623
  "NatSet",
619
624
  "Tuple_0",
620
- state.isArithmetic ? "Proj_Int" : "IntLteq",
625
+ state.encoding.isArithmetic ? "Proj_Int" : "IntLteq",
621
626
  ],
622
627
  [
623
628
  axiom("SeqSelectseqTyping", [], undefined),
@@ -628,48 +633,49 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
628
633
  ],
629
634
  );
630
635
  case "Mem":
631
- if (!state.isSetExtensional) return declareSpec(name, 2, [], [], "Bool");
632
636
  return declareSpec(
633
- "Mem",
637
+ name,
634
638
  2,
635
- ["SetExtTrigger"],
636
- [
637
- axiom(
638
- "SetExt",
639
- [],
640
- `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
641
- ),
642
- ],
639
+ state.encoding.isSetExtensional ? ["SetExtTrigger"] : [],
640
+ state.encoding.isSetExtensional
641
+ ? [
642
+ axiom(
643
+ "SetExt",
644
+ [],
645
+ `(forall ((x Idv) (y Idv)) (! (=> (forall ((z Idv)) (= (${MEM} z x) (${MEM} z y))) (= x y)) :pattern ((${SET_EXT_TRIGGER} x y))))`,
646
+ ),
647
+ ]
648
+ : [],
643
649
  "Bool",
644
650
  );
645
651
  case "Cap":
646
- if (!state.isSetExtensional)
647
- return declareSpec(
648
- name,
649
- 2,
650
- ["Mem"],
651
- [getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`)],
652
- );
653
652
  return declareSpec(
654
- "Cap",
653
+ name,
655
654
  2,
656
- ["Mem", "SetEnum_0", "SetExtTrigger"],
655
+ ["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
657
656
  [
658
657
  getSetOperationDef("Cap", `(and (${MEM} x a) (${MEM} x b))`),
659
- axiom(
660
- "DisjointTrigger",
661
- [],
662
- `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
663
- ),
658
+ ...(state.encoding.isSetExtensional
659
+ ? [
660
+ axiom(
661
+ "DisjointTrigger",
662
+ [],
663
+ `(forall ((x Idv) (y Idv)) (! (${SET_EXT_TRIGGER} (${CAP} x y) ${tla("SetEnum_0")}) :pattern ((${CAP} x y))))`,
664
+ ),
665
+ ]
666
+ : []),
664
667
  ],
665
668
  );
666
669
  case "SetSt":
667
- if (!state.isSetExtensional)
668
- return createSpec(getOmittedDeclaration(name), ["Mem"], [axiom("SetStDef", [], undefined)]);
669
670
  return createSpec(
670
671
  getOmittedDeclaration(name),
671
- ["Mem", "SetEnum_0", "SetExtTrigger"],
672
- [axiom("SetStDef", [], undefined), axiom("EmptyComprehensionTrigger", [], undefined)],
672
+ ["Mem", ...(state.encoding.isSetExtensional ? ["SetEnum_0", "SetExtTrigger"] : [])],
673
+ [
674
+ axiom("SetStDef", [], undefined),
675
+ ...(state.encoding.isSetExtensional
676
+ ? [axiom("EmptyComprehensionTrigger", [], undefined)]
677
+ : []),
678
+ ],
673
679
  );
674
680
  case "FunSet":
675
681
  state.isFunSet = true;
@@ -734,7 +740,7 @@ export const getSymbolSpec = (name: string, state: CollectState): SymbolSpec =>
734
740
  [],
735
741
  `(forall ((f Idv) (x Idv) (y Idv) (z Idv)) (! (=> (${MEM} z (${FUN_DOM} f)) (and (=> (= z x) (= (${FUN_APP} ${updated} z) y)) (=> (distinct z x) (= (${FUN_APP} ${updated} z) (${FUN_APP} f z))))) :pattern ((${FUN_APP} ${updated} z)) :pattern (${updated} (${FUN_APP} f z))))`,
736
742
  ),
737
- ...state.tuples.flatMap((count) => getTupleExcepts(count, state.isArithmetic)),
743
+ ...state.tuples.flatMap((count) => getTupleExcepts(count, state.encoding.isArithmetic)),
738
744
  ...state.records.flatMap(getRecordExcepts),
739
745
  ],
740
746
  );
@@ -82,8 +82,7 @@ const sortRecordFields = (expression: Expr): Expr =>
82
82
 
83
83
  const collectSymbols = (entries: Entry[], encoder: Encoder) => {
84
84
  const state: CollectState = {
85
- isArithmetic: encoder.encoding.isArithmetic,
86
- isSetExtensional: encoder.encoding.isSetExtensional,
85
+ encoding: encoder.encoding,
87
86
  recordFields: encoder.recordFields,
88
87
  setTypes: encoder.setTypes,
89
88
  strings: [],
@@ -296,7 +296,7 @@ const invert = (mode: Mode): Mode => ({
296
296
  : "Neither",
297
297
  });
298
298
 
299
- export const encodeIdv = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
299
+ const encodeIdv = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
300
300
  toIdv(encode(encoder, expression, env, clearPolarity(mode)));
301
301
 
302
302
  export const encodeBool = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode) =>
@@ -917,12 +917,7 @@ const encodeSequent = (
917
917
  );
918
918
  };
919
919
 
920
- export const encode = (
921
- encoder: Encoder,
922
- expression: Expr,
923
- env: Env | undefined,
924
- mode: Mode,
925
- ): Term => {
920
+ const encode = (encoder: Encoder, expression: Expr, env: Env | undefined, mode: Mode): Term => {
926
921
  switch (expression.kind) {
927
922
  case "Ix":
928
923
  return encodeReference(encoder, getBinding(env, expression.index), [], env, mode);
@@ -1093,6 +1088,7 @@ export const encode = (
1093
1088
  return wrapIdv(tla(`StrLit_${expression.value}`), getTypedOnly(encoder, STRING));
1094
1089
  case "Num":
1095
1090
  if (expression.fraction !== "") throw new TlaUnsupportedError("a real number");
1091
+ // Deviation from tlapm: its int_of_string fails the obligation for a literal above 2^62 - 1.
1096
1092
  // Type.Synthesize gives a number no type when arithmetic is off.
1097
1093
  if (!encoder.encoding.isArithmetic)
1098
1094
  return wrapIdv(tla(`IntLit_${BigInt(expression.integer)}`));
@@ -307,7 +307,7 @@ const getMembership = (polarity: Polarity, element: Expr, set: Expr): Expr | und
307
307
  items: [
308
308
  builtin("Eq", [
309
309
  left,
310
- { kind: "Tuple", elements: factors.map((_, index) => component(index)) },
310
+ { kind: "Tuple", elements: factors.map((_value, index) => component(index)) },
311
311
  ]),
312
312
  ...factors.map((factor, index) => mem(component(index), factor)),
313
313
  ],
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ackermannization/ackermannize_bv_tactic.cpp,
2
- // src/tactic/smtlogics/qfufbv_tactic.cpp), MIT license, see z3-license.txt.
3
1
  import { SmtTacticError } from "../../../errors";
4
2
  import type { AstManager } from "./ast";
5
3
  import { convertAckrModel } from "./ackr-model-converter";
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/ackermannization/ackr_helper.h, src/ackermannization/ackr_helper.cpp,
2
- // src/ackermannization/ackr_info.h, src/ackermannization/ackr_bound_probe.cpp), MIT license, see
3
- // z3-license.txt.
4
1
  import {
5
2
  type AstManager,
6
3
  FAMILY_USER,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ackermannization/ackr_model_converter.cpp), MIT license, see z3-license.txt.
2
1
  import { type AstManager, OP_CONST_ARRAY, OP_SELECT, OP_STORE } from "./ast";
3
2
  import type { AckrInfo } from "./ackr-helper";
4
3
  import { mkArrayApp } from "./array-decl-plugin";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/act_cache.cpp, src/util/chashtable.h), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
  import { shrink } from "./array";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/tactic/arith/add_bounds_tactic.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  type AstManager,
4
3
  KIND_APP,
@@ -1,5 +1,4 @@
1
- // Ported from Z3 (src/tactic/aig/aig_tactic.cpp), MIT license, see z3-license.txt.
2
- import { SmtTacticError, SmtUnsupportedError } from "../../../errors";
1
+ import { SmtTacticError } from "../../../errors";
3
2
  import type { AstManager } from "./ast";
4
3
  import { AigManager } from "./aig";
5
4
  import { getNumExprs } from "./ast-util";
@@ -7,32 +6,42 @@ import type { Goal } from "./goal";
7
6
  import { RefVector } from "./ref-vector";
8
7
  import type { Tactic } from "./tactic";
9
8
 
10
- // Z3 rewrites each formula with a dependency on its own, but the goal does not track dependencies,
11
- // which only named assertions under unsat cores have.
12
9
  export const createAigTactic =
13
10
  (manager: AstManager): Tactic =>
14
11
  (goal: Goal) => {
15
12
  if (goal.isProofsEnabled) throw new SmtTacticError("aig does not support proof production");
16
- if (goal.isCoresEnabled) throw new SmtUnsupportedError("aig with unsat cores");
17
13
  const aigs = new AigManager(manager);
18
- const forms = new RefVector(manager);
19
- for (let index = 0; index < goal.forms.size; index++) {
20
- forms.push(goal.forms.items[index]);
21
- goal.update(index, manager.trueExpr);
22
- }
23
- if (forms.size > 0) {
24
- const conjunction = manager.mkAnd(forms.items);
25
- manager.incRef(conjunction);
26
- const root = aigs.mkAig(conjunction);
14
+ const useSharedFormula = (expr: number, use: (formula: number) => void) => {
15
+ const root = aigs.mkAig(expr);
27
16
  aigs.incRef(root);
28
17
  const shared = aigs.maxSharing(root);
29
18
  aigs.incRef(shared);
30
19
  aigs.decRef(root);
31
20
  const formula = aigs.toFormula(shared);
32
- const isSmall = getNumExprs(manager, formula) <= 1.2 * getNumExprs(manager, conjunction);
33
- goal.assert(isSmall ? formula : conjunction);
21
+ use(formula);
34
22
  manager.decRef(formula);
35
23
  aigs.decRef(shared);
24
+ };
25
+ const forms = new RefVector(manager);
26
+ for (let index = 0; index < goal.forms.size; index++) {
27
+ const form = goal.forms.items[index];
28
+ const dependency = goal.getDependency(index);
29
+ if (dependency === undefined) {
30
+ forms.push(form);
31
+ goal.update(index, manager.trueExpr);
32
+ } else
33
+ useSharedFormula(form, (formula) => {
34
+ if (getNumExprs(manager, formula) <= 1.2 * getNumExprs(manager, form))
35
+ goal.update(index, formula, dependency);
36
+ });
37
+ }
38
+ if (forms.size > 0) {
39
+ const conjunction = manager.mkAnd(forms.items);
40
+ manager.incRef(conjunction);
41
+ useSharedFormula(conjunction, (formula) => {
42
+ const isSmall = getNumExprs(manager, formula) <= 1.2 * getNumExprs(manager, conjunction);
43
+ goal.assert(isSmall ? formula : conjunction);
44
+ });
36
45
  manager.decRef(conjunction);
37
46
  }
38
47
  goal.elimTrue();
@@ -1,6 +1,5 @@
1
- // Ported from Z3 (src/tactic/aig/aig.cpp, src/tactic/aig/aig.h), MIT license, see z3-license.txt.
2
- // A node is 2 * id for a variable and 2 * (id - FIRST_NODE_ID) + 1 for an and, and a literal is
3
- // 2 * node, plus 1 when inverted.
1
+ // A node is 2 * id for a variable and 2 * (id - FIRST_NODE_ID) + 1 for an and, and a literal is 2 *
2
+ // node, plus 1 when inverted.
4
3
  import { SmtTacticError } from "../../../errors";
5
4
  import {
6
5
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/arith_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  FAMILY_ARITH,
4
3
  KIND_APP,
@@ -905,12 +904,10 @@ export class ArithRewriter extends PolyRewriter {
905
904
  else if (manager.getOp(child) === OP_TO_REAL) intArgs.push(manager.getArg(child, 0));
906
905
  else realArgs.push(child);
907
906
  }
908
- const mkSum = (args: number[], sort: number) =>
909
- args.length === 1 ? args[0] : manager.mkApp(op, args, sort);
910
- if (realArgs.length === 0) return this.reduce(mkSum(intArgs, SORT_INT), 1);
907
+ if (realArgs.length === 0) return this.reduce(manager.mkApp(op, intArgs, SORT_INT), 1);
911
908
  if (intArgs.length === 0 || op !== OP_ADD) return undefined;
912
- const intSum = mkSum(intArgs, SORT_INT);
913
- const realSum = mkSum(realArgs, SORT_REAL);
909
+ const intSum = manager.mkApp(OP_ADD, intArgs, SORT_INT);
910
+ const realSum = manager.mkApp(OP_ADD, realArgs, SORT_REAL);
914
911
  return this.reduce(
915
912
  manager.mkApp(OP_ADD, [intSum, manager.mkApp(OP_TO_INT, [realSum], SORT_INT)], SORT_INT),
916
913
  3,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/smt/theory_lra.cpp, src/sat/smt/arith_solver.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import {
4
2
  type AstManager,
5
3
  OP_ADD,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/array_decl_plugin.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import {
4
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/array_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtUnsupportedError } from "../../../errors";
3
2
  import { mkArrayApp } from "./array-decl-plugin";
4
3
  import {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/solver/assertions/asserted_formulas.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import {
4
3
  AstManager,
@@ -125,7 +124,7 @@ class Substitution {
125
124
 
126
125
  update(expr: number) {
127
126
  const manager = this.manager;
128
- if (manager.isGround(expr) && manager.getOp(expr) === OP_EQ) {
127
+ if (manager.isGroundApp(expr) && manager.getOp(expr) === OP_EQ) {
129
128
  const left = manager.getArg(expr, 0);
130
129
  const right = manager.getArg(expr, 1);
131
130
  if (isGreater(manager, left, right)) {
@@ -236,6 +235,13 @@ export class AssertedFormulas {
236
235
  this.isFindingMacros ||= config.isFindingMacros;
237
236
  }
238
237
 
238
+ updateParams(config: SmtConfig) {
239
+ this.isNnfCnf = config.isNnfCnf;
240
+ this.isEq2Ineq = config.isEq2Ineq;
241
+ this.isFindingMacros = config.isFindingMacros;
242
+ this.isReducePending = true;
243
+ }
244
+
239
245
  getNumFormulas() {
240
246
  return this.formulas.size;
241
247
  }
@@ -250,7 +256,7 @@ export class AssertedFormulas {
250
256
  if (!this.isInconsistent && (this.hasQuantifiers || this.isPreprocessing)) this.reduceCore();
251
257
  if (this.isInconsistent) return [];
252
258
  const result = this.formulas.items.slice(this.qhead);
253
- if (this.isFindingMacros) this.macros.markForbidden(result);
259
+ this.macros.markForbidden(result);
254
260
  for (const formula of result) this.substitution.update(formula);
255
261
  this.qhead = this.formulas.size;
256
262
  return result;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/ast_lt.cpp, src/util/symbol.cpp), MIT license, see z3-license.txt.
2
1
  import {
3
2
  FAMILY_ARRAY,
4
3
  FAMILY_BV,
@@ -251,7 +250,7 @@ const compareDecls = (manager: AstManager, first: number, second: number) => {
251
250
  return compareSorts(manager, firstKey.range, secondKey.range);
252
251
  };
253
252
 
254
- export const compareAsts = (manager: AstManager, first: number, second: number): number => {
253
+ const compareAsts = (manager: AstManager, first: number, second: number): number => {
255
254
  if (first === second) return 0;
256
255
  const byKind = compareValues(manager.kinds[first], manager.kinds[second]);
257
256
  if (byKind !== 0) return byKind;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/ast/ast_util.cpp, src/ast/for_each_expr.cpp, src/ast/arith_decl_plugin.cpp),
2
- // MIT license, see z3-license.txt.
3
1
  import {
4
2
  KIND_APP,
5
3
  KIND_QUANTIFIER,
@@ -118,6 +116,8 @@ export const pushNotOwned = (manager: AstManager, expr: number): number => {
118
116
 
119
117
  const ASSOCIATIVE_OPS = new Set([OP_AND, OP_OR, OP_XOR, OP_ADD, OP_MUL, OP_SEQ_CONCAT]);
120
118
 
119
+ export const isAssociativeOp = (op: number) => ASSOCIATIVE_OPS.has(op) || isAssociativeBvOp(op);
120
+
121
121
  // Like Z3, marks only the expressions with several references, and counts an associative
122
122
  // application of n arguments as n - 1 binary ones.
123
123
  export const getNumExprs = (manager: AstManager, root: number) => {
@@ -145,7 +145,7 @@ export const getNumExprs = (manager: AstManager, root: number) => {
145
145
  }
146
146
  const op = manager.getOp(expr);
147
147
  const numArgs = manager.getNumArgs(expr);
148
- count += ASSOCIATIVE_OPS.has(op) || isAssociativeBvOp(op) ? numArgs - 1 : 1;
148
+ count += isAssociativeOp(op) ? numArgs - 1 : 1;
149
149
  for (let index = 0; index < numArgs; index++) {
150
150
  const arg = manager.getArg(expr, index);
151
151
  if (isUnvisited(arg)) todo.push(arg);