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,24 @@
1
+ import type { Context } from "./context";
2
+ import { Theory } from "./theory";
3
+
4
+ export class TheoryWithoutTerms extends Theory {
5
+ constructor(
6
+ context: Context,
7
+ id: number,
8
+ readonly name: string,
9
+ ) {
10
+ super(context, id);
11
+ }
12
+
13
+ internalizeAtom() {
14
+ return false;
15
+ }
16
+
17
+ internalizeTerm() {
18
+ return false;
19
+ }
20
+
21
+ newEqEh() {}
22
+
23
+ newDiseqEh() {}
24
+ }
@@ -0,0 +1,189 @@
1
+ import { shrink } from "./array";
2
+ import { type AstManager, OP_ITE } from "./ast";
3
+ import type { Context } from "./context";
4
+ import type { Enode } from "./enode";
5
+ import { type BoolVar, FALSE_LITERAL, type Literal, negate, TRUE_LITERAL } from "./literal";
6
+ import type { ProtoModel } from "./proto-model";
7
+ import { L_UNDEF } from "./lbool";
8
+
9
+ export const FC_DONE = 0;
10
+ export const FC_CONTINUE = 1;
11
+ export const FC_GIVEUP = 2;
12
+
13
+ export interface ExtraFreshValue {
14
+ sort: number;
15
+ value: number | undefined;
16
+ }
17
+
18
+ export interface DependentValue {
19
+ dependencies: (Enode | ExtraFreshValue)[];
20
+ mkValue: (values: number[]) => number;
21
+ }
22
+
23
+ export abstract class Theory {
24
+ abstract readonly name: string;
25
+ protected varEnodes: Enode[] = [];
26
+ private varEnodeLimits: number[] = [];
27
+
28
+ constructor(
29
+ protected context: Context,
30
+ readonly id: number,
31
+ ) {}
32
+
33
+ protected get manager(): AstManager {
34
+ return this.context.manager;
35
+ }
36
+
37
+ getEnode(thVar: number) {
38
+ return this.varEnodes[thVar];
39
+ }
40
+
41
+ protected getExpr(thVar: number) {
42
+ return this.varEnodes[thVar].owner;
43
+ }
44
+
45
+ getNumVars() {
46
+ return this.varEnodes.length;
47
+ }
48
+
49
+ // The variable of the node itself, not one an equality moved to its list.
50
+ isAttachedToVar(node: Enode) {
51
+ const thVar = node.getThVar(this.id);
52
+ return thVar >= 0 && this.varEnodes[thVar] === node;
53
+ }
54
+
55
+ getThVar(node: Enode) {
56
+ return node.getThVar(this.id);
57
+ }
58
+
59
+ init() {}
60
+
61
+ protected mkEqLiteral(first: number, second: number, isGateContext: boolean): Literal {
62
+ if (first === second) return TRUE_LITERAL;
63
+ if (this.manager.areDistinct(first, second)) return FALSE_LITERAL;
64
+ const eq = this.context.mkEqAtom(first, second);
65
+ this.context.internalize(eq, isGateContext);
66
+ return this.context.getLiteral(eq);
67
+ }
68
+
69
+ protected mkLiteralOf(input: number): Literal {
70
+ const manager = this.manager;
71
+ const isNot = manager.isNot(input);
72
+ const expr = isNot ? manager.getArg(input, 0) : input;
73
+ if (!this.context.isEInternalized(expr)) this.context.internalize(expr, false);
74
+ const literal = this.context.getLiteral(expr);
75
+ this.context.markLiteralAsRelevant(literal);
76
+ return isNot ? negate(literal) : literal;
77
+ }
78
+
79
+ protected ensureEnodeOf(expr: number): Enode {
80
+ const context = this.context;
81
+ if (!context.isEInternalized(expr)) context.internalize(expr, false);
82
+ if (!this.manager.isBool(expr)) context.internalizeTerm(expr);
83
+ const node = context.getEnode(expr)!;
84
+ context.markAsRelevant(expr);
85
+ return node;
86
+ }
87
+
88
+ protected getIteValue(expr: number) {
89
+ const context = this.context;
90
+ const manager = this.manager;
91
+ let current = expr;
92
+ while (manager.getOp(current) === OP_ITE && context.isEInternalized(current)) {
93
+ const root = context.getEnode(current)?.root;
94
+ const thenExpr = manager.getArg(current, 1);
95
+ const elseExpr = manager.getArg(current, 2);
96
+ if (context.getEnode(thenExpr)?.root === root) current = thenExpr;
97
+ else if (context.getEnode(elseExpr)?.root === root) current = elseExpr;
98
+ else break;
99
+ }
100
+ return current;
101
+ }
102
+
103
+ abstract internalizeAtom(atom: number, isGateContext: boolean): boolean;
104
+
105
+ abstract internalizeTerm(term: number): boolean;
106
+
107
+ internalizeEqEh(_eq: number, _boolVar: BoolVar) {}
108
+
109
+ applySortCnstr(_node: Enode, _sort: number) {}
110
+
111
+ assignEh(_boolVar: BoolVar, _isTrue: boolean) {}
112
+
113
+ abstract newEqEh(first: number, second: number): void;
114
+
115
+ useDiseqs() {
116
+ return true;
117
+ }
118
+
119
+ abstract newDiseqEh(first: number, second: number): void;
120
+
121
+ relevantEh(_expr: number) {}
122
+
123
+ pushScopeEh() {
124
+ this.varEnodeLimits.push(this.varEnodes.length);
125
+ }
126
+
127
+ protected getOldNumVars(numScopes: number) {
128
+ return this.varEnodeLimits[this.varEnodeLimits.length - numScopes];
129
+ }
130
+
131
+ popScopeEh(numScopes: number) {
132
+ const newLevel = this.varEnodeLimits.length - numScopes;
133
+ shrink(this.varEnodes, this.varEnodeLimits[newLevel]);
134
+ shrink(this.varEnodeLimits, newLevel);
135
+ }
136
+
137
+ restartEh() {}
138
+
139
+ getPhase(_boolVar: BoolVar) {
140
+ return L_UNDEF;
141
+ }
142
+
143
+ initSearchEh() {}
144
+
145
+ finalCheckEh(_level: number) {
146
+ return FC_DONE;
147
+ }
148
+
149
+ numFinalCheckLevels() {
150
+ return 1;
151
+ }
152
+
153
+ isShared(_thVar: number) {
154
+ return false;
155
+ }
156
+
157
+ isBetaRedex(_parent: Enode, _node: Enode) {
158
+ return false;
159
+ }
160
+
161
+ canPropagate() {
162
+ return false;
163
+ }
164
+
165
+ propagate() {}
166
+
167
+ buildModels() {
168
+ return true;
169
+ }
170
+
171
+ initModel(_model: ProtoModel) {}
172
+
173
+ finalizeModel() {}
174
+
175
+ addTheoryAssumptions(_assumptions: number[]) {}
176
+
177
+ shouldResearch(_unsatCore: readonly number[]) {
178
+ return false;
179
+ }
180
+
181
+ // undefined stands for a fresh value of the sort.
182
+ mkValue(_node: Enode): number | DependentValue | undefined {
183
+ return undefined;
184
+ }
185
+
186
+ includeFuncInterp(_decl: number) {
187
+ return false;
188
+ }
189
+ }
@@ -0,0 +1,495 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_BASIC,
5
+ KIND_APP,
6
+ KIND_QUANTIFIER,
7
+ OP_AND,
8
+ OP_DISTINCT,
9
+ OP_EQ,
10
+ OP_IMPLIES,
11
+ OP_ITE,
12
+ OP_NOT,
13
+ OP_OR,
14
+ OP_XOR,
15
+ SORT_BOOL,
16
+ } from "./ast";
17
+ import type { Dependency, Goal } from "./goal";
18
+ import { RefVector } from "./ref-vector";
19
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
20
+
21
+ const NO = 0;
22
+ const CONT = 1;
23
+ const DONE = 2;
24
+ const DISTRIBUTIVITY_BLOWUP = 32;
25
+
26
+ interface Frame {
27
+ expr: number;
28
+ isFirst: boolean;
29
+ }
30
+
31
+ const getSharedApps = (manager: AstManager, forms: readonly number[]) => {
32
+ const visited = new Set<number>();
33
+ const shared = new Set<number>();
34
+ const todo = [...forms];
35
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
36
+ const kind = manager.kinds[expr];
37
+ if (kind !== KIND_QUANTIFIER && (kind !== KIND_APP || manager.getNumArgs(expr) === 0)) continue;
38
+ if (visited.has(expr)) {
39
+ shared.add(expr);
40
+ continue;
41
+ }
42
+ visited.add(expr);
43
+ if (kind === KIND_APP) manager.pushArgs(expr, todo);
44
+ }
45
+ return shared;
46
+ };
47
+
48
+ const getOrderedById = (manager: AstManager, first: number, second: number) =>
49
+ manager.ids[first] > manager.ids[second] ? [second, first] : [first, second];
50
+
51
+ const getProductNext = (sizes: readonly number[], iterator: number[]) => {
52
+ for (let index = 0; index < sizes.length; index++) {
53
+ iterator[index]++;
54
+ if (iterator[index] < sizes[index]) return true;
55
+ iterator[index] = 0;
56
+ }
57
+ return false;
58
+ };
59
+
60
+ export const tseitinCnf = (manager: AstManager, goal: Goal) => {
61
+ if (goal.isProofsEnabled) throw new SmtTacticError("tseitin-cnf does not support proofs");
62
+ const shared = getSharedApps(manager, goal.forms.items);
63
+ const rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isFlatAndOr: false });
64
+ const pinned = new RefVector(manager);
65
+ const clauses = new RefVector(manager);
66
+ const clauseDependencies: (Dependency | undefined)[] = [];
67
+ let dependency: Dependency | undefined;
68
+ const cache = new Map<number, number>();
69
+ const freshDecls: number[] = [];
70
+ const frames: Frame[] = [];
71
+ const pin = (expr: number) => {
72
+ pinned.push(expr);
73
+ return expr;
74
+ };
75
+
76
+ const isShared = (expr: number) => shared.has(expr);
77
+ const isOp = (expr: number, op: number) =>
78
+ manager.kinds[expr] === KIND_APP && manager.getOp(expr) === op;
79
+ const isOrOf = (expr: number, count: number) =>
80
+ isOp(expr, OP_OR) && manager.getNumArgs(expr) === count;
81
+ const isIff = (expr: number) =>
82
+ isOp(expr, OP_EQ) && manager.sorts[manager.getArg(expr, 0)] === SORT_BOOL;
83
+
84
+ const inv = (expr: number) => {
85
+ if (manager.isTrue(expr)) return manager.falseExpr;
86
+ if (manager.isFalse(expr)) return manager.trueExpr;
87
+ if (manager.isNot(expr)) return manager.getArg(expr, 0);
88
+ return pin(manager.mkNot(expr));
89
+ };
90
+
91
+ const mkLit = (expr: number, isNeg: boolean) => (isNeg ? pin(manager.mkNot(expr)) : expr);
92
+
93
+ const getLit = (form: number, isNegated: boolean): number => {
94
+ let expr = form;
95
+ let isNeg = isNegated;
96
+ while (true) {
97
+ if (manager.kinds[expr] !== KIND_APP || manager.getNumArgs(expr) === 0)
98
+ return mkLit(expr, isNeg);
99
+ if (manager.getFamily(expr) !== FAMILY_BASIC) return mkLit(expr, isNeg);
100
+ const op = manager.getOp(expr);
101
+ if (op === OP_NOT) {
102
+ expr = manager.getArg(expr, 0);
103
+ isNeg = !isNeg;
104
+ continue;
105
+ }
106
+ if (op === OP_OR) return mkLit(cache.get(expr)!, isNeg);
107
+ if ((op === OP_ITE || op === OP_EQ) && manager.sorts[manager.getArg(expr, 1)] === SORT_BOOL)
108
+ return mkLit(cache.get(expr)!, isNeg);
109
+ return mkLit(expr, isNeg);
110
+ }
111
+ };
112
+
113
+ const visit = (form: number, isRoot = false) => {
114
+ let expr = form;
115
+ while (true) {
116
+ if (manager.kinds[expr] !== KIND_APP || cache.has(expr) || manager.getNumArgs(expr) === 0)
117
+ return true;
118
+ if (manager.getFamily(expr) !== FAMILY_BASIC) return true;
119
+ switch (manager.getOp(expr)) {
120
+ case OP_NOT:
121
+ if (isRoot) {
122
+ frames.push({ expr, isFirst: true });
123
+ return false;
124
+ }
125
+ expr = manager.getArg(expr, 0);
126
+ continue;
127
+ case OP_OR:
128
+ frames.push({ expr, isFirst: true });
129
+ return false;
130
+ case OP_ITE:
131
+ case OP_EQ:
132
+ if (manager.sorts[manager.getArg(expr, 1)] !== SORT_BOOL) return true;
133
+ frames.push({ expr, isFirst: true });
134
+ return false;
135
+ case OP_XOR:
136
+ case OP_IMPLIES:
137
+ case OP_DISTINCT:
138
+ case OP_AND:
139
+ throw new SmtTacticError(
140
+ "operator not supported, apply simplifier before invoking this strategy",
141
+ );
142
+ default:
143
+ return true;
144
+ }
145
+ }
146
+ };
147
+
148
+ const visitAll = (exprs: readonly number[]) =>
149
+ exprs.reduce((isVisited, expr) => visit(expr) && isVisited, true);
150
+
151
+ const mkClause = (literals: number[]) => {
152
+ clauses.push(pin(rewriter.mkOr(literals)));
153
+ if (goal.isCoresEnabled) clauseDependencies.push(dependency);
154
+ };
155
+
156
+ const mkFresh = () => {
157
+ const fresh = manager.mkFreshConst(null, SORT_BOOL);
158
+ freshDecls.push(manager.decls[fresh]);
159
+ return pin(fresh);
160
+ };
161
+
162
+ const cacheResult = (expr: number, literal: number) => {
163
+ pinned.push(expr);
164
+ cache.set(expr, literal);
165
+ };
166
+
167
+ const getOr3And = (expr: number) => {
168
+ if (!isOrOf(expr, 3)) return null;
169
+ const ors: number[][] = [];
170
+ for (const arg of manager.getArgs(expr)) {
171
+ if (!manager.isNot(arg)) return null;
172
+ const inner = manager.getArg(arg, 0);
173
+ if (isShared(inner) || !isOrOf(inner, 2)) return null;
174
+ ors.push(getOrderedById(manager, manager.getArg(inner, 0), manager.getArg(inner, 1)));
175
+ }
176
+ const [[a1, a2], [b1, b2], [c1, c2]] = ors;
177
+ if (
178
+ (a1 === b1 && a2 === c1 && b2 === c2) ||
179
+ (a1 === b1 && a2 === c2 && b2 === c1) ||
180
+ (a1 === c1 && a2 === b1 && b2 === c2)
181
+ )
182
+ return [a1, a2, b2];
183
+ if (
184
+ (a1 === b2 && a2 === c2 && b1 === c1) ||
185
+ (a1 === c1 && a2 === b2 && b1 === c2) ||
186
+ (a1 === c2 && a2 === b2 && b1 === c1)
187
+ )
188
+ return [a1, a2, b1];
189
+ return null;
190
+ };
191
+
192
+ const getIff3 = (expr: number) => {
193
+ if (!isIff(expr)) return null;
194
+ const left = manager.getArg(expr, 0);
195
+ const right = manager.getArg(expr, 1);
196
+ if (!isShared(left) && isIff(left))
197
+ return [manager.getArg(left, 0), manager.getArg(left, 1), right];
198
+ if (!isShared(right) && isIff(right))
199
+ return [left, manager.getArg(right, 0), manager.getArg(right, 1)];
200
+ return null;
201
+ };
202
+
203
+ const matchOr3And = (expr: number, isFirst: boolean, isRoot: boolean) => {
204
+ const args = getOr3And(expr);
205
+ if (args === null) return NO;
206
+ if (isFirst && !visitAll(args)) return CONT;
207
+ const [nla, nlb, nlc] = args.map((arg) => getLit(arg, true));
208
+ if (isRoot) {
209
+ mkClause([nla, nlb]);
210
+ mkClause([nla, nlc]);
211
+ mkClause([nlb, nlc]);
212
+ return DONE;
213
+ }
214
+ const k = mkFresh();
215
+ const nk = pin(manager.mkNot(k));
216
+ mkClause([nk, nla, nlb]);
217
+ mkClause([nk, nla, nlc]);
218
+ mkClause([nk, nlb, nlc]);
219
+ const [la, lb, lc] = [nla, nlb, nlc].map(inv);
220
+ mkClause([k, la, lb]);
221
+ mkClause([k, la, lc]);
222
+ mkClause([k, lb, lc]);
223
+ cacheResult(expr, k);
224
+ return DONE;
225
+ };
226
+
227
+ const matchIff3 = (expr: number, isFirst: boolean, isRoot: boolean) => {
228
+ const args = getIff3(expr);
229
+ if (args === null) return NO;
230
+ if (isFirst && !visitAll(args)) return CONT;
231
+ const [la, lb, lc] = args.map((arg) => getLit(arg, false));
232
+ const [nla, nlb, nlc] = [la, lb, lc].map(inv);
233
+ if (isRoot) {
234
+ mkClause([la, lb, lc]);
235
+ mkClause([la, nlb, nlc]);
236
+ mkClause([nla, lb, nlc]);
237
+ mkClause([nla, nlb, lc]);
238
+ return DONE;
239
+ }
240
+ const k = mkFresh();
241
+ const nk = pin(manager.mkNot(k));
242
+ mkClause([nk, la, lb, lc]);
243
+ mkClause([nk, la, nlb, nlc]);
244
+ mkClause([nk, nla, lb, nlc]);
245
+ mkClause([nk, nla, nlb, lc]);
246
+ mkClause([k, nla, nlb, nlc]);
247
+ mkClause([k, nla, lb, lc]);
248
+ mkClause([k, la, nlb, lc]);
249
+ mkClause([k, la, lb, nlc]);
250
+ cacheResult(expr, k);
251
+ return DONE;
252
+ };
253
+
254
+ const matchIff = (expr: number, isFirst: boolean, isRoot: boolean) => {
255
+ if (!isIff(expr)) return NO;
256
+ const args = manager.getArgs(expr);
257
+ if (isFirst && !visitAll(args)) return CONT;
258
+ const [la, lb] = args.map((arg) => getLit(arg, false));
259
+ const nla = inv(la);
260
+ const nlb = inv(lb);
261
+ if (isRoot) {
262
+ mkClause([la, nlb]);
263
+ mkClause([nla, lb]);
264
+ return DONE;
265
+ }
266
+ const k = mkFresh();
267
+ const nk = pin(manager.mkNot(k));
268
+ mkClause([nk, la, nlb]);
269
+ mkClause([nk, nla, lb]);
270
+ mkClause([k, nla, nlb]);
271
+ mkClause([k, la, lb]);
272
+ cacheResult(expr, k);
273
+ return DONE;
274
+ };
275
+
276
+ const getIteChainStep = (ite: number) => {
277
+ const thenExpr = manager.getArg(ite, 1);
278
+ const elseExpr = manager.getArg(ite, 2);
279
+ if (isOp(thenExpr, OP_ITE) && !isShared(thenExpr)) return { next: thenExpr, isThen: true };
280
+ if (isOp(elseExpr, OP_ITE) && !isShared(elseExpr)) return { next: elseExpr, isThen: false };
281
+ return null;
282
+ };
283
+
284
+ const matchIte = (expr: number, isFirst: boolean, isRoot: boolean) => {
285
+ if (!isOp(expr, OP_ITE)) return NO;
286
+ if (isFirst) {
287
+ let isVisited = true;
288
+ let ite = expr;
289
+ while (true) {
290
+ isVisited = visit(manager.getArg(ite, 0)) && isVisited;
291
+ const step = getIteChainStep(ite);
292
+ if (step === null) {
293
+ isVisited = visit(manager.getArg(ite, 1)) && isVisited;
294
+ isVisited = visit(manager.getArg(ite, 2)) && isVisited;
295
+ break;
296
+ }
297
+ isVisited = visit(manager.getArg(ite, step.isThen ? 2 : 1)) && isVisited;
298
+ ite = step.next;
299
+ }
300
+ if (!isVisited) return CONT;
301
+ }
302
+ const context: number[] = [];
303
+ const exNegContext: number[] = [];
304
+ const exPosContext: number[] = [];
305
+ const k = isRoot ? -1 : mkFresh();
306
+ const nk = isRoot ? -1 : pin(manager.mkNot(k));
307
+ if (!isRoot) cacheResult(expr, k);
308
+ const mkIteClause = (literals: number[]) => mkClause([...context, ...literals]);
309
+ let ite = expr;
310
+ while (true) {
311
+ const la = getLit(manager.getArg(ite, 0), false);
312
+ const nla = inv(la);
313
+ const step = getIteChainStep(ite);
314
+ if (step !== null) {
315
+ const other = getLit(manager.getArg(ite, step.isThen ? 2 : 1), false);
316
+ const guard = step.isThen ? la : nla;
317
+ if (isRoot) mkIteClause([guard, other]);
318
+ else {
319
+ const nother = inv(other);
320
+ mkIteClause([guard, other, nk]);
321
+ mkIteClause([guard, nother, k]);
322
+ exNegContext.push(other);
323
+ exPosContext.push(nother);
324
+ }
325
+ context.push(step.isThen ? nla : la);
326
+ ite = step.next;
327
+ continue;
328
+ }
329
+ const lb = getLit(manager.getArg(ite, 1), false);
330
+ const lc = getLit(manager.getArg(ite, 2), false);
331
+ if (isRoot) {
332
+ mkIteClause([nla, lb]);
333
+ mkIteClause([la, lc]);
334
+ break;
335
+ }
336
+ const nlb = inv(lb);
337
+ const nlc = inv(lc);
338
+ mkIteClause([nla, lb, nk]);
339
+ mkIteClause([la, lc, nk]);
340
+ mkIteClause([nla, nlb, k]);
341
+ mkIteClause([la, nlc, k]);
342
+ mkIteClause([lb, lc, nk]);
343
+ mkIteClause([nlb, nlc, k]);
344
+ mkClause([...exNegContext, lb, lc, nk]);
345
+ mkClause([...exPosContext, nlb, nlc, k]);
346
+ break;
347
+ }
348
+ return DONE;
349
+ };
350
+
351
+ const matchAnd = (expr: number, isFirst: boolean, isRoot: boolean) => {
352
+ if (!isOp(expr, OP_AND)) return NO;
353
+ const args = manager.getArgs(expr);
354
+ if (isFirst && !visitAll(args)) return CONT;
355
+ if (isRoot) {
356
+ for (const arg of args) mkClause([getLit(arg, false)]);
357
+ return DONE;
358
+ }
359
+ const k = mkFresh();
360
+ const nk = pin(manager.mkNot(k));
361
+ cacheResult(expr, k);
362
+ const literals: number[] = [];
363
+ for (const arg of args) {
364
+ const literal = getLit(arg, false);
365
+ mkClause([nk, literal]);
366
+ literals.push(inv(literal));
367
+ }
368
+ mkClause([...literals, k]);
369
+ return DONE;
370
+ };
371
+
372
+ const getDistributed = (arg: number) => {
373
+ if (!manager.isNot(arg)) return null;
374
+ const inner = manager.getArg(arg, 0);
375
+ return isOp(inner, OP_OR) && !isShared(inner) ? inner : null;
376
+ };
377
+
378
+ const matchOr = (expr: number, isFirst: boolean, isRoot: boolean) => {
379
+ if (!isOp(expr, OP_OR)) return NO;
380
+ const args = manager.getArgs(expr);
381
+ const isExpanding = (count: number, blowup: number) =>
382
+ count < DISTRIBUTIVITY_BLOWUP &&
383
+ blowup * count < DISTRIBUTIVITY_BLOWUP &&
384
+ blowup < blowup * count;
385
+ if (isFirst) {
386
+ let isVisited = true;
387
+ let blowup = 1;
388
+ for (const arg of args) {
389
+ const inner = getDistributed(arg);
390
+ if (inner !== null && isExpanding(manager.getNumArgs(inner), blowup)) {
391
+ blowup *= manager.getNumArgs(inner);
392
+ isVisited = visitAll(manager.getArgs(inner)) && isVisited;
393
+ continue;
394
+ }
395
+ isVisited = visit(arg) && isVisited;
396
+ }
397
+ if (!isVisited) return CONT;
398
+ }
399
+ const k = isRoot ? -1 : mkFresh();
400
+ const nk = isRoot ? -1 : pin(manager.mkNot(k));
401
+ if (!isRoot) cacheResult(expr, k);
402
+ const isDistributing = args.some((arg) => {
403
+ const inner = getDistributed(arg);
404
+ return inner !== null && manager.getNumArgs(inner) < DISTRIBUTIVITY_BLOWUP;
405
+ });
406
+ if (!isDistributing) {
407
+ const literals = args.map((arg) => getLit(arg, false));
408
+ if (isRoot) mkClause(literals);
409
+ else {
410
+ for (const literal of literals) mkClause([inv(literal), k]);
411
+ mkClause([...literals, nk]);
412
+ }
413
+ return DONE;
414
+ }
415
+ const groups: number[][] = [];
416
+ let blowup = 1;
417
+ for (const arg of args) {
418
+ const inner = getDistributed(arg);
419
+ if (inner !== null && isExpanding(manager.getNumArgs(inner), blowup)) {
420
+ blowup *= manager.getNumArgs(inner);
421
+ const negated = manager.getArgs(inner).map((innerArg) => getLit(innerArg, true));
422
+ if (!isRoot) mkClause([...negated.map(inv), k]);
423
+ groups.push(negated);
424
+ continue;
425
+ }
426
+ const literal = getLit(arg, false);
427
+ if (!isRoot) mkClause([inv(literal), k]);
428
+ groups.push([literal]);
429
+ }
430
+ const sizes = groups.map((group) => group.length);
431
+ const iterator = sizes.map(() => 0);
432
+ do {
433
+ const literals = groups.map((group, index) => group[iterator[index]]);
434
+ mkClause(isRoot ? literals : [...literals, nk]);
435
+ } while (getProductNext(sizes, iterator));
436
+ return DONE;
437
+ };
438
+
439
+ const matchNot = (expr: number, isFirst: boolean, isRoot: boolean) => {
440
+ if (!manager.isNot(expr)) return NO;
441
+ const arg = manager.getArg(expr, 0);
442
+ if (isFirst && !visit(arg)) return CONT;
443
+ const nla = getLit(arg, true);
444
+ if (isRoot) mkClause([nla]);
445
+ return DONE;
446
+ };
447
+
448
+ const matchers = [matchOr3And, matchOr, matchAnd, matchIff3, matchIff, matchIte, matchNot];
449
+
450
+ const process = (root: number) => {
451
+ if (visit(root, true)) {
452
+ mkClause([getLit(root, false)]);
453
+ return;
454
+ }
455
+ while (frames.length > 0) {
456
+ manager.limit.checkpoint();
457
+ const frame = frames[frames.length - 1];
458
+ const isFirst = frame.isFirst;
459
+ frame.isFirst = false;
460
+ for (const match of matchers) {
461
+ const result = match(frame.expr, isFirst, frame.expr === root);
462
+ if (result === CONT) break;
463
+ if (result === DONE) {
464
+ frames.pop();
465
+ break;
466
+ }
467
+ }
468
+ }
469
+ };
470
+
471
+ try {
472
+ for (let index = 0; index < goal.forms.size; index++) {
473
+ dependency = goal.getDependency(index);
474
+ process(goal.forms.items[index]);
475
+ }
476
+ } catch (error) {
477
+ pinned.reset();
478
+ clauses.reset();
479
+ rewriter.release();
480
+ throw error;
481
+ }
482
+ goal.reset();
483
+ const added = new Set<number>();
484
+ for (let index = 0; index < clauses.size; index++) {
485
+ const clause = clauses.items[index];
486
+ if (added.has(clause)) continue;
487
+ added.add(clause);
488
+ goal.assert(clause, clauseDependencies[index]);
489
+ }
490
+ for (const decl of freshDecls) goal.addConverter(decl);
491
+ goal.depth++;
492
+ clauses.reset();
493
+ pinned.reset();
494
+ rewriter.release();
495
+ };