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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (551) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +5 -1
  8. package/dist/index.d.ts +5 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +4 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,542 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BASIC,
6
+ FAMILY_BV,
7
+ FAMILY_DATATYPE,
8
+ KIND_APP,
9
+ KIND_QUANTIFIER,
10
+ OP_ADD,
11
+ OP_AND,
12
+ OP_BADD,
13
+ OP_BMUL,
14
+ OP_BNOT,
15
+ OP_BOR,
16
+ OP_BSDIV,
17
+ OP_BSDIV_I,
18
+ OP_BSUB,
19
+ OP_BUDIV,
20
+ OP_BUDIV_I,
21
+ OP_CONCAT,
22
+ OP_CONST_ARRAY,
23
+ OP_DT_ACCESSOR,
24
+ OP_EQ,
25
+ OP_EXTRACT,
26
+ OP_GE,
27
+ OP_ITE,
28
+ OP_LE,
29
+ OP_MUL,
30
+ OP_NOT,
31
+ OP_OR,
32
+ OP_SELECT,
33
+ OP_SLEQ,
34
+ OP_STORE,
35
+ OP_SUB,
36
+ OP_ULEQ,
37
+ SORT_BOOL,
38
+ SORT_REAL,
39
+ SORT_SIZE_INFINITE,
40
+ SORT_SIZE_VERY_BIG,
41
+ isArithSort,
42
+ } from "./ast";
43
+ import { mkArrayApp } from "./array-decl-plugin";
44
+ import { mkBvApp } from "./bv-decl-plugin";
45
+ import {
46
+ getAccessorConstructor,
47
+ getConstructorAccessors,
48
+ getDatatypeConstructors,
49
+ } from "./datatype-decl-plugin";
50
+ import type { Definition, Goal } from "./goal";
51
+ import { getManagerSomeValue } from "./proto-model";
52
+ import { getMultInverse, Rational } from "./rational";
53
+ import { RefVector } from "./ref-vector";
54
+ import { RewriterTpl } from "./rewriter-tpl";
55
+
56
+ export const collectUnconstrained = (manager: AstManager, goal: Goal) => {
57
+ const visited = new Set<number>();
58
+ const vars: number[] = [];
59
+ const repeated = new Set<number>();
60
+ for (const form of goal.forms.items) {
61
+ const todo = [form];
62
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
63
+ const isConst = manager.kinds[expr] === KIND_APP && manager.isUninterpretedConst(expr);
64
+ if (visited.has(expr)) {
65
+ if (isConst) repeated.add(expr);
66
+ continue;
67
+ }
68
+ visited.add(expr);
69
+ if (isConst) vars.push(expr);
70
+ else if (manager.kinds[expr] === KIND_QUANTIFIER) todo.push(manager.getQuantifier(expr).body);
71
+ else if (manager.kinds[expr] === KIND_APP)
72
+ for (let index = manager.getNumArgs(expr) - 1; index >= 0; index--)
73
+ todo.push(manager.getArg(expr, index));
74
+ }
75
+ }
76
+ return new Set(vars.filter((variable) => !repeated.has(variable)));
77
+ };
78
+
79
+ // The bodies stay held until the next run, as Z3 holds them in the tactic.
80
+ export const disableQuantified = (manager: AstManager, goal: Goal, bodies: RefVector) => {
81
+ const disabled = new Set<number>();
82
+ const visited = new Set<number>();
83
+ const todo = [...goal.forms.items];
84
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
85
+ if (visited.has(expr)) continue;
86
+ visited.add(expr);
87
+ if (manager.kinds[expr] === KIND_QUANTIFIER) {
88
+ const body = manager.getQuantifier(expr).body;
89
+ todo.push(body);
90
+ if (disabled.has(body)) continue;
91
+ bodies.push(body);
92
+ const marks = [body];
93
+ for (let marked = marks.pop(); marked !== undefined; marked = marks.pop()) {
94
+ if (disabled.has(marked)) continue;
95
+ disabled.add(marked);
96
+ if (manager.kinds[marked] === KIND_APP) manager.pushArgs(marked, marks);
97
+ }
98
+ } else if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
99
+ }
100
+ return disabled;
101
+ };
102
+
103
+ class UncnstrRewriter extends RewriterTpl {
104
+ vars = new Set<number>();
105
+ disabled = new Set<number>();
106
+ readonly entries: Definition[] = [];
107
+ readonly terms: RefVector;
108
+ private cache = new Map<number, number>();
109
+
110
+ constructor(
111
+ manager: AstManager,
112
+ private isProofsEnabled: boolean,
113
+ ) {
114
+ super(manager);
115
+ this.terms = new RefVector(manager);
116
+ }
117
+
118
+ private pin(expr: number) {
119
+ this.terms.push(expr);
120
+ return expr;
121
+ }
122
+
123
+ private isUncnstr(expr: number) {
124
+ return this.vars.has(expr) && !this.disabled.has(expr);
125
+ }
126
+
127
+ private mkFreshFor(decl: number, args: number[], sort: number) {
128
+ const manager = this.manager;
129
+ const key = this.pin(manager.mkApp(decl, args, sort));
130
+ const cached = this.cache.get(key);
131
+ if (cached !== undefined) return { fresh: cached, isNew: false };
132
+ const fresh = this.pin(manager.mkFreshConst(null, sort));
133
+ this.entries.push({ decl: manager.decls[fresh], def: -1 });
134
+ this.cache.set(key, fresh);
135
+ return { fresh, isNew: true };
136
+ }
137
+
138
+ private addDef(variable: number, def: number) {
139
+ this.entries.push({ decl: this.manager.decls[variable], def: this.pin(def) });
140
+ }
141
+
142
+ private addDefs(args: number[], fresh: number, identity: number) {
143
+ this.addDef(args[0], fresh);
144
+ for (const arg of args.slice(1)) this.addDef(arg, identity);
145
+ }
146
+
147
+ private isFullyInterp(sort: number): boolean {
148
+ const manager = this.manager;
149
+ if (manager.isUninterpretedSort(sort)) return false;
150
+ if (manager.isArraySort(sort))
151
+ return manager.getSortParameters(sort).every((parameter) => this.isFullyInterp(parameter));
152
+ return true;
153
+ }
154
+
155
+ private mkNumeral(value: Rational, sort: number) {
156
+ return this.pin(this.manager.mkNumeralOfSort(value, sort));
157
+ }
158
+
159
+ private mkDiff(term: number): number {
160
+ const manager = this.manager;
161
+ const sort = manager.sorts[term];
162
+ if (sort === SORT_BOOL) return this.pin(manager.mkApp(OP_NOT, [term], SORT_BOOL));
163
+ if (isArithSort(sort))
164
+ return this.pin(manager.mkApp(OP_ADD, [term, this.mkNumeral(Rational.one, sort)], sort));
165
+ if (manager.isBvSort(sort)) return this.pin(mkBvApp(manager, OP_BNOT, [term]));
166
+ if (manager.isDatatypeSort(sort)) {
167
+ for (const constructor of getDatatypeConstructors(manager, sort)) {
168
+ const domain = manager.funcDecls[constructor].domain;
169
+ let target = -1;
170
+ for (const [index, argSort] of domain.entries()) {
171
+ if (argSort === sort) {
172
+ target = index;
173
+ continue;
174
+ }
175
+ if (manager.isUninterpretedSort(argSort)) break;
176
+ }
177
+ if (target === -1) continue;
178
+ const args = domain.map((argSort, index) =>
179
+ index === target ? term : this.pin(getManagerSomeValue(manager, argSort)),
180
+ );
181
+ return this.pin(manager.mkApp(constructor, args, sort));
182
+ }
183
+ return -1;
184
+ }
185
+ if (!manager.isArraySort(sort)) return -1;
186
+ const parameters = manager.getSortParameters(sort);
187
+ if (parameters.some((parameter) => manager.isUninterpretedSort(parameter))) return -1;
188
+ const indices = parameters
189
+ .slice(0, -1)
190
+ .map((parameter) => this.pin(getManagerSomeValue(manager, parameter)));
191
+ const select = this.pin(mkArrayApp(manager, OP_SELECT, [term, ...indices]));
192
+ const diff = this.mkDiff(select);
193
+ return diff === -1 ? -1 : this.pin(mkArrayApp(manager, OP_STORE, [term, ...indices, diff]));
194
+ }
195
+
196
+ private processEq(decl: number, args: number[]) {
197
+ const manager = this.manager;
198
+ const [first, second] = args;
199
+ const isFirst = this.isUncnstr(first);
200
+ if (!isFirst && !this.isUncnstr(second)) return -1;
201
+ const variable = isFirst ? first : second;
202
+ const term = isFirst ? second : first;
203
+ const sort = manager.sorts[first];
204
+ if (!this.isFullyInterp(sort)) return -1;
205
+ const size = manager.getSortSize(sort);
206
+ if (size !== SORT_SIZE_INFINITE && size !== SORT_SIZE_VERY_BIG && size <= 1n) return -1;
207
+ const diff = this.mkDiff(term);
208
+ if (diff === -1) return -1;
209
+ const found = this.mkFreshFor(decl, args, SORT_BOOL);
210
+ if (found.isNew)
211
+ this.addDef(variable, manager.mkApp(OP_ITE, [found.fresh, term, diff], manager.sorts[term]));
212
+ return found.fresh;
213
+ }
214
+
215
+ private processBasic(decl: number, args: number[], sort: number) {
216
+ const manager = this.manager;
217
+ switch (manager.funcDecls[decl].op) {
218
+ case OP_ITE: {
219
+ const [condition, thenExpr, elseExpr] = args;
220
+ const isBranches = this.isUncnstr(thenExpr) && this.isUncnstr(elseExpr);
221
+ const isThen = this.isUncnstr(condition) && this.isUncnstr(thenExpr);
222
+ const isElse = this.isUncnstr(condition) && this.isUncnstr(elseExpr);
223
+ if (!isBranches && !isThen && !isElse) return -1;
224
+ const found = this.mkFreshFor(decl, args, sort);
225
+ if (!found.isNew) return found.fresh;
226
+ if (isBranches) this.addDef(thenExpr, found.fresh);
227
+ else this.addDef(condition, isThen ? manager.trueExpr : manager.falseExpr);
228
+ this.addDef(isThen && !isBranches ? thenExpr : elseExpr, found.fresh);
229
+ return found.fresh;
230
+ }
231
+ case OP_NOT: {
232
+ if (!this.isUncnstr(args[0])) return -1;
233
+ const found = this.mkFreshFor(decl, args, sort);
234
+ if (found.isNew) this.addDef(args[0], manager.mkApp(OP_NOT, [found.fresh], SORT_BOOL));
235
+ return found.fresh;
236
+ }
237
+ case OP_AND:
238
+ case OP_OR: {
239
+ if (!args.every((arg) => this.isUncnstr(arg))) return -1;
240
+ const found = this.mkFreshFor(decl, args, sort);
241
+ const identity =
242
+ manager.funcDecls[decl].op === OP_AND ? manager.trueExpr : manager.falseExpr;
243
+ if (found.isNew) this.addDefs(args, found.fresh, identity);
244
+ return found.fresh;
245
+ }
246
+ case OP_EQ:
247
+ return this.processEq(decl, args);
248
+ default:
249
+ return -1;
250
+ }
251
+ }
252
+
253
+ private processAdd(decl: number, args: number[], sort: number, subOp: number) {
254
+ const manager = this.manager;
255
+ const index = args.findIndex((arg) => this.isUncnstr(arg));
256
+ if (index === -1) return -1;
257
+ const found = this.mkFreshFor(decl, args, sort);
258
+ if (!found.isNew) return found.fresh;
259
+ const rest = args.filter((_value, other) => other !== index);
260
+ const restExpr =
261
+ rest.length === 0
262
+ ? -1
263
+ : rest.length === 1
264
+ ? rest[0]
265
+ : this.pin(manager.mkApp(decl, rest, sort));
266
+ const def =
267
+ restExpr === -1
268
+ ? found.fresh
269
+ : subOp === OP_BSUB
270
+ ? mkBvApp(manager, OP_BSUB, [found.fresh, restExpr])
271
+ : manager.mkApp(OP_SUB, [found.fresh, restExpr], sort);
272
+ this.addDef(args[index], def);
273
+ return found.fresh;
274
+ }
275
+
276
+ private processArith(decl: number, args: number[], sort: number) {
277
+ const manager = this.manager;
278
+ const op = manager.funcDecls[decl].op;
279
+ if (op === OP_ADD) return this.processAdd(decl, args, sort, OP_SUB);
280
+ if (op === OP_LE || op === OP_GE) {
281
+ const [first, second] = args;
282
+ const isFirst = this.isUncnstr(first);
283
+ if (!isFirst && !this.isUncnstr(second)) return -1;
284
+ const isLe = isFirst === (op === OP_LE);
285
+ const variable = isFirst ? first : second;
286
+ const term = isFirst ? second : first;
287
+ const found = this.mkFreshFor(decl, args, SORT_BOOL);
288
+ if (!found.isNew) return found.fresh;
289
+ const argSort = manager.sorts[first];
290
+ const step = this.mkNumeral(isLe ? Rational.one : Rational.minusOne, argSort);
291
+ const next = this.pin(manager.mkApp(OP_ADD, [term, step], argSort));
292
+ this.addDef(variable, manager.mkApp(OP_ITE, [found.fresh, term, next], argSort));
293
+ return found.fresh;
294
+ }
295
+ if (op !== OP_MUL) return -1;
296
+ if (args.every((arg) => this.isUncnstr(arg))) {
297
+ const found = this.mkFreshFor(decl, args, sort);
298
+ if (found.isNew)
299
+ this.addDefs(args, found.fresh, this.mkNumeral(Rational.one, manager.sorts[args[0]]));
300
+ return found.fresh;
301
+ }
302
+ if (
303
+ args.length !== 2 ||
304
+ !this.isUncnstr(args[1]) ||
305
+ !manager.isNumeral(args[0]) ||
306
+ manager.sorts[args[0]] !== SORT_REAL
307
+ )
308
+ return -1;
309
+ const value = manager.getRationalValue(args[0]);
310
+ if (value.isZero()) return -1;
311
+ const found = this.mkFreshFor(decl, args, sort);
312
+ if (found.isNew)
313
+ this.addDef(
314
+ args[1],
315
+ manager.mkApp(
316
+ OP_MUL,
317
+ [this.mkNumeral(Rational.one.div(value), SORT_REAL), found.fresh],
318
+ sort,
319
+ ),
320
+ );
321
+ return found.fresh;
322
+ }
323
+
324
+ private processBvLe(decl: number, args: number[], isSigned: boolean) {
325
+ const manager = this.manager;
326
+ if (this.isProofsEnabled) return -1;
327
+ const [first, second] = args;
328
+ const isFirst = this.isUncnstr(first);
329
+ if (!isFirst && !this.isUncnstr(second)) return -1;
330
+ const width = manager.getBvSize(manager.sorts[first]);
331
+ const bound = isFirst
332
+ ? isSigned
333
+ ? (1n << BigInt(width - 1)) - 1n
334
+ : (1n << BigInt(width)) - 1n
335
+ : isSigned
336
+ ? -(1n << BigInt(width - 1))
337
+ : 0n;
338
+ const variable = isFirst ? first : second;
339
+ const term = isFirst ? second : first;
340
+ const found = this.mkFreshFor(decl, args, SORT_BOOL);
341
+ const isBound = this.pin(manager.mkEq(term, this.pin(manager.mkBvNumeral(bound, width))));
342
+ const result = this.pin(manager.mkOr([found.fresh, isBound]));
343
+ if (found.isNew) {
344
+ const one = this.pin(manager.mkBvNumeral(1n, width));
345
+ const next = this.pin(mkBvApp(manager, isFirst ? OP_BADD : OP_BSUB, [term, one]));
346
+ this.addDef(variable, manager.mkApp(OP_ITE, [result, term, next], manager.sorts[term]));
347
+ }
348
+ return result;
349
+ }
350
+
351
+ private processBv(decl: number, args: number[], sort: number) {
352
+ const manager = this.manager;
353
+ const op = manager.funcDecls[decl].op;
354
+ const isAllUncnstr = args.every((arg) => this.isUncnstr(arg));
355
+ switch (op) {
356
+ case OP_BADD:
357
+ return this.processAdd(decl, args, sort, OP_BSUB);
358
+ case OP_BMUL: {
359
+ const width = manager.getBvSize(manager.sorts[args[0]]);
360
+ if (isAllUncnstr) {
361
+ const found = this.mkFreshFor(decl, args, sort);
362
+ if (found.isNew)
363
+ this.addDefs(args, found.fresh, this.pin(manager.mkBvNumeral(1n, width)));
364
+ return found.fresh;
365
+ }
366
+ if (args.length !== 2 || !this.isUncnstr(args[1]) || !manager.isBvNumeral(args[0]))
367
+ return -1;
368
+ const inverse = getMultInverse(manager.getBvNumeralValue(args[0]), width);
369
+ if (inverse === undefined) return -1;
370
+ const found = this.mkFreshFor(decl, args, sort);
371
+ if (found.isNew)
372
+ this.addDef(
373
+ args[1],
374
+ mkBvApp(manager, OP_BMUL, [this.pin(manager.mkBvNumeral(inverse, width)), found.fresh]),
375
+ );
376
+ return found.fresh;
377
+ }
378
+ case OP_BSDIV:
379
+ case OP_BUDIV:
380
+ case OP_BSDIV_I:
381
+ case OP_BUDIV_I: {
382
+ if (!isAllUncnstr) return -1;
383
+ const found = this.mkFreshFor(decl, args, sort);
384
+ if (found.isNew) {
385
+ this.addDef(args[0], found.fresh);
386
+ this.addDef(args[1], manager.mkBvNumeral(1n, manager.getBvSize(manager.sorts[args[0]])));
387
+ }
388
+ return found.fresh;
389
+ }
390
+ case OP_SLEQ:
391
+ case OP_ULEQ:
392
+ return this.processBvLe(decl, args, op === OP_SLEQ);
393
+ case OP_CONCAT: {
394
+ if (!isAllUncnstr) return -1;
395
+ const found = this.mkFreshFor(decl, args, sort);
396
+ if (!found.isNew) return found.fresh;
397
+ let low = 0;
398
+ for (let index = args.length - 1; index >= 0; index--) {
399
+ const width = manager.getBvSize(manager.sorts[args[index]]);
400
+ this.addDef(
401
+ args[index],
402
+ mkBvApp(manager, OP_EXTRACT, [found.fresh], [low + width - 1, low]),
403
+ );
404
+ low += width;
405
+ }
406
+ return found.fresh;
407
+ }
408
+ case OP_EXTRACT: {
409
+ const arg = args[0];
410
+ if (!this.isUncnstr(arg)) return -1;
411
+ const found = this.mkFreshFor(decl, args, sort);
412
+ if (!found.isNew) return found.fresh;
413
+ const [high, low] = manager.funcDecls[decl].parameters;
414
+ const width = manager.getBvSize(manager.sorts[arg]);
415
+ if (width === high - low + 1) {
416
+ this.addDef(arg, found.fresh);
417
+ return found.fresh;
418
+ }
419
+ const parts = [
420
+ ...(high < width - 1 ? [this.pin(manager.mkBvNumeral(0n, width - high - 1))] : []),
421
+ found.fresh,
422
+ ...(low > 0 ? [this.pin(manager.mkBvNumeral(0n, low))] : []),
423
+ ];
424
+ this.addDef(arg, mkBvApp(manager, OP_CONCAT, parts));
425
+ return found.fresh;
426
+ }
427
+ case OP_BNOT: {
428
+ if (!this.isUncnstr(args[0])) return -1;
429
+ const found = this.mkFreshFor(decl, args, sort);
430
+ if (found.isNew) this.addDef(args[0], manager.mkApp(decl, [found.fresh], sort));
431
+ return found.fresh;
432
+ }
433
+ case OP_BOR: {
434
+ if (!isAllUncnstr) return -1;
435
+ const found = this.mkFreshFor(decl, args, sort);
436
+ if (found.isNew)
437
+ this.addDefs(
438
+ args,
439
+ found.fresh,
440
+ this.pin(manager.mkBvNumeral(0n, manager.getBvSize(sort))),
441
+ );
442
+ return found.fresh;
443
+ }
444
+ default:
445
+ return -1;
446
+ }
447
+ }
448
+
449
+ private processArray(decl: number, args: number[], sort: number) {
450
+ const manager = this.manager;
451
+ const op = manager.funcDecls[decl].op;
452
+ if (op === OP_SELECT && this.isUncnstr(args[0])) {
453
+ const found = this.mkFreshFor(decl, args, sort);
454
+ if (found.isNew)
455
+ this.addDef(
456
+ args[0],
457
+ mkArrayApp(manager, OP_CONST_ARRAY, [found.fresh], [manager.sorts[args[0]]]),
458
+ );
459
+ return found.fresh;
460
+ }
461
+ if (op !== OP_STORE || !this.isUncnstr(args[0]) || !this.isUncnstr(args[args.length - 1]))
462
+ return -1;
463
+ const found = this.mkFreshFor(decl, args, sort);
464
+ if (found.isNew) {
465
+ this.addDef(args[args.length - 1], mkArrayApp(manager, OP_SELECT, args.slice(0, -1)));
466
+ this.addDef(args[0], found.fresh);
467
+ }
468
+ return found.fresh;
469
+ }
470
+
471
+ // head(x) -> fresh, x := cons(fresh, arb)
472
+ private processDatatype(decl: number, args: number[], sort: number) {
473
+ const manager = this.manager;
474
+ if (manager.funcDecls[decl].op !== OP_DT_ACCESSOR || !this.isUncnstr(args[0])) return -1;
475
+ const constructor = getAccessorConstructor(manager, decl);
476
+ const domain = manager.funcDecls[constructor].domain;
477
+ if (!domain.every((argSort) => this.isFullyInterp(argSort))) return -1;
478
+ const found = this.mkFreshFor(decl, args, sort);
479
+ if (!found.isNew) return found.fresh;
480
+ const newArgs = getConstructorAccessors(manager, constructor).map((accessor, index) =>
481
+ accessor === decl ? found.fresh : this.pin(getManagerSomeValue(manager, domain[index])),
482
+ );
483
+ this.addDef(args[0], manager.mkApp(constructor, newArgs, manager.sorts[args[0]]));
484
+ return found.fresh;
485
+ }
486
+
487
+ reduceApp(decl: number, args: number[], sort: number) {
488
+ const manager = this.manager;
489
+ if (args.length === 0 || !args.every((arg) => manager.isGroundApp(arg))) return -1;
490
+ const info = manager.funcDecls[decl];
491
+ const result =
492
+ info.family === FAMILY_BASIC
493
+ ? this.processBasic(decl, args, sort)
494
+ : info.family === FAMILY_ARITH
495
+ ? this.processArith(decl, args, sort)
496
+ : info.family === FAMILY_BV
497
+ ? this.processBv(decl, args, sort)
498
+ : info.family === FAMILY_ARRAY
499
+ ? this.processArray(decl, args, sort)
500
+ : info.family === FAMILY_DATATYPE
501
+ ? this.processDatatype(decl, args, sort)
502
+ : -1;
503
+ if (result !== -1) manager.incRef(result);
504
+ return result;
505
+ }
506
+ }
507
+
508
+ export const elimUncnstr = (manager: AstManager, goal: Goal, bodies: RefVector) => {
509
+ bodies.reset();
510
+ const vars = collectUnconstrained(manager, goal);
511
+ const disabled = disableQuantified(manager, goal, bodies);
512
+ if (vars.size === 0 || manager.hasRecDefs) return;
513
+ const rewriter = new UncnstrRewriter(manager, goal.isProofsEnabled);
514
+ rewriter.vars = vars;
515
+ rewriter.disabled = disabled;
516
+ let isModified = true;
517
+ let size = goal.forms.size;
518
+ let start = 0;
519
+ for (;;) {
520
+ for (let index = start; index < size; index++) {
521
+ const form = goal.forms.items[index];
522
+ const rewritten = rewriter.rewrite(form);
523
+ if (rewritten !== form) {
524
+ isModified = true;
525
+ goal.update(index, rewritten);
526
+ }
527
+ manager.decRef(rewritten);
528
+ }
529
+ if (!isModified) break;
530
+ isModified = false;
531
+ size = goal.forms.size;
532
+ rewriter.reset();
533
+ bodies.reset();
534
+ rewriter.disabled = disableQuantified(manager, goal, bodies);
535
+ rewriter.vars = collectUnconstrained(manager, goal);
536
+ start = rewriter.vars.size === 0 ? size : 0;
537
+ }
538
+ goal.addDefinitions(rewriter.entries);
539
+ rewriter.release();
540
+ rewriter.terms.reset();
541
+ goal.depth++;
542
+ };
@@ -1,7 +1,6 @@
1
- // Ported from Z3 (src/smt/smt_enode.h, src/smt/smt_eq_justification.h, src/smt/smt_justification.h), MIT license, see z3-license.txt.
2
1
  import type { Literal } from "./literal";
