tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.4a2a53c48

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 (570) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +3 -10
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/java-hash.ts +7 -0
  48. package/src/json.ts +4 -7
  49. package/src/levels.ts +39 -42
  50. package/src/lexer.ts +5 -3
  51. package/src/liveness-checker.ts +553 -237
  52. package/src/liveness.ts +94 -86
  53. package/src/obligations/action.ts +14 -17
  54. package/src/obligations/anonymize.ts +37 -16
  55. package/src/obligations/enabled-axioms.ts +218 -0
  56. package/src/obligations/equality.ts +1 -3
  57. package/src/obligations/expression.ts +36 -8
  58. package/src/obligations/format.ts +0 -2
  59. package/src/obligations/generate.ts +66 -54
  60. package/src/obligations/index.ts +38 -8
  61. package/src/obligations/levels.ts +24 -11
  62. package/src/obligations/module.ts +28 -41
  63. package/src/obligations/normalize.ts +26 -14
  64. package/src/obligations/operators.ts +0 -2
  65. package/src/obligations/pragma.ts +53 -16
  66. package/src/obligations/printer.ts +43 -13
  67. package/src/obligations/proof.ts +3 -2
  68. package/src/obligations/regroup.ts +0 -2
  69. package/src/obligations/simplify.ts +55 -50
  70. package/src/obligations/source.ts +118 -74
  71. package/src/obligations/subexpression.ts +45 -18
  72. package/src/obligations/substitution.ts +1 -3
  73. package/src/obligations/temporal.ts +5 -7
  74. package/src/obligations/tuples.ts +0 -2
  75. package/src/parallel-worker.ts +10 -30
  76. package/src/parallel.ts +24 -47
  77. package/src/parser.ts +580 -180
  78. package/src/pretty-print.ts +1 -1
  79. package/src/prover/decide-pool.ts +3 -3
  80. package/src/prover/deciders.ts +12 -9
  81. package/src/prover/isabelle/decide.ts +3 -25
  82. package/src/prover/isabelle/encode.ts +72 -42
  83. package/src/prover/isabelle/isar/attrib.ts +250 -0
  84. package/src/prover/isabelle/isar/context.ts +335 -0
  85. package/src/prover/isabelle/isar/induct.ts +382 -0
  86. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  87. package/src/prover/isabelle/isar/method.ts +509 -212
  88. package/src/prover/isabelle/isar/proof.ts +570 -14
  89. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  90. package/src/prover/isabelle/isar/theory.ts +487 -76
  91. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  92. package/src/prover/isabelle/isar/type-check.ts +89 -14
  93. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  94. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  99. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  100. package/src/prover/isabelle/provers/classical.ts +45 -20
  101. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  102. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  103. package/src/prover/isabelle/pure/consts.ts +0 -2
  104. package/src/prover/isabelle/pure/conv.ts +2 -10
  105. package/src/prover/isabelle/pure/drule.ts +72 -6
  106. package/src/prover/isabelle/pure/envir.ts +0 -2
  107. package/src/prover/isabelle/pure/goal.ts +1 -3
  108. package/src/prover/isabelle/pure/logic.ts +1 -3
  109. package/src/prover/isabelle/pure/name.ts +0 -2
  110. package/src/prover/isabelle/pure/net.ts +0 -2
  111. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  112. package/src/prover/isabelle/pure/pattern.ts +0 -2
  113. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  114. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  115. package/src/prover/isabelle/pure/search.ts +0 -2
  116. package/src/prover/isabelle/pure/seq.ts +0 -2
  117. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  118. package/src/prover/isabelle/pure/table.ts +2 -3
  119. package/src/prover/isabelle/pure/tactic.ts +0 -2
  120. package/src/prover/isabelle/pure/tactical.ts +42 -37
  121. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  122. package/src/prover/isabelle/pure/term.ts +0 -2
  123. package/src/prover/isabelle/pure/thm.ts +14 -13
  124. package/src/prover/isabelle/pure/type.ts +0 -2
  125. package/src/prover/isabelle/pure/unify.ts +0 -2
  126. package/src/prover/isabelle/pure/variable.ts +0 -2
  127. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  128. package/src/prover/isabelle/tla/context.ts +58 -11
  129. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  130. package/src/prover/isabelle/tla/logic.ts +49 -21
  131. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  132. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  133. package/src/prover/ocaml.ts +4 -1
  134. package/src/prover/prep/action.ts +30 -31
  135. package/src/prover/prep/enabled-axioms.ts +11 -2
  136. package/src/prover/prep/fingerprint.ts +2 -5
  137. package/src/prover/prep/methods.ts +181 -51
  138. package/src/prover/prep/normalize.ts +38 -9
  139. package/src/prover/prove.ts +395 -94
  140. package/src/prover/ptl/decide.ts +95 -50
  141. package/src/prover/ptl/encode.ts +2 -3
  142. package/src/prover/ptl/tableau.ts +28 -2
  143. package/src/prover/smt/arithmetic.ts +310 -0
  144. package/src/prover/smt/axioms.ts +12 -8
  145. package/src/prover/smt/context.ts +43 -8
  146. package/src/prover/smt/data.ts +498 -379
  147. package/src/prover/smt/encode.ts +148 -57
  148. package/src/prover/smt/extensionality.ts +5 -3
  149. package/src/prover/smt/flatten.ts +4 -6
  150. package/src/prover/smt/format.ts +28 -4
  151. package/src/prover/smt/instances.ts +7 -1
  152. package/src/prover/smt/layout.ts +91 -0
  153. package/src/prover/smt/rewrite.ts +1021 -618
  154. package/src/prover/smt/simplify.ts +441 -0
  155. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  156. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  157. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  158. package/src/prover/smt/solver/act-cache.ts +0 -1
  159. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  160. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  161. package/src/prover/smt/solver/aig.ts +889 -0
  162. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  163. package/src/prover/smt/solver/arith-terms.ts +121 -0
  164. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  165. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  166. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  167. package/src/prover/smt/solver/ast-lt.ts +166 -12
  168. package/src/prover/smt/solver/ast-util.ts +160 -2
  169. package/src/prover/smt/solver/ast.ts +1427 -41
  170. package/src/prover/smt/solver/auf-solver.ts +2 -6
  171. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  172. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  173. package/src/prover/smt/solver/bound-manager.ts +196 -0
  174. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  175. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  176. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  177. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  178. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  179. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  180. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  181. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  182. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  183. package/src/prover/smt/solver/card2bv.ts +110 -0
  184. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  185. package/src/prover/smt/solver/cg-table.ts +39 -25
  186. package/src/prover/smt/solver/check-logic.ts +330 -0
  187. package/src/prover/smt/solver/clause.ts +0 -1
  188. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  189. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  190. package/src/prover/smt/solver/context.ts +516 -115
  191. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  192. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  193. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  194. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  195. package/src/prover/smt/solver/demodulator.ts +786 -0
  196. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  197. package/src/prover/smt/solver/der.ts +38 -10
  198. package/src/prover/smt/solver/diff-neq.ts +206 -0
  199. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  200. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  201. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  202. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  203. package/src/prover/smt/solver/e-matching.ts +7 -8
  204. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  205. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  206. package/src/prover/smt/solver/enode.ts +100 -3
  207. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  208. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  209. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  210. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  211. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  212. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  213. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  214. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  215. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  216. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  217. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  218. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  219. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  220. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  221. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  222. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  223. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  224. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  225. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  226. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  227. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  228. package/src/prover/smt/solver/expr-ref.ts +0 -1
  229. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  230. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  231. package/src/prover/smt/solver/factor.ts +141 -0
  232. package/src/prover/smt/solver/fd-solver.ts +265 -0
  233. package/src/prover/smt/solver/fingerprints.ts +15 -15
  234. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  235. package/src/prover/smt/solver/flat-literals.ts +0 -1
  236. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  237. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  238. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  239. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  240. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  241. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  242. package/src/prover/smt/solver/goal.ts +175 -15
  243. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  244. package/src/prover/smt/solver/guard-set.ts +219 -0
  245. package/src/prover/smt/solver/hash.ts +0 -1
  246. package/src/prover/smt/solver/hashtable.ts +30 -16
  247. package/src/prover/smt/solver/inf-eps.ts +63 -0
  248. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  249. package/src/prover/smt/solver/internalizer.ts +110 -38
  250. package/src/prover/smt/solver/lackr.ts +381 -0
  251. package/src/prover/smt/solver/lbool.ts +0 -1
  252. package/src/prover/smt/solver/lia2card.ts +268 -0
  253. package/src/prover/smt/solver/lia2pb.ts +154 -0
  254. package/src/prover/smt/solver/literal.ts +0 -1
  255. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  256. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  257. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  258. package/src/prover/smt/solver/lp/containers.ts +0 -1
  259. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  260. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  261. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  262. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  263. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  264. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  265. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  266. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  267. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  268. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  269. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  270. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  271. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  272. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  273. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  274. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  275. package/src/prover/smt/solver/lp/nex.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  279. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  283. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  284. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  285. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  290. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  291. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  293. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  295. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  296. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  300. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  301. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  302. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  303. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  304. package/src/prover/smt/solver/macro-finder.ts +530 -0
  305. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  306. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  307. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  308. package/src/prover/smt/solver/max-cliques.ts +105 -0
  309. package/src/prover/smt/solver/maxcore.ts +309 -0
  310. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  311. package/src/prover/smt/solver/maxlex.ts +115 -0
  312. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  313. package/src/prover/smt/solver/maxsmt.ts +92 -0
  314. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  315. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  316. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  317. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  318. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  319. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  320. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  321. package/src/prover/smt/solver/model-checker.ts +18 -27
  322. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  323. package/src/prover/smt/solver/model-finder.ts +12 -18
  324. package/src/prover/smt/solver/model-generator.ts +56 -29
  325. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  326. package/src/prover/smt/solver/model-printer.ts +214 -0
  327. package/src/prover/smt/solver/mpf.ts +711 -0
  328. package/src/prover/smt/solver/mus.ts +51 -0
  329. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  330. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  331. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  332. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  333. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  334. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  335. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  336. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  337. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  338. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  339. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  340. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  341. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  342. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  343. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  344. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  345. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  346. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  347. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  348. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  349. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  350. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  351. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  352. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  353. package/src/prover/smt/solver/nlqsat.ts +484 -0
  354. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  355. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  356. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  357. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  358. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  359. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  360. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  361. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  362. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  363. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  364. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  365. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  366. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  367. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  368. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  369. package/src/prover/smt/solver/nnf.ts +105 -23
  370. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  371. package/src/prover/smt/solver/occf.ts +97 -0
  372. package/src/prover/smt/solver/opt-context.ts +787 -0
  373. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  374. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  375. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  376. package/src/prover/smt/solver/opt-solver.ts +308 -0
  377. package/src/prover/smt/solver/opt-value.ts +55 -0
  378. package/src/prover/smt/solver/optsmt.ts +692 -0
  379. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  380. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  381. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  382. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  383. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  384. package/src/prover/smt/solver/probes.ts +512 -0
  385. package/src/prover/smt/solver/propagate-values.ts +37 -21
  386. package/src/prover/smt/solver/proto-model.ts +648 -19
  387. package/src/prover/smt/solver/pull-quant.ts +28 -12
  388. package/src/prover/smt/solver/purify-arith.ts +632 -0
  389. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  390. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  391. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  392. package/src/prover/smt/solver/qe-lite.ts +37 -17
  393. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  394. package/src/prover/smt/solver/qe.ts +1498 -0
  395. package/src/prover/smt/solver/qel.ts +25 -0
  396. package/src/prover/smt/solver/qi-queue.ts +0 -1
  397. package/src/prover/smt/solver/qsat.ts +814 -0
  398. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  399. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  400. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  401. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  402. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  403. package/src/prover/smt/solver/random-gen.ts +0 -1
  404. package/src/prover/smt/solver/rational.ts +45 -1
  405. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  406. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  407. package/src/prover/smt/solver/reduce-args.ts +225 -0
  408. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  409. package/src/prover/smt/solver/ref-vector.ts +0 -1
  410. package/src/prover/smt/solver/relevancy.ts +1 -2
  411. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  412. package/src/prover/smt/solver/rewriter.ts +475 -36
  413. package/src/prover/smt/solver/rlimit.ts +25 -2
  414. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  415. package/src/prover/smt/solver/sat/big.ts +177 -0
  416. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  417. package/src/prover/smt/solver/sat/clause.ts +203 -0
  418. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  419. package/src/prover/smt/solver/sat/config.ts +122 -0
  420. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  421. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  422. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  423. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  424. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  425. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  426. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  427. package/src/prover/smt/solver/sat/probing.ts +170 -0
  428. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  429. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  430. package/src/prover/smt/solver/sat/scc.ts +142 -0
  431. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  432. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  433. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  434. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  435. package/src/prover/smt/solver/search-tree.ts +284 -0
  436. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  437. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  438. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  439. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  440. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  441. package/src/prover/smt/solver/seq-factory.ts +89 -0
  442. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  443. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  444. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  445. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  446. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  447. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  448. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  449. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  450. package/src/prover/smt/solver/seq-subset.ts +165 -0
  451. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  452. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  453. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  454. package/src/prover/smt/solver/smt-logics.ts +66 -0
  455. package/src/prover/smt/solver/smt-setup.ts +496 -0
  456. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  457. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  458. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  459. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  460. package/src/prover/smt/solver/solver.ts +113 -22
  461. package/src/prover/smt/solver/static-features.ts +314 -0
  462. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  463. package/src/prover/smt/solver/tactic.ts +1986 -0
  464. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  465. package/src/prover/smt/solver/theory-array.ts +1240 -0
  466. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  467. package/src/prover/smt/solver/theory-char.ts +355 -0
  468. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  469. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  470. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  471. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  472. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  473. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  474. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  475. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  476. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  477. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  478. package/src/prover/smt/solver/theory-lra.ts +188 -1
  479. package/src/prover/smt/solver/theory-pb.ts +934 -0
  480. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  481. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  482. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  483. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  484. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  485. package/src/prover/smt/solver/theory-seq.ts +961 -0
  486. package/src/prover/smt/solver/theory.ts +189 -0
  487. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  488. package/src/prover/smt/solver/var-subst.ts +36 -14
  489. package/src/prover/smt/table.ts +3 -2
  490. package/src/prover/smt/types.ts +146 -0
  491. package/src/prover/tlapm/cache.ts +50 -19
  492. package/src/prover/tlapm/tlapm.ts +15 -9
  493. package/src/prover/tlapm-library.ts +3208 -0
  494. package/src/prover/verdict.ts +9 -0
  495. package/src/prover/zenon/check/check.ts +1 -2
  496. package/src/prover/zenon/check/records.ts +1 -1
  497. package/src/prover/zenon/check/relations.ts +2 -1
  498. package/src/prover/zenon/check/rewrites.ts +2 -15
  499. package/src/prover/zenon/check/sets.ts +40 -58
  500. package/src/prover/zenon/check/terms.ts +1 -2
  501. package/src/prover/zenon/decide.ts +10 -7
  502. package/src/prover/zenon/encode.ts +0 -2
  503. package/src/prover/zenon/eqrel.ts +2 -2
  504. package/src/prover/zenon/equality-rules.ts +0 -2
  505. package/src/prover/zenon/expr.ts +7 -2
  506. package/src/prover/zenon/index-table.ts +9 -21
  507. package/src/prover/zenon/isar-case.ts +0 -2
  508. package/src/prover/zenon/isar.ts +35 -37
  509. package/src/prover/zenon/llproof.ts +2 -13
  510. package/src/prover/zenon/mltoll.ts +12 -30
  511. package/src/prover/zenon/node.ts +20 -5
  512. package/src/prover/zenon/parse.ts +9 -8
  513. package/src/prover/zenon/phrase.ts +0 -2
  514. package/src/prover/zenon/proof.ts +0 -2
  515. package/src/prover/zenon/propositional-rules.ts +0 -2
  516. package/src/prover/zenon/rules.ts +0 -2
  517. package/src/prover/zenon/search.ts +11 -19
  518. package/src/prover/zenon/tla/functions.ts +2 -4
  519. package/src/prover/zenon/tla/llproof.ts +9 -13
  520. package/src/prover/zenon/tla/records.ts +1 -8
  521. package/src/prover/zenon/tla/rewrites.ts +0 -2
  522. package/src/prover/zenon/tla/sets.ts +22 -22
  523. package/src/prover/zenon/tla/terms.ts +0 -2
  524. package/src/prover/zenon/tla/tla.ts +7 -8
  525. package/src/resolve.ts +56 -74
  526. package/src/runtime.ts +4 -0
  527. package/src/sany/generation.ts +394 -0
  528. package/src/sany/generator-def-entries.ts +210 -0
  529. package/src/sany/generator-definitions.ts +686 -0
  530. package/src/sany/generator-expressions.ts +1100 -0
  531. package/src/sany/generator-proofs.ts +662 -0
  532. package/src/sany/generator.ts +155 -2625
  533. package/src/sany/levels.ts +0 -2
  534. package/src/sany/lexer.ts +17 -16
  535. package/src/sany/linter.ts +0 -2
  536. package/src/sany/nodes.ts +6 -13
  537. package/src/sany/report.ts +3 -6
  538. package/src/sany/selectors.ts +35 -38
  539. package/src/sany/xml.ts +23 -55
  540. package/src/search.ts +205 -43
  541. package/src/simulate.ts +160 -133
  542. package/src/spec-description.ts +33 -48
  543. package/src/standard-definitions.ts +4 -0
  544. package/src/standard-modules.ts +16 -32
  545. package/src/state-graph.ts +2 -9
  546. package/src/substitution-levels.ts +5 -4
  547. package/src/successors.ts +6 -8
  548. package/src/symmetry.ts +2 -2
  549. package/src/tableau.ts +2 -2
  550. package/src/tlc/fingerprint.ts +81 -9
  551. package/src/tlc/messages.ts +20 -15
  552. package/src/tlc/order.ts +2 -9
  553. package/src/tlc/random.ts +4 -4
  554. package/src/tlc/replay.ts +8 -15
  555. package/src/tlc/summary.ts +29 -14
  556. package/src/tlc/tlc-operators.ts +2 -3
  557. package/src/tlc/tlcext-operators.ts +44 -12
  558. package/src/tlc/trace-spec.ts +25 -45
  559. package/src/typed-tier.ts +6535 -0
  560. package/src/typescript/actions.ts +2 -4
  561. package/src/typescript/collections.ts +34 -20
  562. package/src/typescript/compile.ts +1 -3
  563. package/src/typescript/formula.ts +5 -3
  564. package/src/typescript/model.ts +4 -5
  565. package/src/typescript/steps.ts +20 -18
  566. package/src/values.ts +63 -158
  567. package/src/prover/isabelle/isar/statement.ts +0 -52
  568. package/src/prover/smt/solver/z3-license.txt +0 -10
  569. package/src/prover/tlaps-module.ts +0 -510
  570. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,618 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import { mkArrayApp } from "../array-decl-plugin";
