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,287 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_AND,
7
+ OP_DISTINCT,
8
+ OP_EQ,
9
+ OP_IMPLIES,
10
+ OP_ITE,
11
+ OP_NUM,
12
+ OP_OR,
13
+ OP_XOR,
14
+ SORT_BOOL,
15
+ } from "../ast";
16
+ import { isAppOf, mkNot } from "../ast-util";
17
+ import type { ProtoModel } from "../proto-model";
18
+ import { RefVector } from "../ref-vector";
19
+
20
+ // A model and the expressions an mbp call makes, which live until the call releases them.
21
+ export class MbpContext {
22
+ readonly pinned: RefVector;
23
+ isCompletion = false;
24
+
25
+ constructor(
26
+ readonly manager: AstManager,
27
+ readonly model: ProtoModel,
28
+ ) {
29
+ this.pinned = new RefVector(manager);
30
+ }
31
+
32
+ pin(expr: number) {
33
+ this.pinned.push(expr);
34
+ return expr;
35
+ }
36
+
37
+ eval(expr: number, isCompletion = this.isCompletion) {
38
+ this.manager.incRef(expr);
39
+ const value = this.model.eval(expr, isCompletion);
40
+ this.pinned.pushOwned(value);
41
+ this.manager.decRef(expr);
42
+ return value;
43
+ }
44
+
45
+ isTrue(expr: number, isCompletion = this.isCompletion) {
46
+ return this.manager.isTrue(this.eval(expr, isCompletion));
47
+ }
48
+
49
+ isFalse(expr: number, isCompletion = this.isCompletion) {
50
+ return this.manager.isFalse(this.eval(expr, isCompletion));
51
+ }
52
+
53
+ release() {
54
+ this.pinned.reset();
55
+ }
56
+ }
57
+
58
+ const isIff = (manager: AstManager, expr: number) =>
59
+ isAppOf(manager, expr, OP_EQ) && manager.sorts[manager.getArg(expr, 0)] === SORT_BOOL;
60
+
61
+ export const getBinaryArgs = (manager: AstManager, expr: number, op: number) =>
62
+ isAppOf(manager, expr, op) && manager.getNumArgs(expr) === 2
63
+ ? [manager.getArg(expr, 0), manager.getArg(expr, 1)]
64
+ : undefined;
65
+
66
+ export const getNumeral = (manager: AstManager, expr: number) =>
67
+ isAppOf(manager, expr, OP_NUM) ? manager.getRationalValue(expr) : undefined;
68
+
69
+ export const markRec = (manager: AstManager, visited: Set<number>, expr: number) => {
70
+ const todo = [expr];
71
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
72
+ if (visited.has(current)) continue;
73
+ visited.add(current);
74
+ if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
75
+ else if (manager.kinds[current] === KIND_QUANTIFIER)
76
+ todo.push(manager.getQuantifier(current).body);
77
+ }
78
+ };
79
+
80
+ // Two arguments of a distinct term that is false in the model and are equal in it.
81
+ export const pickEquality = (context: MbpContext, distinct: number) => {
82
+ const manager = context.manager;
83
+ const args = manager.getArgs(distinct);
84
+ if (args.length === 2) return context.pin(manager.mkEq(args[0], args[1]));
85
+ const value2Expr = new Map<number, number>();
86
+ for (const arg of args) {
87
+ const value = context.eval(arg);
88
+ const other = value2Expr.get(value);
89
+ if (other !== undefined) return context.pin(manager.mkEq(arg, other));
90
+ value2Expr.set(value, arg);
91
+ }
92
+ for (const [index, first] of args.entries())
93
+ for (const second of args.slice(index + 1)) {
94
+ const eq = context.pin(manager.mkEq(first, second));
95
+ if (!context.isFalse(eq)) return eq;
96
+ }
97
+ throw new SmtUnsupportedError("pick_equality found no equal arguments");
98
+ };
99
+
100
+ const eraseLit = (lits: RefVector, index: number) => {
101
+ lits.set(index, lits.items[lits.size - 1]);
102
+ lits.pop();
103
+ return index - 1;
104
+ };
105
+
106
+ export class ProjectPlugin {
107
+ private cache = new Map<number, number>();
108
+ private boolVisited = new Set<number>();
109
+ private toVisit: number[] = [];
110
+
111
+ // extract_literals evaluates without model completion.
112
+ constructor(private context: MbpContext) {}
113
+
114
+ private pushBack(lits: RefVector, expr: number) {
115
+ if (!this.context.manager.isTrue(expr)) lits.push(expr);
116
+ }
117
+
118
+ private reduce(formula: number, lits: RefVector) {
119
+ const context = this.context;
120
+ const manager = context.manager;
121
+ const negated = manager.isNot(formula) ? manager.getArg(formula, 0) : -1;
122
+ const not = (expr: number) => context.pin(mkNot(manager, expr));
123
+ const arg = (expr: number, index: number) => manager.getArg(expr, index);
124
+ if (negated !== -1 && isAppOf(manager, negated, OP_DISTINCT))
125
+ this.pushBack(lits, pickEquality(context, negated));
126
+ else if (isAppOf(manager, formula, OP_OR)) {
127
+ const found = manager.getArgs(formula).find((disjunct) => context.isTrue(disjunct, false));
128
+ if (found !== undefined) lits.push(found);
129
+ } else if (isAppOf(manager, formula, OP_AND))
130
+ for (const conjunct of manager.getArgs(formula)) lits.push(conjunct);
131
+ else if (isIff(manager, formula) || (negated !== -1 && isAppOf(manager, negated, OP_XOR))) {
132
+ const source = isIff(manager, formula) ? formula : negated;
133
+ if (context.isFalse(arg(source, 0), false)) {
134
+ this.pushBack(lits, not(arg(source, 0)));
135
+ this.pushBack(lits, not(arg(source, 1)));
136
+ } else {
137
+ this.pushBack(lits, arg(source, 0));
138
+ this.pushBack(lits, arg(source, 1));
139
+ }
140
+ } else if (isAppOf(manager, formula, OP_IMPLIES)) {
141
+ if (context.isTrue(arg(formula, 1), false)) this.pushBack(lits, arg(formula, 1));
142
+ else this.pushBack(lits, not(arg(formula, 0)));
143
+ } else if (isAppOf(manager, formula, OP_ITE)) {
144
+ if (context.isTrue(arg(formula, 0), false)) {
145
+ this.pushBack(lits, arg(formula, 0));
146
+ this.pushBack(lits, arg(formula, 1));
147
+ } else {
148
+ this.pushBack(lits, not(arg(formula, 0)));
149
+ this.pushBack(lits, arg(formula, 2));
150
+ }
151
+ } else if (negated !== -1 && manager.isNot(negated)) this.pushBack(lits, arg(negated, 0));
152
+ else if (negated !== -1 && isAppOf(manager, negated, OP_AND)) {
153
+ const found = manager.getArgs(negated).find((conjunct) => context.isFalse(conjunct, false));
154
+ if (found !== undefined) this.pushBack(lits, not(found));
155
+ } else if (negated !== -1 && isAppOf(manager, negated, OP_OR))
156
+ for (const disjunct of manager.getArgs(negated)) this.pushBack(lits, not(disjunct));
157
+ else if ((negated !== -1 && isIff(manager, negated)) || isAppOf(manager, formula, OP_XOR)) {
158
+ const source = negated !== -1 && isIff(manager, negated) ? negated : formula;
159
+ let first = arg(source, 0);
160
+ let second = arg(source, 1);
161
+ if (context.isTrue(first, false)) second = not(second);
162
+ else first = not(first);
163
+ this.pushBack(lits, first);
164
+ this.pushBack(lits, second);
165
+ } else if (negated !== -1 && isAppOf(manager, negated, OP_IMPLIES)) {
166
+ this.pushBack(lits, arg(negated, 0));
167
+ this.pushBack(lits, not(arg(negated, 1)));
168
+ } else if (negated !== -1 && isAppOf(manager, negated, OP_ITE)) {
169
+ if (context.isTrue(arg(negated, 0), false)) {
170
+ this.pushBack(lits, arg(negated, 0));
171
+ this.pushBack(lits, not(arg(negated, 1)));
172
+ } else {
173
+ this.pushBack(lits, not(arg(negated, 0)));
174
+ this.pushBack(lits, not(arg(negated, 2)));
175
+ }
176
+ } else return false;
177
+ return true;
178
+ }
179
+
180
+ // Replaces the formulas by literals that are true in the model and imply them.
181
+ extractLiterals(lits: RefVector) {
182
+ const manager = this.context.manager;
183
+ this.cache.clear();
184
+ this.boolVisited.clear();
185
+ for (let index = 0; index < lits.size; index++) {
186
+ const formula = lits.items[index];
187
+ if (this.reduce(formula, lits)) index = eraseLit(lits, index);
188
+ else if (manager.isNot(formula))
189
+ this.extractBools(lits, index, manager.getArg(formula, 0), false);
190
+ else this.extractBools(lits, index, formula, true);
191
+ }
192
+ }
193
+
194
+ private extractBools(lits: RefVector, index: number, formula: number, isPositive: boolean) {
195
+ const context = this.context;
196
+ const manager = context.manager;
197
+ if (manager.kinds[formula] !== KIND_APP) return;
198
+ this.toVisit = manager.getArgs(formula);
199
+ while (this.toVisit.length > 0) {
200
+ const expr = this.toVisit[this.toVisit.length - 1];
201
+ if (this.cache.has(expr)) this.toVisit.pop();
202
+ else if (manager.kinds[expr] !== KIND_APP) {
203
+ this.cache.set(expr, expr);
204
+ this.toVisit.pop();
205
+ } else if (this.visitIte(expr, lits)) continue;
206
+ else if (this.visitBool(expr, lits)) continue;
207
+ else this.visitApp(expr);
208
+ }
209
+ this.toVisit.push(formula);
210
+ this.visitApp(formula);
211
+ const result = this.cache.get(formula) as number;
212
+ if (result !== formula)
213
+ lits.set(index, isPositive ? result : context.pin(mkNot(manager, result)));
214
+ }
215
+
216
+ private isTrueValue(expr: number) {
217
+ const manager = this.context.manager;
218
+ const value = this.context.eval(expr, false);
219
+ const isTrue = manager.isTrue(value);
220
+ if (!isTrue && !manager.isFalse(value) && containsUninterpreted(manager, value))
221
+ throw new SmtUnsupportedError("could not evaluate Boolean in model");
222
+ return isTrue;
223
+ }
224
+
225
+ private visitIte(expr: number, lits: RefVector) {
226
+ const manager = this.context.manager;
227
+ if (!isAppOf(manager, expr, OP_ITE)) return false;
228
+ const condition = manager.getArg(expr, 0);
229
+ const isTrue = this.isTrueValue(condition);
230
+ if (!this.boolVisited.has(condition))
231
+ lits.push(isTrue ? condition : this.context.pin(mkNot(manager, condition)));
232
+ this.boolVisited.add(condition);
233
+ const branch = manager.getArg(expr, isTrue ? 1 : 2);
234
+ const cached = this.cache.get(branch);
235
+ if (cached !== undefined) {
236
+ this.toVisit.pop();
237
+ this.cache.set(expr, cached);
238
+ } else this.toVisit.push(branch);
239
+ return true;
240
+ }
241
+
242
+ private visitBool(expr: number, lits: RefVector) {
243
+ const manager = this.context.manager;
244
+ if (manager.sorts[expr] !== SORT_BOOL || manager.isTrue(expr) || manager.isFalse(expr))
245
+ return false;
246
+ const isTrue = this.isTrueValue(expr);
247
+ if (!this.boolVisited.has(expr))
248
+ lits.push(isTrue ? expr : this.context.pin(mkNot(manager, expr)));
249
+ this.boolVisited.add(expr);
250
+ this.cache.set(expr, isTrue ? manager.trueExpr : manager.falseExpr);
251
+ this.toVisit.pop();
252
+ return true;
253
+ }
254
+
255
+ private visitApp(expr: number) {
256
+ const manager = this.context.manager;
257
+ const size = this.toVisit.length;
258
+ const args: number[] = [];
259
+ let isDifferent = false;
260
+ for (const arg of manager.getArgs(expr)) {
261
+ const cached = this.cache.get(arg);
262
+ isDifferent ||= cached !== arg;
263
+ if (cached === undefined) this.toVisit.push(arg);
264
+ else args.push(cached);
265
+ }
266
+ if (size !== this.toVisit.length) return;
267
+ this.cache.set(
268
+ expr,
269
+ isDifferent
270
+ ? this.context.pin(manager.mkApp(manager.decls[expr], args, manager.sorts[expr]))
271
+ : expr,
272
+ );
273
+ this.toVisit.pop();
274
+ }
275
+ }
276
+
277
+ const containsUninterpreted = (manager: AstManager, expr: number) => {
278
+ const visited = new Set<number>();
279
+ const todo = [expr];
280
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
281
+ if (visited.has(current) || manager.kinds[current] !== KIND_APP) continue;
282
+ visited.add(current);
283
+ if (manager.isUninterpreted(current)) return true;
284
+ manager.pushArgs(current, todo);
285
+ }
286
+ return false;
287
+ };
@@ -0,0 +1,48 @@
1
+ import { OP_DISTINCT, OP_IMPLIES, OP_ITE, OP_OR, SORT_BOOL } from "../ast";
2
+ import { flattenAndVector, isAppOf } from "../ast-util";
3
+ import { RefVector } from "../ref-vector";
4
+ import { MbpBasicTg } from "./mbp-basic-tg";
5
+ import type { MbpContext } from "./mbp-plugin";
6
+ import { TermGraph } from "./mbp-term-graph";
7
+
8
+ // Projects the variables with the term graph's rules until saturation, first without and then with
9
+ // splits on the model. The caller rules out arrays and datatypes, whose rules are not ported.
10
+ export const applyMbpQel = (context: MbpContext, vars: RefVector, formula: number) => {
11
+ const manager = context.manager;
12
+ if (vars.size === 0) return formula;
13
+ // Splitting also visits inactive branches, whose conditions may be undefined.
14
+ const wasCompletion = context.isCompletion;
15
+ context.isCompletion = true;
16
+ const termGraph = new TermGraph(manager);
17
+ termGraph.addVars(vars.items);
18
+ termGraph.setExplicitEq();
19
+ const fmls = new RefVector(manager);
20
+ fmls.push(formula);
21
+ flattenAndVector(manager, fmls);
22
+ termGraph.addLits(fmls.items);
23
+ fmls.reset();
24
+ const basic = new MbpBasicTg(context, termGraph, new Set());
25
+ while (basic.apply());
26
+ basic.isUsingModel = true;
27
+ while (basic.apply());
28
+ termGraph.qel(vars);
29
+ const isNonCore = (expr: number) =>
30
+ isAppOf(manager, expr, OP_ITE) ||
31
+ isAppOf(manager, expr, OP_OR) ||
32
+ isAppOf(manager, expr, OP_IMPLIES) ||
33
+ isAppOf(manager, expr, OP_DISTINCT);
34
+ termGraph.qel(vars, isNonCore);
35
+ // The remaining Boolean variables get their values.
36
+ const substituted = new Set<number>();
37
+ for (const innerVar of vars.items) {
38
+ if (manager.sorts[innerVar] !== SORT_BOOL) continue;
39
+ substituted.add(innerVar);
40
+ termGraph.addEq(innerVar, context.eval(innerVar));
41
+ }
42
+ const result = context.pin(
43
+ termGraph.qel(vars, (expr) => isAppOf(manager, expr, OP_ITE) || substituted.has(expr)),
44
+ );
45
+ termGraph.release();
46
+ context.isCompletion = wasCompletion;
47
+ return result;
48
+ };
@@ -0,0 +1,271 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_BASIC,
5
+ OP_ADD,
6
+ OP_EQ,
7
+ OP_GE,
8
+ OP_IDIV,
9
+ OP_ITE,
10
+ OP_LE,
11
+ OP_MOD,
12
+ OP_MUL,
13
+ OP_SUB,
14
+ OP_UMINUS,
15
+ SORT_BOOL,
16
+ SORT_INT,
17
+ SORT_REAL,
18
+ } from "../ast";
19
+ import { isAppOf, mkNot } from "../ast-util";
20
+ import { Rational } from "../rational";
21
+ import { getBinaryArgs, getNumeral } from "./mbp-plugin";
22
+
23
+ export interface SolvePlugin {
24
+ readonly family: number;
25
+ // Rewrites the atom of a literal into a form that solves for a variable. The result lives as
26
+ // long as the caller's pin does.
27
+ solve(atom: number, isPositive: boolean): number;
28
+ }
29
+
30
+ interface SignedExpr {
31
+ isPositive: boolean;
32
+ expr: number;
33
+ }
34
+
35
+ const isZero = (manager: AstManager, expr: number) => getNumeral(manager, expr)?.isZero() === true;
36
+
37
+ export const mkArithSolvePlugin = (
38
+ manager: AstManager,
39
+ isVariable: (expr: number) => boolean,
40
+ pin: (expr: number) => number,
41
+ ): SolvePlugin => {
42
+ const mkNumeral = (value: Rational, isInt: boolean) =>
43
+ manager.mkNumeralOfSort(value, isInt ? SORT_INT : SORT_REAL);
44
+
45
+ const mkAddSimplify = (args: number[], sort: number) =>
46
+ args.length === 0
47
+ ? manager.mkNumeral(0n)
48
+ : args.length === 1
49
+ ? args[0]
50
+ : manager.mkApp(OP_ADD, args, sort);
51
+
52
+ // r * (sum of sign * e)
53
+ const mkTerm = (isInt: boolean, factor: Rational, isPositive: boolean, exprs: SignedExpr[]) => {
54
+ const sort = isInt ? SORT_INT : SORT_REAL;
55
+ const result = exprs.map((signed) => {
56
+ const scaled = isPositive === signed.isPositive ? factor.neg() : factor;
57
+ return scaled.equals(Rational.one)
58
+ ? signed.expr
59
+ : manager.mkApp(OP_MUL, [mkNumeral(scaled, isInt), signed.expr], sort);
60
+ });
61
+ return pin(mkAddSimplify(result, sort));
62
+ };
63
+
64
+ const getInvertibleConst = (isInt: boolean, expr: number): Rational | undefined => {
65
+ if (isAppOf(manager, expr, OP_UMINUS))
66
+ return getInvertibleConst(isInt, manager.getArg(expr, 0))?.neg();
67
+ const value = getNumeral(manager, expr);
68
+ if (value === undefined || value.isZero()) return undefined;
69
+ return !isInt || value.equals(Rational.one) || value.equals(Rational.minusOne)
70
+ ? value
71
+ : undefined;
72
+ };
73
+
74
+ // Whether the term is value * v, for a value that is safe to divide by.
75
+ const getInvertibleMul = (isInt: boolean, expr: number) => {
76
+ if (isVariable(expr)) return { expr, value: Rational.one };
77
+ const args = getBinaryArgs(manager, expr, OP_MUL);
78
+ if (args === undefined) return undefined;
79
+ if (isVariable(args[0])) {
80
+ const value = getInvertibleConst(isInt, args[1]);
81
+ if (value !== undefined) return { expr: args[0], value };
82
+ }
83
+ if (isVariable(args[1])) {
84
+ const value = getInvertibleConst(isInt, args[0]);
85
+ if (value !== undefined) return { expr: args[1], value };
86
+ }
87
+ return undefined;
88
+ };
89
+
90
+ // Whether lhs = rhs solves as v = t for a variable v.
91
+ const solveEq = (lhs: number, rhs: number) => {
92
+ if (manager.sorts[lhs] !== SORT_INT && manager.sorts[rhs] !== SORT_REAL) return undefined;
93
+ const isInt = manager.sorts[lhs] === SORT_INT;
94
+ const todo: SignedExpr[] = [
95
+ { isPositive: true, expr: lhs },
96
+ { isPositive: false, expr: rhs },
97
+ ];
98
+ const done: SignedExpr[] = [];
99
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
100
+ const expr = item.expr;
101
+ const isPositive = item.isPositive;
102
+ const op = manager.getOp(expr);
103
+ if (op === OP_ADD)
104
+ for (const arg of manager.getArgs(expr)) todo.push({ isPositive, expr: arg });
105
+ else if (op === OP_SUB) {
106
+ const args = manager.getArgs(expr);
107
+ todo.push({ isPositive, expr: args[0] });
108
+ for (const arg of args.slice(1)) todo.push({ isPositive: !isPositive, expr: arg });
109
+ } else if (op === OP_UMINUS)
110
+ todo.push({ isPositive: !isPositive, expr: manager.getArg(expr, 0) });
111
+ else {
112
+ const mul = getInvertibleMul(isInt, expr);
113
+ if (mul !== undefined) {
114
+ done.push(...todo);
115
+ return {
116
+ variable: mul.expr,
117
+ term: mkTerm(isInt, Rational.one.div(mul.value), isPositive, done),
118
+ };
119
+ }
120
+ done.push(item);
121
+ }
122
+ }
123
+ return undefined;
124
+ };
125
+
126
+ const mkEqCore = (first: number, second: number) => {
127
+ const solved = solveEq(first, second);
128
+ if (solved !== undefined) return manager.mkEq(solved.variable, solved.term);
129
+ let left = first;
130
+ let right = second;
131
+ if (isZero(manager, left)) [left, right] = [right, left];
132
+ // y + -1*x == 0 --> y = x
133
+ const args = isZero(manager, right) ? getBinaryArgs(manager, left, OP_ADD) : undefined;
134
+ if (args !== undefined) {
135
+ const negated1 = manager.getTimesMinusOneArg(args[1]);
136
+ const negated0 = manager.getTimesMinusOneArg(args[0]);
137
+ if (negated1 !== undefined) {
138
+ left = args[0];
139
+ right = negated1;
140
+ } else if (negated0 !== undefined) {
141
+ left = args[1];
142
+ right = negated0;
143
+ }
144
+ }
145
+ return manager.mkEq(left, right);
146
+ };
147
+
148
+ const mkZero = () => manager.mkNumeral(0n);
149
+
150
+ const mkBoundZero = (arg: number, op: number) => {
151
+ const args = getBinaryArgs(manager, arg, OP_ADD);
152
+ if (args !== undefined) {
153
+ const negated1 = manager.getTimesMinusOneArg(args[1]);
154
+ if (negated1 !== undefined) return manager.mkApp(op, [args[0], negated1], SORT_BOOL);
155
+ const negated0 = manager.getTimesMinusOneArg(args[0]);
156
+ if (negated0 !== undefined) return manager.mkApp(op, [args[1], negated0], SORT_BOOL);
157
+ }
158
+ return manager.mkApp(op, [arg, mkZero()], SORT_BOOL);
159
+ };
160
+
161
+ const mkLeCore = (arg1: number, arg2: number) => {
162
+ const value = getNumeral(manager, arg2);
163
+ const isInt = manager.sorts[arg1] === SORT_INT;
164
+ // t <= -1 ==> ! (t >= 0)
165
+ if (isInt && value?.equals(Rational.minusOne)) return manager.mkNot(mkBoundZero(arg1, OP_GE));
166
+ if (value?.isZero()) return mkBoundZero(arg1, OP_LE);
167
+ // t <= n ==> ! (t >= n + 1)
168
+ if (isInt && value !== undefined && value.isNegative())
169
+ return manager.mkNot(
170
+ manager.mkApp(OP_GE, [arg1, manager.mkNumeral(value.num + 1n)], SORT_BOOL),
171
+ );
172
+ return undefined;
173
+ };
174
+
175
+ const mkGeCore = (arg1: number, arg2: number) => {
176
+ const value = getNumeral(manager, arg2);
177
+ const isInt = manager.sorts[arg1] === SORT_INT;
178
+ // t >= 1 ==> ! (t <= 0)
179
+ if (isInt && value?.equals(Rational.one)) return manager.mkNot(mkBoundZero(arg1, OP_LE));
180
+ if (value?.isZero()) return mkBoundZero(arg1, OP_GE);
181
+ // t >= n ==> ! (t <= n - 1)
182
+ if (isInt && value !== undefined && value.isPositive())
183
+ return manager.mkNot(
184
+ manager.mkApp(OP_LE, [arg1, manager.mkNumeral(value.num - 1n)], SORT_BOOL),
185
+ );
186
+ return undefined;
187
+ };
188
+
189
+ // k*y == x -----> y = x div k && x mod k == 0
190
+ const tryIntMulSolve = (atom: number, isPositive: boolean) => {
191
+ if (!isPositive) return undefined;
192
+ const eq = getBinaryArgs(manager, atom, OP_EQ);
193
+ if (eq === undefined || manager.sorts[eq[0]] !== SORT_INT) return undefined;
194
+ let [lhs, rhs] = eq;
195
+ if (!isAppOf(manager, rhs, OP_MUL)) {
196
+ if (!isAppOf(manager, lhs, OP_MUL)) return undefined;
197
+ [lhs, rhs] = [rhs, lhs];
198
+ }
199
+ const factors = getBinaryArgs(manager, rhs, OP_MUL);
200
+ if (factors === undefined) return undefined;
201
+ let [first, second] = factors;
202
+ if (!manager.isNumeral(first)) {
203
+ if (!manager.isNumeral(second)) return undefined;
204
+ [first, second] = [second, first];
205
+ }
206
+ if (isZero(manager, first)) return manager.mkEq(lhs, manager.mkNumeral(0n));
207
+ const quotientEq = manager.mkEq(second, manager.mkApp(OP_IDIV, [lhs, first], SORT_INT));
208
+ const remainderEq = manager.mkEq(
209
+ manager.mkNumeral(0n),
210
+ manager.mkApp(OP_MOD, [lhs, first], SORT_INT),
211
+ );
212
+ return manager.mkAnd([quotientEq, remainderEq]);
213
+ };
214
+
215
+ const arithSolve = (atom: number, isPositive: boolean) => {
216
+ const solved = tryIntMulSolve(atom, isPositive);
217
+ if (solved !== undefined) return pin(solved);
218
+ let result = atom;
219
+ const eq = getBinaryArgs(manager, atom, OP_EQ);
220
+ if (eq !== undefined) {
221
+ const found = solveEq(eq[0], eq[1]);
222
+ result = found === undefined ? mkEqCore(eq[0], eq[1]) : mkEqCore(found.variable, found.term);
223
+ } else if (isAppOf(manager, atom, OP_LE))
224
+ result = mkLeCore(manager.getArg(atom, 0), manager.getArg(atom, 1)) ?? atom;
225
+ else if (isAppOf(manager, atom, OP_GE))
226
+ result = mkGeCore(manager.getArg(atom, 0), manager.getArg(atom, 1)) ?? atom;
227
+ pin(result);
228
+ return isPositive ? result : pin(mkNot(manager, result));
229
+ };
230
+
231
+ return { family: FAMILY_ARITH, solve: arithSolve };
232
+ };
233
+
234
+ export const mkBasicSolvePlugin = (
235
+ manager: AstManager,
236
+ isVariable: (expr: number) => boolean,
237
+ pin: (expr: number) => number,
238
+ ): SolvePlugin => {
239
+ const basicSolve = (atom: number, isPositive: boolean): number => {
240
+ let result = atom;
241
+ const eq = getBinaryArgs(manager, atom, OP_EQ);
242
+ if (eq !== undefined) {
243
+ const [lhs, rhs] = eq;
244
+ if (manager.isNot(lhs) && isVariable(manager.getArg(lhs, 0)))
245
+ result = manager.mkEq(manager.getArg(lhs, 0), mkNot(manager, rhs));
246
+ else if (manager.isNot(rhs) && isVariable(manager.getArg(rhs, 0)))
247
+ result = manager.mkEq(manager.getArg(rhs, 0), mkNot(manager, lhs));
248
+ else if (isVariable(rhs) && !isVariable(lhs)) result = manager.mkEq(rhs, lhs);
249
+ pin(result);
250
+ }
251
+ // (ite cond (= VAR t) (= VAR t2))
252
+ if (isAppOf(manager, atom, OP_ITE)) {
253
+ const solved1 = basicSolve(manager.getArg(atom, 1), true);
254
+ const solved2 = basicSolve(manager.getArg(atom, 2), true);
255
+ const eq1 = getBinaryArgs(manager, solved1, OP_EQ);
256
+ const eq2 = getBinaryArgs(manager, solved2, OP_EQ);
257
+ if (eq1 !== undefined && eq2 !== undefined && eq1[0] === eq2[0])
258
+ result = pin(
259
+ manager.mkEq(
260
+ eq1[0],
261
+ manager.mkApp(OP_ITE, [manager.getArg(atom, 0), eq1[1], eq2[1]], manager.sorts[eq1[1]]),
262
+ ),
263
+ );
264
+ }
265
+ if (isVariable(atom) && manager.sorts[atom] === SORT_BOOL)
266
+ return pin(manager.mkEq(atom, isPositive ? manager.trueExpr : manager.falseExpr));
267
+ return isPositive ? result : pin(mkNot(manager, result));
268
+ };
269
+
270
+ return { family: FAMILY_BASIC, solve: basicSolve };
271
+ };