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,577 @@
1
+ import { SmtParseError, SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_ARRAY,
6
+ FAMILY_BASIC,
7
+ FAMILY_BV,
8
+ FAMILY_FPA,
9
+ FAMILY_USER,
10
+ KIND_APP,
11
+ KIND_QUANTIFIER,
12
+ KIND_VAR,
13
+ OP_ABS,
14
+ OP_ADD,
15
+ OP_ALGEBRAIC_NUM,
16
+ OP_BSDIV0,
17
+ OP_BSMOD0,
18
+ OP_BSREM0,
19
+ OP_BUDIV0,
20
+ OP_BUREM0,
21
+ OP_BV_NUM,
22
+ OP_CONCAT,
23
+ OP_DIV,
24
+ OP_EQ,
25
+ OP_EXTRACT,
26
+ OP_FPA_TO_REAL,
27
+ OP_GE,
28
+ OP_GT,
29
+ OP_IDIV,
30
+ OP_IS_INT,
31
+ OP_ITE,
32
+ OP_LE,
33
+ OP_LT,
34
+ OP_MOD,
35
+ OP_MUL,
36
+ OP_NUM,
37
+ OP_POWER,
38
+ OP_SUB,
39
+ OP_TO_INT,
40
+ OP_TO_REAL,
41
+ OP_UMINUS,
42
+ SORT_BOOL,
43
+ SORT_INT,
44
+ SORT_REAL,
45
+ } from "./ast";
46
+ import { getAckrBound } from "./ackr-helper";
47
+ import { BoundManager } from "./bound-manager";
48
+ import { Expr2Polynomial } from "./expr2polynomial";
49
+ import { PolynomialManager, PolynomialRef } from "./nlsat/polynomial";
50
+ import { findNonPb } from "./pb2bv-tactic";
51
+ import type { Goal } from "./goal";
52
+ import { isSymbol, type SExpr } from "./smtlib-parser";
53
+
54
+ export interface Probe {
55
+ (goal: Goal): number;
56
+ }
57
+
58
+ const forEachExpr = (goal: Goal, visit: (expr: number) => void) => {
59
+ const manager = goal.manager;
60
+ const visited = new Set<number>();
61
+ const todo = [...goal.forms.items].reverse();
62
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
63
+ if (visited.has(expr)) continue;
64
+ visited.add(expr);
65
+ visit(expr);
66
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
67
+ else if (manager.kinds[expr] === KIND_QUANTIFIER) {
68
+ const data = manager.getQuantifier(expr);
69
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
70
+ }
71
+ }
72
+ };
73
+
74
+ const countExprs = (goal: Goal, isCounted: (expr: number) => boolean) => {
75
+ let count = 0;
76
+ forEachExpr(goal, (expr) => {
77
+ if (isCounted(expr)) count++;
78
+ });
79
+ return count;
80
+ };
81
+
82
+ const isNone = (goal: Goal, isFound: (expr: number) => boolean) => countExprs(goal, isFound) === 0;
83
+
84
+ const mkTest =
85
+ (isFound: (manager: AstManager, expr: number) => boolean): Probe =>
86
+ (goal) =>
87
+ Number(isNone(goal, (expr) => isFound(goal.manager, expr)));
88
+
89
+ const isConst = (manager: AstManager, expr: number) =>
90
+ manager.kinds[expr] === KIND_APP && manager.getNumArgs(expr) === 0 && !manager.isValue(expr);
91
+
92
+ const isArithSort = (sort: number) => sort === SORT_INT || sort === SORT_REAL;
93
+
94
+ const isApp = (manager: AstManager, expr: number) => manager.kinds[expr] === KIND_APP;
95
+
96
+ const isNonPropositional = (manager: AstManager, expr: number) =>
97
+ !isApp(manager, expr) ||
98
+ manager.sorts[expr] !== SORT_BOOL ||
99
+ (manager.getFamily(expr) !== FAMILY_BASIC && !manager.isUninterpretedConst(expr));
100
+
101
+ const BV_DIV0_OPS = [OP_BSDIV0, OP_BUDIV0, OP_BSREM0, OP_BUREM0, OP_BSMOD0];
102
+
103
+ const isNonQfbv = (manager: AstManager, expr: number) => {
104
+ if (!isApp(manager, expr)) return true;
105
+ if (manager.sorts[expr] !== SORT_BOOL && !manager.isBvSort(manager.sorts[expr])) return true;
106
+ const family = manager.getFamily(expr);
107
+ if (family === FAMILY_BASIC) return false;
108
+ if (family === FAMILY_BV) return BV_DIV0_OPS.includes(manager.getOp(expr));
109
+ return !manager.isUninterpretedConst(expr);
110
+ };
111
+
112
+ const isNonQfaufbv = (manager: AstManager, expr: number) => {
113
+ if (!isApp(manager, expr)) return true;
114
+ const sort = manager.sorts[expr];
115
+ if (sort !== SORT_BOOL && !manager.isBvSort(sort) && !manager.isArraySort(sort)) return true;
116
+ const family = manager.getFamily(expr);
117
+ return (
118
+ family !== FAMILY_BASIC &&
119
+ family !== FAMILY_BV &&
120
+ family !== FAMILY_ARRAY &&
121
+ !manager.isUninterpreted(expr)
122
+ );
123
+ };
124
+
125
+ const isNonQfufbv = (manager: AstManager, expr: number) => {
126
+ if (!isApp(manager, expr)) return true;
127
+ if (manager.sorts[expr] !== SORT_BOOL && !manager.isBvSort(manager.sorts[expr])) return true;
128
+ const family = manager.getFamily(expr);
129
+ return family !== FAMILY_BASIC && family !== FAMILY_BV && !manager.isUninterpreted(expr);
130
+ };
131
+
132
+ export const isQfufbv = mkTest(isNonQfufbv);
133
+
134
+ const isNonQfbvEq = (manager: AstManager, expr: number) =>
135
+ manager.kinds[expr] !== KIND_APP ||
136
+ (manager.getFamily(expr) === FAMILY_BV &&
137
+ ![OP_BV_NUM, OP_EXTRACT, OP_CONCAT].includes(manager.getOp(expr)));
138
+
139
+ const mkNonQffp = (isLra: boolean) => (manager: AstManager, expr: number) => {
140
+ if (!isApp(manager, expr)) return true;
141
+ const sort = manager.sorts[expr];
142
+ if (
143
+ sort !== SORT_BOOL &&
144
+ !manager.isFpSort(sort) &&
145
+ !manager.isRmSort(sort) &&
146
+ !manager.isBvSort(sort) &&
147
+ sort !== SORT_REAL
148
+ )
149
+ return true;
150
+ const family = manager.getFamily(expr);
151
+ if (family === FAMILY_BASIC || family === FAMILY_FPA || family === FAMILY_BV) return false;
152
+ if ((isLra && family === FAMILY_ARITH) || manager.isUninterpretedConst(expr)) return false;
153
+ return isLra ? sort !== SORT_REAL : !(sort === SORT_REAL && manager.isNumeral(expr));
154
+ };
155
+
156
+ // Z3 rejects every application of the basic family before it would accept one, so the goal must not
157
+ // have a Boolean connective.
158
+ const isNonFpQfnra = (manager: AstManager, expr: number) => {
159
+ if (!isApp(manager, expr)) return true;
160
+ const family = manager.getFamily(expr);
161
+ const sort = manager.sorts[expr];
162
+ if (family === FAMILY_FPA)
163
+ return (
164
+ !manager.isFpSort(sort) && !manager.isRmSort(sort) && manager.getOp(expr) !== OP_FPA_TO_REAL
165
+ );
166
+ return (
167
+ family !== FAMILY_USER ||
168
+ (!manager.isFpSort(sort) && !manager.isRmSort(sort) && sort !== SORT_BOOL)
169
+ );
170
+ };
171
+
172
+ // Z3 builds these probes into its tactics without registering them by name. memory is registered,
173
+ // but it reads the megabytes Z3's allocator handed out, which the port has no counterpart for:
174
+ // only the port's own strategies see it, as 0, so qfnra takes the branch Z3 takes on small goals.
175
+ const INTERNAL_PROBES = new Map<string, Probe>([
176
+ ["is-fp-qfnra", mkTest(isNonFpQfnra)],
177
+ ["memory", () => 0],
178
+ ]);
179
+
180
+ const LINEAR_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_NUM];
181
+
182
+ const isLinearMul = (manager: AstManager, expr: number) =>
183
+ manager.getNumArgs(expr) === 2 && manager.isNumeral(manager.getArg(expr, 0));
184
+
185
+ const mkNonLira =
186
+ (isInt: boolean, isReal: boolean, isArray: boolean) => (manager: AstManager, expr: number) => {
187
+ if (!isApp(manager, expr)) return true;
188
+ const sort = manager.sorts[expr];
189
+ if (
190
+ sort !== SORT_BOOL &&
191
+ !(isInt && sort === SORT_INT) &&
192
+ !(isReal && sort === SORT_REAL) &&
193
+ !(isArray && manager.isArraySort(sort))
194
+ )
195
+ return true;
196
+ const family = manager.getFamily(expr);
197
+ if (family === FAMILY_BASIC || (isArray && family === FAMILY_ARRAY)) return false;
198
+ if (family !== FAMILY_ARITH)
199
+ return isArray ? !manager.isUninterpreted(expr) : !manager.isUninterpretedConst(expr);
200
+ const op = manager.getOp(expr);
201
+ if (LINEAR_OPS.includes(op)) return false;
202
+ if (op === OP_MUL) return !isLinearMul(manager, expr);
203
+ return op !== OP_TO_REAL || !isReal;
204
+ };
205
+
206
+ const isNonQflia = mkNonLira(true, false, false);
207
+
208
+ const isTermIte = (manager: AstManager, expr: number) =>
209
+ manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL;
210
+
211
+ const isLp = (goal: Goal) => {
212
+ const manager = goal.manager;
213
+ return goal.forms.items.every((form) => {
214
+ let atom = form;
215
+ let isNegated = false;
216
+ while (manager.isNot(atom)) {
217
+ atom = manager.getArg(atom, 0);
218
+ isNegated = !isNegated;
219
+ }
220
+ if (manager.getOp(atom) === OP_EQ && !isNegated)
221
+ return isArithSort(manager.sorts[manager.getArg(atom, 0)]);
222
+ return [OP_LE, OP_GE, OP_LT, OP_GT].includes(manager.getOp(atom));
223
+ });
224
+ };
225
+
226
+ const isIlp: Probe = (goal) =>
227
+ Number(
228
+ isNone(goal, (expr) => isNonQflia(goal.manager, expr)) &&
229
+ isNone(goal, (expr) => isTermIte(goal.manager, expr)) &&
230
+ isLp(goal),
231
+ );
232
+
233
+ const hasNonlinearMul = (manager: AstManager, expr: number) => {
234
+ if (!isApp(manager, expr) || manager.getFamily(expr) !== FAMILY_ARITH) return false;
235
+ const op = manager.getOp(expr);
236
+ if (op === OP_MUL) return !isLinearMul(manager, expr);
237
+ if (op === OP_IDIV || op === OP_DIV || op === OP_MOD)
238
+ return !manager.isNumeral(manager.getArg(expr, 1));
239
+ return op === OP_POWER;
240
+ };
241
+
242
+ const NIRA_OPS = [OP_LE, OP_GE, OP_LT, OP_GT, OP_ADD, OP_UMINUS, OP_SUB, OP_ABS, OP_NUM];
243
+
244
+ const mkNonNira =
245
+ (isInt: boolean, isReal: boolean, isQuantified: boolean, isLinear: boolean) =>
246
+ (manager: AstManager, expr: number) => {
247
+ const sort = manager.sorts[expr];
248
+ const isCompatible =
249
+ sort === SORT_BOOL || (isInt && sort === SORT_INT) || (isReal && sort === SORT_REAL);
250
+ if (manager.kinds[expr] === KIND_VAR) return !isQuantified || !isCompatible;
251
+ if (manager.kinds[expr] === KIND_QUANTIFIER) return !isQuantified;
252
+ if (!isCompatible) return true;
253
+ const family = manager.getFamily(expr);
254
+ if (family === FAMILY_BASIC) return false;
255
+ if (family !== FAMILY_ARITH) return !manager.isUninterpretedConst(expr);
256
+ const op = manager.getOp(expr);
257
+ if (NIRA_OPS.includes(op)) return false;
258
+ if (op === OP_MUL)
259
+ return (
260
+ isLinear &&
261
+ (manager.getNumArgs(expr) !== 2 ||
262
+ (!manager.isNumeral(manager.getArg(expr, 0)) &&
263
+ !manager.isNumeral(manager.getArg(expr, 1))))
264
+ );
265
+ if (op === OP_IDIV || op === OP_DIV || op === OP_MOD) {
266
+ const divisor = manager.getArg(expr, 1);
267
+ if (isLinear)
268
+ return !manager.isNumeral(divisor) || manager.getRationalValue(divisor).isZero();
269
+ return !manager.isGroundApp(manager.getArg(expr, 0)) || !manager.isGroundApp(divisor);
270
+ }
271
+ if (op === OP_IS_INT) return isReal;
272
+ if (op === OP_TO_INT || op === OP_TO_REAL) return false;
273
+ if (op === OP_POWER) return isLinear;
274
+ if (op === OP_ALGEBRAIC_NUM) return isLinear || !isReal;
275
+ return true;
276
+ };
277
+
278
+ const mkNiraProbe =
279
+ (isInt: boolean, isReal: boolean, isQuantified: boolean, isLinear: boolean): Probe =>
280
+ (goal) => {
281
+ const isNonNira = mkNonNira(isInt, isReal, isQuantified, isLinear);
282
+ return Number(
283
+ isNone(goal, (expr) => isNonNira(goal.manager, expr)) &&
284
+ (isLinear || !isNone(goal, (expr) => hasNonlinearMul(goal.manager, expr))),
285
+ );
286
+ };
287
+
288
+ const isQfufnra: Probe = (goal) => {
289
+ const manager = goal.manager;
290
+ let isNonlinear = false;
291
+ const isFound = (expr: number) => {
292
+ if (manager.kinds[expr] !== KIND_APP) return true;
293
+ if (manager.getFamily(expr) !== FAMILY_ARITH) return false;
294
+ const op = manager.getOp(expr);
295
+ if (NIRA_OPS.includes(op) || op === OP_ALGEBRAIC_NUM) return false;
296
+ if (op === OP_MUL) {
297
+ const first = manager.getArg(expr, 0);
298
+ if (
299
+ manager.getNumArgs(expr) === 2 &&
300
+ manager.sorts[first] === SORT_REAL &&
301
+ !manager.isNumeral(first) &&
302
+ !manager.isNumeral(manager.getArg(expr, 1))
303
+ )
304
+ isNonlinear = true;
305
+ return false;
306
+ }
307
+ if (op === OP_IDIV || op === OP_DIV || op === OP_MOD)
308
+ return !manager.isNumeral(manager.getArg(expr, 1));
309
+ if (op === OP_POWER) {
310
+ if (!manager.isNumeral(manager.getArg(expr, 1))) return true;
311
+ isNonlinear = true;
312
+ return false;
313
+ }
314
+ return true;
315
+ };
316
+ return Number(
317
+ !goal.isProofsEnabled && !goal.isCoresEnabled && isNone(goal, isFound) && isNonlinear,
318
+ );
319
+ };
320
+
321
+ const getBounds = (goal: Goal) => {
322
+ const bounds = new BoundManager(goal.manager);
323
+ if (!goal.isProofsEnabled) for (const form of goal.forms.items) bounds.add(form);
324
+ return bounds;
325
+ };
326
+
327
+ const isUnbounded: Probe = (goal) => {
328
+ const manager = goal.manager;
329
+ const bounds = getBounds(goal);
330
+ return Number(
331
+ !isNone(
332
+ goal,
333
+ (expr) =>
334
+ manager.kinds[expr] === KIND_APP &&
335
+ manager.isUninterpretedConst(expr) &&
336
+ isArithSort(manager.sorts[expr]) &&
337
+ (!bounds.lowers.has(expr) || !bounds.uppers.has(expr)),
338
+ ),
339
+ );
340
+ };
341
+
342
+ const isQuasiPb: Probe = (goal) => {
343
+ if (isUnbounded(goal) !== 0) return 0;
344
+ const bounds = getBounds(goal);
345
+ return Number(bounds.boundedVars.filter((variable) => !bounds.isZeroOne(variable)).length <= 1);
346
+ };
347
+
348
+ const isPb: Probe = (goal) =>
349
+ Number(findNonPb(goal.manager, goal.forms.items, getBounds(goal)) === undefined);
350
+
351
+ const hasQuantifiers: Probe = (goal) =>
352
+ Number(!isNone(goal, (expr) => goal.manager.kinds[expr] === KIND_QUANTIFIER));
353
+
354
+ const hasPatterns: Probe = (goal) => {
355
+ const manager = goal.manager;
356
+ return Number(
357
+ !isNone(
358
+ goal,
359
+ (expr) =>
360
+ manager.kinds[expr] === KIND_QUANTIFIER && manager.getQuantifier(expr).patterns.length > 0,
361
+ ),
362
+ );
363
+ };
364
+
365
+ const mkArithDegreeProbe =
366
+ (isAverage: boolean): Probe =>
367
+ (goal) => {
368
+ const manager = goal.manager;
369
+ let variableCount = 0;
370
+ const expr2poly = new Expr2Polynomial(
371
+ manager,
372
+ new PolynomialManager(manager.limit),
373
+ new Map(),
374
+ () => variableCount++,
375
+ );
376
+ let maxDegree = 0;
377
+ let accDegree = 0;
378
+ let counter = 0;
379
+ const updateDegree = (polynomial: PolynomialRef) => {
380
+ const degree = expr2poly.pm.totalDegree(polynomial.get());
381
+ if (degree > maxDegree) maxDegree = degree;
382
+ accDegree += degree;
383
+ counter++;
384
+ };
385
+ const process = (expr: number) => {
386
+ const first = new PolynomialRef(expr2poly.pm);
387
+ const second = new PolynomialRef(expr2poly.pm);
388
+ expr2poly.toPolynomial(manager.getArg(expr, 0), first);
389
+ expr2poly.toPolynomial(manager.getArg(expr, 1), second);
390
+ updateDegree(first);
391
+ updateDegree(second);
392
+ second.reset();
393
+ first.reset();
394
+ };
395
+ forEachExpr(goal, (expr) => {
396
+ const op = manager.getOp(expr);
397
+ if (op === OP_LE || op === OP_LT || op === OP_GT || op === OP_GE) process(expr);
398
+ if (op === OP_EQ && isArithSort(manager.sorts[manager.getArg(expr, 0)])) process(expr);
399
+ });
400
+ expr2poly.release();
401
+ return isAverage ? (counter === 0 ? 0 : accDegree / counter) : maxDegree;
402
+ };
403
+
404
+ const getBitsize = (value: bigint) => (value < 0n ? -value : value).toString(2).length;
405
+
406
+ const mkArithBwProbe =
407
+ (isAverage: boolean): Probe =>
408
+ (goal) => {
409
+ const manager = goal.manager;
410
+ let maxBitWidth = 0;
411
+ let accBitWidth = 0;
412
+ let counter = 0;
413
+ forEachExpr(goal, (expr) => {
414
+ if (!manager.isNumeral(expr)) return;
415
+ const value = manager.getRationalValue(expr);
416
+ const bitWidth = getBitsize(value.num) + (value.den === 1n ? 0 : getBitsize(value.den));
417
+ if (bitWidth > maxBitWidth) maxBitWidth = bitWidth;
418
+ accBitWidth += bitWidth;
419
+ counter++;
420
+ });
421
+ return isAverage ? (counter === 0 ? 0 : accBitWidth / counter) : maxBitWidth;
422
+ };
423
+
424
+ const NAMED_PROBES = new Map<string, Probe>([
425
+ ["depth", (goal) => goal.depth],
426
+ ["size", (goal) => goal.forms.size],
427
+ ["num-exprs", (goal) => countExprs(goal, () => true)],
428
+ [
429
+ "num-consts",
430
+ (goal) =>
431
+ countExprs(
432
+ goal,
433
+ (expr) => isConst(goal.manager, expr) && goal.manager.sorts[expr] !== SORT_BOOL,
434
+ ),
435
+ ],
436
+ [
437
+ "num-bool-consts",
438
+ (goal) =>
439
+ countExprs(
440
+ goal,
441
+ (expr) => isConst(goal.manager, expr) && goal.manager.sorts[expr] === SORT_BOOL,
442
+ ),
443
+ ],
444
+ [
445
+ "num-arith-consts",
446
+ (goal) =>
447
+ countExprs(
448
+ goal,
449
+ (expr) => isConst(goal.manager, expr) && isArithSort(goal.manager.sorts[expr]),
450
+ ),
451
+ ],
452
+ [
453
+ "num-bv-consts",
454
+ (goal) =>
455
+ countExprs(
456
+ goal,
457
+ (expr) => isConst(goal.manager, expr) && goal.manager.isBvSort(goal.manager.sorts[expr]),
458
+ ),
459
+ ],
460
+ ["produce-proofs", (goal) => Number(goal.isProofsEnabled)],
461
+ ["produce-model", () => 1],
462
+ ["produce-unsat-cores", (goal) => Number(goal.isCoresEnabled)],
463
+ ["has-quantifiers", hasQuantifiers],
464
+ ["has-patterns", hasPatterns],
465
+ ["is-propositional", mkTest(isNonPropositional)],
466
+ ["is-qfbv", mkTest(isNonQfbv)],
467
+ ["is-qfaufbv", mkTest(isNonQfaufbv)],
468
+ ["is-qfbv-eq", mkTest(isNonQfbvEq)],
469
+ ["is-quasi-pb", isQuasiPb],
470
+ ["is-unbounded", isUnbounded],
471
+ ["is-pb", isPb],
472
+ ["is-qflia", mkTest(isNonQflia)],
473
+ ["is-qfauflia", mkTest(mkNonLira(true, false, true))],
474
+ ["is-qflra", mkTest(mkNonLira(false, true, false))],
475
+ ["is-qflira", mkTest(mkNonLira(true, true, false))],
476
+ ["is-ilp", isIlp],
477
+ ["is-qfnia", mkNiraProbe(true, false, false, false)],
478
+ ["is-qfnra", mkNiraProbe(false, true, false, false)],
479
+ ["is-nia", mkNiraProbe(true, false, true, false)],
480
+ ["is-nra", mkNiraProbe(false, true, true, false)],
481
+ ["is-nira", mkNiraProbe(true, true, true, false)],
482
+ ["is-lia", mkNiraProbe(true, false, true, true)],
483
+ ["is-lra", mkNiraProbe(false, true, true, true)],
484
+ ["is-lira", mkNiraProbe(true, true, true, true)],
485
+ ["is-qfufnra", isQfufnra],
486
+ ["is-qffp", mkTest(mkNonQffp(false))],
487
+ ["is-qffpbv", mkTest(mkNonQffp(false))],
488
+ [
489
+ "is-qffplra",
490
+ (goal) =>
491
+ Number(
492
+ !isNone(
493
+ goal,
494
+ (expr) => isApp(goal.manager, expr) && goal.manager.getFamily(expr) === FAMILY_FPA,
495
+ ) && mkTest(mkNonQffp(true))(goal) === 1,
496
+ ),
497
+ ],
498
+ ["ackr-bound-probe", getAckrBound],
499
+ ["arith-max-deg", mkArithDegreeProbe(false)],
500
+ ["arith-avg-deg", mkArithDegreeProbe(true)],
501
+ ["arith-max-bw", mkArithBwProbe(false)],
502
+ ["arith-avg-bw", mkArithBwProbe(true)],
503
+ ]);
504
+
505
+ const UNPORTED_PROBES = new Set(["memory"]);
506
+
507
+ const BINARY_PROBES = new Map<string, (first: number, second: number) => number>([
508
+ ["=", (first, second) => Number(first === second)],
509
+ ["<=", (first, second) => Number(first <= second)],
510
+ [">=", (first, second) => Number(first >= second)],
511
+ ["<", (first, second) => Number(first < second)],
512
+ [">", (first, second) => Number(first > second)],
513
+ ["=>", (first, second) => Number(first === 0 || second !== 0)],
514
+ ["implies", (first, second) => Number(first === 0 || second !== 0)],
515
+ ["-", (first, second) => first - second],
516
+ ["/", (first, second) => first / second],
517
+ ]);
518
+
519
+ const NARY_PROBES = new Map<string, (first: number, second: number) => number>([
520
+ ["and", (first, second) => Number(first !== 0 && second !== 0)],
521
+ ["or", (first, second) => Number(first !== 0 || second !== 0)],
522
+ ["+", (first, second) => first + second],
523
+ ["*", (first, second) => first * second],
524
+ ]);
525
+
526
+ export const compileProbe = (sexpr: SExpr, isInternal = false): Probe => {
527
+ // A decimal is a numeral of the s-expression, which is_int32 rejects unless it is whole.
528
+ if (sexpr.kind === "numeral" || sexpr.kind === "decimal") {
529
+ const [whole, fraction = ""] = sexpr.text.split(".");
530
+ const value = Number(whole);
531
+ if (!/^0*$/.test(fraction) || value > 2 ** 31 - 1)
532
+ throw new SmtParseError(
533
+ "invalid probe, constant is too big to fit in a fixed size integer",
534
+ sexpr,
535
+ );
536
+ return () => value;
537
+ }
538
+ if (sexpr.kind !== "list") {
539
+ if (!isSymbol(sexpr)) throw new SmtParseError("invalid probe, unexpected input", sexpr);
540
+ const named =
541
+ NAMED_PROBES.get(sexpr.text) ?? (isInternal ? INTERNAL_PROBES.get(sexpr.text) : undefined);
542
+ if (named !== undefined) return named;
543
+ if (UNPORTED_PROBES.has(sexpr.text)) throw new SmtUnsupportedError(`the probe ${sexpr.text}`);
544
+ throw new SmtParseError(`invalid probe, unknown builtin probe ${sexpr.text}`, sexpr);
545
+ }
546
+ const head = sexpr.items[0];
547
+ if (head === undefined) throw new SmtParseError("invalid probe, arguments expected", sexpr.end);
548
+ if (!isSymbol(head)) throw new SmtParseError("invalid probe, symbol expected", sexpr.end);
549
+ const children = sexpr.items.slice(1);
550
+ if (head.text === "not") {
551
+ if (children.length !== 1)
552
+ throw new SmtParseError("invalid probe expression, one argument expected", sexpr.end);
553
+ const child = compileProbe(children[0], isInternal);
554
+ return (goal) => Number(child(goal) === 0);
555
+ }
556
+ const binary = BINARY_PROBES.get(head.text);
557
+ if (binary !== undefined) {
558
+ if (children.length !== 2)
559
+ throw new SmtParseError("invalid probe expression, two arguments expected", sexpr.end);
560
+ const first = compileProbe(children[0], isInternal);
561
+ const second = compileProbe(children[1], isInternal);
562
+ return (goal) => binary(first(goal), second(goal));
563
+ }
564
+ const nary = NARY_PROBES.get(head.text);
565
+ if (nary === undefined)
566
+ throw new SmtParseError(`invalid probe, unknown probe expression ${head.text}`, sexpr.end);
567
+ if (children.length === 0)
568
+ throw new SmtParseError("invalid probe, at least one argument expected", sexpr.end);
569
+ const probes = children.map((child) => compileProbe(child, isInternal));
570
+ // Deviation from Z3: MK_NARY_PROBE applies the operator to its first argument twice.
571
+ return (goal) => probes.map((probe) => probe(goal)).reduce(nary);
572
+ };
573
+
574
+ export const formatProbeValue = (value: number) =>
575
+ Number.isInteger(value) && Math.abs(value) < 1e6
576
+ ? String(value)
577
+ : String(Number(value.toPrecision(6)));
@@ -1,10 +1,8 @@
1
- // Ported from Z3 (src/tactic/core/propagate_values_tactic.cpp, src/ast/shared_occs.cpp), MIT license, see z3-license.txt.
2
1
  import { KIND_APP, KIND_QUANTIFIER, OP_EQ, type AstManager } from "./ast";