3
+ import {
4
+ FAMILY_ARRAY,
5
+ OP_ARRAY_DEFAULT,
6
+ OP_DT_ACCESSOR,
7
+ OP_DT_CONSTRUCTOR,
8
+ OP_DT_IS,
9
+ OP_DT_RECOGNISER,
10
+ OP_DT_UPDATE_FIELD,
11
+ SORT_BOOL,
12
+ SORT_SIZE_INFINITE,
13
+ } from "../ast";
14
+ import {
15
+ getAccessorConstructor,
16
+ getConstructorAccessors,
17
+ getConstructorIndex,
18
+ getConstructorIs,
19
+ getDatatypeConstructors,
20
+ getDatatypeDef,
21
+ getNonRecConstructor,
22
+ getNumConstructors,
23
+ getRecognizerConstructor,
24
+ isRecursiveDatatype,
25
+ } from "../datatype-decl-plugin";
26
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
27
+ import type { ProtoModel } from "../proto-model";
28
+ import { NULL_LITERAL } from "../sat/clause";
29
+ import { CR_CONTINUE, CR_DONE } from "../sat/solver";
30
+ import { ArraySolver } from "./array-solver";
31
+ import { type Enode, NULL_THEORY_VAR, type ThEq } from "./egraph";
32
+ import type { EufSolver } from "./euf-solver";
33
+ import { UnionFind } from "../lp/union-find";
34
+ import { addDependency, type Dependencies, ThSolver } from "./th-solver";
35
+
36
+ const ENTER = 0;
37
+ const EXIT = 1;
38
+
39
+ interface VarData {
40
+ constructorNode: Enode | null;
41
+ readonly recognizers: (Enode | null)[];
42
+ }
43
+
44
+ export class DtSolver extends ThSolver {
45
+ private readonly find: UnionFind;
46
+ private varData: VarData[] = [];
47
+ private toUnmark1: Enode[] = [];
48
+ private toUnmark2: Enode[] = [];
49
+ private usedEqs: [Enode, Enode][] = [];
50
+ private dfs: [number, Enode][] = [];
51
+ private parents = new Map<Enode, Enode>();
52
+
53
+ constructor(ctx: EufSolver, id: number) {
54
+ super(ctx, "datatype", id);
55
+ this.find = new UnionFind(ctx.trail);
56
+ this.find.handler = { mergeEh: (first, second) => this.mergeEh(first, second) };
57
+ }
58
+
59
+ private isOp(expr: number, op: number) {
60
+ return this.manager.getOp(expr) === op;
61
+ }
62
+
63
+ private isConstructor(expr: number) {
64
+ return this.isOp(expr, OP_DT_CONSTRUCTOR);
65
+ }
66
+
67
+ private isRecognizer(expr: number) {
68
+ return this.isOp(expr, OP_DT_RECOGNISER) || this.isOp(expr, OP_DT_IS);
69
+ }
70
+
71
+ private isUpdateField(expr: number) {
72
+ return this.isOp(expr, OP_DT_UPDATE_FIELD);
73
+ }
74
+
75
+ private isDatatypeSort(sort: number) {
76
+ return this.manager.isDatatypeSort(sort);
77
+ }
78
+
79
+ private isDatatype(expr: number) {
80
+ return this.isDatatypeSort(this.manager.sorts[expr]);
81
+ }
82
+
83
+ private isArrayOfDatatypes(sort: number) {
84
+ const manager = this.manager;
85
+ return manager.isArraySort(sort) && this.isDatatypeSort(manager.getArrayRange(sort));
86
+ }
87
+
88
+ private isSeqOfDatatypes(sort: number) {
89
+ const manager = this.manager;
90
+ return manager.isSeqSort(sort) && this.isDatatypeSort(manager.getSortParameters(sort)[0]);
91
+ }
92
+
93
+ private isEnumSort(sort: number) {
94
+ return (
95
+ getDatatypeDef(this.manager, sort)?.constructors.every(
96
+ (constructor) => constructor.accessors.length === 0,
97
+ ) ?? false
98
+ );
99
+ }
100
+
101
+ private value(node: Enode) {
102
+ return this.s.value(2 * node.boolVar);
103
+ }
104
+
105
+ private mkApp(decl: number, args: number[]) {
106
+ const manager = this.manager;
107
+ return manager.mkApp(decl, args, manager.funcDecls[decl].range);
108
+ }
109
+
110
+ private clearMark() {
111
+ for (const node of this.toUnmark1) node.isMarked1 = false;
112
+ for (const node of this.toUnmark2) node.isMarked2 = false;
113
+ this.toUnmark1 = [];
114
+ this.toUnmark2 = [];
115
+ }
116
+
117
+ private ocMarkOnStack(node: Enode) {
118
+ const root = node.root;
119
+ root.isMarked1 = true;
120
+ this.toUnmark1.push(root);
121
+ }
122
+
123
+ private ocMarkCycleFree(node: Enode) {
124
+ const root = node.root;
125
+ root.isMarked2 = true;
126
+ this.toUnmark2.push(root);
127
+ }
128
+
129
+ private ocPushStack(node: Enode) {
130
+ this.dfs.push([EXIT, node], [ENTER, node]);
131
+ }
132
+
133
+ private assertEqAxiom(first: Enode, second: number, antecedent = NULL_LITERAL) {
134
+ if (antecedent === NULL_LITERAL) {
135
+ this.addUnit(this.eqInternalize(first.owner, second));
136
+ return;
137
+ }
138
+ if (this.s.value(antecedent) === L_TRUE) {
139
+ const secondNode = this.eInternalize(second);
140
+ if (first.root !== secondNode.root) this.propagateEq([antecedent], [], first, secondNode);
141
+ return;
142
+ }
143
+ this.addClause([antecedent ^ 1, this.eqInternalize(first.owner, second)]);
144
+ }
145
+
146
+ private assertIsConstructorAxiom(node: Enode, constructor: number, antecedent = NULL_LITERAL) {
147
+ const args = getConstructorAccessors(this.manager, constructor).map((accessor) =>
148
+ this.mkApp(accessor, [node.owner]),
149
+ );
150
+ this.assertEqAxiom(node, this.mkApp(constructor, args), antecedent);
151
+ }
152
+
153
+ private assertAccessorAxioms(node: Enode) {
154
+ getConstructorAccessors(this.manager, node.decl).forEach((accessor, index) =>
155
+ this.assertEqAxiom(node.getArg(index), this.mkApp(accessor, [node.owner])),
156
+ );
157
+ }
158
+
159
+ private signRecognizerConflict(constructor: Enode, recognizer: Enode) {
160
+ const lit = 2 * recognizer.boolVar;
161
+ this.clearMark();
162
+ this.setConflict([lit ^ 1], [[constructor, recognizer.getArg(0)]]);
163
+ }
164
+
165
+ private assertUpdateFieldAxioms(node: Enode) {
166
+ const manager = this.manager;
167
+ const own = node.owner;
168
+ const record = node.getArg(0).owner;
169
+ const field = manager.funcDecls[node.decl].parameters[0];
170
+ const constructor = getAccessorConstructor(manager, field);
171
+ const recognizer = getConstructorIs(manager, constructor);
172
+ const isConstructor = this.mkLiteral(manager.mkApp(recognizer, [record], SORT_BOOL));
173
+ for (const accessor of getConstructorAccessors(manager, constructor)) {
174
+ const arg =
175
+ accessor === field ? node.getArg(1) : this.eInternalize(this.mkApp(accessor, [record]));
176
+ this.assertEqAxiom(arg, this.mkApp(accessor, [own]), isConstructor);
177
+ }
178
+ this.assertEqAxiom(node, record, isConstructor ^ 1);
179
+ const isOwnConstructor = this.mkLiteral(manager.mkApp(recognizer, [own], SORT_BOOL));
180
+ this.addClause([isConstructor ^ 1, isOwnConstructor]);
181
+ }
182
+
183
+ override mkVar(node: Enode) {
184
+ if (this.isAttachedToVar(node)) return node.getThVar(this.id);
185
+ const manager = this.manager;
186
+ const thVar = super.mkVar(node);
187
+ this.find.mkVar();
188
+ const data: VarData = { constructorNode: null, recognizers: [] };
189
+ this.varData.push(data);
190
+ this.ctx.egraph.addThVar(node, thVar, this.id);
191
+ const expr = node.owner;
192
+ if (this.isConstructor(expr)) {
193
+ data.constructorNode = node;
194
+ this.assertAccessorAxioms(node);
195
+ } else if (this.isUpdateField(expr)) this.assertUpdateFieldAxioms(node);
196
+ else if (!this.isRecognizer(expr)) {
197
+ const sort = manager.sorts[expr];
198
+ if (getNumConstructors(manager, sort) === 1)
199
+ this.assertIsConstructorAxiom(node, getDatatypeConstructors(manager, sort)[0]);
200
+ else if (manager.getSortSize(sort) !== SORT_SIZE_INFINITE) this.mkSplit(thVar);
201
+ }
202
+ return thVar;
203
+ }
204
+
205
+ private mkSplit(inputVar: number) {
206
+ const manager = this.manager;
207
+ const thVar = this.find.find(inputVar);
208
+ const node = this.var2enodeOf(thVar);
209
+ const sort = manager.sorts[node.owner];
210
+ if (this.isEnumSort(sort)) {
211
+ this.mkEnumSplit(thVar);
212
+ return;
213
+ }
214
+ const nonRecConstructor = getNonRecConstructor(manager, sort);
215
+ const index = getConstructorIndex(manager, nonRecConstructor);
216
+ const recognizer = this.varData[thVar].recognizers[index] ?? null;
217
+ if (recognizer === null && manager.funcDecls[nonRecConstructor].domain.length === 0) {
218
+ const eq = this.eqInternalize(node.owner, this.mkApp(nonRecConstructor, []));
219
+ this.s.setPhaseLiteral(eq);
220
+ if (this.s.value(eq) === L_FALSE) this.mkEnumSplit(thVar);
221
+ } else if (recognizer === null) this.mkRecognizerConstructorLiteral(nonRecConstructor, node);
222
+ else if (this.value(recognizer) === L_FALSE) this.mkEnumSplit(thVar);
223
+ }
224
+
225
+ private mkRecognizerConstructorLiteral(constructor: number, node: Enode) {
226
+ const recognizer = getConstructorIs(this.manager, constructor);
227
+ const lit = this.mkLiteral(this.manager.mkApp(recognizer, [node.owner], SORT_BOOL));
228
+ this.s.setPhaseLiteral(lit);
229
+ return lit;
230
+ }
231
+
232
+ private mkEnumSplit(thVar: number) {
233
+ const manager = this.manager;
234
+ const node = this.var2enodeOf(thVar);
235
+ const data = this.varData[thVar];
236
+ const constructors = getDatatypeConstructors(manager, manager.sorts[node.owner]);
237
+ const size = constructors.length;
238
+ const start = this.random();
239
+ const lits: number[] = [];
240
+ for (let index = 0; index < size; index++) {
241
+ const position = (index + start) % size;
242
+ const constructor = constructors[position];
243
+ if (manager.funcDecls[constructor].domain.length > 0) {
244
+ const current = data.recognizers[position] ?? null;
245
+ if (current !== null && this.value(current) !== L_FALSE) return;
246
+ const lit = this.mkRecognizerConstructorLiteral(constructor, node);
247
+ if (current === null) return;
248
+ if (this.s.value(lit) !== L_FALSE) return;
249
+ lits.push(lit ^ 1);
250
+ continue;
251
+ }
252
+ const lit = this.eqInternalize(node.owner, this.mkApp(constructor, []));
253
+ const value = this.s.value(lit);
254
+ if (value === L_UNDEF) {
255
+ this.s.setPhaseLiteral(lit);
256
+ return;
257
+ }
258
+ if (value === L_TRUE) return;
259
+ lits.push(lit ^ 1);
260
+ }
261
+ this.setConflict(lits, []);
262
+ }
263
+
264
+ override applySortCnstr(node: Enode) {
265
+ this.forcePush();
266
+ if (!this.isAttachedToVar(node)) this.mkVar(node);
267
+ }
268
+
269
+ override newEqEh(eq: ThEq) {
270
+ this.forcePush();
271
+ this.find.merge(eq.v1, eq.v2);
272
+ }
273
+
274
+ override asserted(lit: number) {
275
+ this.forcePush();
276
+ const manager = this.manager;
277
+ const node = this.boolVar2enode(lit >> 1);
278
+ if (node === undefined || !this.isRecognizer(node.owner)) return;
279
+ const arg = node.getArg(0);
280
+ const thVar = this.find.find(arg.getThVar(this.id));
281
+ const data = this.varData[thVar];
282
+ const constructor = getRecognizerConstructor(manager, node.decl);
283
+ if ((lit & 1) === 0) {
284
+ if (data.constructorNode !== null && data.constructorNode.decl === constructor) return;
285
+ this.assertIsConstructorAxiom(arg, constructor, lit);
286
+ } else if (data.constructorNode === null) this.propagateRecognizer(thVar, node);
287
+ else if (data.constructorNode.decl === constructor)
288
+ this.signRecognizerConflict(data.constructorNode, node);
289
+ }
290
+
291
+ private addRecognizer(inputVar: number, recognizer: Enode) {
292
+ const manager = this.manager;
293
+ const thVar = this.find.find(inputVar);
294
+ const data = this.varData[thVar];
295
+ const sort = manager.funcDecls[recognizer.decl].domain[0];
296
+ if (data.recognizers.length === 0)
297
+ for (let index = 0; index < getNumConstructors(manager, sort); index++)
298
+ data.recognizers.push(null);
299
+ const constructor = getRecognizerConstructor(manager, recognizer.decl);
300
+ const index = getConstructorIndex(manager, constructor);
301
+ if (data.recognizers[index] !== null) return;
302
+ const value = this.value(recognizer);
303
+ if (value === L_TRUE) return;
304
+ if (value === L_FALSE && data.constructorNode !== null) {
305
+ if (data.constructorNode.decl === constructor)
306
+ this.signRecognizerConflict(data.constructorNode, recognizer);
307
+ return;
308
+ }
309
+ this.ctx.trail.push(() => {
310
+ data.recognizers[index] = null;
311
+ });
312
+ data.recognizers[index] = recognizer;
313
+ if (value === L_FALSE) this.propagateRecognizer(thVar, recognizer);
314
+ }
315
+
316
+ private propagateRecognizer(thVar: number, recognizer: Enode) {
317
+ const manager = this.manager;
318
+ const node = this.var2enodeOf(thVar);
319
+ const sort = manager.sorts[node.owner];
320
+ const data = this.varData[thVar];
321
+ if (data.recognizers.length === 0) {
322
+ this.addRecognizer(thVar, recognizer);
323
+ return;
324
+ }
325
+ const lits: number[] = [];
326
+ const eqs: [Enode, Enode][] = [];
327
+ let numUnassigned = 0;
328
+ let unassignedIndex = -1;
329
+ for (let index = 0; index < data.recognizers.length; index++) {
330
+ const current = data.recognizers[index];
331
+ if (current !== null && this.value(current) === L_TRUE) return;
332
+ if (current !== null && this.value(current) === L_FALSE) {
333
+ lits.push(2 * current.boolVar + 1);
334
+ if (node !== current.getArg(0)) eqs.push([node, current.getArg(0)]);
335
+ continue;
336
+ }
337
+ if (numUnassigned === 0) unassignedIndex = index;
338
+ numUnassigned++;
339
+ }
340
+ if (numUnassigned === 0) {
341
+ this.setConflict(lits, eqs);
342
+ return;
343
+ }
344
+ if (numUnassigned === 1) {
345
+ const current = data.recognizers[unassignedIndex];
346
+ const consequent =
347
+ current !== null
348
+ ? 2 * current.boolVar
349
+ : this.mkLiteral(
350
+ manager.mkApp(
351
+ getConstructorIs(manager, getDatatypeConstructors(manager, sort)[unassignedIndex]),
352
+ [node.owner],
353
+ SORT_BOOL,
354
+ ),
355
+ );
356
+ this.propagateLit(lits, eqs, consequent);
357
+ return;
358
+ }
359
+ if (manager.getSortSize(sort) !== SORT_SIZE_INFINITE) this.mkSplit(thVar);
360
+ }
361
+
362
+ private mergeEh(first: number, second: number) {
363
+ const manager = this.manager;
364
+ const firstData = this.varData[first];
365
+ const secondData = this.varData[second];
366
+ const firstConstructor = firstData.constructorNode;
367
+ const secondConstructor = secondData.constructorNode;
368
+ if (
369
+ firstConstructor !== null &&
370
+ secondConstructor !== null &&
371
+ firstConstructor.decl !== secondConstructor.decl
372
+ )
373
+ this.setConflict([], [[firstConstructor, secondConstructor]]);
374
+ else if (secondConstructor !== null && firstConstructor === null) {
375
+ this.ctx.trail.push(() => {
376
+ firstData.constructorNode = null;
377
+ });
378
+ if (firstData.recognizers.length > 0) {
379
+ const recognizer =
380
+ firstData.recognizers[getConstructorIndex(manager, secondConstructor.decl)];
381
+ if (recognizer !== null && this.value(recognizer) === L_FALSE) {
382
+ this.signRecognizerConflict(secondConstructor, recognizer);
383
+ return;
384
+ }
385
+ }
386
+ firstData.constructorNode = secondConstructor;
387
+ }
388
+ for (const recognizer of secondData.recognizers)
389
+ if (recognizer !== null) this.addRecognizer(first, recognizer);
390
+ }
391
+
392
+ private getArrayArgs(node: Enode) {
393
+ const arrays = this.ctx.fid2solver(FAMILY_ARRAY);
394
+ const nodes = arrays instanceof ArraySolver ? [...arrays.parentSelects(node)] : [];
395
+ const arrayDefault = this.ctx.getEnode(
396
+ mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [node.owner]),
397
+ );
398
+ if (arrayDefault !== undefined) nodes.push(arrayDefault);
399
+ return nodes;
400
+ }
401
+
402
+ private ocGetConstructor(app: Enode) {
403
+ const thVar = app.root.getThVar(this.id);
404
+ if (thVar === NULL_THEORY_VAR) return null;
405
+ return this.varData[this.find.find(thVar)].constructorNode;
406
+ }
407
+
408
+ private explainIsChild(parent: Enode, child: Enode) {
409
+ const parentConstructor = this.ocGetConstructor(parent) as Enode;
410
+ if (parent !== parentConstructor) this.usedEqs.push([parent, parentConstructor]);
411
+ const add = (arg: Enode) => {
412
+ if (arg.root !== child.root) return;
413
+ if (arg !== child) this.usedEqs.push([arg, child]);
414
+ };
415
+ for (const arg of parentConstructor.args) {
416
+ add(arg);
417
+ const sort = this.manager.sorts[arg.owner];
418
+ if (this.isArrayOfDatatypes(sort))
419
+ for (const arrayArg of this.getArrayArgs(arg)) add(arrayArg);
420
+ if (this.isSeqOfDatatypes(sort))
421
+ throw new SmtUnsupportedError("sat.euf datatypes in sequences");
422
+ }
423
+ }
424
+
425
+ private occursCheckExplain(inputApp: Enode, root: Enode) {
426
+ this.explainIsChild(inputApp, root);
427
+ let app = inputApp;
428
+ while (app.root !== root.root) {
429
+ const parentApp = this.parents.get(app.root) as Enode;
430
+ this.explainIsChild(parentApp, app);
431
+ app = parentApp;
432
+ }
433
+ if (app !== root) this.usedEqs.push([app, root]);
434
+ }
435
+
436
+ private occursCheckEnter(inputApp: Enode) {
437
+ const app = inputApp.root;
438
+ const thVar = app.getThVar(this.id);
439
+ if (thVar === NULL_THEORY_VAR) return false;
440
+ const parent = this.varData[this.find.find(thVar)].constructorNode;
441
+ if (parent === null) return false;
442
+ this.ocMarkOnStack(parent);
443
+ const processArg = (arg: Enode) => {
444
+ if (arg.root.isMarked2) return false;
445
+ if (arg.root.isMarked1) {
446
+ this.occursCheckExplain(parent, arg);
447
+ return true;
448
+ }
449
+ if (this.isDatatype(arg.owner)) {
450
+ this.parents.set(arg.root, parent);
451
+ this.ocPushStack(arg);
452
+ }
453
+ return false;
454
+ };
455
+ for (const arg of parent.args) {
456
+ if (arg.root.isMarked2) continue;
457
+ if (arg.root.isMarked1) {
458
+ this.occursCheckExplain(parent, arg);
459
+ return true;
460
+ }
461
+ const sort = this.manager.sorts[arg.owner];
462
+ if (this.isDatatypeSort(sort)) {
463
+ this.parents.set(arg.root, parent);
464
+ this.ocPushStack(arg);
465
+ } else if (this.isSeqOfDatatypes(sort))
466
+ throw new SmtUnsupportedError("sat.euf datatypes in sequences");
467
+ else if (this.isArrayOfDatatypes(sort))
468
+ for (const arrayArg of this.getArrayArgs(arg)) if (processArg(arrayArg)) return true;
469
+ }
470
+ return false;
471
+ }
472
+
473
+ private occursCheck(node: Enode) {
474
+ let isCyclic = false;
475
+ this.ocPushStack(node);
476
+ while (!isCyclic && this.dfs.length > 0) {
477
+ const [op, app] = this.dfs.pop() as [number, Enode];
478
+ if (app.root.isMarked2) continue;
479
+ if (op === ENTER) isCyclic = this.occursCheckEnter(app);
480
+ else this.ocMarkCycleFree(app);
481
+ }
482
+ if (isCyclic) {
483
+ this.clearMark();
484
+ this.setConflict([], this.usedEqs);
485
+ }
486
+ return isCyclic;
487
+ }
488
+
489
+ override check() {
490
+ this.forcePush();
491
+ const manager = this.manager;
492
+ const numVars = this.numVars;
493
+ this.usedEqs = [];
494
+ this.dfs = [];
495
+ this.parents.clear();
496
+ const start = this.random();
497
+ let result = CR_DONE;
498
+ for (let index = 0; index < numVars; index++) {
499
+ const thVar = (index + start) % numVars;
500
+ if (thVar !== this.find.find(thVar)) continue;
501
+ const node = this.var2enodeOf(thVar);
502
+ if (!this.isDatatype(node.owner)) continue;
503
+ if (
504
+ isRecursiveDatatype(manager, manager.sorts[node.owner]) &&
505
+ !node.root.isMarked2 &&
506
+ this.occursCheck(node)
507
+ ) {
508
+ this.clearMark();
509
+ return CR_CONTINUE;
510
+ }
511
+ if (this.varData[thVar].constructorNode !== null) continue;
512
+ this.clearMark();
513
+ this.mkSplit(thVar);
514
+ result = CR_CONTINUE;
515
+ }
516
+ this.clearMark();
517
+ return result;
518
+ }
519
+
520
+ protected override popCore(numScopes: number) {
521
+ super.popCore(numScopes);
522
+ this.varData.length = this.numVars;
523
+ }
524
+
525
+ override addValue(node: Enode, model: ProtoModel, values: (number | undefined)[]) {
526
+ const thVar = node.getThVar(this.id);
527
+ if (thVar === NULL_THEORY_VAR) {
528
+ values[node.root.owner] = model.getFreshValue(this.manager.sorts[node.owner]) ?? undefined;
529
+ return;
530
+ }
531
+ const constructor = this.varData[this.find.find(thVar)].constructorNode as Enode;
532
+ values[node.root.owner] = this.mkApp(
533
+ constructor.decl,
534
+ constructor.args.map((arg) => values[arg.root.owner] as number),
535
+ );
536
+ }
537
+
538
+ override addDep(node: Enode, deps: Dependencies) {
539
+ if (!this.isDatatype(node.owner)) return false;
540
+ const thVar = node.getThVar(this.id);
541
+ if (thVar === NULL_THEORY_VAR) return false;
542
+ const constructor = this.varData[this.find.find(thVar)].constructorNode as Enode;
543
+ if (constructor.numArgs === 0) deps.set(node, null);
544
+ for (const arg of constructor.args) addDependency(deps, node, arg.root);
545
+ return true;
546
+ }
547
+
548
+ override includeFuncInterp(decl: number) {
549
+ const manager = this.manager;
550
+ if (manager.funcDecls[decl].op !== OP_DT_ACCESSOR) return false;
551
+ const constructor = getAccessorConstructor(manager, decl);
552
+ for (const app of this.ctx.egraph.enodesOf(decl)) {
553
+ const appConstructor = this.ocGetConstructor(app.getArg(0));
554
+ if (
555
+ appConstructor !== null &&
556
+ this.isConstructor(appConstructor.owner) &&
557
+ appConstructor.decl !== constructor
558
+ )
559
+ return true;
560
+ }
561
+ return false;
562
+ }
563
+
564
+ internalize(expr: number, isSign: boolean, isRoot: boolean) {
565
+ if (!this.visitRec(expr, isSign, isRoot)) return NULL_LITERAL;
566
+ const lit = this.expr2literal(expr);
567
+ return isSign ? lit ^ 1 : lit;
568
+ }
569
+
570
+ internalizeTerm(expr: number) {
571
+ this.visitRec(expr, false, false);
572
+ }
573
+
574
+ protected override visit(expr: number) {
575
+ if (this.visited(expr)) return true;
576
+ const manager = this.manager;
577
+ if (!manager.isApp(expr) || manager.getFamily(expr) !== this.id) {
578
+ this.ctx.internalizeTerm(expr);
579
+ if (this.isDatatype(expr)) this.mkVar(this.expr2enode(expr) as Enode);
580
+ return true;
581
+ }
582
+ this.stack.push({ expr, index: 0 });
583
+ return false;
584
+ }
585
+
586
+ protected override visited(expr: number) {
587
+ const node = this.expr2enode(expr);
588
+ return node !== undefined && node.getThVar(this.id) !== NULL_THEORY_VAR;
589
+ }
590
+
591
+ protected override postVisit(expr: number) {
592
+ const node = this.expr2enode(expr) ?? this.mkEnode(expr);
593
+ if (this.isConstructor(expr) || this.isUpdateField(expr)) {
594
+ for (const arg of node.args) {
595
+ const sort = this.manager.sorts[arg.owner];
596
+ if (this.isDatatypeSort(sort)) this.mkVar(arg);
597
+ else if (this.isArrayOfDatatypes(sort))
598
+ this.mkVar(this.eInternalize(mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [arg.owner])));
599
+ }
600
+ this.mkVar(node);
601
+ } else if (this.isRecognizer(expr)) {
602
+ this.mkVar(node);
603
+ this.addRecognizer(this.mkVar(node.getArg(0)), node);
604
+ } else {
605
+ this.mkVar(node.getArg(0));
606
+ if (this.isDatatype(expr)) this.mkVar(node);
607
+ }
608
+ return true;
609
+ }
610
+
611
+ override getPhase() {
612
+ return L_TRUE;
613
+ }
614
+
615
+ override isSelfPropagating() {
616
+ return true;
617
+ }
618
+ }