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,328 @@
1
+ import { SmtCanceledError } from "../../../../errors";
2
+ import { mkNot } from "../ast-util";
3
+ import type { ProtoModel } from "../proto-model";
4
+ import { L_TRUE, L_UNDEF } from "../lbool";
5
+ import { NULL_LITERAL } from "../sat/clause";
6
+ import { CR_DONE } from "../sat/solver";
7
+ import { type Enode, NULL_THEORY_VAR, type ThEq } from "./egraph";
8
+ import type { EufSolver } from "./euf-solver";
9
+
10
+ export class TrailStack {
11
+ private undos: (() => void)[] = [];
12
+ private scopes: number[] = [];
13
+
14
+ push(undo: () => void) {
15
+ this.undos.push(undo);
16
+ }
17
+
18
+ pushScope() {
19
+ this.scopes.push(this.undos.length);
20
+ }
21
+
22
+ popScope(numScopes: number) {
23
+ if (numScopes === 0) return;
24
+ const lim = this.scopes[this.scopes.length - numScopes];
25
+ this.scopes.length -= numScopes;
26
+ while (this.undos.length > lim) (this.undos.pop() as () => void)();
27
+ }
28
+ }
29
+
30
+ // A th_explain: the literals and equalities that explain a propagation or a conflict.
31
+ export interface ThExplain {
32
+ readonly lits: readonly number[];
33
+ readonly eqs: readonly (readonly [Enode, Enode])[];
34
+ readonly consequent: number;
35
+ readonly eq: readonly [Enode, Enode] | null;
36
+ }
37
+
38
+ export type Dependencies = Map<Enode, Enode[] | null>;
39
+
40
+ export const addDependency = (deps: Dependencies, node: Enode, dep: Enode) => {
41
+ const existing = deps.get(node);
42
+ if (existing === undefined || existing === null) deps.set(node, [dep]);
43
+ else if (!existing.includes(dep)) existing.push(dep);
44
+ };
45
+
46
+ export abstract class ThSolver {
47
+ protected var2enode: Enode[] = [];
48
+ protected stack: { expr: number; index: number }[] = [];
49
+ private var2enodeLim: number[] = [];
50
+ protected numScopes = 0;
51
+
52
+ constructor(
53
+ readonly ctx: EufSolver,
54
+ readonly name: string,
55
+ readonly id: number,
56
+ ) {}
57
+
58
+ get manager() {
59
+ return this.ctx.manager;
60
+ }
61
+
62
+ get s() {
63
+ return this.ctx.s;
64
+ }
65
+
66
+ abstract internalize(expr: number, isSign: boolean, isRoot: boolean): number;
67
+ abstract internalizeTerm(expr: number): void;
68
+
69
+ applySortCnstr(_node: Enode, _sort: number) {}
70
+ eqInternalized(_node: Enode) {}
71
+ newEqEh(_eq: ThEq) {}
72
+ useDiseqs() {
73
+ return false;
74
+ }
75
+ newDiseqEh(_eq: ThEq) {}
76
+ unitPropagate() {
77
+ return false;
78
+ }
79
+ check() {
80
+ return CR_DONE;
81
+ }
82
+ asserted(_lit: number) {}
83
+ getAntecedents(_lit: number, data: unknown, antecedents: number[]) {
84
+ this.ctx.getThAntecedents(data as ThExplain, antecedents);
85
+ }
86
+ getPhase(_boolVar: number) {
87
+ return L_UNDEF;
88
+ }
89
+ isExternal(_boolVar: number) {
90
+ return false;
91
+ }
92
+ initSearch() {}
93
+ popReinit() {}
94
+ isSelfPropagating() {
95
+ return false;
96
+ }
97
+ preSimplify() {}
98
+ simplify() {}
99
+ flushRoots() {}
100
+ finalize() {}
101
+ relevantEh(_node: Enode) {}
102
+ isShared(_thVar: number) {
103
+ return false;
104
+ }
105
+ isBetaRedex(_parent: Enode, _node: Enode) {
106
+ return false;
107
+ }
108
+ addValue(_node: Enode, _model: ProtoModel, _values: (number | undefined)[]) {}
109
+ addDep(node: Enode, deps: Dependencies) {
110
+ deps.set(node, null);
111
+ return true;
112
+ }
113
+ includeFuncInterp(_decl: number) {
114
+ return false;
115
+ }
116
+ initModel() {}
117
+ finalizeModel(_model: ProtoModel) {}
118
+ hasUnhandled() {
119
+ return false;
120
+ }
121
+
122
+ protected visit(_expr: number) {
123
+ return false;
124
+ }
125
+
126
+ protected visited(_expr: number) {
127
+ return false;
128
+ }
129
+
130
+ protected postVisit(_expr: number, _isSign: boolean, _isRoot: boolean) {
131
+ return false;
132
+ }
133
+
134
+ protected visitRec(expr: number, isSign: boolean, isRoot: boolean) {
135
+ const manager = this.manager;
136
+ const stack = this.stack;
137
+ const base = stack.length;
138
+ this.visit(expr);
139
+ loop: while (stack.length > base) {
140
+ if (!manager.limit.inc()) throw new SmtCanceledError();
141
+ const frame = stack[stack.length - 1];
142
+ const current = frame.expr;
143
+ if (this.visited(current)) {
144
+ stack.pop();
145
+ continue;
146
+ }
147
+ const numArgs = manager.isApp(current) ? manager.getNumArgs(current) : 0;
148
+ while (frame.index < numArgs)
149
+ if (!this.visit(manager.getArg(current, frame.index++))) continue loop;
150
+ if (!this.visited(current) && !this.postVisit(current, isSign, isRoot && current === expr)) {
151
+ stack.length = base;
152
+ return false;
153
+ }
154
+ stack.pop();
155
+ }
156
+ return true;
157
+ }
158
+
159
+ mkVar(node: Enode) {
160
+ this.forcePush();
161
+ const thVar = this.var2enode.length;
162
+ this.var2enode.push(node);
163
+ return thVar;
164
+ }
165
+
166
+ get numVars() {
167
+ return this.var2enode.length;
168
+ }
169
+
170
+ var2enodeOf(thVar: number) {
171
+ return this.var2enode[thVar];
172
+ }
173
+
174
+ var2expr(thVar: number) {
175
+ return this.var2enode[thVar].owner;
176
+ }
177
+
178
+ getThVar(node: Enode) {
179
+ return node.getThVar(this.id);
180
+ }
181
+
182
+ getRepresentative(thVar: number) {
183
+ return this.getThVar(this.var2enode[thVar].root);
184
+ }
185
+
186
+ isAttachedToVar(node: Enode) {
187
+ const thVar = node.getThVar(this.id);
188
+ return thVar !== NULL_THEORY_VAR && this.var2enode[thVar] === node;
189
+ }
190
+
191
+ push() {
192
+ this.numScopes++;
193
+ }
194
+
195
+ pop(numScopes: number) {
196
+ const fromLazy = Math.min(this.numScopes, numScopes);
197
+ this.numScopes -= fromLazy;
198
+ if (numScopes > fromLazy) this.popCore(numScopes - fromLazy);
199
+ }
200
+
201
+ protected forcePush() {
202
+ for (; this.numScopes > 0; this.numScopes--) this.pushCore();
203
+ }
204
+
205
+ protected pushCore() {
206
+ this.var2enodeLim.push(this.var2enode.length);
207
+ }
208
+
209
+ protected popCore(numScopes: number) {
210
+ const newLvl = this.var2enodeLim.length - numScopes;
211
+ this.var2enode.length = this.var2enodeLim[newLvl];
212
+ this.var2enodeLim.length = newLvl;
213
+ }
214
+
215
+ expr2enode(expr: number) {
216
+ return this.ctx.getEnode(expr);
217
+ }
218
+
219
+ eInternalize(expr: number) {
220
+ return this.ctx.eInternalize(expr);
221
+ }
222
+
223
+ mkEnode(expr: number, isSuppressingArgs = false) {
224
+ const manager = this.manager;
225
+ const args = isSuppressingArgs
226
+ ? []
227
+ : manager.getArgs(expr).map((arg) => this.expr2enode(arg) as Enode);
228
+ const node = this.ctx.mkEnode(expr, args);
229
+ this.ctx.attachNode(node);
230
+ return node;
231
+ }
232
+
233
+ mkLiteral(expr: number) {
234
+ return this.ctx.mkLiteral(expr);
235
+ }
236
+
237
+ mkEq(first: number, second: number) {
238
+ return this.ctx.mkEq(first, second);
239
+ }
240
+
241
+ eqInternalize(first: number, second: number) {
242
+ return this.mkLiteral(this.ctx.mkEq(first, second));
243
+ }
244
+
245
+ expr2literal(expr: number) {
246
+ return this.ctx.expr2literal(expr);
247
+ }
248
+
249
+ literal2expr(lit: number) {
250
+ const expr = this.ctx.boolVar2expr(lit >> 1) as number;
251
+ return (lit & 1) === 1 ? mkNot(this.manager, expr) : expr;
252
+ }
253
+
254
+ boolVar2enode(boolVar: number) {
255
+ const expr = this.ctx.boolVar2expr(boolVar);
256
+ return expr === undefined ? undefined : this.expr2enode(expr);
257
+ }
258
+
259
+ boolVar2expr(boolVar: number) {
260
+ return this.ctx.boolVar2expr(boolVar);
261
+ }
262
+
263
+ isTrue(lit: number) {
264
+ return this.s.value(lit) === L_TRUE;
265
+ }
266
+
267
+ addUnit(lit: number) {
268
+ const wasTrue = this.isTrue(lit);
269
+ this.ctx.addClause([lit], false);
270
+ return !wasTrue;
271
+ }
272
+
273
+ addClause(lits: number[], isRedundant = false) {
274
+ let wasTrue = false;
275
+ for (const lit of lits) wasTrue ||= this.isTrue(lit);
276
+ this.ctx.addClause(lits, isRedundant);
277
+ return !wasTrue;
278
+ }
279
+
280
+ addEquiv(first: number, second: number) {
281
+ this.addClause([first ^ 1, second]);
282
+ this.addClause([first, second ^ 1]);
283
+ }
284
+
285
+ addEquivAnd(lit: number, lits: readonly number[]) {
286
+ for (const other of lits) this.addClause([lit ^ 1, other]);
287
+ this.addClause([...lits.map((other) => other ^ 1), lit]);
288
+ }
289
+
290
+ rewrite(expr: number) {
291
+ return this.ctx.rewrite(expr);
292
+ }
293
+
294
+ random() {
295
+ return this.s.rand.next();
296
+ }
297
+
298
+ mkPropagation(
299
+ lits: readonly number[],
300
+ eqs: readonly (readonly [Enode, Enode])[],
301
+ consequent: number,
302
+ eq: readonly [Enode, Enode] | null = null,
303
+ ) {
304
+ const explain: ThExplain = { lits, eqs, consequent, eq };
305
+ return this.ctx.mkConstraint(this, explain);
306
+ }
307
+
308
+ propagateLit(lits: readonly number[], eqs: readonly (readonly [Enode, Enode])[], lit: number) {
309
+ this.ctx.propagate(lit, this.mkPropagation(lits, eqs, lit));
310
+ }
311
+
312
+ propagateEq(
313
+ lits: readonly number[],
314
+ eqs: readonly (readonly [Enode, Enode])[],
315
+ first: Enode,
316
+ second: Enode,
317
+ ) {
318
+ return this.ctx.propagateEq(
319
+ first,
320
+ second,
321
+ this.mkPropagation(lits, eqs, NULL_LITERAL, [first, second]),
322
+ );
323
+ }
324
+
325
+ setConflict(lits: readonly number[], eqs: readonly (readonly [Enode, Enode])[]) {
326
+ this.ctx.setConflict(this.mkPropagation(lits, eqs, NULL_LITERAL));
327
+ }
328
+ }
@@ -0,0 +1,30 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ FAMILY_ARITH,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BV,
6
+ FAMILY_DATATYPE,
7
+ FAMILY_FPA,
8
+ FAMILY_MODEL_VALUE,
9
+ } from "../ast";
10
+ import { ArithSolver } from "./arith-solver";
11
+ import { ArraySolver } from "./array-solver";
12
+ import { BvSolver } from "./bv-solver";
13
+ import { DtSolver } from "./dt-solver";
14
+ import { FpaSolver } from "./fpa-solver";
15
+ import type { EufSolver } from "./euf-solver";
16
+ import { QSolver } from "./q-solver";
17
+ import type { ThSolver } from "./th-solver";
18
+
19
+ // euf::solver::get_solver: the theory solver of a family, or of quantifiers for family -1. Model
20
+ // values have none. A goal that needs a theory the port lacks goes back to the smt kernel.
21
+ export const mkThSolver = (ctx: EufSolver, family: number): ThSolver | null => {
22
+ if (family === -1) return new QSolver(ctx);
23
+ if (family === FAMILY_MODEL_VALUE) return null;
24
+ if (family === FAMILY_ARITH) return new ArithSolver(ctx, family);
25
+ if (family === FAMILY_ARRAY) return new ArraySolver(ctx, family);
26
+ if (family === FAMILY_BV) return new BvSolver(ctx, family);
27
+ if (family === FAMILY_DATATYPE) return new DtSolver(ctx, family);
28
+ if (family === FAMILY_FPA) return new FpaSolver(ctx, family);
29
+ throw new SmtUnsupportedError(`sat.euf theory of family ${family}`);
30
+ };
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/ast.h), MIT license, see z3-license.txt.
2
1
  import type { AstManager } from "./ast";
