tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  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 +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,381 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ KIND_VAR,
5
+ OP_ARRAY_MAP,
6
+ OP_AS_ARRAY,
7
+ OP_IMPLIES,
8
+ SORT_BOOL,
9
+ } from "./ast";
10
+ import {
11
+ AckrInfo,
12
+ type AppOcc,
13
+ calculateLemmaBound,
14
+ createFun2Terms,
15
+ createSel2Terms,
16
+ insertTerm,
17
+ isAckrSelect,
18
+ isUninterpFn,
19
+ markNonSelect,
20
+ pruneNonMarked,
21
+ } from "./ackr-helper";
22
+ import type { Goal } from "./goal";
23
+ import { ObjMap } from "./hashtable";
24
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
25
+ import { ModelEvaluator } from "./model-evaluator";
26
+ import { ProtoModel } from "./proto-model";
27
+ import { RefVector } from "./ref-vector";
28
+ import { type RewriterOptions, Rewriter } from "./rewriter";
29
+
30
+ export interface AckrSolver {
31
+ assert: (expr: number) => void;
32
+ check: () => number;
33
+ getModel: () => ProtoModel;
34
+ release: () => void;
35
+ }
36
+
37
+ interface ValInfo {
38
+ value: number;
39
+ sourceTerm: number;
40
+ }
41
+
42
+ class LackrModelConstructor {
43
+ conflicts: [number, number][] = [];
44
+ private pinned: RefVector;
45
+ private values2val: ObjMap<ValInfo>;
46
+ private app2val: ObjMap<number>;
47
+ private visited = new Set<number>();
48
+ private evaluator: ModelEvaluator | undefined;
49
+
50
+ constructor(
51
+ private manager: AstManager,
52
+ private info: AckrInfo,
53
+ private abstrModel: ProtoModel,
54
+ ) {
55
+ this.pinned = new RefVector(manager);
56
+ this.values2val = new ObjMap((expr) => manager.hashes[expr]);
57
+ this.app2val = new ObjMap((expr) => manager.hashes[expr]);
58
+ }
59
+
60
+ check() {
61
+ const manager = this.manager;
62
+ let isOk = true;
63
+ for (const decl of this.abstrModel.getConstDecls()) {
64
+ const term =
65
+ this.info.findTerm(decl) ?? manager.mkApp(decl, [], manager.funcDecls[decl].range);
66
+ if (!this.checkTerm(term)) isOk = false;
67
+ }
68
+ return isOk;
69
+ }
70
+
71
+ release() {
72
+ this.evaluator?.release();
73
+ this.pinned.reset();
74
+ }
75
+
76
+ private checkTerm(term: number) {
77
+ const manager = this.manager;
78
+ this.evaluator ??= new ModelEvaluator(manager, new ProtoModel(manager).mkModel());
79
+ const stack = [term];
80
+ while (stack.length > 0) {
81
+ const current = stack[stack.length - 1];
82
+ if (this.visited.has(current)) {
83
+ stack.pop();
84
+ continue;
85
+ }
86
+ let isDone = true;
87
+ for (const arg of manager.getArgs(current))
88
+ if (!this.visited.has(arg)) {
89
+ stack.push(arg);
90
+ isDone = false;
91
+ }
92
+ if (!isDone) continue;
93
+ this.visited.add(current);
94
+ stack.pop();
95
+ if (!this.mkValue(current)) return false;
96
+ }
97
+ return true;
98
+ }
99
+
100
+ private getCachedValue(app: number) {
101
+ return this.manager.isValue(app) ? app : this.app2val.get(app);
102
+ }
103
+
104
+ private mkValue(app: number) {
105
+ const manager = this.manager;
106
+ if (manager.isValue(app)) return true;
107
+ const result = this.evaluate(app);
108
+ if (result === undefined) return false;
109
+ this.app2val.set(app, result);
110
+ this.pinned.push(app);
111
+ this.pinned.push(result);
112
+ manager.decRef(result);
113
+ return true;
114
+ }
115
+
116
+ // The result comes with a reference.
117
+ private evaluate(app: number) {
118
+ const manager = this.manager;
119
+ const decl = manager.decls[app];
120
+ if (manager.getNumArgs(app) === 0) {
121
+ const value =
122
+ this.abstrModel.constInterps.get(decl) ??
123
+ this.abstrModel.getSomeValue(manager.funcDecls[decl].range);
124
+ manager.incRef(value);
125
+ return value;
126
+ }
127
+ const values = new RefVector(manager);
128
+ for (const arg of manager.getArgs(app)) {
129
+ const value = this.getCachedValue(arg);
130
+ if (value === undefined) {
131
+ values.reset();
132
+ return undefined;
133
+ }
134
+ values.push(value);
135
+ }
136
+ const term = manager.mkApp(decl, values.items, manager.sorts[app]);
137
+ manager.incRef(term);
138
+ const result = isUninterpFn(manager, app)
139
+ ? this.mkUninterpretedValue(app, term)
140
+ : isAckrSelect(manager, app)
141
+ ? undefined
142
+ : (this.evaluator as ModelEvaluator).rewrite(term);
143
+ manager.decRef(term);
144
+ values.reset();
145
+ return result;
146
+ }
147
+
148
+ private mkUninterpretedValue(app: number, key: number) {
149
+ const manager = this.manager;
150
+ const abstrDecl = manager.decls[this.info.getAbstr(app)];
151
+ const value =
152
+ this.abstrModel.constInterps.get(abstrDecl) ??
153
+ this.abstrModel.getSomeValue(manager.funcDecls[abstrDecl].range);
154
+ const existing = this.values2val.get(key);
155
+ if (existing === undefined) {
156
+ this.values2val.set(key, { value, sourceTerm: app });
157
+ this.pinned.push(app);
158
+ this.pinned.push(value);
159
+ this.pinned.push(key);
160
+ manager.incRef(value);
161
+ return value;
162
+ }
163
+ if (existing.value !== value) {
164
+ this.conflicts.push([app, existing.sourceTerm]);
165
+ return undefined;
166
+ }
167
+ manager.incRef(existing.value);
168
+ return existing.value;
169
+ }
170
+ }
171
+
172
+ export class Lackr {
173
+ readonly info: AckrInfo;
174
+ model: ProtoModel | undefined;
175
+ private abstr: RefVector;
176
+ private fun2terms: ObjMap<AppOcc>;
177
+ private sel2terms: ObjMap<AppOcc>;
178
+ private simp: Rewriter;
179
+ private ackrs: RefVector;
180
+ private nonSelect = new Set<number>();
181
+ private nonFuns = new Set<number>();
182
+ private isInit = false;
183
+
184
+ constructor(
185
+ private manager: AstManager,
186
+ private formulas: readonly number[],
187
+ rewriterOptions: RewriterOptions,
188
+ private isEager: boolean,
189
+ private solver?: AckrSolver,
190
+ ) {
191
+ this.abstr = new RefVector(manager);
192
+ this.fun2terms = createFun2Terms(manager);
193
+ this.sel2terms = createSel2Terms(manager);
194
+ this.info = new AckrInfo(manager);
195
+ this.simp = new Rewriter(manager, rewriterOptions);
196
+ this.ackrs = new RefVector(manager);
197
+ }
198
+
199
+ solve() {
200
+ if (!this.init()) return L_UNDEF;
201
+ const result = this.isEager ? this.eager() : this.lazy();
202
+ if (result === L_TRUE) this.model = this.solver?.getModel();
203
+ return result;
204
+ }
205
+
206
+ mkAckermann(goal: Goal, lemmasUpperBound: number) {
207
+ if (lemmasUpperBound <= 0 || !this.init()) return false;
208
+ if (calculateLemmaBound(this.fun2terms, this.sel2terms) > lemmasUpperBound) return false;
209
+ this.eagerEnc();
210
+ for (const form of this.abstr.items) goal.assert(form);
211
+ for (const form of this.ackrs.items) goal.assert(form);
212
+ return true;
213
+ }
214
+
215
+ // ~lackr: the lemmas, the simplifier, the abstraction info and the abstractions, in that order.
216
+ release(isInfoKept: boolean) {
217
+ this.ackrs.reset();
218
+ this.simp.release();
219
+ if (!isInfoKept) this.info.release();
220
+ this.abstr.reset();
221
+ }
222
+
223
+ private init() {
224
+ if (this.isInit) return true;
225
+ if (!this.collectTerms()) return false;
226
+ this.abstract();
227
+ this.isInit = true;
228
+ return true;
229
+ }
230
+
231
+ private isEqual(first: number, second: number) {
232
+ const manager = this.manager;
233
+ return (
234
+ first === second ||
235
+ (manager.isAlgebraicNumeral(first) &&
236
+ manager.isAlgebraicNumeral(second) &&
237
+ manager.am.compare(manager.getAlgebraicValue(first), manager.getAlgebraicValue(second)) ===
238
+ 0)
239
+ );
240
+ }
241
+
242
+ private ackr(first: number, second: number) {
243
+ const manager = this.manager;
244
+ const eqs = new RefVector(manager);
245
+ for (let index = 0; index < manager.getNumArgs(first); index++) {
246
+ const firstArg = manager.getArg(first, index);
247
+ const secondArg = manager.getArg(second, index);
248
+ if (this.isEqual(firstArg, secondArg)) continue;
249
+ if (manager.areDistinct(firstArg, secondArg)) {
250
+ eqs.reset();
251
+ return false;
252
+ }
253
+ eqs.push(manager.mkEq(firstArg, secondArg));
254
+ }
255
+ const lhs = manager.mkAnd(eqs.items);
256
+ manager.incRef(lhs);
257
+ const rhs = manager.mkEq(this.info.getAbstr(first), this.info.getAbstr(second));
258
+ manager.incRef(rhs);
259
+ const implication = manager.mkApp(OP_IMPLIES, [lhs, rhs], SORT_BOOL);
260
+ manager.incRef(implication);
261
+ const abstracted = this.info.abstract(implication);
262
+ const simplified = this.simp.rewrite(abstracted);
263
+ manager.decRef(abstracted);
264
+ const isTrivial = manager.isTrue(simplified);
265
+ if (isTrivial) manager.decRef(simplified);
266
+ else this.ackrs.pushOwned(simplified);
267
+ manager.decRef(implication);
268
+ manager.decRef(rhs);
269
+ manager.decRef(lhs);
270
+ eqs.reset();
271
+ return !isTrivial;
272
+ }
273
+
274
+ private eagerEnc() {
275
+ for (const occs of [this.fun2terms, this.sel2terms])
276
+ for (const entry of occs) {
277
+ this.manager.limit.checkpoint();
278
+ this.ackrOcc(entry[1]);
279
+ }
280
+ }
281
+
282
+ private ackrOcc(occ: AppOcc) {
283
+ const varArgs = [...occ.varArgs];
284
+ for (const [index, first] of varArgs.entries()) {
285
+ for (const second of varArgs.slice(index + 1)) this.ackr(first, second);
286
+ for (const second of occ.constArgs) this.ackr(first, second);
287
+ }
288
+ }
289
+
290
+ private abstract() {
291
+ const manager = this.manager;
292
+ for (const entry of this.fun2terms) {
293
+ const name = manager.funcDecls[entry[0]].name;
294
+ for (const terms of [entry[1].varArgs, entry[1].constArgs])
295
+ for (const term of terms)
296
+ this.info.setAbstr(term, manager.mkFreshConst(name, manager.sorts[term]));
297
+ }
298
+ for (const entry of this.sel2terms) {
299
+ const name = manager.funcDecls[manager.decls[entry[0]]].name;
300
+ for (const terms of [entry[1].constArgs, entry[1].varArgs])
301
+ for (const term of terms)
302
+ this.info.setAbstr(term, manager.mkFreshConst(name, manager.sorts[term]));
303
+ }
304
+ for (const form of this.formulas) this.abstr.pushOwned(this.info.abstract(form));
305
+ }
306
+
307
+ private eager() {
308
+ const manager = this.manager;
309
+ const solver = this.solver as AckrSolver;
310
+ for (const form of this.abstr.items) solver.assert(form);
311
+ if (solver.check() === L_FALSE) return L_FALSE;
312
+ this.eagerEnc();
313
+ const all = manager.mkAnd(this.ackrs.items);
314
+ manager.incRef(all);
315
+ const simplified = this.simp.rewrite(all);
316
+ manager.decRef(all);
317
+ solver.assert(simplified);
318
+ manager.decRef(simplified);
319
+ return solver.check();
320
+ }
321
+
322
+ private lazy() {
323
+ const solver = this.solver as AckrSolver;
324
+ for (const form of this.abstr.items) solver.assert(form);
325
+ let ackrHead = 0;
326
+ let constructor: LackrModelConstructor | undefined;
327
+ while (true) {
328
+ this.manager.limit.checkpoint();
329
+ const result = solver.check();
330
+ if (result !== L_TRUE) {
331
+ constructor?.release();
332
+ return result;
333
+ }
334
+ constructor?.release();
335
+ constructor = new LackrModelConstructor(this.manager, this.info, solver.getModel());
336
+ if (constructor.check()) {
337
+ constructor.release();
338
+ return L_TRUE;
339
+ }
340
+ for (const conflict of constructor.conflicts) this.ackr(conflict[0], conflict[1]);
341
+ while (ackrHead < this.ackrs.size) solver.assert(this.ackrs.items[ackrHead++]);
342
+ }
343
+ }
344
+
345
+ private collectTerms() {
346
+ const manager = this.manager;
347
+ const stack = [...this.formulas];
348
+ const visited = new Set<number>();
349
+ while (stack.length > 0) {
350
+ const current = stack[stack.length - 1];
351
+ if (visited.has(current)) {
352
+ stack.pop();
353
+ continue;
354
+ }
355
+ if (manager.kinds[current] === KIND_VAR) {
356
+ visited.add(current);
357
+ stack.pop();
358
+ continue;
359
+ }
360
+ if (manager.kinds[current] !== KIND_APP) return false;
361
+ let isDone = true;
362
+ for (const arg of manager.getArgs(current))
363
+ if (!visited.has(arg)) {
364
+ stack.push(arg);
365
+ isDone = false;
366
+ }
367
+ if (isDone) {
368
+ visited.add(current);
369
+ stack.pop();
370
+ markNonSelect(manager, current, this.nonSelect);
371
+ insertTerm(manager, this.fun2terms, this.sel2terms, current);
372
+ }
373
+ const op = manager.getOp(current);
374
+ if (op === OP_AS_ARRAY || op === OP_ARRAY_MAP)
375
+ this.nonFuns.add(manager.funcDecls[manager.decls[current]].parameters[0]);
376
+ }
377
+ pruneNonMarked(this.sel2terms, this.nonSelect);
378
+ pruneNonMarked(this.fun2terms, this.nonFuns);
379
+ return true;
380
+ }
381
+ }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/lbool.h), MIT license, see z3-license.txt.
2
1
  export const L_TRUE = 1;
