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

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 (568) 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 +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  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.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,296 @@
1
+ import { SmtInvariantError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ OP_ITE,
5
+ OP_LT,
6
+ OP_NOT,
7
+ OP_ULEQ,
8
+ SORT_BOOL,
9
+ SORT_INT,
10
+ SORT_REAL,
11
+ } from "../ast";
12
+ import { mkBvApp } from "../bv-decl-plugin";
13
+ import { ObjHashtable } from "../hashtable";
14
+ import {
15
+ type CondMacro,
16
+ collectMacroCandidates,
17
+ releaseCondMacros,
18
+ solveMacros,
19
+ } from "../model-macro-solver";
20
+ import { FuncInterp, type ProtoModel } from "../proto-model";
21
+ import { RefVector } from "../ref-vector";
22
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "../rewriter";
23
+ import type { EufSolver } from "./euf-solver";
24
+ import type { QSolver } from "./q-solver";
25
+
26
+ // subterms::ground: the subterms of an expression, outside quantifier bodies.
27
+ export const getSubterms = (manager: AstManager, expr: number) => {
28
+ const subterms: number[] = [];
29
+ const stack = [expr];
30
+ const visited = new Set<number>();
31
+ while (stack.length > 0) {
32
+ const current = stack[stack.length - 1];
33
+ subterms.push(current);
34
+ visited.add(current);
35
+ if (manager.isApp(current)) stack.push(...manager.getArgs(current));
36
+ while (stack.length > 0 && visited.has(stack[stack.length - 1])) stack.pop();
37
+ }
38
+ return subterms;
39
+ };
40
+
41
+ export const isUninterpretedApp = (manager: AstManager, expr: number) =>
42
+ manager.isApp(expr) && manager.isUninterpreted(expr);
43
+
44
+ // The quantifier_macro_info of a flattened quantifier, with the macro candidates of its body.
45
+ interface MacroInfo {
46
+ readonly condMacros: CondMacro[];
47
+ readonly ngDecls: Set<number>;
48
+ readonly isAuf: boolean;
49
+ readonly flatQ: number;
50
+ theOne: number | null;
51
+ }
52
+
53
+ // projection_function: the order of the values of a sort, and its strict comparison.
54
+ interface ProjectionFunction {
55
+ readonly isLess: (first: number, second: number) => boolean;
56
+ readonly mkLt: (first: number, second: number) => number;
57
+ }
58
+
59
+ // projection_meta_data: the sorted values an argument of a function has, and a term of each.
60
+ interface ProjectionData {
61
+ readonly values: RefVector;
62
+ readonly value2Term: Map<number, number>;
63
+ }
64
+
65
+ const getProjectionTerm = (data: ProjectionData, value: number) => {
66
+ const term = data.value2Term.get(value);
67
+ if (term === undefined) throw new SmtInvariantError("a projection value has a term");
68
+ return term;
69
+ };
70
+
71
+ const isArithValueSupported = (manager: AstManager, expr: number) =>
72
+ manager.isNumeral(expr) || manager.isAlgebraicNumeral(expr);
73
+
74
+ const isArithValueLess = (manager: AstManager, first: number, second: number) =>
75
+ first !== second && manager.compareArithValues(first, second) < 0;
76
+
77
+ export class ModelFixer {
78
+ private readonly manager: AstManager;
79
+ private q2info = new Map<number, MacroInfo>();
80
+ private readonly macroRewriter: Rewriter;
81
+ private projectionData = new Map<string, ProjectionData>();
82
+
83
+ constructor(
84
+ private readonly ctx: EufSolver,
85
+ private readonly qs: QSolver,
86
+ ) {
87
+ this.manager = ctx.manager;
88
+ this.macroRewriter = new Rewriter(ctx.manager, TACTIC_REWRITER_OPTIONS);
89
+ }
90
+
91
+ // operator(): macros for the universal quantifiers, then an else for every partial function.
92
+ fix(model: ProtoModel) {
93
+ const manager = this.manager;
94
+ const univ = this.qs.universal.map((lit) => this.ctx.boolVar2expr(lit >> 1) as number);
95
+ if (univ.length === 0) return;
96
+ this.resetProjectionData();
97
+ const qs = solveMacros(manager, model, univ, (quantifier) => this.getInfo(quantifier));
98
+ this.addProjectionFunctions(model, qs);
99
+ const decls = model.getFuncDecls();
100
+ for (let index = decls.length; index-- > 0;) {
101
+ const decl = decls[index];
102
+ const interp = model.funcInterps.get(decl);
103
+ if (interp === undefined) continue;
104
+ const maxOcc = interp.isPartial() ? interp.getMaxOccResult() : null;
105
+ if (maxOcc !== null) interp.setElse(maxOcc);
106
+ if (interp.isPartial()) interp.setElse(model.getSomeValue(manager.funcDecls[decl].range));
107
+ }
108
+ }
109
+
110
+ private resetProjectionData() {
111
+ for (const data of this.projectionData.values()) data.values.reset();
112
+ this.projectionData.clear();
113
+ }
114
+
115
+ private getInfo(quantifier: number) {
116
+ const existing = this.q2info.get(quantifier);
117
+ if (existing !== undefined) return existing;
118
+ const manager = this.manager;
119
+ const flatQ = this.qs.flatten(quantifier);
120
+ const info: MacroInfo = {
121
+ condMacros: collectMacroCandidates(manager, this.macroRewriter, flatQ),
122
+ ngDecls: new Set(),
123
+ isAuf: true,
124
+ flatQ,
125
+ theOne: null,
126
+ };
127
+ this.q2info.set(quantifier, info);
128
+ this.ctx.trail.push(() => {
129
+ this.q2info.delete(quantifier);
130
+ releaseCondMacros(manager, info.condMacros);
131
+ });
132
+ return info;
133
+ }
134
+
135
+ private addProjectionFunctions(model: ProtoModel, qs: readonly number[]) {
136
+ const manager = this.manager;
137
+ const decls = new ObjHashtable((decl) => manager.getDeclHash(decl));
138
+ for (const quantifier of qs) {
139
+ const body = manager.getQuantifier(this.getInfo(quantifier).flatQ).body;
140
+ for (const subterm of getSubterms(manager, body))
141
+ if (isUninterpretedApp(manager, subterm) && !manager.isGroundApp(subterm))
142
+ decls.add(manager.decls[subterm]);
143
+ }
144
+ for (const decl of decls) this.addProjectionFunctionsOf(model, decl);
145
+ }
146
+
147
+ // f becomes f_aux(p_1(x_1), ..., p_n(x_n)), for f_aux the old interpretation of f and p_i the
148
+ // projection of its i'th argument onto the values that argument has in the e-graph.
149
+ private addProjectionFunctionsOf(model: ProtoModel, decl: number) {
150
+ const manager = this.manager;
151
+ const interp = model.funcInterps.get(decl);
152
+ if (interp === undefined || interp.isConstant()) return;
153
+ const info = manager.funcDecls[decl];
154
+ const args = new RefVector(manager);
155
+ info.domain.forEach((_sort, index) =>
156
+ args.push(this.addProjectionFunction(model, decl, index)),
157
+ );
158
+ if (interp.isPartial() && interp.entries.length > 0) {
159
+ const index = this.ctx.s.rand.next() % interp.entries.length;
160
+ interp.setElse(interp.entries[index].result);
161
+ interp.delEntry(index);
162
+ }
163
+ if (args.items.every((arg) => manager.isVar(arg))) {
164
+ args.reset();
165
+ return;
166
+ }
167
+ const auxDecl = manager.mkFreshFuncDecl(info.name, info.domain, info.range, true, "aux");
168
+ const projected = new FuncInterp(manager, info.domain.length);
169
+ projected.setElse(manager.mkApp(auxDecl, args.items, info.range));
170
+ args.reset();
171
+ model.updateFuncInterp(decl, projected);
172
+ model.registerFunc(auxDecl, interp);
173
+ }
174
+
175
+ // p(x) := if x < v_2 then v_1 else if x < v_3 then v_2 ... else v_n, for the sorted values v_i
176
+ // of the idx'th arguments of the applications of f.
177
+ private addProjectionFunction(model: ProtoModel, decl: number, index: number) {
178
+ const manager = this.manager;
179
+ const sort = manager.funcDecls[decl].domain[index];
180
+ const variable = manager.mkVar(index, sort);
181
+ const projection = this.getProjection(sort);
182
+ if (projection === undefined) return variable;
183
+ const values = new RefVector(manager);
184
+ const value2Term = new Map<number, number>();
185
+ for (const node of this.ctx.egraph.enodesOf(decl)) {
186
+ const term = node.getArg(index).owner;
187
+ values.pushOwned(model.eval(term, false));
188
+ const value = values.items[values.size - 1];
189
+ if (!manager.isValue(value)) {
190
+ values.reset();
191
+ return variable;
192
+ }
193
+ value2Term.set(value, term);
194
+ }
195
+ if (values.size === 0) return variable;
196
+ const isArith = sort === SORT_INT || sort === SORT_REAL;
197
+ if (isArith && !values.items.every((value) => isArithValueSupported(manager, value))) {
198
+ values.reset();
199
+ return variable;
200
+ }
201
+ const sorted = values.items.toSorted((first, second) =>
202
+ projection.isLess(first, second) ? -1 : projection.isLess(second, first) ? 1 : 0,
203
+ );
204
+ const unique = new RefVector(manager);
205
+ sorted.forEach((value, position) => {
206
+ if (position === 0 || sorted[position - 1] !== value) unique.push(value);
207
+ });
208
+ values.reset();
209
+ this.projectionData.set(`${decl}:${index}`, { values: unique, value2Term });
210
+ const bound = manager.mkVar(0, sort);
211
+ let projected = unique.items[unique.size - 1];
212
+ for (let position = unique.size - 1; position >= 1; position--)
213
+ projected = manager.mkApp(
214
+ OP_ITE,
215
+ [projection.mkLt(bound, unique.items[position]), unique.items[position - 1], projected],
216
+ sort,
217
+ );
218
+ const interp = new FuncInterp(manager, 1);
219
+ interp.setElse(projected);
220
+ const projectionDecl = manager.mkFreshFuncDecl(null, [sort], sort);
221
+ model.registerFunc(projectionDecl, interp);
222
+ return manager.mkApp(projectionDecl, [variable], sort);
223
+ }
224
+
225
+ private getProjection(sort: number): ProjectionFunction | undefined {
226
+ const manager = this.manager;
227
+ if (sort === SORT_INT || sort === SORT_REAL)
228
+ return {
229
+ isLess: (first, second) => isArithValueLess(manager, first, second),
230
+ mkLt: (first, second) => manager.mkApp(OP_LT, [first, second], SORT_BOOL),
231
+ };
232
+ if (!manager.isBvSort(sort)) return undefined;
233
+ return {
234
+ isLess: (first, second) =>
235
+ manager.isBvNumeral(first) && manager.isBvNumeral(second)
236
+ ? manager.getBvNumeralValue(first) < manager.getBvNumeralValue(second)
237
+ : manager.ids[first] < manager.ids[second],
238
+ mkLt: (first, second) =>
239
+ manager.mkApp(OP_NOT, [mkBvApp(manager, OP_ULEQ, [second, first])], SORT_BOOL),
240
+ };
241
+ }
242
+
243
+ // invert_app: the root of the class whose value t has.
244
+ invertApp(value: number) {
245
+ return this.ctx.values2root().get(value)?.owner ?? value;
246
+ }
247
+
248
+ // invert_arg: bounds t_j <= arg < t_{j+1} on the i'th argument of t, for the terms whose values
249
+ // v_j <= value < v_{j+1} surround the argument's value.
250
+ invertArg(term: number, index: number, value: number, lits: RefVector) {
251
+ const manager = this.manager;
252
+ const decl = manager.decls[term];
253
+ const data = this.projectionData.get(`${decl}:${index}`);
254
+ if (data === undefined) return;
255
+ const sort = manager.funcDecls[decl].domain[index];
256
+ const projection = this.getProjection(sort);
257
+ if (projection === undefined) return;
258
+ const values = data.values.items;
259
+ if (values.length <= 1) return;
260
+ const arg = manager.getArg(term, index);
261
+ const valueSort = manager.sorts[value];
262
+ if (
263
+ (valueSort === SORT_INT || valueSort === SORT_REAL) &&
264
+ !isArithValueSupported(manager, value)
265
+ ) {
266
+ lits.push(manager.mkEq(arg, value));
267
+ return;
268
+ }
269
+ const getTerm = (position: number) => getProjectionTerm(data, values[position]);
270
+ const mkLe = (first: number, second: number) =>
271
+ manager.mkApp(OP_NOT, [projection.mkLt(second, first)], SORT_BOOL);
272
+ if (projection.isLess(value, values[1])) {
273
+ lits.push(projection.mkLt(arg, getTerm(1)));
274
+ return;
275
+ }
276
+ for (let position = 2; position < values.length; position++)
277
+ if (projection.isLess(value, values[position])) {
278
+ lits.push(mkLe(getTerm(position - 1), arg));
279
+ lits.push(projection.mkLt(arg, getTerm(position)));
280
+ return;
281
+ }
282
+ lits.push(mkLe(getTerm(values.length - 1), arg));
283
+ }
284
+
285
+ // restrict_arg: the i'th argument of t is one of the terms of the ground applications of its
286
+ // function.
287
+ restrictArg(term: number, index: number) {
288
+ const manager = this.manager;
289
+ const data = this.projectionData.get(`${manager.decls[term]}:${index}`);
290
+ if (data === undefined) return manager.trueExpr;
291
+ const arg = manager.getArg(term, index);
292
+ return manager.mkOr(
293
+ data.values.items.map((value) => manager.mkEq(arg, getProjectionTerm(data, value))),
294
+ );
295
+ }
296
+ }
@@ -0,0 +1,361 @@
1
+ import {
2
+ KIND_QUANTIFIER,
3
+ OP_AND,
4
+ OP_EQ,
5
+ OP_IMPLIES,
6
+ OP_OR,
7
+ QUANTIFIER_EXISTS,
8
+ QUANTIFIER_FORALL,
9
+ QUANTIFIER_LAMBDA,
10
+ SORT_BOOL,
11
+ } from "../ast";
12
+ import { flattenAndVector, flattenOrVector, mkNot } from "../ast-util";
13
+ import { DerRewriter } from "../der";
14
+ import { simplifyInjAxiom } from "../inj-axiom";
15
+ import { L_FALSE, L_TRUE } from "../lbool";
16
+ import type { ProtoModel } from "../proto-model";
17
+ import { pullQuant } from "../pull-quant";
18
+ import { containsDef } from "../recfun-decl-plugin";
19
+ import { RefVector } from "../ref-vector";
20
+ import { CR_CONTINUE, CR_DONE, CR_GIVEUP } from "../sat/solver";
21
+ import { VarSubst } from "../var-subst";
22
+ import type { Enode } from "./egraph";
23
+ import type { EufSolver } from "./euf-solver";
24
+ import { Ematch } from "./q-ematch";
25
+ import { Mbqi } from "./q-mbi";
26
+ import { ThSolver } from "./th-solver";
27
+
28
+ // The family id Z3 gives "quant" when the q solver registers it.
29
+ const FAMILY_QUANT = 15;
30
+
31
+ export class QSolver extends ThSolver {
32
+ private flats = new Map<number, number>();
33
+ readonly universal: number[] = [];
34
+ readonly ematch: Ematch;
35
+ readonly mbqi: Mbqi;
36
+ private expanded: RefVector;
37
+ private der: DerRewriter;
38
+
39
+ constructor(ctx: EufSolver) {
40
+ super(ctx, "quant", FAMILY_QUANT);
41
+ this.mbqi = new Mbqi(ctx, this);
42
+ this.ematch = new Ematch(ctx, this);
43
+ this.expanded = new RefVector(ctx.manager);
44
+ this.der = new DerRewriter(ctx.manager);
45
+ }
46
+
47
+ private isQuantifier(expr: number) {
48
+ const manager = this.manager;
49
+ return (
50
+ manager.kinds[expr] === KIND_QUANTIFIER &&
51
+ manager.getQuantifier(expr).kind !== QUANTIFIER_LAMBDA
52
+ );
53
+ }
54
+
55
+ private isForall(expr: number) {
56
+ const manager = this.manager;
57
+ return (
58
+ manager.kinds[expr] === KIND_QUANTIFIER &&
59
+ manager.getQuantifier(expr).kind === QUANTIFIER_FORALL
60
+ );
61
+ }
62
+
63
+ asserted(lit: number) {
64
+ const ctx = this.ctx;
65
+ const manager = this.manager;
66
+ const expr = this.boolVar2expr(lit >> 1) as number;
67
+ if (!this.isQuantifier(expr)) return;
68
+ const isSign = (lit & 1) === 1;
69
+ if (isSign === this.isForall(expr)) {
70
+ this.addClause([lit ^ 1, this.skolemize(expr)]);
71
+ return;
72
+ }
73
+ let flat = this.flats.get(expr);
74
+ if (flat === undefined) {
75
+ if (this.expand(expr)) {
76
+ for (const expanded of this.expanded.items)
77
+ this.addClause([lit ^ 1, ctx.internalize(expanded, isSign, false)]);
78
+ return;
79
+ }
80
+ flat = this.flatten(expr);
81
+ }
82
+ const body = manager.getQuantifier(flat).body;
83
+ if (manager.isGroundApp(body)) {
84
+ this.addClause([lit ^ 1, ctx.internalize(body, isSign, false)]);
85
+ return;
86
+ }
87
+ this.universal.push(lit);
88
+ ctx.trail.push(() => this.universal.pop());
89
+ this.ematch.add(expr);
90
+ }
91
+
92
+ check() {
93
+ if (this.ematch.run()) return CR_CONTINUE;
94
+ const result = this.mbqi.run();
95
+ if (result === L_TRUE) return CR_DONE;
96
+ if (result === L_FALSE) return CR_CONTINUE;
97
+ return CR_GIVEUP;
98
+ }
99
+
100
+ unitPropagate() {
101
+ return this.ematch.unitPropagate();
102
+ }
103
+
104
+ mkVar(node: Enode) {
105
+ const thVar = super.mkVar(node);
106
+ this.ctx.egraph.addThVar(node, thVar, this.id);
107
+ return thVar;
108
+ }
109
+
110
+ // instantiate: the literal of the body of q, or of its negation, with each bound variable
111
+ // replaced by mkVar.
112
+ private instantiate(
113
+ quantifier: number,
114
+ isNegated: boolean,
115
+ mkVar: (flat: number, index: number) => number,
116
+ ) {
117
+ const manager = this.manager;
118
+ const data = manager.getQuantifier(quantifier);
119
+ const q = isNegated
120
+ ? manager.withTemporaries(() =>
121
+ manager.mkQuantifier({
122
+ ...data,
123
+ kind: data.kind === QUANTIFIER_FORALL ? QUANTIFIER_EXISTS : QUANTIFIER_FORALL,
124
+ body: manager.mkNot(data.body),
125
+ patterns: [],
126
+ noPatterns: [],
127
+ }),
128
+ )
129
+ : quantifier;
130
+ const flat = this.flatten(q);
131
+ const flatData = manager.getQuantifier(flat);
132
+ const vars = flatData.sorts.map((_sort, index) => mkVar(flat, index));
133
+ const subst = new VarSubst(manager, true);
134
+ const substituted = subst.apply(flatData.body, vars);
135
+ subst.release();
136
+ const body = this.rewrite(substituted);
137
+ manager.decRef(substituted);
138
+ const lit = this.mkLiteral(body);
139
+ manager.decRef(body);
140
+ if (isNegated) manager.decRef(q);
141
+ return lit;
142
+ }
143
+
144
+ private skolemize(quantifier: number) {
145
+ const manager = this.manager;
146
+ return this.instantiate(quantifier, this.isForall(quantifier), (flat, index) => {
147
+ const data = manager.getQuantifier(flat);
148
+ return manager.mkFreshConst(data.names[index], data.sorts[index]);
149
+ });
150
+ }
151
+
152
+ initSearch() {
153
+ this.mbqi.initSearch();
154
+ }
155
+
156
+ internalize(expr: number, isSign: boolean) {
157
+ const ctx = this.ctx;
158
+ const lit = ctx.attachLit(2 * ctx.si.addBoolVar(expr), expr);
159
+ this.mkVar(ctx.egraph.find(expr) as Enode);
160
+ return isSign ? lit ^ 1 : lit;
161
+ }
162
+
163
+ internalizeTerm(expr: number) {
164
+ this.internalize(expr, false);
165
+ }
166
+
167
+ finalizeModel(model: ProtoModel) {
168
+ this.mbqi.finalizeModel(model);
169
+ }
170
+
171
+ getAntecedents(_lit: number, data: unknown, antecedents: number[]) {
172
+ this.ematch.getAntecedents(data, antecedents);
173
+ }
174
+
175
+ // flatten: q with its nested quantifiers pulled out, or its injectivity axiom refined.
176
+ flatten(quantifier: number) {
177
+ const manager = this.manager;
178
+ const existing = this.flats.get(quantifier);
179
+ if (existing !== undefined) return existing;
180
+ const data = manager.getQuantifier(quantifier);
181
+ const flat = (() => {
182
+ if (!manager.hasQuantifierFlags[data.body]) return simplifyInjAxiom(manager, quantifier);
183
+ if (data.kind === QUANTIFIER_FORALL) return pullQuant(manager, quantifier);
184
+ return undefined;
185
+ })();
186
+ if (flat === undefined && !manager.hasQuantifierFlags[data.body]) return quantifier;
187
+ const result = flat ?? quantifier;
188
+ if (flat === undefined) manager.incRef(result);
189
+ manager.incRef(quantifier);
190
+ this.flats.set(quantifier, result);
191
+ this.ctx.trail.push(() => {
192
+ this.flats.delete(quantifier);
193
+ manager.decRef(result);
194
+ manager.decRef(quantifier);
195
+ });
196
+ return result;
197
+ }
198
+
199
+ // expand: whether rewriting q gives formulas to assert in place of q, left in this.expanded.
200
+ // smt.q.lite is off by default, so qe-lite does not run.
201
+ private expand(quantifier: number) {
202
+ const manager = this.manager;
203
+ const expanded = this.expanded;
204
+ const simplified = this.rewrite(quantifier);
205
+ let rewritten = this.der.rewrite(simplified);
206
+ manager.decRef(simplified);
207
+ expanded.reset();
208
+ const isUpdated = quantifier !== rewritten;
209
+ let q = quantifier;
210
+ const finish = (result: boolean) => {
211
+ manager.decRef(rewritten);
212
+ return result;
213
+ };
214
+ if (isUpdated) {
215
+ const again = this.rewrite(rewritten);
216
+ manager.decRef(rewritten);
217
+ rewritten = again;
218
+ if (
219
+ manager.kinds[rewritten] !== KIND_QUANTIFIER ||
220
+ this.isForall(q) !== this.isForall(rewritten)
221
+ ) {
222
+ expanded.push(rewritten);
223
+ return finish(true);
224
+ }
225
+ if (rewritten === q) return finish(false);
226
+ q = rewritten;
227
+ }
228
+ const body = manager.getQuantifier(q).body;
229
+ expanded.push(body);
230
+ if (this.isForall(q)) flattenAndVector(manager, expanded);
231
+ else flattenOrVector(manager, expanded);
232
+ if (expanded.size === 1 && this.isForall(q) && !containsDef(manager, body)) {
233
+ expanded.reset();
234
+ expanded.push(body);
235
+ flattenOrVector(manager, expanded);
236
+ let first = -1;
237
+ let second = -1;
238
+ let splitIndex = 0;
239
+ for (let index = expanded.size; index-- > 0;) {
240
+ const split = this.split(expanded.items[index]);
241
+ if (split === null) continue;
242
+ if (first !== -1) {
243
+ for (const part of split) manager.decRef(part);
244
+ manager.decRef(first);
245
+ manager.decRef(second);
246
+ return finish(false);
247
+ }
248
+ first = split[0];
249
+ second = split[1];
250
+ splitIndex = index;
251
+ }
252
+ if (first === -1 && isUpdated) {
253
+ expanded.reset();
254
+ expanded.push(rewritten);
255
+ return finish(true);
256
+ }
257
+ if (first === -1) return finish(false);
258
+ expanded.set(splitIndex, first);
259
+ manager.decRef(first);
260
+ const firstOr = manager.mkOr([...expanded.items]);
261
+ manager.incRef(firstOr);
262
+ expanded.set(splitIndex, second);
263
+ manager.decRef(second);
264
+ const secondOr = manager.mkOr([...expanded.items]);
265
+ manager.incRef(secondOr);
266
+ expanded.reset();
267
+ expanded.pushOwned(firstOr);
268
+ expanded.pushOwned(secondOr);
269
+ }
270
+ if (expanded.size > 1) {
271
+ const data = manager.getQuantifier(q);
272
+ for (let index = expanded.size; index-- > 0;) {
273
+ const updated = manager.withTemporaries(() =>
274
+ manager.mkQuantifier({ ...data, body: expanded.items[index] }),
275
+ );
276
+ expanded.setOwned(index, this.rewrite(updated));
277
+ manager.decRef(updated);
278
+ }
279
+ return finish(true);
280
+ }
281
+ if (expanded.size === 1 && isUpdated) {
282
+ expanded.set(0, rewritten);
283
+ this.flatten(rewritten);
284
+ return finish(true);
285
+ }
286
+ return finish(false);
287
+ }
288
+
289
+ // split: the two halves of a disjunct over literals, owned by the caller.
290
+ private split(arg: number): [number, number] | null {
291
+ const manager = this.manager;
292
+ const isNot = manager.isNot(arg);
293
+ const inner = isNot ? manager.getArg(arg, 0) : -1;
294
+ const isBinary = (expr: number, op: number) =>
295
+ manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
296
+ const isIff = (expr: number) =>
297
+ isBinary(expr, OP_EQ) && manager.isBool(manager.getArg(expr, 0));
298
+ const own = (expr: number) => {
299
+ manager.incRef(expr);
300
+ return expr;
301
+ };
302
+ if (
303
+ isNot &&
304
+ isBinary(inner, OP_OR) &&
305
+ this.isLiteral(manager.getArg(inner, 0)) &&
306
+ this.isLiteral(manager.getArg(inner, 1))
307
+ )
308
+ return [
309
+ own(mkNot(manager, manager.getArg(inner, 0))),
310
+ own(mkNot(manager, manager.getArg(inner, 1))),
311
+ ];
312
+ if (
313
+ isIff(arg) &&
314
+ this.isLiteral(manager.getArg(arg, 0)) &&
315
+ this.isLiteral(manager.getArg(arg, 1))
316
+ ) {
317
+ const lhs = manager.getArg(arg, 0);
318
+ const rhs = manager.getArg(arg, 1);
319
+ return [
320
+ own(manager.mkApp(OP_IMPLIES, [lhs, rhs], SORT_BOOL)),
321
+ own(manager.mkApp(OP_IMPLIES, [rhs, lhs], SORT_BOOL)),
322
+ ];
323
+ }
324
+ if (
325
+ isBinary(arg, OP_AND) &&
326
+ this.isLiteral(manager.getArg(arg, 0)) &&
327
+ this.isLiteral(manager.getArg(arg, 1))
328
+ )
329
+ return [own(manager.getArg(arg, 0)), own(manager.getArg(arg, 1))];
330
+ if (
331
+ isNot &&
332
+ isIff(inner) &&
333
+ this.isLiteral(manager.getArg(inner, 0)) &&
334
+ this.isLiteral(manager.getArg(inner, 1))
335
+ ) {
336
+ const lhs = manager.getArg(inner, 0);
337
+ const rhs = manager.getArg(inner, 1);
338
+ const notLhs = mkNot(manager, lhs);
339
+ manager.incRef(notLhs);
340
+ const result: [number, number] = [
341
+ own(manager.mkOr([lhs, rhs])),
342
+ own(manager.mkOr([notLhs, mkNot(manager, rhs)])),
343
+ ];
344
+ manager.decRef(notLhs);
345
+ return result;
346
+ }
347
+ return null;
348
+ }
349
+
350
+ private isLiteral(input: number) {
351
+ const manager = this.manager;
352
+ const arg = manager.isNot(input) ? manager.getArg(input, 0) : input;
353
+ const op = manager.getOp(arg);
354
+ return (
355
+ op !== OP_AND &&
356
+ op !== OP_OR &&
357
+ !(op === OP_EQ && manager.isBool(manager.getArg(arg, 0))) &&
358
+ op !== OP_IMPLIES
359
+ );
360
+ }
361
+ }