3
2
 
4
3
  export const assign = (manager: AstManager, old: number, value: number) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/expr_safe_replace.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import { KIND_APP, KIND_VAR, type AstManager } from "./ast";
4
3
  import { RefVector } from "./ref-vector";
@@ -80,6 +79,7 @@ export class ExprSafeReplace {
80
79
  const manager = this.manager;
81
80
  const data = manager.getQuantifier(quantifier);
82
81
  const patterns = new RefVector(manager);
82
+ const noPatterns = new RefVector(manager);
83
83
  let body = -1;
84
84
  const isAllGround =
85
85
  this.sources.items.every((source) => manager.isGroundApp(source)) &&
@@ -103,8 +103,18 @@ export class ExprSafeReplace {
103
103
  todo.push(pattern);
104
104
  hasAllData = false;
105
105
  }
106
+ for (const noPattern of data.noPatterns) {
107
+ const replaced = hasAllData ? this.cache.get(noPattern) : undefined;
108
+ if (replaced !== undefined) {
109
+ noPatterns.push(replaced);
110
+ continue;
111
+ }
112
+ todo.push(noPattern);
113
+ hasAllData = false;
114
+ }
106
115
  if (!hasAllData) {
107
116
  patterns.reset();
117
+ noPatterns.reset();
108
118
  if (body !== -1) manager.decRef(body);
109
119
  return;
110
120
  }
@@ -130,6 +140,7 @@ export class ExprSafeReplace {
130
140
  pattern = replaced;
131
141
  patterns.push(pattern);
132
142
  }
143
+ for (const original of data.noPatterns) noPatterns.pushOwned(replace.apply(original));
133
144
  const isAllVars = replace.sources.items.every(
134
145
  (replaced) => manager.kinds[replaced] === KIND_VAR,
135
146
  );
@@ -150,14 +161,27 @@ export class ExprSafeReplace {
150
161
  shifter.release();
151
162
  replace.release();
152
163
  }
153
- const result = manager.mkQuantifier({ ...data, body, patterns: patterns.items });
164
+ const result = manager.mkQuantifier({
165
+ ...data,
166
+ body,
167
+ patterns: patterns.items,
168
+ noPatterns: noPatterns.items,
169
+ });
154
170
  this.refs.push(result);
155
171
  this.cache.set(quantifier, result);
156
172
  todo.pop();
157
173
  patterns.reset();
174
+ noPatterns.reset();
158
175
  manager.decRef(body);
159
176
  }