3
2
  export const L_FALSE = -1;
4
3
  export const L_UNDEF = 0;
@@ -0,0 +1,268 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ OP_ADD,
5
+ OP_EQ,
6
+ OP_GE,
7
+ OP_GT,
8
+ OP_IMPLIES,
9
+ OP_ITE,
10
+ OP_LE,
11
+ OP_LT,
12
+ OP_MUL,
13
+ OP_NOT,
14
+ OP_SUB,
15
+ OP_TO_REAL,
16
+ OP_UMINUS,
17
+ SORT_BOOL,
18
+ SORT_INT,
19
+ } from "./ast";
20
+ import { BoundManager } from "./bound-manager";
21
+ import { mkPbEq, mkPbGe, mkPbLe } from "./pb-rewriter";
22
+ import { ExprSafeReplace } from "./expr-safe-replace";
23
+ import type { Definition, Goal } from "./goal";
24
+ import { Rational } from "./rational";
25
+ import { RefVector } from "./ref-vector";
26
+ import { RewriterTpl } from "./rewriter-tpl";
27
+
28
+ const UINT_LIMIT = 2n ** 32n;
29
+
30
+ interface PbSum {
31
+ args: number[];
32
+ coeffs: Rational[];
33
+ coeff: Rational;
34
+ }
35
+
36
+ class PbRewriter extends RewriterTpl {
37
+ constructor(
38
+ manager: AstManager,
39
+ private terms: RefVector,
40
+ private maxIteNesting: number,
41
+ private isCompilingEquality: boolean,
42
+ ) {
43
+ super(manager);
44
+ }
45
+
46
+ isRewritingPatterns() {
47
+ return false;
48
+ }
49
+
50
+ private pin(expr: number) {
51
+ this.terms.push(expr);
52
+ return expr;
53
+ }
54
+
55
+ private getNumeral(expr: number): Rational | undefined {
56
+ const manager = this.manager;
57
+ const op = manager.getOp(expr);
58
+ if (op === OP_UMINUS) return this.getNumeral(manager.getArg(expr, 0))?.neg();
59
+ if (op === OP_TO_REAL) return this.getNumeral(manager.getArg(expr, 0));
60
+ return manager.isNumeral(expr) ? manager.getRationalValue(expr) : undefined;
61
+ }
62
+
63
+ private insertArg(value: Rational, conds: number[], sum: PbSum) {
64
+ const manager = this.manager;
65
+ const cond = this.pin(manager.mkAnd(conds));
66
+ if (manager.isTrue(cond)) sum.coeff = sum.coeff.add(value);
67
+ else if (value.isNegative()) {
68
+ sum.args.push(this.pin(manager.mkApp(OP_NOT, [cond], SORT_BOOL)));
69
+ sum.coeffs.push(value.neg());
70
+ sum.coeff = sum.coeff.add(value);
71
+ } else if (value.isPositive()) {
72
+ sum.args.push(cond);
73
+ sum.coeffs.push(value);
74
+ }
75
+ }
76
+
77
+ private getSum(
78
+ nesting: number,
79
+ expr: number,
80
+ factor: Rational,
81
+ conds: number[],
82
+ sum: PbSum,
83
+ ): boolean {
84
+ const manager = this.manager;
85
+ manager.limit.checkpoint();
86
+ if (manager.kinds[expr] !== KIND_APP) return false;
87
+ const numeral = this.getNumeral(expr);
88
+ if (nesting > this.maxIteNesting && numeral === undefined) return false;
89
+ if (numeral !== undefined) {
90
+ this.insertArg(factor.mul(numeral), conds, sum);
91
+ return true;
92
+ }
93
+ const op = manager.getOp(expr);
94
+ const args = manager.getArgs(expr);
95
+ if (op === OP_ADD) return args.every((arg) => this.getSum(nesting, arg, factor, conds, sum));
96
+ if (op === OP_SUB && args.length === 2)
97
+ return (
98
+ this.getSum(nesting, args[0], factor, conds, sum) &&
99
+ this.getSum(nesting, args[1], factor.neg(), conds, sum)
100
+ );
101
+ if (op === OP_UMINUS) return this.getSum(nesting, args[0], factor.neg(), conds, sum);
102
+ if (op === OP_MUL && args.length === 2) {
103
+ const first = this.getNumeral(args[0]);
104
+ if (first !== undefined) return this.getSum(nesting, args[1], first.mul(factor), conds, sum);
105
+ const second = this.getNumeral(args[1]);
106
+ if (second !== undefined)
107
+ return this.getSum(nesting, args[0], second.mul(factor), conds, sum);
108
+ return false;
109
+ }
110
+ if (op === OP_TO_REAL) return this.getSum(nesting, args[0], factor, conds, sum);
111
+ if (op !== OP_ITE) return false;
112
+ const isThen = this.getSum(nesting + 1, args[1], factor, [...conds, args[0]], sum);
113
+ const negated = this.pin(manager.mkApp(OP_NOT, [args[0]], SORT_BOOL));
114
+ const isElse = this.getSum(nesting + 1, args[2], factor, [...conds, negated], sum);
115
+ return isThen && isElse;
116
+ }
117
+
118
+ getPbSum(term: number) {
119
+ const sum: PbSum = { args: [], coeffs: [], coeff: Rational.zero };
120
+ return this.getSum(0, term, Rational.one, [], sum) ? sum : undefined;
121
+ }
122
+
123
+ private getPb(first: number, second: number) {
124
+ const sum: PbSum = { args: [], coeffs: [], coeff: Rational.zero };
125
+ const isPb =
126
+ this.getSum(0, first, Rational.one, [], sum) &&
127
+ this.getSum(0, second, Rational.minusOne, [], sum);
128
+ return isPb ? sum : undefined;
129
+ }
130
+
131
+ private mkLe(sum: PbSum) {
132
+ const manager = this.manager;
133
+ const bound = sum.coeff.neg();
134
+ if (sum.args.length === 0) return bound.isNegative() ? manager.falseExpr : manager.trueExpr;
135
+ const isSingleOne = sum.args.length === 1 && sum.coeffs[0].equals(Rational.one);
136
+ if (isSingleOne && bound.compare(Rational.one) >= 0) return manager.trueExpr;
137
+ if (isSingleOne && bound.isZero()) return manager.mkApp(OP_NOT, [sum.args[0]], SORT_BOOL);
138
+ if (bound.isNegative()) return manager.falseExpr;
139
+ return mkPbLe(manager, sum.coeffs, sum.args, bound);
140
+ }
141
+
142
+ // Only mkEq uses it, so a single 0-1 term at least zero is its negation, as in Z3.
143
+ private mkGe(sum: PbSum) {
144
+ const manager = this.manager;
145
+ const bound = sum.coeff.neg();
146
+ if (sum.args.length === 0) return bound.isPositive() ? manager.falseExpr : manager.trueExpr;
147
+ const isSingleOne = sum.args.length === 1 && sum.coeffs[0].equals(Rational.one);
148
+ if (isSingleOne && bound.equals(Rational.one)) return sum.args[0];
149
+ if (isSingleOne && bound.isZero()) return manager.mkApp(OP_NOT, [sum.args[0]], SORT_BOOL);
150
+ if (bound.isNegative()) return manager.trueExpr;
151
+ return mkPbGe(manager, sum.coeffs, sum.args, bound);
152
+ }
153
+
154
+ private mkEq(sum: PbSum) {
155
+ const manager = this.manager;
156
+ const bound = sum.coeff.neg();
157
+ if (bound.isNegative()) return manager.falseExpr;
158
+ if (!this.isCompilingEquality)
159
+ return manager.mkAnd([this.pin(this.mkGe(sum)), this.pin(this.mkLe(sum))]);
160
+ return mkPbEq(manager, sum.coeffs, sum.args, bound);
161
+ }
162
+
163
+ reduceApp(decl: number, args: number[]) {
164
+ const manager = this.manager;
165
+ const op = manager.funcDecls[decl].op;
166
+ const isLe = op === OP_LE || op === OP_GT;
167
+ const isGe = op === OP_GE || op === OP_LT;
168
+ const sum =
169
+ isLe || isGe
170
+ ? this.getPb(isLe ? args[0] : args[1], isLe ? args[1] : args[0])
171
+ : op === OP_EQ
172
+ ? this.getPb(args[0], args[1])
173
+ : undefined;
174
+ if (sum === undefined) return -1;
175
+ const result =
176
+ op === OP_EQ
177
+ ? this.mkEq(sum)
178
+ : op === OP_LE || op === OP_GE
179
+ ? this.mkLe(sum)
180
+ : manager.mkApp(OP_NOT, [this.pin(this.mkLe(sum))], SORT_BOOL);
181
+ manager.incRef(result);
182
+ return result;
183
+ }
184
+ }
185
+
186
+ // The terms of the sum stay in terms.
187
+ export const getPbSum = (manager: AstManager, term: number, terms: RefVector) =>
188
+ new PbRewriter(manager, terms, 4, true).getPbSum(term);
189
+
190
+ export const lia2card = (
191
+ manager: AstManager,
192
+ goal: Goal,
193
+ maxRange: number,
194
+ maxIteNesting: number,
195
+ isCompilingEquality: boolean,
196
+ ) => {
197
+ if (manager.hasRecDefs) return;
198
+ const terms = new RefVector(manager);
199
+ const pin = (expr: number) => {
200
+ terms.push(expr);
201
+ return expr;
202
+ };
203
+ const bounds = new BoundManager(manager);
204
+ if (!goal.isProofsEnabled) for (const form of goal.forms.items) bounds.add(form);
205
+ const replace = new ExprSafeReplace(manager);
206
+ const definitions: Definition[] = [];
207
+ const axioms: number[] = [];
208
+ for (const variable of bounds.boundedVars) {
209
+ manager.limit.checkpoint();
210
+ const lower = bounds.lowers.get(variable);
211
+ const upper = bounds.uppers.get(variable);
212
+ if (
213
+ manager.sorts[variable] !== SORT_INT ||
214
+ !manager.isUninterpretedConst(variable) ||
215
+ lower === undefined ||
216
+ lower.isStrict ||
217
+ !lower.value.isInt() ||
218
+ lower.value.num < 0n ||
219
+ lower.value.num >= UINT_LIMIT ||
220
+ upper === undefined ||
221
+ upper.isStrict ||
222
+ !upper.value.isInt() ||
223
+ upper.value.num < 0n ||
224
+ upper.value.num >= UINT_LIMIT ||
225
+ (((upper.value.num - lower.value.num) % UINT_LIMIT) + UINT_LIMIT) % UINT_LIMIT >
226
+ BigInt(maxRange)
227
+ )
228
+ continue;
229
+ const low = Number(lower.value.num);
230
+ const high = Number(upper.value.num);
231
+ const decl = manager.decls[variable];
232
+ const summands: number[] = low > 0 ? [pin(manager.mkNumeral(BigInt(low)))] : [];
233
+ let last = -1;
234
+ for (let index = low; index < high; index++) {
235
+ manager.limit.checkpoint();
236
+ const fresh = pin(manager.mkFreshConst(manager.funcDecls[decl].name, SORT_BOOL));
237
+ if (last !== -1) axioms.push(pin(manager.mkApp(OP_IMPLIES, [fresh, last], SORT_BOOL)));
238
+ const one = pin(manager.mkNumeral(1n));
239
+ const zero = pin(manager.mkNumeral(0n));
240
+ summands.push(pin(manager.mkApp(OP_ITE, [fresh, one, zero], SORT_INT)));
241
+ definitions.push({ decl: manager.decls[fresh], def: -1 });
242
+ last = fresh;
243
+ }
244
+ const sum =
245
+ high === 0
246
+ ? pin(manager.mkNumeral(0n))
247
+ : summands.length === 1
248
+ ? summands[0]
249
+ : pin(manager.mkApp(OP_ADD, summands, SORT_INT));
250
+ definitions.push({ decl, def: sum });
251
+ replace.insert(variable, sum);
252
+ }
253
+ const rewriter = new PbRewriter(manager, terms, maxIteNesting, isCompilingEquality);
254
+ for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
255
+ manager.limit.checkpoint();
256
+ const replaced = replace.apply(goal.forms.items[index]);
257
+ const rewritten = rewriter.rewrite(replaced);
258
+ manager.decRef(replaced);
259
+ goal.update(index, rewritten, goal.getDependency(index));
260
+ manager.decRef(rewritten);
261
+ }
262
+ for (const axiom of axioms) goal.assert(axiom);
263
+ if (definitions.length > 0) goal.addDefinitions(definitions);
264
+ goal.depth++;
265
+ rewriter.release();
266
+ replace.release();
267
+ terms.reset();
268
+ };