3
2
 
4
- interface Antecedents {
3
+ export interface Antecedents {
5
4
  markLiteral(literal: Literal): void;
6
5
  markEq(first: Enode, second: Enode): void;
7
6
  markJustification(justification: Justification): void;
@@ -10,6 +9,7 @@ interface Antecedents {
10
9
 
11
10
  export abstract class Justification {
12
11
  isMarked = false;
12
+ readonly fromTheory: number = -1;
13
13
  abstract getAntecedents(antecedents: Antecedents): void;
14
14
  }
15
15
 
@@ -35,7 +35,17 @@ const IS_CGC_ENABLED = 8;
35
35
  const IS_MARKED = 16;
36
36
  const IS_MARKED2 = 32;
37
37
  const IS_INTERPRETED = 64;
38
- const NUM_ARGS_SHIFT = 7;
38
+ const IS_COMMUTATIVE = 128;
39
+ const IS_COMMUTATIVE_TABLE = 256;
40
+ const NUM_ARGS_SHIFT = 9;
41
+
42
+ class ThVarCell {
43
+ constructor(
44
+ public thId: number,
45
+ public thVar: number,
46
+ public next: ThVarCell | null,
47
+ ) {}
48
+ }
39
49
 
40
50
  export class Enode {
41
51
  root: Enode = this;
@@ -45,7 +55,10 @@ export class Enode {
45
55
  parents: Enode[] = NO_ENODES;
46
56
  transTarget: Enode | null = null;
47
57
  transJustification: EqJustification = AXIOM_EQ_JUSTIFICATION;
58
+ // The first theory variable inline, -1 when there is none, then the rest in the order added.
48
59
  thVar = -1;
60
+ thId = -1;
61
+ thNext: ThVarCell | null = null;
49
62
  lbls = 0;
50
63
  lblsHigh = 0;
51
64
  plbls = 0;
@@ -65,6 +78,8 @@ export class Enode {
65
78
  moreArgs: Enode[],
66
79
  public generation: number,
67
80
  isEq: boolean,
81
+ isCommutative: boolean,
82
+ isCommutativeTable: boolean,
68
83
  isBool: boolean,
69
84
  isMergeTf: boolean,
70
85
  isCgcEnabled: boolean,
@@ -76,6 +91,8 @@ export class Enode {
76
91
  this.flags =
77
92
  (numArgs << NUM_ARGS_SHIFT) |
78
93
  (isEq ? IS_EQ : 0) |
94
+ (isCommutative ? IS_COMMUTATIVE : 0) |
95
+ (isCommutativeTable ? IS_COMMUTATIVE_TABLE : 0) |
79
96
  (isBool ? IS_BOOL : 0) |
80
97
  (isMergeTf ? IS_MERGE_TF : 0) |
81
98
  (isCgcEnabled ? IS_CGC_ENABLED : 0);
@@ -97,6 +114,14 @@ export class Enode {
97
114
  return (this.flags & IS_EQ) !== 0;
98
115
  }
99
116
 
117
+ get isCommutative() {
118
+ return (this.flags & IS_COMMUTATIVE) !== 0;
119
+ }
120
+
121
+ get isCommutativeTable() {
122
+ return (this.flags & IS_COMMUTATIVE_TABLE) !== 0;
123
+ }
124
+
100
125
  get isBool() {
101
126
  return (this.flags & IS_BOOL) !== 0;
102
127
  }
@@ -137,6 +162,77 @@ export class Enode {
137
162
  this.setFlag(IS_INTERPRETED, value);
138
163
  }
139
164
 
165
+ getThVar(thId: number) {
166
+ if (this.thVar < 0) return -1;
167
+ if (this.thId === thId) return this.thVar;
168
+ for (let cell = this.thNext; cell !== null; cell = cell.next)
169
+ if (cell.thId === thId) return cell.thVar;
170
+ return -1;
171
+ }
172
+
173
+ forEachThVar(visit: (thId: number, thVar: number) => void) {
174
+ if (this.thVar < 0) return;
175
+ visit(this.thId, this.thVar);
176
+ for (let cell = this.thNext; cell !== null; cell = cell.next) visit(cell.thId, cell.thVar);
177
+ }
178
+
179
+ addThVar(thVar: number, thId: number) {
180
+ if (this.thVar < 0) {
181
+ this.thVar = thVar;
182
+ this.thId = thId;
183
+ this.thNext = null;
184
+ return;
185
+ }
186
+ const cell = new ThVarCell(thId, thVar, null);
187
+ if (this.thNext === null) {
188
+ this.thNext = cell;
189
+ return;
190
+ }
191
+ let last = this.thNext;
192
+ while (last.next !== null) last = last.next;
193
+ last.next = cell;
194
+ }
195
+
196
+ replaceThVar(thVar: number, thId: number) {
197
+ if (this.thId === thId) {
198
+ this.thVar = thVar;
199
+ return;
200
+ }
201
+ for (let cell = this.thNext; cell !== null; cell = cell.next)
202
+ if (cell.thId === thId) {
203
+ cell.thVar = thVar;
204
+ return;
205
+ }
206
+ }
207
+
208
+ delThVar(thId: number) {
209
+ if (this.thId === thId) {
210
+ const next = this.thNext;
211
+ this.thVar = next === null ? -1 : next.thVar;
212
+ this.thId = next === null ? -1 : next.thId;
213
+ this.thNext = next === null ? null : next.next;
214
+ return;
215
+ }
216
+ let previous: ThVarCell | null = null;
217
+ for (let cell = this.thNext; cell !== null; previous = cell, cell = cell.next) {
218
+ if (cell.thId !== thId) continue;
219
+ if (previous === null) this.thNext = cell.next;
220
+ else previous.next = cell.next;
221
+ return;
222
+ }
223
+ }
224
+
225
+ restoreThVars(getEnode: (thId: number, thVar: number) => Enode) {
226
+ const kept: [number, number][] = [];
227
+ this.forEachThVar((thId, thVar) => {
228
+ if (getEnode(thId, thVar).root === this) kept.push([thId, thVar]);
229
+ });
230
+ this.thVar = -1;
231
+ this.thId = -1;
232
+ this.thNext = null;
233
+ for (const entry of kept) this.addThVar(entry[1], entry[0]);
234
+ }
235
+
140
236
  addParent(parent: Enode) {
141
237
  if (this.parents.length === 0) this.parents = [parent];
142
238
  else this.parents.push(parent);
@@ -225,6 +321,7 @@ export class UnitResolutionJustification extends Justification {
225
321
 
226
322
  export class TheoryJustification extends Justification {
227
323
  constructor(
324
+ readonly fromTheory: number,
228
325
  private literals: Literal[],
229
326
  private eqs: Enode[],
230
327
  ) {