160
177
 
178
+ reset() {
179
+ this.sources.reset();
180
+ this.targets.reset();
181
+ this.refs.reset();
182
+ this.cache.clear();
183
+ }
184
+
161
185
  release() {
162
186
  this.cache.clear();
163
187
  this.refs.reset();
@@ -0,0 +1,271 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ KIND_APP,
5
+ OP_ADD,
6
+ OP_MUL,
7
+ OP_NUM,
8
+ OP_POWER,
9
+ OP_SUB,
10
+ OP_TO_REAL,
11
+ OP_UMINUS,
12
+ SORT_INT,
13
+ SORT_REAL,
14
+ } from "./ast";
15
+ import {
16
+ type Polynomial,
17
+ type PolynomialManager,
18
+ PolynomialRef,
19
+ PolynomialRefVector,
20
+ } from "./nlsat/polynomial";
21
+ import { getLcm, Rational } from "./rational";
22
+ import { RefVector } from "./ref-vector";
23
+
24
+ interface Frame {
25
+ term: number;
26
+ index: number;
27
+ }
28
+
29
+ export class Expr2Polynomial {
30
+ private cache = new Map<number, number>();
31
+ private cachedDomain: RefVector;
32
+ private cachedPolynomials: PolynomialRefVector;
33
+ private cachedDenominators: bigint[] = [];
34
+ private frames: Frame[] = [];
35
+ private presult: PolynomialRefVector;
36
+ private dresult: bigint[] = [];
37
+ private var2expr: RefVector;
38
+
39
+ constructor(
40
+ private manager: AstManager,
41
+ readonly pm: PolynomialManager,
42
+ private t2x: Map<number, number>,
43
+ private mkVar: (isInt: boolean) => number,
44
+ ) {
45
+ this.cachedDomain = new RefVector(manager);
46
+ this.cachedPolynomials = new PolynomialRefVector(pm);
47
+ this.presult = new PolynomialRefVector(pm);
48
+ this.var2expr = new RefVector(manager);
49
+ }
50
+
51
+ private reset() {
52
+ this.frames.length = 0;
53
+ this.presult.reset();
54
+ this.dresult.length = 0;
55
+ }
56
+
57
+ private cacheResult(term: number) {
58
+ if (this.manager.getRefCount(term) <= 1) return;
59
+ this.cache.set(term, this.cachedPolynomials.size);
60
+ this.cachedDomain.push(term);
61
+ this.cachedPolynomials.push(this.presult.get(this.presult.size - 1));
62
+ this.cachedDenominators.push(this.dresult[this.dresult.length - 1]);
63
+ }
64
+
65
+ private storeResult(term: number, polynomial: Polynomial, denominator: bigint) {
66
+ this.presult.push(polynomial);
67
+ this.dresult.push(denominator);
68
+ this.cacheResult(term);
69
+ }
70
+
71
+ private storeVarPoly(term: number) {
72
+ let variable = this.t2x.get(term);
73
+ if (variable === undefined) {
74
+ variable = this.mkVar(this.manager.sorts[term] === SORT_INT);
75
+ this.t2x.set(term, variable);
76
+ if (variable >= this.var2expr.size) this.var2expr.resize(variable + 1);
77
+ this.var2expr.set(variable, term);
78
+ }
79
+ this.storeResult(term, this.pm.mkVar(variable), 1n);
80
+ }
81
+
82
+ private visitArithApp(term: number) {
83
+ const manager = this.manager;
84
+ switch (manager.getOp(term)) {
85
+ case OP_NUM: {
86
+ const value = manager.getRationalValue(term);
87
+ this.storeResult(term, this.pm.mkConst(value.num), value.den);
88
+ return true;
89
+ }
90
+ case OP_ADD:
91
+ case OP_SUB:
92
+ case OP_MUL:
93
+ case OP_UMINUS:
94
+ case OP_TO_REAL:
95
+ this.frames.push({ term, index: 0 });
96
+ return false;
97
+ case OP_POWER: {
98
+ const exponent = manager.getArg(term, 1);
99
+ const value = manager.isNumeral(exponent) ? manager.getRationalValue(exponent) : undefined;
100
+ if (value === undefined || !value.isInt() || value.num <= 0n || value.num > 0xffffffffn) {
101
+ this.storeVarPoly(term);
102
+ return true;
103
+ }
104
+ this.frames.push({ term, index: 0 });
105
+ return false;
106
+ }
107
+ default:
108
+ this.storeVarPoly(term);
109
+ return true;
110
+ }
111
+ }
112
+
113
+ private visit(term: number) {
114
+ const manager = this.manager;
115
+ const cached = manager.getRefCount(term) > 1 ? this.cache.get(term) : undefined;
116
+ if (cached !== undefined) {
117
+ this.presult.push(this.cachedPolynomials.get(cached));
118
+ this.dresult.push(this.cachedDenominators[cached]);
119
+ return true;
120
+ }
121
+ if (manager.kinds[term] !== KIND_APP || manager.getFamily(term) !== FAMILY_ARITH) {
122
+ this.storeVarPoly(term);
123
+ return true;
124
+ }
125
+ return this.visitArithApp(term);
126
+ }
127
+
128
+ private pop(numArgs: number) {
129
+ this.presult.shrink(this.presult.size - numArgs);
130
+ this.dresult.length -= numArgs;
131
+ }
132
+
133
+ private processAddSub(term: number, numArgs: number, isAdd: boolean) {
134
+ const pm = this.pm;
135
+ const first = this.presult.size - numArgs;
136
+ const p = new PolynomialRef(pm);
137
+ const pAux = new PolynomialRef(pm);
138
+ let denominator = 1n;
139
+ for (let index = 0; index < numArgs; index++)
140
+ denominator = getLcm(denominator, this.dresult[first + index]);
141
+ p.set(pm.zero);
142
+ for (let index = 0; index < numArgs; index++) {
143
+ pAux.set(
144
+ pm.mulConst(denominator / this.dresult[first + index], this.presult.get(first + index)),
145
+ );
146
+ if (index === 0) p.copy(pAux);
147
+ else p.set(isAdd ? pm.add(p.get(), pAux.get()) : pm.sub(p.get(), pAux.get()));
148
+ }
149
+ this.pop(numArgs);
150
+ this.storeResult(term, p.get(), denominator);
151
+ pAux.reset();
152
+ p.reset();
153
+ }
154
+
155
+ private processMul(term: number, numArgs: number) {
156
+ const first = this.presult.size - numArgs;
157
+ const p = new PolynomialRef(this.pm);
158
+ let denominator = 1n;
159
+ p.set(this.pm.one);
160
+ for (let index = 0; index < numArgs; index++) {
161
+ p.set(this.pm.mul(p.get(), this.presult.get(first + index)));
162
+ denominator *= this.dresult[first + index];
163
+ }
164
+ this.pop(numArgs);
165
+ this.storeResult(term, p.get(), denominator);
166
+ p.reset();
167
+ }
168
+
169
+ private processUminus(term: number) {
170
+ const negP = new PolynomialRef(this.pm);
171
+ negP.set(this.pm.neg(this.presult.get(this.presult.size - 1)));
172
+ this.presult.shrink(this.presult.size - 1);
173
+ this.presult.push(negP.get());
174
+ this.cacheResult(term);
175
+ negP.reset();
176
+ }
177
+
178
+ private processPower(term: number, numArgs: number) {
179
+ const first = this.presult.size - numArgs;
180
+ const k = Number(this.manager.getRationalValue(this.manager.getArg(term, 1)).num);
181
+ const p = new PolynomialRef(this.pm);
182
+ this.pm.pw(this.presult.get(first), k, p);
183
+ const denominator = this.dresult[first] ** BigInt(k);
184
+ this.pop(numArgs);
185
+ this.storeResult(term, p.get(), denominator);
186
+ p.reset();
187
+ }
188
+
189
+ private processApp(term: number) {
190
+ const numArgs = this.manager.getNumArgs(term);
191
+ switch (this.manager.getOp(term)) {
192
+ case OP_ADD:
193
+ return this.processAddSub(term, numArgs, true);
194
+ case OP_SUB:
195
+ return this.processAddSub(term, numArgs, false);
196
+ case OP_MUL:
197
+ return this.processMul(term, numArgs);
198
+ case OP_POWER:
199
+ return this.processPower(term, numArgs);
200
+ case OP_UMINUS:
201
+ return this.processUminus(term);
202
+ default:
203
+ return this.cacheResult(term);
204
+ }
205
+ }
206
+
207
+ toPolynomial(term: number, p: PolynomialRef) {
208
+ this.reset();
209
+ if (!this.visit(term)) {
210
+ const frames = this.frames;
211
+ while (frames.length > 0) {
212
+ const frame = frames[frames.length - 1];
213
+ const numArgs = this.manager.getNumArgs(frame.term);
214
+ let isPushed = false;
215
+ while (frame.index < numArgs) {
216
+ const arg = this.manager.getArg(frame.term, frame.index);
217
+ frame.index++;
218
+ if (!this.visit(arg)) {
219
+ isPushed = true;
220
+ break;
221
+ }
222
+ }
223
+ if (isPushed) continue;
224
+ this.processApp(frame.term);
225
+ frames.pop();
226
+ }
227
+ }
228
+ p.set(this.presult.get(this.presult.size - 1));
229
+ const denominator = this.dresult[this.dresult.length - 1];
230
+ this.reset();
231
+ return denominator;
232
+ }
233
+
234
+ private isIntVar(variable: number) {
235
+ return this.manager.sorts[this.var2expr.items[variable]] === SORT_INT;
236
+ }
237
+
238
+ toExpr(polynomial: Polynomial, isUsingPower: boolean) {
239
+ const manager = this.manager;
240
+ const isInt = polynomial.ms.every((monomial) =>
241
+ monomial.vars.every((variable) => this.isIntVar(variable)),
242
+ );
243
+ const sort = isInt ? SORT_INT : SORT_REAL;
244
+ const mkNumeral = (value: bigint) => manager.mkNumeralOfSort(Rational.of(value), sort);
245
+ const args = polynomial.ms.map((monomial, index) => {
246
+ const factors: number[] = [];
247
+ const coeff = polynomial.as[index];
248
+ if (coeff !== 1n) factors.push(mkNumeral(coeff));
249
+ for (const [position, variable] of monomial.vars.entries()) {
250
+ const term = this.var2expr.items[variable];
251
+ const base =
252
+ this.isIntVar(variable) && !isInt ? manager.mkApp(OP_TO_REAL, [term], SORT_REAL) : term;
253
+ const degree = monomial.degrees[position];
254
+ if (isUsingPower && degree > 1)
255
+ factors.push(manager.mkApp(OP_POWER, [base, mkNumeral(BigInt(degree))], SORT_REAL));
256
+ else for (let count = 0; count < degree; count++) factors.push(base);
257
+ }
258
+ if (factors.length === 0) return mkNumeral(1n);
259
+ return factors.length === 1 ? factors[0] : manager.mkApp(OP_MUL, factors, sort);
260
+ });
261
+ if (args.length === 0) return mkNumeral(0n);
262
+ return args.length === 1 ? args[0] : manager.mkApp(OP_ADD, args, sort);
263
+ }
264
+
265
+ release() {
266
+ this.presult.reset();
267
+ this.cachedPolynomials.reset();
268
+ this.cachedDomain.reset();
269
+ this.var2expr.reset();
270
+ }
271
+ }