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,928 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ KIND_VAR,
7
+ OP_ADD,
8
+ OP_AND,
9
+ OP_BADD,
10
+ OP_BMUL,
11
+ OP_BSUB,
12
+ OP_DIV,
13
+ OP_EQ,
14
+ OP_GE,
15
+ OP_IMPLIES,
16
+ OP_ITE,
17
+ OP_LE,
18
+ OP_MOD,
19
+ OP_MUL,
20
+ OP_OR,
21
+ OP_SELECT,
22
+ OP_SUB,
23
+ OP_TO_REAL,
24
+ OP_UMINUS,
25
+ SORT_BOOL,
26
+ SORT_INT,
27
+ SORT_REAL,
28
+ QUANTIFIER_FORALL,
29
+ } from "./ast";
30
+ import { BoundManager } from "./bound-manager";
31
+ import { mkBvApp } from "./bv-decl-plugin";
32
+ import type { Definition, Goal } from "./goal";
33
+ import { ObjMap } from "./hashtable";
34
+ import { Rational } from "./rational";
35
+ import { getSubterms } from "./recfun-decl-plugin";
36
+ import { RefVector } from "./ref-vector";
37
+ import { Rewriter, type RewriterOptions } from "./rewriter";
38
+ import { RewriterTpl } from "./rewriter-tpl";
39
+ import { DependentExprState, finishSimplifier } from "./dependent-expr-state";
40
+
41
+ interface SolveEqsOptions {
42
+ isTheorySolver: boolean;
43
+ isIteSolver: boolean;
44
+ isContextSolve: boolean;
45
+ isEliminatingMod: boolean;
46
+ rewriter: RewriterOptions;
47
+ }
48
+
49
+ interface DependentEq {
50
+ orig: number;
51
+ variable: number;
52
+ term: number;
53
+ }
54
+
55
+ interface Signed {
56
+ isNegated: boolean;
57
+ expr: number;
58
+ }
59
+
60
+ interface NestedItem {
61
+ isNegated: boolean;
62
+ depth: number;
63
+ expr: number;
64
+ parent: number;
65
+ }
66
+
67
+ export class SubstReplacer extends RewriterTpl {
68
+ constructor(
69
+ manager: AstManager,
70
+ private substitution: ObjMap<number>,
71
+ ) {
72
+ super(manager);
73
+ }
74
+
75
+ getSubst(expr: number) {
76
+ return this.substitution.get(expr);
77
+ }
78
+ }
79
+
80
+ const getModInverse = (value: bigint, modulus: bigint) => {
81
+ let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
82
+ let [oldCoefficient, coefficient] = [1n, 0n];
83
+ while (remainder !== 0n) {
84
+ const quotient = oldRemainder / remainder;
85
+ [oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
86
+ [oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
87
+ }
88
+ return ((oldCoefficient % modulus) + modulus) % modulus;
89
+ };
90
+
91
+ export class SolveEqs {
92
+ private pinned: RefVector;
93
+ private eqTerms: RefVector;
94
+ private nonzero = new Set<number>();
95
+ private bounds: BoundManager;
96
+ private isAllowingBool = true;
97
+ private var2id = new Map<number, number>();
98
+ private id2var: number[] = [];
99
+ private next: DependentEq[][] = [];
100
+ private id2level: number[] = [];
101
+ private substIds: number[] = [];
102
+ private substitution: ObjMap<number>;
103
+ private definitions: Definition[] = [];
104
+ private containsV = new Set<number>();
105
+ private unsafeVars = new Set<number>();
106
+ private andPositive = new Set<number>();
107
+ private andNegative = new Set<number>();
108
+ private orPositive = new Set<number>();
109
+ private orNegative = new Set<number>();
110
+ private rewriter: Rewriter;
111
+ private state: DependentExprState;
112
+
113
+ constructor(
114
+ private manager: AstManager,
115
+ private goal: Goal,
116
+ private options: SolveEqsOptions,
117
+ ) {
118
+ this.pinned = new RefVector(manager);
119
+ this.eqTerms = new RefVector(manager);
120
+ this.bounds = new BoundManager(manager);
121
+ this.substitution = new ObjMap((expr) => manager.hashes[expr]);
122
+ this.rewriter = new Rewriter(manager, options.rewriter);
123
+ this.state = new DependentExprState(manager, goal);
124
+ }
125
+
126
+ private pin(expr: number) {
127
+ this.eqTerms.push(expr);
128
+ return expr;
129
+ }
130
+
131
+ private mkApp(op: number, args: number[], sort: number) {
132
+ return this.pin(this.manager.mkApp(op, args, sort));
133
+ }
134
+
135
+ private mkMul(args: number[], sort: number) {
136
+ return args.length === 1 ? args[0] : this.mkApp(OP_MUL, args, sort);
137
+ }
138
+
139
+ private push(eqs: DependentEq[], orig: number, variable: number, term: number) {
140
+ this.eqTerms.push(term);
141
+ eqs.push({ orig, variable, term });
142
+ }
143
+
144
+ private isConst(expr: number) {
145
+ return this.manager.kinds[expr] === KIND_APP && this.manager.isUninterpretedConst(expr);
146
+ }
147
+
148
+ private isEqOf(first: number, second: number) {
149
+ const manager = this.manager;
150
+ if (manager.getOp(first) !== OP_EQ || manager.getOp(second) !== OP_EQ) return undefined;
151
+ const [x1, x2] = manager.getArgs(first);
152
+ const [y1, y2] = manager.getArgs(second);
153
+ if (x1 === y1) return { variable: x1, thenExpr: x2, elseExpr: y2 };
154
+ if (x1 === y2) return { variable: x1, thenExpr: x2, elseExpr: y1 };
155
+ if (x2 === y1) return { variable: x2, thenExpr: x1, elseExpr: y2 };
156
+ return undefined;
157
+ }
158
+
159
+ private isComplementary(first: number, second: number) {
160
+ const manager = this.manager;
161
+ return (
162
+ (manager.isNot(first) && manager.getArg(first, 0) === second) ||
163
+ (manager.isNot(second) && manager.getArg(second, 0) === first)
164
+ );
165
+ }
166
+
167
+ private getBasicEqs(form: number, eqs: DependentEq[]) {
168
+ const manager = this.manager;
169
+ const op = manager.getOp(form);
170
+ if (op === OP_EQ) {
171
+ const [left, right] = manager.getArgs(form);
172
+ if (left === right) return;
173
+ if (!this.isAllowingBool && manager.sorts[left] === SORT_BOOL) return;
174
+ if (this.isConst(left)) this.push(eqs, form, left, right);
175
+ if (this.isConst(right)) this.push(eqs, form, right, left);
176
+ }
177
+ if (this.isAllowingBool) {
178
+ if (this.isConst(form)) this.push(eqs, form, form, manager.trueExpr);
179
+ if (manager.isNot(form) && this.isConst(manager.getArg(form, 0)))
180
+ this.push(eqs, form, manager.getArg(form, 0), manager.falseExpr);
181
+ }
182
+ if (this.goal.isProofsEnabled) return;
183
+ if (this.options.isIteSolver && op === OP_ITE) {
184
+ const [condition, thenExpr, elseExpr] = manager.getArgs(form);
185
+ if (manager.getOp(thenExpr) === OP_EQ && manager.getOp(elseExpr) === OP_EQ) {
186
+ let [x1, y1] = manager.getArgs(thenExpr);
187
+ let [x2, y2] = manager.getArgs(elseExpr);
188
+ if (!this.isAllowingBool && manager.sorts[x1] === SORT_BOOL) return;
189
+ if (x1 === y2 && this.isConst(x1)) [x2, y2] = [y2, x2];
190
+ if (x2 === y2 && this.isConst(x2)) {
191
+ [x2, y2] = [y2, x2];
192
+ [x1, y1] = [y1, x1];
193
+ }
194
+ if (x2 === y1 && this.isConst(x2)) [x1, y1] = [y1, x1];
195
+ if (x1 === x2 && this.isConst(x1))
196
+ this.push(eqs, form, x1, manager.mkApp(OP_ITE, [condition, y1, y2], manager.sorts[y1]));
197
+ }
198
+ }
199
+ const isBinary = (expr: number, binaryOp: number) =>
200
+ manager.getOp(expr) === binaryOp && manager.getNumArgs(expr) === 2;
201
+ const outer = op === OP_OR ? OP_AND : op === OP_AND ? OP_OR : -1;
202
+ if (outer === -1 || !isBinary(form, op)) return;
203
+ const [first, second] = manager.getArgs(form);
204
+ if (!isBinary(first, outer) || !isBinary(second, outer)) return;
205
+ const [x1, x2] = manager.getArgs(first);
206
+ const [y1, y2] = manager.getArgs(second);
207
+ const cases: [number, number, number, number, number][] =
208
+ op === OP_OR
209
+ ? [
210
+ [x1, y1, x2, y2, x2],
211
+ [x1, y2, x2, y1, x2],
212
+ [x2, y2, x1, y1, x1],
213
+ [x2, y1, x1, y2, x1],
214
+ ]
215
+ : [
216
+ [x1, y1, x2, y2, y2],
217
+ [x1, y2, x2, y1, y1],
218
+ [x2, y2, x1, y1, y1],
219
+ [x2, y1, x1, y2, y2],
220
+ ];
221
+ for (const [eqFirst, eqSecond, complementFirst, complementSecond, condition] of cases) {
222
+ const found = this.isEqOf(eqFirst, eqSecond);
223
+ if (found !== undefined && this.isComplementary(complementFirst, complementSecond))
224
+ this.push(
225
+ eqs,
226
+ form,
227
+ found.variable,
228
+ manager.mkApp(
229
+ OP_ITE,
230
+ [condition, found.thenExpr, found.elseExpr],
231
+ manager.sorts[found.thenExpr],
232
+ ),
233
+ );
234
+ }
235
+ }
236
+
237
+ private mkSubTerm(sum: number, index: number, rhs: number) {
238
+ const manager = this.manager;
239
+ const isBv = manager.isBvSort(manager.sorts[rhs]);
240
+ return manager
241
+ .getArgs(sum)
242
+ .reduce(
243
+ (term, arg, other) =>
244
+ other === index
245
+ ? term
246
+ : isBv
247
+ ? this.pin(mkBvApp(manager, OP_BSUB, [term, arg]))
248
+ : this.mkApp(OP_SUB, [term, arg], manager.sorts[rhs]),
249
+ rhs,
250
+ );
251
+ }
252
+
253
+ private isNonzeroFactor(expr: number) {
254
+ const manager = this.manager;
255
+ return (
256
+ this.nonzero.has(expr) ||
257
+ (manager.isNumeral(expr) && !manager.getRationalValue(expr).isZero())
258
+ );
259
+ }
260
+
261
+ private solveArithAdd(orig: number, x: number, y: number, eqs: DependentEq[]) {
262
+ const manager = this.manager;
263
+ if (manager.getOp(x) !== OP_ADD) return;
264
+ for (const [index, arg] of manager.getArgs(x).entries()) {
265
+ if (this.isConst(arg)) {
266
+ this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
267
+ continue;
268
+ }
269
+ const isReal = manager.sorts[arg] === SORT_REAL;
270
+ if (manager.getOp(arg) === OP_MUL && manager.getNumArgs(arg) === 2) {
271
+ const [coefficient, variable] = manager.getArgs(arg);
272
+ if (manager.isNumeral(coefficient) && this.isConst(variable)) {
273
+ const value = manager.getRationalValue(coefficient);
274
+ if (value.equals(Rational.minusOne))
275
+ this.push(
276
+ eqs,
277
+ orig,
278
+ variable,
279
+ this.mkApp(OP_UMINUS, [this.mkSubTerm(x, index, y)], manager.sorts[y]),
280
+ );
281
+ else if (isReal && !value.isZero())
282
+ this.push(
283
+ eqs,
284
+ orig,
285
+ variable,
286
+ this.mkApp(OP_DIV, [this.mkSubTerm(x, index, y), coefficient], SORT_REAL),
287
+ );
288
+ continue;
289
+ }
290
+ }
291
+ if (!isReal || manager.getOp(arg) !== OP_MUL) continue;
292
+ const factors = manager.getArgs(arg);
293
+ for (const [factorIndex, factor] of factors.entries()) {
294
+ if (!this.isConst(factor)) continue;
295
+ if (
296
+ !factors.every(
297
+ (other, otherIndex) => otherIndex === factorIndex || this.isNonzeroFactor(other),
298
+ )
299
+ )
300
+ continue;
301
+ const others = factors.filter((_value, otherIndex) => otherIndex !== factorIndex);
302
+ const term = this.mkSubTerm(x, index, y);
303
+ this.push(
304
+ eqs,
305
+ orig,
306
+ factor,
307
+ this.mkApp(OP_DIV, [term, this.mkMul(others, SORT_REAL)], SORT_REAL),
308
+ );
309
+ }
310
+ }
311
+ }
312
+
313
+ private solveArithMod(orig: number, x: number, y: number, eqs: DependentEq[]) {
314
+ const manager = this.manager;
315
+ if (!this.options.isEliminatingMod || manager.getOp(x) !== OP_MOD) return;
316
+ const [dividend, divisor] = manager.getArgs(x);
317
+ if (!manager.isNumeral(divisor) || !manager.getRationalValue(divisor).isPositive()) return;
318
+ const fresh = this.pin(manager.mkFreshConst("mod", SORT_INT));
319
+ const term = this.mkApp(OP_ADD, [this.mkApp(OP_MUL, [divisor, fresh], SORT_INT), y], SORT_INT);
320
+ if (this.isConst(dividend)) this.push(eqs, orig, dividend, term);
321
+ else this.solveArithEq(orig, dividend, term, eqs);
322
+ }
323
+
324
+ private solveArithMul(orig: number, x: number, y: number, eqs: DependentEq[]) {
325
+ const manager = this.manager;
326
+ if (manager.getOp(x) !== OP_MUL) return;
327
+ const factors = manager.getArgs(x);
328
+ for (const [index, factor] of factors.entries()) {
329
+ if (!this.isConst(factor) || manager.sorts[factor] !== SORT_REAL) continue;
330
+ if (
331
+ !factors.every((other, otherIndex) => otherIndex === index || this.isNonzeroFactor(other))
332
+ )
333
+ continue;
334
+ const others = factors.filter((_value, otherIndex) => otherIndex !== index);
335
+ this.push(
336
+ eqs,
337
+ orig,
338
+ factor,
339
+ this.mkApp(OP_DIV, [y, this.mkMul(others, SORT_REAL)], SORT_REAL),
340
+ );
341
+ }
342
+ }
343
+
344
+ private solveArithToReal(orig: number, x: number, y: number, eqs: DependentEq[]) {
345
+ const manager = this.manager;
346
+ if (manager.getOp(x) !== OP_TO_REAL || !this.isConst(manager.getArg(x, 0))) return;
347
+ const variable = manager.getArg(x, 0);
348
+ if (manager.getOp(y) === OP_TO_REAL) this.push(eqs, orig, variable, manager.getArg(y, 0));
349
+ else if (manager.isNumeral(y) && manager.getRationalValue(y).isInt())
350
+ this.push(eqs, orig, variable, manager.mkNumeral(manager.getRationalValue(y).num));
351
+ }
352
+
353
+ private solveArithEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
354
+ this.solveArithAdd(orig, x, y, eqs);
355
+ this.solveArithMod(orig, x, y, eqs);
356
+ this.solveArithMul(orig, x, y, eqs);
357
+ this.solveArithToReal(orig, x, y, eqs);
358
+ }
359
+
360
+ private getArithEqs(form: number, eqs: DependentEq[]) {
361
+ const manager = this.manager;
362
+ if (!this.options.isTheorySolver) return;
363
+ if (manager.getOp(form) === OP_EQ) {
364
+ const [x, y] = manager.getArgs(form);
365
+ if (manager.sorts[x] === SORT_INT || manager.sorts[x] === SORT_REAL) {
366
+ this.solveArithEq(form, x, y, eqs);
367
+ this.solveArithEq(form, y, x, eqs);
368
+ }
369
+ }
370
+ if (manager.getOp(form) !== OP_LE) return;
371
+ const [x, y] = manager.getArgs(form);
372
+ const lower = this.bounds.lowers.get(x);
373
+ if (
374
+ !manager.isNumeral(y) ||
375
+ lower === undefined ||
376
+ lower.isStrict ||
377
+ !lower.value.equals(manager.getRationalValue(y))
378
+ )
379
+ return;
380
+ if (this.isConst(x)) this.push(eqs, form, x, y);
381
+ else {
382
+ this.solveArithEq(form, x, y, eqs);
383
+ this.solveArithEq(form, y, x, eqs);
384
+ }
385
+ }
386
+
387
+ private getOddCoefficient(expr: number) {
388
+ const manager = this.manager;
389
+ if (manager.getOp(expr) !== OP_BMUL || manager.getNumArgs(expr) !== 2) return undefined;
390
+ const [coefficient, variable] = manager.getArgs(expr);
391
+ if (!manager.isBvNumeral(coefficient) || !this.isConst(variable)) return undefined;
392
+ const value = manager.getBvNumeralValue(coefficient);
393
+ if (value % 2n === 0n) return undefined;
394
+ const width = manager.getBvSize(manager.sorts[variable]);
395
+ return {
396
+ variable,
397
+ inverse: manager.mkBvNumeral(getModInverse(value, 1n << BigInt(width)), width),
398
+ };
399
+ }
400
+
401
+ private solveBvEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
402
+ const manager = this.manager;
403
+ if (manager.getOp(x) === OP_BADD)
404
+ for (const [index, arg] of manager.getArgs(x).entries()) {
405
+ if (this.isConst(arg)) {
406
+ this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
407
+ continue;
408
+ }
409
+ const odd = this.getOddCoefficient(arg);
410
+ if (odd === undefined) continue;
411
+ const term = this.mkSubTerm(x, index, y);
412
+ this.push(
413
+ eqs,
414
+ orig,
415
+ odd.variable,
416
+ this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), term])),
417
+ );
418
+ }
419
+ const odd = this.getOddCoefficient(x);
420
+ if (odd !== undefined)
421
+ this.push(
422
+ eqs,
423
+ orig,
424
+ odd.variable,
425
+ this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), y])),
426
+ );
427
+ }
428
+
429
+ private getBvEqs(form: number, eqs: DependentEq[]) {
430
+ const manager = this.manager;
431
+ if (manager.getOp(form) !== OP_EQ) return;
432
+ const [x, y] = manager.getArgs(form);
433
+ if (!manager.isBvSort(manager.sorts[x])) return;
434
+ this.solveBvEq(form, x, y, eqs);
435
+ this.solveBvEq(form, y, x, eqs);
436
+ }
437
+
438
+ private hasSubterm(root: number, isMatch: (expr: number) => boolean) {
439
+ const manager = this.manager;
440
+ const visited = new Set<number>();
441
+ const todo = [root];
442
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
443
+ if (visited.has(expr)) continue;
444
+ visited.add(expr);
445
+ if (isMatch(expr)) return true;
446
+ if (manager.kinds[expr] === KIND_APP || manager.kinds[expr] === KIND_QUANTIFIER)
447
+ manager.pushArgs(expr, todo);
448
+ }
449
+ return false;
450
+ }
451
+
452
+ // Array definitions by a universal quantifier need lambdas, which the port does not have.
453
+ private checkArrayEqs(form: number) {
454
+ const manager = this.manager;
455
+ if (
456
+ manager.kinds[form] !== KIND_QUANTIFIER ||
457
+ manager.getQuantifier(form).kind !== QUANTIFIER_FORALL
458
+ )
459
+ return;
460
+ const numVars = manager.getQuantifier(form).sorts.length;
461
+ const body = manager.getQuantifier(form).body;
462
+ const [guard, eq] =
463
+ manager.getOp(body) === OP_IMPLIES
464
+ ? manager.getArgs(body)
465
+ : manager.getOp(body) === OP_OR && manager.getNumArgs(body) === 2
466
+ ? manager.getOp(manager.getArg(body, 1)) === OP_EQ
467
+ ? manager.getArgs(body)
468
+ : manager.getOp(manager.getArg(body, 0)) === OP_EQ
469
+ ? manager.getArgs(body).reverse()
470
+ : [-1, -1]
471
+ : [-1, body];
472
+ if (eq === -1 || manager.getOp(eq) !== OP_EQ) return;
473
+ const [lhs, rhs] = manager.getArgs(eq);
474
+ const isGuardedIte =
475
+ guard === -1 &&
476
+ manager.getOp(lhs) === OP_ITE &&
477
+ manager.getOp(rhs) === OP_ITE &&
478
+ manager.getArg(lhs, 0) === manager.getArg(rhs, 0) &&
479
+ manager.getArg(lhs, 2) === manager.getArg(rhs, 2);
480
+ const [condition, left, right] = isGuardedIte
481
+ ? [manager.getArg(lhs, 0), manager.getArg(lhs, 1), manager.getArg(rhs, 1)]
482
+ : [guard, lhs, rhs];
483
+ const isSelectOfVars = (expr: number) =>
484
+ manager.getOp(expr) === OP_SELECT &&
485
+ manager.getNumArgs(expr) === numVars + 1 &&
486
+ manager
487
+ .getArgs(expr)
488
+ .slice(1)
489
+ .every(
490
+ (arg, index) =>
491
+ manager.kinds[arg] === KIND_VAR && manager.values[arg] === numVars - index - 1,
492
+ );
493
+ const [select, def] = isSelectOfVars(left)
494
+ ? [left, right]
495
+ : isSelectOfVars(right)
496
+ ? [right, left]
497
+ : [-1, -1];
498
+ if (select === -1) return;
499
+ const array = manager.getArg(select, 0);
500
+ const isQuantifier = (expr: number) => manager.kinds[expr] === KIND_QUANTIFIER;
501
+ const parts = condition === -1 ? [def] : [def, condition];
502
+ if (
503
+ this.isConst(array) &&
504
+ !parts.some((part) => this.hasSubterm(part, (expr) => expr === array)) &&
505
+ !parts.some((part) => this.hasSubterm(part, isQuantifier))
506
+ )
507
+ throw new SmtUnsupportedError("solving for an array defined by a quantifier");
508
+ }
509
+
510
+ private getEqsOf(form: number, eqs: DependentEq[]) {
511
+ if (!this.goal.isProofsEnabled) this.getArithEqs(form, eqs);
512
+ this.getBasicEqs(form, eqs);
513
+ if (!this.goal.isProofsEnabled) {
514
+ this.getBvEqs(form, eqs);
515
+ this.checkArrayEqs(form);
516
+ }
517
+ }
518
+
519
+ private getEqs() {
520
+ const eqs: DependentEq[] = [];
521
+ const state = this.state;
522
+ if (!this.goal.isProofsEnabled)
523
+ state.forEachIndex((index) => this.getArithEqs(state.get(index), eqs));
524
+ state.forEachIndex((index) => this.getBasicEqs(state.get(index), eqs));
525
+ if (!this.goal.isProofsEnabled) {
526
+ state.forEachIndex((index) => this.getBvEqs(state.get(index), eqs));
527
+ state.forEachIndex((index) => this.checkArrayEqs(state.get(index)));
528
+ // ff_extract_eq finds no equations without finite fields, but its pass still counts steps.
529
+ state.forEachIndex(() => {});
530
+ }
531
+ return eqs;
532
+ }
533
+
534
+ private extractDepGraph(eqs: DependentEq[]) {
535
+ this.var2id.clear();
536
+ this.id2var = [];
537
+ for (const eq of eqs) {
538
+ if (this.var2id.has(eq.variable) || !this.canBeVar(eq.variable)) continue;
539
+ this.var2id.set(eq.variable, this.id2var.length);
540
+ this.id2var.push(eq.variable);
541
+ }
542
+ this.next = this.id2var.map(() => []);
543
+ for (const eq of eqs)
544
+ if (this.canBeVar(eq.variable)) this.next[this.var2id.get(eq.variable) as number].push(eq);
545
+ }
546
+
547
+ private extractSubst() {
548
+ const manager = this.manager;
549
+ const size = this.id2var.length;
550
+ this.id2level = this.id2var.map(() => Infinity);
551
+ this.substIds = [];
552
+ this.substitution = new ObjMap((expr) => manager.hashes[expr]);
553
+ let initLevel = 2 ** 32 - 1;
554
+ const todo: number[] = [];
555
+ for (let id = 0; id < size; id++) {
556
+ if (this.id2level[id] !== Infinity) continue;
557
+ if (initLevel < size + 1) return;
558
+ initLevel -= size + 1;
559
+ let currLevel = initLevel;
560
+ todo.push(id);
561
+ for (let next = todo.pop(); next !== undefined; next = todo.pop()) {
562
+ if (this.id2level[next] !== Infinity) continue;
563
+ this.id2level[next] = currLevel++;
564
+ for (const eq of this.next[next]) {
565
+ const todoSize = todo.length;
566
+ let isSafe = true;
567
+ const visited = new Set<number>();
568
+ const stack = [eq.term];
569
+ for (let expr = stack.pop(); expr !== undefined; expr = stack.pop()) {
570
+ if (visited.has(expr)) continue;
571
+ visited.add(expr);
572
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, stack);
573
+ else if (manager.kinds[expr] === KIND_QUANTIFIER)
574
+ stack.push(manager.getQuantifier(expr).body);
575
+ const id = this.var2id.get(expr);
576
+ if (id === undefined) continue;
577
+ if (this.id2level[id] < currLevel) {
578
+ isSafe = false;
579
+ break;
580
+ }
581
+ if (this.id2level[id] === Infinity) todo.push(id);
582
+ }
583
+ if (!isSafe) {
584
+ todo.length = todoSize;
585
+ continue;
586
+ }
587
+ this.next[next][0] = eq;
588
+ this.substIds.push(next);
589
+ break;
590
+ }
591
+ }
592
+ }
593
+ }
594
+
595
+ private normalize() {
596
+ if (this.substIds.length === 0) return;
597
+ const manager = this.manager;
598
+ const replacer = new SubstReplacer(manager, this.substitution);
599
+ this.substIds.sort((first, second) => this.id2level[second] - this.id2level[first]);
600
+ for (const id of this.substIds) {
601
+ if (!manager.limit.inc()) break;
602
+ const eq = this.next[id][0];
603
+ const definition = replacer.rewrite(eq.term);
604
+ this.pinned.pushOwned(definition);
605
+ manager.incRef(eq.variable);
606
+ this.pinned.pushOwned(eq.variable);
607
+ this.substitution.set(eq.variable, definition);
608
+ }
609
+ replacer.release();
610
+ }
611
+
612
+ private applySubst() {
613
+ const manager = this.manager;
614
+ if (!manager.limit.inc() || this.substIds.length === 0) return;
615
+ const replacer = new SubstReplacer(manager, this.substitution);
616
+ const goal = this.goal;
617
+ const state = this.state;
618
+ state.forEachIndex((index) => {
619
+ const form = state.get(index);
620
+ const replaced = replacer.rewrite(form);
621
+ const simplified = this.rewriter.rewrite(replaced);
622
+ manager.decRef(replaced);
623
+ if (simplified !== form) goal.update(index, simplified);
624
+ manager.decRef(simplified);
625
+ });
626
+ replacer.release();
627
+ }
628
+
629
+ private saveSubst() {
630
+ for (const [variable, def] of this.substitution.entries())
631
+ this.definitions.push({ decl: this.manager.decls[variable], def });
632
+ }
633
+
634
+ private canBeVar(expr: number) {
635
+ return this.isConst(expr) && !this.unsafeVars.has(expr);
636
+ }
637
+
638
+ // filter_unsafe_vars: the recfun theory unfolds a recursive definition, which a substitution
639
+ // does not reach, so the constants in its body stay.
640
+ private runRound(getEqs: () => DependentEq[]) {
641
+ const manager = this.manager;
642
+ this.unsafeVars = new Set(
643
+ [...manager.recFunDefs.values()]
644
+ .filter((def) => !def.isMacro && def.rhs !== -1)
645
+ .flatMap((def) => getSubterms(manager, def.rhs)),
646
+ );
647
+ this.eqTerms.reset();
648
+ const eqs = getEqs();
649
+ this.extractDepGraph(eqs);
650
+ this.extractSubst();
651
+ this.normalize();
652
+ this.applySubst();
653
+ this.saveSubst();
654
+ }
655
+
656
+ reduce() {
657
+ const goal = this.goal;
658
+ if (!goal.isProofsEnabled && this.options.isTheorySolver)
659
+ for (const form of goal.forms.items) {
660
+ this.markPositive(form);
661
+ this.bounds.add(form);
662
+ }
663
+ const limit = this.manager.limit;
664
+ let count = 0;
665
+ do {
666
+ this.runRound(() => this.getEqs());
667
+ count++;
668
+ } while (this.substIds.length > 0 && count < 20 && limit.inc());
669
+ if (limit.inc() && this.options.isContextSolve && !goal.isProofsEnabled)
670
+ this.runRound(() => this.collectNestedEqualities());
671
+ this.eqTerms.reset();
672
+ finishSimplifier(goal, this.definitions);
673
+ }
674
+
675
+ private markPositive(form: number) {
676
+ const manager = this.manager;
677
+ const isNegated = manager.isNot(form);
678
+ const atom = isNegated ? manager.getArg(form, 0) : form;
679
+ const op = manager.getOp(atom);
680
+ if (op !== OP_LE && op !== OP_GE && op !== OP_EQ) return;
681
+ const [lhs, rhs] = manager.getArgs(atom);
682
+ if (!manager.isNumeral(rhs)) return;
683
+ const value = manager.getRationalValue(rhs);
684
+ const isNonzero = isNegated
685
+ ? (op === OP_LE && !value.isNegative()) ||
686
+ (op === OP_GE && !value.isPositive()) ||
687
+ (op === OP_EQ && value.isZero())
688
+ : (op === OP_LE && value.isNegative()) || (op === OP_GE && value.isPositive());
689
+ if (isNonzero) this.nonzero.add(lhs);
690
+ }
691
+
692
+ private markOccurs(roots: number[], variable: number) {
693
+ const manager = this.manager;
694
+ const occurs = this.containsV;
695
+ const visited = new Set<number>([variable]);
696
+ occurs.add(variable);
697
+ const todo = [...roots];
698
+ while (todo.length > 0) {
699
+ const expr = todo[todo.length - 1];
700
+ if (visited.has(expr)) {
701
+ todo.pop();
702
+ continue;
703
+ }
704
+ if (manager.kinds[expr] === KIND_APP) {
705
+ let isOccurring = false;
706
+ let isAllVisited = true;
707
+ for (const arg of manager.getArgs(expr))
708
+ if (!visited.has(arg)) {
709
+ todo.push(arg);
710
+ isAllVisited = false;
711
+ } else if (occurs.has(arg)) isOccurring = true;
712
+ if (isAllVisited) {
713
+ if (isOccurring) occurs.add(expr);
714
+ else occurs.delete(expr);
715
+ visited.add(expr);
716
+ todo.pop();
717
+ }
718
+ } else if (manager.kinds[expr] === KIND_QUANTIFIER) {
719
+ const body = manager.getQuantifier(expr).body;
720
+ if (visited.has(body)) {
721
+ visited.add(expr);
722
+ if (occurs.has(body)) occurs.add(expr);
723
+ else occurs.delete(expr);
724
+ todo.pop();
725
+ } else todo.push(body);
726
+ } else {
727
+ visited.add(expr);
728
+ todo.pop();
729
+ }
730
+ }
731
+ }
732
+
733
+ private isConjunction(isNegated: boolean, expr: number) {
734
+ const op = this.manager.getOp(expr);
735
+ return (!isNegated && op === OP_AND) || (isNegated && op === OP_OR);
736
+ }
737
+
738
+ private containsConjunctively(form: number, isNegated: boolean, eq: number, conjuncts: Signed[]) {
739
+ const manager = this.manager;
740
+ const todo: Signed[] = [{ isNegated, expr: form }];
741
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
742
+ if (!item.isNegated && item.expr === eq) return true;
743
+ const marks = item.isNegated ? this.andNegative : this.andPositive;
744
+ if (marks.has(item.expr)) continue;
745
+ marks.add(item.expr);
746
+ if (!this.containsV.has(item.expr)) continue;
747
+ const op = manager.getOp(item.expr);
748
+ if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
749
+ for (const arg of manager.getArgs(item.expr))
750
+ todo.push({ isNegated: item.isNegated, expr: arg });
751
+ else if (manager.isNot(item.expr))
752
+ todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
753
+ else conjuncts.push(item);
754
+ }
755
+ return false;
756
+ }
757
+
758
+ private isDisjunctivelySafe(depth: number, root: number, isNegated: boolean, eq: number) {
759
+ const manager = this.manager;
760
+ const todo: Signed[] = [{ isNegated, expr: root }];
761
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
762
+ const marks = item.isNegated ? this.orNegative : this.orPositive;
763
+ if (marks.has(item.expr)) continue;
764
+ marks.add(item.expr);
765
+ const op = manager.getOp(item.expr);
766
+ if (!item.isNegated && item.expr === eq) continue;
767
+ if (!this.containsV.has(item.expr)) continue;
768
+ if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
769
+ for (const arg of manager.getArgs(item.expr))
770
+ todo.push({ isNegated: item.isNegated, expr: arg });
771
+ else if (manager.isNot(item.expr))
772
+ todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
773
+ else if (!this.isConjunction(item.isNegated, item.expr)) return false;
774
+ else if (!this.isSafeEqIn(depth + 1, item.expr, item.isNegated, eq)) return false;
775
+ }
776
+ return true;
777
+ }
778
+
779
+ private isSafeEqIn(depth: number, form: number, isNegated: boolean, eq: number): boolean {
780
+ if (!this.containsV.has(form)) return true;
781
+ const conjuncts: Signed[] = [];
782
+ if (this.containsConjunctively(form, isNegated, eq, conjuncts)) return true;
783
+ if (depth > 3) return false;
784
+ return conjuncts.every((conjunct) =>
785
+ this.isDisjunctivelySafe(depth, conjunct.expr, conjunct.isNegated, eq),
786
+ );
787
+ }
788
+
789
+ private isSafeEq(eq: number) {
790
+ this.andPositive.clear();
791
+ this.andNegative.clear();
792
+ this.orPositive.clear();
793
+ this.orNegative.clear();
794
+ return this.goal.forms.items.every((form) => this.isSafeEqIn(0, form, false, eq));
795
+ }
796
+
797
+ private isSafeVar(variable: number, index: number, form: number, todo: NestedItem[]) {
798
+ this.containsV.clear();
799
+ this.markOccurs([form], variable);
800
+ const isParent = (parent: number, child: number) => {
801
+ let current = child;
802
+ while (current !== parent && current !== 0) current = todo[current].parent;
803
+ return current === parent;
804
+ };
805
+ let top = index;
806
+ while (top !== 0) {
807
+ if (todo[top].depth !== todo[index].depth) break;
808
+ top = todo[top].parent;
809
+ }
810
+ return todo.every(
811
+ (item, other) =>
812
+ other === index ||
813
+ !this.containsV.has(item.expr) ||
814
+ isParent(other, index) ||
815
+ isParent(top, other),
816
+ );
817
+ }
818
+
819
+ private collectNestedIn(form: number, visited: Set<number>, eqs: DependentEq[]) {
820
+ const manager = this.manager;
821
+ const todo: NestedItem[] = [{ isNegated: false, depth: 0, expr: form, parent: 0 }];
822
+ const incOr = (depth: number) => (depth % 2 === 0 ? depth + 1 : depth);
823
+ const incAnd = (depth: number) => (depth % 2 === 0 ? depth : depth + 1);
824
+ for (let index = 0; index < todo.length; index++) {
825
+ const item = todo[index];
826
+ if (visited.has(item.expr)) continue;
827
+ visited.add(item.expr);
828
+ const op = manager.getOp(item.expr);
829
+ const pushArgs = (depth: number) => {
830
+ for (const arg of manager.getArgs(item.expr))
831
+ todo.push({ isNegated: item.isNegated, depth, expr: arg, parent: index });
832
+ };
833
+ if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
834
+ pushArgs(incOr(item.depth));
835
+ if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
836
+ pushArgs(incAnd(item.depth));
837
+ else if (manager.isNot(item.expr))
838
+ todo.push({
839
+ isNegated: !item.isNegated,
840
+ depth: item.depth,
841
+ expr: manager.getArg(item.expr, 0),
842
+ parent: index,
843
+ });
844
+ else if (!item.isNegated && item.depth >= 1) {
845
+ const start = eqs.length;
846
+ this.isAllowingBool = false;
847
+ this.getEqsOf(item.expr, eqs);
848
+ this.isAllowingBool = true;
849
+ for (let current = start; current < eqs.length; current++)
850
+ if (!this.isSafeVar(eqs[current].variable, index, form, todo)) {
851
+ eqs[current] = eqs[eqs.length - 1];
852
+ current--;
853
+ eqs.pop();
854
+ }
855
+ }
856
+ }
857
+ }
858
+
859
+ private collectNestedEqualities() {
860
+ const manager = this.manager;
861
+ const forms = this.goal.forms.items;
862
+ const visited = new Set<number>();
863
+ const collected: DependentEq[] = [];
864
+ for (const form of forms) this.collectNestedIn(form, visited, collected);
865
+ if (collected.length === 0) return collected;
866
+ const eqs = collected
867
+ .map((eq, index) => ({ eq, index }))
868
+ .sort(
869
+ (first, second) =>
870
+ manager.ids[first.eq.variable] - manager.ids[second.eq.variable] ||
871
+ first.index - second.index,
872
+ )
873
+ .map((entry) => entry.eq);
874
+ const firstOccurrence = new Map<number, number>();
875
+ const lastOccurrence = new Map<number, number>();
876
+ const record = (occurrence: Map<number, number>, order: number[]) => {
877
+ const seen = new Set<number>();
878
+ for (const index of order) {
879
+ const todo = [forms[index]];
880
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
881
+ if (seen.has(expr)) continue;
882
+ seen.add(expr);
883
+ occurrence.set(expr, index);
884
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
885
+ else if (manager.kinds[expr] === KIND_QUANTIFIER) {
886
+ const data = manager.getQuantifier(expr);
887
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
888
+ }
889
+ }
890
+ }
891
+ };
892
+ record(
893
+ firstOccurrence,
894
+ forms.map((_value, index) => index),
895
+ );
896
+ record(
897
+ lastOccurrence,
898
+ forms.map((_value, index) => forms.length - 1 - index),
899
+ );
900
+ const kept: DependentEq[] = [];
901
+ let lastVar = -1;
902
+ let isUnsafe = false;
903
+ for (const eq of eqs) {
904
+ const first = firstOccurrence.get(eq.variable);
905
+ if (first === undefined || first !== lastOccurrence.get(eq.variable)) continue;
906
+ if (eq.variable !== lastVar) {
907
+ this.containsV.clear();
908
+ this.markOccurs([eq.term], eq.variable);
909
+ lastVar = eq.variable;
910
+ isUnsafe = false;
911
+ if (this.containsV.has(eq.term)) {
912
+ isUnsafe = true;
913
+ continue;
914
+ }
915
+ this.markOccurs([forms[first]], eq.variable);
916
+ } else if (this.containsV.has(eq.term) || isUnsafe) continue;
917
+ if (this.isSafeEq(eq.orig)) kept.push(eq);
918
+ }
919
+ return kept;
920
+ }
921
+
922
+ release() {
923
+ this.state.release();
924
+ this.rewriter.release();
925
+ this.pinned.reset();
926
+ this.eqTerms.reset();
927
+ }
928
+ }