3
- import type { Goal } from "./goal";
2
+ import { type Dependency, type Goal, joinDependencies } from "./goal";
4
3
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
5
4
 
6
- const MAX_ROUNDS = 4;
7
-
5
+ // Quantifier bodies are included and patterns excluded.
8
6
  const getSharedOccs = (manager: AstManager, forms: number[]) => {
9
7
  const visited = new Set<number>();
10
8
  const shared = new Set<number>();
@@ -21,11 +19,26 @@ const getSharedOccs = (manager: AstManager, forms: number[]) => {
21
19
  return shared;
22
20
  };
23
21
 
24
- export const propagateValues = (manager: AstManager, goal: Goal) => {
22
+ export const propagateValues = (manager: AstManager, goal: Goal, maxRounds = 4) => {
23
+ goal.depth++;
25
24
  if (goal.isInconsistent) return;
25
+ if (goal.isProofsEnabled) {
26
+ goal.elimRedundancies();
27
+ return;
28
+ }
26
29
  const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
27
30
  const substitution = new Map<number, number>();
28
- rewriter.setSubstitution(substitution);
31
+ const dependencies = new Map<number, Dependency | undefined>();
32
+ rewriter.setSubstitution(substitution, dependencies);
33
+ const insert = (expr: number, value: number, dependency: Dependency | undefined) => {
34
+ substitution.set(expr, value);
35
+ dependencies.set(expr, dependency);
36
+ };
37
+ const clear = () => {
38
+ substitution.clear();
39
+ dependencies.clear();
40
+ rewriter.setSubstitution(substitution, dependencies);
41
+ };
29
42
  let occs = getSharedOccs(manager, goal.forms.items);
30
43
  let isModified = false;
31
44
  const process = (index: number) => {
@@ -33,40 +46,43 @@ export const propagateValues = (manager: AstManager, goal: Goal) => {
33
46
  const isRewriting = substitution.size !== 0;
34
47
  const rewritten = isRewriting ? rewriter.rewrite(current) : current;
35
48
  if (rewritten !== current) isModified = true;
36
- goal.update(index, rewritten);
49
+ const used = goal.isCoresEnabled ? rewriter.usedDependencies : undefined;
50
+ const dependency = joinDependencies(goal.getDependency(index), used);
51
+ // Forgetting the used dependencies drops the cache, whose results would hide them next time.
52
+ if (used !== undefined) {
53
+ rewriter.usedDependencies = undefined;
54
+ rewriter.setSubstitution(substitution, dependencies);
55
+ }
56
+ goal.update(index, rewritten, dependency);
37
57
  if (isRewriting) manager.decRef(rewritten);
38
- if (occs.has(rewritten)) substitution.set(rewritten, manager.trueExpr);
58
+ if (occs.has(rewritten)) insert(rewritten, manager.trueExpr, dependency);
39
59
  if (manager.isNot(rewritten) && occs.has(manager.getArg(rewritten, 0)))
40
- substitution.set(manager.getArg(rewritten, 0), manager.falseExpr);
60
+ insert(manager.getArg(rewritten, 0), manager.falseExpr, dependency);
41
61
  if (manager.getOp(rewritten) !== OP_EQ) return;
42
- if (
43
- manager.isUniqueValue(manager.getArg(rewritten, 0)) &&
44
- occs.has(manager.getArg(rewritten, 1))
45
- )
46
- substitution.set(manager.getArg(rewritten, 1), manager.getArg(rewritten, 0));
62
+ if (manager.isValue(manager.getArg(rewritten, 0)) && occs.has(manager.getArg(rewritten, 1)))
63
+ insert(manager.getArg(rewritten, 1), manager.getArg(rewritten, 0), dependency);
47
64
  else if (
48
- manager.isUniqueValue(manager.getArg(rewritten, 1)) &&
65
+ manager.isValue(manager.getArg(rewritten, 1)) &&
49
66
  occs.has(manager.getArg(rewritten, 0))
50
67
  )
51
- substitution.set(manager.getArg(rewritten, 0), manager.getArg(rewritten, 1));
68
+ insert(manager.getArg(rewritten, 0), manager.getArg(rewritten, 1), dependency);
52
69
  };
53
- for (let round = 0; round < MAX_ROUNDS; round += 2) {
70
+ for (let round = 0; round < maxRounds; round += 2) {
54
71
  const size = goal.forms.size;
55
72
  for (let index = 0; index < size; index++) {
56
73
  process(index);
57
74
  if (goal.isInconsistent) return;
58
75
  }
59
76
  if (substitution.size === 0 && !isModified) break;
77
+ if (round + 1 >= maxRounds) break;
60
78
  occs = getSharedOccs(manager, goal.forms.items);
61
- substitution.clear();
62
- rewriter.setSubstitution(substitution);
79
+ clear();
63
80
  for (let index = goal.forms.size - 1; index >= 0; index--) {
64
81
  process(index);
65
82
  if (goal.isInconsistent) return;
66
83
  }
67
84
  if (!isModified) break;
68
- substitution.clear();
69
- rewriter.setSubstitution(substitution);
85
+ clear();
70
86
  isModified = false;
71
87
  occs = getSharedOccs(manager, goal.forms.items);
72
88
  }