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,495 @@
1
+ import { SmtTacticError, SmtUnsupportedError } from "../../../../errors";
2
+ import {
3
+ type AstManager,
4
+ getSymbolName,
5
+ KIND_APP,
6
+ KIND_QUANTIFIER,
7
+ KIND_VAR,
8
+ OP_AND,
9
+ OP_IMPLIES,
10
+ SORT_BOOL,
11
+ QUANTIFIER_EXISTS,
12
+ QUANTIFIER_FORALL,
13
+ } from "../ast";
14
+ import { flattenAndVector } from "../ast-util";
15
+ import { RefVector } from "../ref-vector";
16
+ import { DEFAULT_PRINT_OPTIONS, printExpr } from "../smt2-printer";
17
+ import { getFreeVarSorts, VarSubst } from "../var-subst";
18
+ import { simplifyQuantifiers } from "../qe";
19
+ import { QuantifierHoister } from "../quant-hoist";
20
+ import type { DatalogContext } from "./dl-context";
21
+ import { Hnf } from "./hnf";
22
+ import type { RuleSet } from "./dl-rule-set";
23
+
24
+ const PRINT_ENVIRONMENT = {
25
+ options: DEFAULT_PRINT_OPTIONS,
26
+ isUsed: () => false,
27
+ isClashing: () => false,
28
+ };
29
+
30
+ export const mkPp = (manager: AstManager, expr: number) =>
31
+ printExpr(manager, PRINT_ENVIRONMENT, expr);
32
+
33
+ // output_predicate of src/muz/base/dl_util.cpp.
34
+ const outputPredicate = (manager: AstManager, predicate: number) =>
35
+ `${getSymbolName(manager.funcDecls[manager.decls[predicate]].name)}(${manager
36
+ .getArgs(predicate)
37
+ .map((arg) =>
38
+ manager.kinds[arg] === KIND_VAR ? `#${manager.values[arg]}` : mkPp(manager, arg),
39
+ )
40
+ .join(",")})`;
41
+
42
+ // The tail lists the positive predicates, then the negated ones, then the interpreted formulas.
43
+ export class Rule {
44
+ constructor(
45
+ public head: number,
46
+ readonly tail: number[],
47
+ readonly isNegated: boolean[],
48
+ readonly uninterpretedSize: number,
49
+ readonly positiveSize: number,
50
+ readonly name: string | undefined,
51
+ ) {}
52
+
53
+ getDecl(manager: AstManager) {
54
+ return manager.decls[this.head];
55
+ }
56
+
57
+ getTailDecl(manager: AstManager, index: number) {
58
+ return manager.decls[this.tail[index]];
59
+ }
60
+
61
+ hasNegation() {
62
+ for (let index = 0; index < this.uninterpretedSize; index++)
63
+ if (this.isNegated[index]) return true;
64
+ return false;
65
+ }
66
+
67
+ getNameText() {
68
+ return this.name ?? "<null>";
69
+ }
70
+
71
+ display(context: DatalogContext) {
72
+ const manager = context.manager;
73
+ const head = `${this.getNameText()}:\n${outputPredicate(manager, this.head)}`;
74
+ if (this.tail.length === 0) return `${head}.\n`;
75
+ const tail = this.tail.map(
76
+ (literal, index) =>
77
+ `\n ${this.isNegated[index] ? "not " : ""}${
78
+ context.isPredicate(literal) ? outputPredicate(manager, literal) : mkPp(manager, literal)
79
+ }`,
80
+ );
81
+ return `${head} :- ${tail.join(",")}.\n`;
82
+ }
83
+ }
84
+
85
+ // The sorts of the free variables of the expressions, by index, as Z3's used_vars collects them.
86
+ export const getUsedVars = (manager: AstManager, exprs: readonly number[]) => {
87
+ const used: (number | undefined)[] = [];
88
+ for (const expr of exprs)
89
+ getFreeVarSorts(manager, expr, manager.freeVarBounds[expr]).forEach((sort, index) => {
90
+ if (sort !== undefined && used[index] === undefined) used[index] = sort;
91
+ });
92
+ return Array.from(used);
93
+ };
94
+
95
+ export const getRuleVars = (manager: AstManager, rule: Rule) =>
96
+ getUsedVars(manager, [rule.head, ...rule.tail]);
97
+
98
+ export const mkForall = (manager: AstManager, sorts: number[], names: string[], body: number) =>
99
+ manager.mkQuantifier({
100
+ kind: QUANTIFIER_FORALL,
101
+ sorts,
102
+ names,
103
+ body,
104
+ patterns: [],
105
+ noPatterns: [],
106
+ weight: 0,
107
+ qid: "",
108
+ });
109
+
110
+ export const mkExists = (manager: AstManager, sorts: number[], names: string[], body: number) =>
111
+ manager.mkQuantifier({
112
+ kind: QUANTIFIER_EXISTS,
113
+ sorts,
114
+ names,
115
+ body,
116
+ patterns: [],
117
+ noPatterns: [],
118
+ weight: 0,
119
+ qid: "",
120
+ });
121
+
122
+ export class BindVariables {
123
+ private vars: number[] = [];
124
+
125
+ constructor(private manager: AstManager) {}
126
+
127
+ addVar(variable: number) {
128
+ this.manager.incRef(variable);
129
+ this.vars.push(variable);
130
+ }
131
+
132
+ apply(fml: number, isForall: boolean) {
133
+ const manager = this.manager;
134
+ if (this.vars.length === 0) return fml;
135
+ const bound = new Map<number, number>();
136
+ const names: string[] = [];
137
+ const sorts: number[] = [];
138
+ const todo: number[] = [];
139
+ // The arguments of an application are abstracted last to first, as Z3's stack pops them.
140
+ const abstract = (term: number, scope: number, cache: Map<number, number>): number => {
141
+ const size = todo.length;
142
+ todo.push(term);
143
+ while (todo.length > size) {
144
+ const current = todo[todo.length - 1];
145
+ if (cache.has(current)) {
146
+ todo.pop();
147
+ continue;
148
+ }
149
+ const kind = manager.kinds[current];
150
+ if (kind === KIND_VAR) cache.set(current, current);
151
+ else if (kind === KIND_QUANTIFIER) {
152
+ const data = manager.getQuantifier(current);
153
+ const innerScope = scope + data.sorts.length;
154
+ const innerCache = new Map<number, number>();
155
+ const patterns = data.patterns.map((pattern) =>
156
+ abstract(pattern, innerScope, innerCache),
157
+ );
158
+ cache.set(
159
+ current,
160
+ manager.mkQuantifier({
161
+ ...data,
162
+ patterns,
163
+ body: abstract(data.body, innerScope, innerCache),
164
+ }),
165
+ );
166
+ } else if (this.vars.includes(current)) {
167
+ const existing =
168
+ bound.get(current) ??
169
+ (() => {
170
+ const variable = manager.mkVar(names.length, manager.sorts[current]);
171
+ names.push(manager.getDeclName(current));
172
+ sorts.push(manager.sorts[current]);
173
+ bound.set(current, variable);
174
+ return variable;
175
+ })();
176
+ cache.set(
177
+ current,
178
+ scope === 0
179
+ ? existing
180
+ : manager.mkVar(scope + manager.values[existing], manager.sorts[existing]),
181
+ );
182
+ } else {
183
+ const args: number[] = [];
184
+ let isAllVisited = true;
185
+ for (const arg of manager.getArgs(current)) {
186
+ const abstracted = cache.get(arg);
187
+ if (abstracted === undefined) {
188
+ todo.push(arg);
189
+ isAllVisited = false;
190
+ } else if (isAllVisited) args.push(abstracted);
191
+ }
192
+ if (!isAllVisited) continue;
193
+ cache.set(
194
+ current,
195
+ args.every((arg, index) => arg === manager.getArg(current, index))
196
+ ? current
197
+ : manager.mkApp(manager.decls[current], args, manager.sorts[current]),
198
+ );
199
+ }
200
+ todo.pop();
201
+ }
202
+ return cache.get(term) ?? term;
203
+ };
204
+ const body = abstract(fml, 0, new Map());
205
+ if (names.length === 0) return body;
206
+ sorts.reverse();
207
+ names.reverse();
208
+ return isForall ? mkForall(manager, sorts, names, body) : mkExists(manager, sorts, names, body);
209
+ }
210
+ }
211
+
212
+ export class RuleManager {
213
+ private hnf: Hnf;
214
+
215
+ constructor(
216
+ readonly manager: AstManager,
217
+ private context: DatalogContext,
218
+ ) {
219
+ this.hnf = new Hnf(manager);
220
+ }
221
+
222
+ private pin(expr: number) {
223
+ this.manager.incRef(expr);
224
+ return expr;
225
+ }
226
+
227
+ mkRule(fml: number, rules: RuleSet, name?: string) {
228
+ const bound = this.context.bindVars(fml, true);
229
+ if (this.manager.hasLabelFlags[bound]) throw new SmtUnsupportedError("labels in Horn rules");
230
+ this.mkRuleCore(bound, rules, name);
231
+ }
232
+
233
+ private mkRuleCore(fml: number, rules: RuleSet, name: string | undefined) {
234
+ this.hnf.setName(name);
235
+ const fmls = this.hnf.apply(fml);
236
+ for (const predicate of this.hnf.freshPredicates) this.context.registerPredicate(predicate);
237
+ for (const horn of fmls) this.mkHornRule(horn, rules, name);
238
+ }
239
+
240
+ private mkHornRule(fml: number, rules: RuleSet, name: string | undefined) {
241
+ const manager = this.manager;
242
+ const body: number[] = [];
243
+ const extracted = this.extractHorn(fml, body);
244
+ const index = { value: extracted.index };
245
+ const head = this.hoistCompound(index, extracted.head, body);
246
+ const size = body.length;
247
+ for (let position = 0; position < size; position++)
248
+ body[position] = this.hoistCompound(index, body[position], body);
249
+ const isNegated = body.map((literal, position) => {
250
+ if (!manager.isNot(literal) || !this.context.isPredicate(manager.getArg(literal, 0)))
251
+ return false;
252
+ body[position] = manager.getArg(literal, 0);
253
+ return true;
254
+ });
255
+ this.checkValidHead(head);
256
+ const rule = this.mk(head, body, isNegated, name);
257
+ rules.addRule(this.context.isFixingUnboundVars() ? this.fixUnboundVars(rule, true) : rule);
258
+ }
259
+
260
+ private extractHorn(fml: number, body: number[]) {
261
+ const manager = this.manager;
262
+ const matrix =
263
+ manager.kinds[fml] === KIND_QUANTIFIER &&
264
+ manager.getQuantifier(fml).kind === QUANTIFIER_FORALL
265
+ ? manager.getQuantifier(fml).body
266
+ : fml;
267
+ const index = manager.freeVarBounds[matrix];
268
+ if (manager.getOp(matrix) !== OP_IMPLIES) return { index, head: this.ensureApp(matrix) };
269
+ const args = new RefVector(manager);
270
+ args.push(manager.getArg(matrix, 0));
271
+ flattenAndVector(manager, args);
272
+ for (const arg of args.items) body.push(this.pin(this.ensureApp(arg)));
273
+ args.reset();
274
+ return { index, head: this.ensureApp(manager.getArg(matrix, 1)) };
275
+ }
276
+
277
+ private hoistCompound(index: { value: number }, fml: number, body: number[]): number {
278
+ const manager = this.manager;
279
+ if (manager.isNot(fml))
280
+ return manager.mkNot(this.hoistCompound(index, this.ensureApp(manager.getArg(fml, 0)), body));
281
+ if (!this.context.isPredicate(fml)) return fml;
282
+ const args = manager.getArgs(fml).map((arg) => {
283
+ if (manager.kinds[arg] !== KIND_APP || manager.isValue(arg)) return arg;
284
+ const variable = manager.mkVar(index.value++, manager.sorts[arg]);
285
+ body.push(this.pin(manager.mkEq(variable, arg)));
286
+ return variable;
287
+ });
288
+ return manager.mkApp(manager.decls[fml], args, SORT_BOOL);
289
+ }
290
+
291
+ ensureApp(expr: number) {
292
+ const manager = this.manager;
293
+ return manager.kinds[expr] === KIND_APP ? expr : manager.mkEq(expr, manager.trueExpr);
294
+ }
295
+
296
+ private checkValidHead(head: number) {
297
+ const manager = this.manager;
298
+ if (!this.context.isPredicate(head))
299
+ throw new SmtTacticError(`Illegal head. The head predicate needs to be uninterpreted`);
300
+ for (const arg of manager.getArgs(head))
301
+ if (manager.kinds[arg] !== KIND_VAR && !manager.isValue(arg))
302
+ throw new SmtTacticError("Illegal argument to predicate in head");
303
+ }
304
+
305
+ mk(
306
+ head: number,
307
+ tail: readonly number[],
308
+ isNegated: readonly boolean[],
309
+ name?: string,
310
+ isNormalizing = true,
311
+ ) {
312
+ const manager = this.manager;
313
+ const size = tail.length;
314
+ const entries: number[] = Array.from({ length: size }, () => -1);
315
+ const negated: boolean[] = Array.from({ length: size }, () => false);
316
+ let uninterpreted = 0;
317
+ let interpreted = size;
318
+ for (let index = 0; index < size; index++) {
319
+ let current = tail[index];
320
+ let isNeg = isNegated[index] ?? false;
321
+ if (isNeg && !this.context.isPredicate(current)) {
322
+ current = manager.mkNot(current);
323
+ isNeg = false;
324
+ }
325
+ this.pin(current);
326
+ if (this.context.isPredicate(current)) {
327
+ entries[uninterpreted] = current;
328
+ negated[uninterpreted++] = isNeg;
329
+ } else {
330
+ entries[--interpreted] = current;
331
+ negated[interpreted] = false;
332
+ }
333
+ }
334
+ let positive = 0;
335
+ let end = uninterpreted;
336
+ while (positive !== end) {
337
+ if (!negated[positive]) {
338
+ positive++;
339
+ continue;
340
+ }
341
+ end--;
342
+ [entries[positive], entries[end]] = [entries[end], entries[positive]];
343
+ [negated[positive], negated[end]] = [negated[end], negated[positive]];
344
+ }
345
+ const rule = new Rule(this.pin(head), entries, negated, uninterpreted, positive, name);
346
+ if (isNormalizing) this.normVars(rule);
347
+ return rule;
348
+ }
349
+
350
+ normVars(rule: Rule) {
351
+ const manager = this.manager;
352
+ const used = getRuleVars(manager, rule);
353
+ if (used.every((sort) => sort !== undefined)) return;
354
+ let next = 0;
355
+ const substitution = used.map((sort) =>
356
+ sort === undefined ? -1 : manager.mkVar(next++, sort),
357
+ );
358
+ const subst = new VarSubst(manager, false);
359
+ rule.head = this.pin(this.ensureApp(subst.apply(rule.head, substitution)));
360
+ for (let index = 0; index < rule.tail.length; index++)
361
+ rule.tail[index] = this.pin(this.ensureApp(subst.apply(rule.tail[index], substitution)));
362
+ subst.release();
363
+ }
364
+
365
+ toFormula(rule: Rule) {
366
+ const manager = this.manager;
367
+ const body = rule.tail.map((literal, index) =>
368
+ rule.isNegated[index] ? manager.mkNot(literal) : literal,
369
+ );
370
+ const matrix =
371
+ body.length === 0
372
+ ? rule.head
373
+ : manager.mkApp(
374
+ OP_IMPLIES,
375
+ [body.length === 1 ? body[0] : manager.mkApp(OP_AND, body, SORT_BOOL), rule.head],
376
+ SORT_BOOL,
377
+ );
378
+ const used = getUsedVars(manager, [matrix]);
379
+ if (used.length === 0) return matrix;
380
+ const sorts = used.map((sort) => sort ?? SORT_BOOL).reverse();
381
+ return mkForall(
382
+ manager,
383
+ sorts,
384
+ sorts.map((_value, index) => getVarName(index)),
385
+ matrix,
386
+ );
387
+ }
388
+
389
+ hasQuantifiers(rule: Rule) {
390
+ const manager = this.manager;
391
+ for (let index = rule.uninterpretedSize; index < rule.tail.length; index++)
392
+ if (manager.hasQuantifierFlags[rule.tail[index]]) return true;
393
+ return false;
394
+ }
395
+
396
+ mkQuery(query: number, rules: RuleSet) {
397
+ const manager = this.manager;
398
+ const names: string[] = [];
399
+ const sorts: number[] = [];
400
+ const hoister = new QuantifierHoister(manager);
401
+ let body = this.pin(
402
+ hoister.pullQuantifierBound(false, this.context.bindVars(query, false), sorts, names),
403
+ );
404
+ hoister.release();
405
+ let vars = getUsedVars(manager, [body]);
406
+ while (vars.includes(undefined)) {
407
+ let next = 0;
408
+ const args = vars.map((sort) =>
409
+ sort === undefined ? manager.mkVar(0, SORT_BOOL) : manager.mkVar(next++, sort),
410
+ );
411
+ const subst = new VarSubst(manager, false);
412
+ body = this.pin(subst.apply(body, args));
413
+ subst.release();
414
+ vars = getUsedVars(manager, [body]);
415
+ }
416
+ if (manager.kinds[body] !== KIND_APP) throw new SmtTacticError("Query body is not well-formed");
417
+ while (vars.length > names.length) names.push(String(names.length));
418
+ const domain = (vars as number[]).slice().reverse();
419
+ names.reverse();
420
+ const queryPredicate = this.context.mkFreshHeadPredicate("query", "", domain);
421
+ rules.setOutputPredicate(queryPredicate);
422
+ this.context.addGenericModelConverter([{ decl: queryPredicate, def: -1 }]);
423
+ const head = manager.mkApp(
424
+ queryPredicate,
425
+ domain.map((sort, index) => manager.mkVar(domain.length - index - 1, sort)),
426
+ SORT_BOOL,
427
+ );
428
+ const implication = manager.mkApp(OP_IMPLIES, [body, head], SORT_BOOL);
429
+ this.mkRule(
430
+ domain.length === 0 ? implication : mkForall(manager, domain, names, implication),
431
+ rules,
432
+ );
433
+ return queryPredicate;
434
+ }
435
+
436
+ fixUnboundVars(rule: Rule, isTryingQe: boolean) {
437
+ const reduced = this.context.reduceUnboundVars(rule);
438
+ const manager = this.manager;
439
+ if (!this.context.isFixingUnboundVars()) return reduced;
440
+ if (reduced.uninterpretedSize === reduced.tail.length) return reduced;
441
+ const counted = getUsedVars(manager, [
442
+ reduced.head,
443
+ ...reduced.tail.slice(0, reduced.uninterpretedSize),
444
+ ]);
445
+ const tail = reduced.tail.slice(0, reduced.uninterpretedSize);
446
+ const isNegated = reduced.isNegated.slice(0, reduced.uninterpretedSize);
447
+ const unbound = new Set<number>();
448
+ const withUnbound: number[] = [];
449
+ for (let index = reduced.uninterpretedSize; index < reduced.tail.length; index++) {
450
+ const literal = reduced.tail[index];
451
+ let hasUnbound = false;
452
+ getUsedVars(manager, [literal]).forEach((sort, varIndex) => {
453
+ if (sort !== undefined && counted[varIndex] === undefined) {
454
+ hasUnbound = true;
455
+ unbound.add(varIndex);
456
+ }
457
+ });
458
+ if (hasUnbound) withUnbound.push(literal);
459
+ else {
460
+ tail.push(literal);
461
+ isNegated.push(false);
462
+ }
463
+ }
464
+ if (withUnbound.length === 0) return reduced;
465
+ const unboundTail = this.pin(manager.mkAnd(withUnbound));
466
+ // Z3 numbers the substitution by the used variables only, so a gap in the indexes shifts it.
467
+ const subst: number[] = [];
468
+ const sorts: number[] = [];
469
+ let quantifiedIndex = 0;
470
+ getRuleVars(manager, reduced).forEach((sort, index) => {
471
+ if (sort === undefined) return;
472
+ if (unbound.has(index)) sorts.push(sort);
473
+ subst.push(
474
+ manager.mkVar(unbound.has(index) ? quantifiedIndex++ : index + unbound.size, sort),
475
+ );
476
+ });
477
+ const varSubst = new VarSubst(manager, false);
478
+ const preQuant = this.pin(varSubst.apply(unboundTail, subst));
479
+ varSubst.release();
480
+ sorts.reverse();
481
+ const names = sorts.map((_value, index) => String(sorts.length - 1 - index));
482
+ const quantified = this.pin(mkExists(manager, sorts, names, preQuant));
483
+ let fixed = isTryingQe ? this.pin(simplifyQuantifiers(manager, quantified)) : quantified;
484
+ if (manager.kinds[fixed] !== KIND_APP) fixed = this.pin(manager.mkEq(fixed, manager.trueExpr));
485
+ if (!manager.isTrue(fixed)) {
486
+ tail.push(fixed);
487
+ isNegated.push(false);
488
+ }
489
+ return this.mk(reduced.head, tail, isNegated, reduced.name);
490
+ }
491
+ }
492
+
493
+ // rule_manager::to_formula names the variables A, B, ..., Z, A1, ...
494
+ const getVarName = (index: number) =>
495
+ `${String.fromCharCode(65 + (index % 26))}${index < 26 ? "" : Math.floor(index / 26)}`;
@@ -0,0 +1,201 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_USER,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ KIND_VAR,
7
+ OP_AND,
8
+ OP_IMPLIES,
9
+ OP_OR,
10
+ SORT_BOOL,
11
+ QUANTIFIER_FORALL,
12
+ } from "../ast";
13
+ import { flattenAndVector, mkNot } from "../ast-util";
14
+ import { QuantifierHoister } from "../quant-hoist";
15
+ import { RefVector } from "../ref-vector";
16
+ import { mkForall, getUsedVars } from "./dl-rule";
17
+
18
+ export class Hnf {
19
+ private name = "P";
20
+ private sorts: number[] = [];
21
+ private names: string[] = [];
22
+ private todo: number[] = [];
23
+ private memoizedDisjunctions = new Map<number, number>();
24
+ freshPredicates: number[] = [];
25
+
26
+ constructor(private manager: AstManager) {}
27
+
28
+ setName(name: string | undefined) {
29
+ this.name = name ?? "P";
30
+ }
31
+
32
+ private isPredicate(expr: number) {
33
+ const manager = this.manager;
34
+ return (
35
+ manager.kinds[expr] === KIND_APP &&
36
+ manager.sorts[expr] === SORT_BOOL &&
37
+ manager.getFamily(expr) === FAMILY_USER
38
+ );
39
+ }
40
+
41
+ private containsPredicate(expr: number) {
42
+ const manager = this.manager;
43
+ const visited = new Set<number>();
44
+ const todo = [expr];
45
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
46
+ if (visited.has(current)) continue;
47
+ visited.add(current);
48
+ const kind = manager.kinds[current];
49
+ if (kind === KIND_QUANTIFIER) {
50
+ const quantifier = manager.getQuantifier(current);
51
+ todo.push(quantifier.body, ...quantifier.patterns, ...quantifier.noPatterns);
52
+ } else if (kind === KIND_APP) {
53
+ if (this.isPredicate(current)) return true;
54
+ manager.pushArgs(current, todo);
55
+ }
56
+ }
57
+ return false;
58
+ }
59
+
60
+ private isHorn(expr: number) {
61
+ const manager = this.manager;
62
+ let current = expr;
63
+ while (
64
+ manager.kinds[current] === KIND_QUANTIFIER &&
65
+ manager.getQuantifier(current).kind === QUANTIFIER_FORALL
66
+ )
67
+ current = manager.getQuantifier(current).body;
68
+ if (manager.getOp(current) !== OP_IMPLIES) return false;
69
+ const premise = manager.getArg(current, 0);
70
+ if (!this.isPredicate(manager.getArg(current, 1))) return false;
71
+ if (manager.kinds[premise] === KIND_VAR) return true;
72
+ if (manager.kinds[premise] === KIND_QUANTIFIER) return false;
73
+ const args = manager.getOp(premise) === OP_AND ? manager.getArgs(premise) : [premise];
74
+ return args.every((arg) => this.isPredicate(arg) || !this.containsPredicate(arg));
75
+ }
76
+
77
+ apply(expr: number) {
78
+ this.freshPredicates = [];
79
+ if (this.isHorn(expr)) return [expr];
80
+ this.todo = [expr];
81
+ this.memoizedDisjunctions.clear();
82
+ const result: number[] = [];
83
+ for (let fml = this.todo.pop(); fml !== undefined; fml = this.todo.pop()) {
84
+ this.manager.limit.checkpoint();
85
+ const horn = this.mkHorn(fml);
86
+ if (horn !== -1) result.push(horn);
87
+ }
88
+ return result;
89
+ }
90
+
91
+ private pin(expr: number) {
92
+ this.manager.incRef(expr);
93
+ return expr;
94
+ }
95
+
96
+ private mkHorn(fml: number) {
97
+ const manager = this.manager;
98
+ this.sorts = [];
99
+ this.names = [];
100
+ const hoister = new QuantifierHoister(manager);
101
+ let head = hoister.pullQuantifierBound(true, fml, this.sorts, this.names);
102
+ hoister.release();
103
+ const body = new RefVector(manager);
104
+ while (manager.getOp(head) === OP_IMPLIES) {
105
+ body.push(manager.getArg(head, 0));
106
+ head = manager.getArg(head, 1);
107
+ }
108
+ flattenAndVector(manager, body);
109
+ if (
110
+ body.size === 1 &&
111
+ manager.getOp(body.items[0]) === OP_OR &&
112
+ this.containsPredicate(body.items[0])
113
+ ) {
114
+ for (const arg of manager.getArgs(body.items[0]))
115
+ this.todo.push(this.pin(this.bindVariables(this.mkImplies([arg], head))));
116
+ body.reset();
117
+ return -1;
118
+ }
119
+ for (let index = 0; index < body.size; index++)
120
+ body.set(index, this.eliminateDisjunctions(body.items[index]));
121
+ for (let index = 0; index < body.size; index++)
122
+ body.set(index, this.eliminateQuantifierBody(body.items[index]));
123
+ const result = this.pin(this.bindVariables(this.mkImplies(body.items, head)));
124
+ body.reset();
125
+ return result;
126
+ }
127
+
128
+ private eliminateDisjunctions(expr: number) {
129
+ const manager = this.manager;
130
+ if (!this.containsPredicate(expr)) return expr;
131
+ const disjuncts =
132
+ manager.getOp(expr) === OP_OR
133
+ ? manager.getArgs(expr)
134
+ : manager.isNot(expr) && manager.getOp(manager.getArg(expr, 0)) === OP_AND
135
+ ? manager.getArgs(manager.getArg(expr, 0)).map((arg) => manager.mkNot(arg))
136
+ : manager.getOp(expr) === OP_IMPLIES
137
+ ? [mkNot(manager, manager.getArg(expr, 0)), manager.getArg(expr, 1)]
138
+ : undefined;
139
+ if (disjuncts === undefined) return expr;
140
+ const memoized = this.memoizedDisjunctions.get(expr);
141
+ if (memoized !== undefined) return memoized;
142
+ const head = this.pin(this.mkFreshHead(expr));
143
+ for (const disjunct of disjuncts)
144
+ this.todo.push(
145
+ this.pin(this.bindVariables(manager.mkApp(OP_IMPLIES, [disjunct, head], SORT_BOOL))),
146
+ );
147
+ this.pin(expr);
148
+ this.memoizedDisjunctions.set(expr, head);
149
+ return head;
150
+ }
151
+
152
+ private eliminateQuantifierBody(expr: number) {
153
+ const manager = this.manager;
154
+ if (
155
+ manager.kinds[expr] !== KIND_QUANTIFIER ||
156
+ manager.getQuantifier(expr).kind !== QUANTIFIER_FORALL ||
157
+ !this.containsPredicate(expr)
158
+ )
159
+ return expr;
160
+ const data = manager.getQuantifier(expr);
161
+ if (this.isPredicate(data.body)) return expr;
162
+ const head = this.mkFreshHead(data.body);
163
+ this.todo.push(
164
+ this.pin(this.bindVariables(manager.mkApp(OP_IMPLIES, [data.body, head], SORT_BOOL))),
165
+ );
166
+ return manager.mkQuantifier({ ...data, body: head });
167
+ }
168
+
169
+ private mkFreshHead(expr: number) {
170
+ const manager = this.manager;
171
+ const used = getUsedVars(manager, [expr]);
172
+ const args: number[] = [];
173
+ used.forEach((sort, index) => {
174
+ if (sort !== undefined) args.push(manager.mkVar(index, sort));
175
+ });
176
+ // Z3 passes an empty suffix that is not the null symbol, so the name has two separators.
177
+ const decl = manager.mkFreshFuncDecl(
178
+ `${this.name}!`,
179
+ args.map((arg) => manager.sorts[arg]),
180
+ SORT_BOOL,
181
+ );
182
+ manager.incDeclRef(decl);
183
+ this.freshPredicates.push(decl);
184
+ return manager.mkApp(decl, args, SORT_BOOL);
185
+ }
186
+
187
+ private mkImplies(body: readonly number[], head: number) {
188
+ const manager = this.manager;
189
+ return body.length === 0
190
+ ? head
191
+ : manager.mkApp(
192
+ OP_IMPLIES,
193
+ [body.length === 1 ? body[0] : manager.mkApp(OP_AND, [...body], SORT_BOOL), head],
194
+ SORT_BOOL,
195
+ );
196
+ }
197
+
198
+ private bindVariables(expr: number) {
199
+ return this.sorts.length === 0 ? expr : mkForall(this.manager, this.sorts, this.names, expr);
200
+ }
201
+ }