tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  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 +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,216 @@
1
+ import { SmtTacticError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_ARITH,
5
+ FAMILY_BASIC,
6
+ KIND_APP,
7
+ OP_AND,
8
+ OP_ATAN2,
9
+ OP_DISTINCT,
10
+ OP_EQ,
11
+ OP_FALSE,
12
+ OP_GE,
13
+ OP_IMPLIES,
14
+ OP_ITE,
15
+ OP_LE,
16
+ OP_NOT,
17
+ OP_OR,
18
+ OP_PI,
19
+ OP_TRUE,
20
+ OP_XOR,
21
+ SORT_BOOL,
22
+ SORT_INT,
23
+ SORT_REAL,
24
+ } from "./ast";
25
+ import { Expr2Polynomial } from "./expr2polynomial";
26
+ import { getLcm } from "./rational";
27
+ import { flipKind } from "./nlsat/atoms";
28
+ import { Factors, type Polynomial, PolynomialRef } from "./nlsat/polynomial";
29
+ import type { NlsatSolver } from "./nlsat/solver";
30
+ import { TRANSCENDENTAL_OPS } from "./nlsat/transcendental-eval";
31
+ import type { IneqKind } from "./nlsat/types";
32
+
33
+ export const goal2nlsat = (
34
+ manager: AstManager,
35
+ forms: readonly number[],
36
+ solver: NlsatSolver,
37
+ t2x: Map<number, number>,
38
+ a2b: Map<number, number>,
39
+ assumption: number | null,
40
+ isFactoring = true,
41
+ ) => {
42
+ const pm = solver.pm;
43
+ const expr2poly = new Expr2Polynomial(manager, pm, t2x, (isInt) => solver.mkVar(isInt));
44
+
45
+ const factorAtom = (polynomial: Polynomial, kind: IneqKind) => {
46
+ const factors = new Factors(pm);
47
+ pm.factor(polynomial, factors);
48
+ const literal = solver.mkIneqLiteral(
49
+ factors.constant < 0n ? flipKind(kind) : kind,
50
+ factors.factors,
51
+ factors.degrees.map((degree) => degree % 2 === 0),
52
+ );
53
+ factors.reset();
54
+ return literal;
55
+ };
56
+
57
+ const processIneqPolynomial = (p: PolynomialRef, kind: IneqKind) => {
58
+ const polynomial = p.get();
59
+ if (pm.isConst(polynomial)) {
60
+ const sign = pm.isZero(polynomial) ? 0 : polynomial.as[0] > 0n ? 1 : -1;
61
+ const isTrue = kind === "EQ" ? sign === 0 : kind === "LT" ? sign < 0 : sign > 0;
62
+ return isTrue ? 0 : 1;
63
+ }
64
+ return isFactoring
65
+ ? factorAtom(polynomial, kind)
66
+ : solver.mkIneqLiteral(kind, [polynomial], [false]);
67
+ };
68
+
69
+ const processIneq = (atom: number, kind: IneqKind) => {
70
+ const first = new PolynomialRef(pm);
71
+ const second = new PolynomialRef(pm);
72
+ const p = new PolynomialRef(pm);
73
+ const firstDenominator = expr2poly.toPolynomial(manager.getArg(atom, 0), first);
74
+ const secondDenominator = expr2poly.toPolynomial(manager.getArg(atom, 1), second);
75
+ const lcm = getLcm(firstDenominator, secondDenominator);
76
+ p.set(
77
+ pm.addmulTerms(
78
+ lcm / firstDenominator,
79
+ pm.unit,
80
+ first.get(),
81
+ -(lcm / secondDenominator),
82
+ pm.unit,
83
+ second.get(),
84
+ ),
85
+ );
86
+ const literal = processIneqPolynomial(p, kind);
87
+ p.reset();
88
+ second.reset();
89
+ first.reset();
90
+ return literal;
91
+ };
92
+
93
+ const processBoolVar = (atom: number) => {
94
+ const existing = a2b.get(atom);
95
+ if (existing !== undefined) return 2 * existing;
96
+ const boolVar = solver.mkBoolVar();
97
+ a2b.set(atom, boolVar);
98
+ return 2 * boolVar;
99
+ };
100
+
101
+ const processAtom = (atom: number) => {
102
+ if (manager.kinds[atom] !== KIND_APP) return processBoolVar(atom);
103
+ const op = manager.getOp(atom);
104
+ const family = manager.getFamily(atom);
105
+ if (op === OP_EQ) {
106
+ const sort = manager.sorts[manager.getArg(atom, 0)];
107
+ return sort === SORT_INT || sort === SORT_REAL
108
+ ? processIneq(atom, "EQ")
109
+ : processBoolVar(atom);
110
+ }
111
+ if (op === OP_LE) return processIneq(atom, "GT") ^ 1;
112
+ if (op === OP_GE) return processIneq(atom, "LT") ^ 1;
113
+ if (family === FAMILY_BASIC) {
114
+ if (op === OP_TRUE || op === OP_FALSE)
115
+ throw new SmtTacticError("apply simplify before applying nlsat");
116
+ if ([OP_AND, OP_OR, OP_XOR, OP_NOT, OP_IMPLIES, OP_ITE].includes(op))
117
+ throw new SmtTacticError("convert goal into cnf before applying nlsat");
118
+ if (op === OP_DISTINCT)
119
+ throw new SmtTacticError(
120
+ "eliminate distinct operator (use tactic '(using-params simplify :blast-distinct true)') before applying nlsat",
121
+ );
122
+ }
123
+ if (family === FAMILY_ARITH)
124
+ throw new SmtTacticError("apply purify-arith before applying nlsat");
125
+ return processBoolVar(atom);
126
+ };
127
+
128
+ const processLiteral = (form: number) => {
129
+ let atom = form;
130
+ let isNeg = false;
131
+ while (manager.isNot(atom)) {
132
+ atom = manager.getArg(atom, 0);
133
+ isNeg = !isNeg;
134
+ }
135
+ const literal = processAtom(atom);
136
+ return isNeg ? literal ^ 1 : literal;
137
+ };
138
+
139
+ if (forms.some((form) => hasTermIte(manager, form)))
140
+ throw new SmtTacticError("eliminate term-ite before applying nlsat");
141
+ for (const form of forms) {
142
+ const literals = manager.getOp(form) === OP_OR ? manager.getArgs(form) : [form];
143
+ solver.mkExternalClause(literals.map(processLiteral), assumption);
144
+ }
145
+
146
+ // The polynomial conversion treats a transcendental application, argument included, as one
147
+ // variable, so its argument gets a variable here, through an equation unless it is one already.
148
+ const mkArgVar = (term: number) => {
149
+ const p = new PolynomialRef(pm);
150
+ const denominator = expr2poly.toPolynomial(term, p);
151
+ const polynomial = p.get();
152
+ const monomial = polynomial.ms[0];
153
+ if (
154
+ denominator === 1n &&
155
+ polynomial.ms.length === 1 &&
156
+ polynomial.as[0] === 1n &&
157
+ monomial.size === 1 &&
158
+ monomial.degrees[0] === 1
159
+ ) {
160
+ p.reset();
161
+ return monomial.vars[0];
162
+ }
163
+ const variable = solver.mkVar(false);
164
+ const vp = new PolynomialRef(pm);
165
+ const equation = new PolynomialRef(pm);
166
+ vp.set(pm.mkVar(variable));
167
+ equation.set(pm.addmulTerms(denominator, pm.unit, vp.get(), -1n, pm.unit, polynomial));
168
+ solver.mkExternalClause([solver.mkIneqLiteral("EQ", [equation.get()], [false])], null);
169
+ equation.reset();
170
+ vp.reset();
171
+ p.reset();
172
+ return variable;
173
+ };
174
+
175
+ // An argument can bring in applications nested inside it, so this repeats to a fixed point.
176
+ const seen = new Set<number>();
177
+ let piVar: number | undefined;
178
+ for (let isChanged = true; isChanged;) {
179
+ const found = [...t2x].filter(
180
+ (entry) =>
181
+ !seen.has(entry[0]) &&
182
+ manager.kinds[entry[0]] === KIND_APP &&
183
+ manager.getFamily(entry[0]) === FAMILY_ARITH,
184
+ );
185
+ const atan2Found = found.filter((entry) => manager.getOp(entry[0]) === OP_ATAN2);
186
+ piVar = found.find((entry) => manager.getOp(entry[0]) === OP_PI)?.[1] ?? piVar;
187
+ isChanged = false;
188
+ for (const [term, variable] of found) {
189
+ const op = TRANSCENDENTAL_OPS.get(manager.getOp(term));
190
+ if (op === undefined) continue;
191
+ seen.add(term);
192
+ solver.transcendentals.add(op, mkArgVar(manager.getArg(term, 0)), variable);
193
+ isChanged = true;
194
+ }
195
+ for (const [term, variable] of atan2Found) {
196
+ seen.add(term);
197
+ const y = mkArgVar(manager.getArg(term, 0));
198
+ solver.transcendentals.addAtan2(y, mkArgVar(manager.getArg(term, 1)), variable);
199
+ isChanged = true;
200
+ }
201
+ }
202
+ if (piVar !== undefined) solver.transcendentals.addPi(piVar);
203
+ expr2poly.release();
204
+ };
205
+
206
+ const hasTermIte = (manager: AstManager, form: number) => {
207
+ const seen = new Set<number>();
208
+ const todo = [form];
209
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
210
+ if (seen.has(expr) || manager.kinds[expr] !== KIND_APP) continue;
211
+ seen.add(expr);
212
+ if (manager.getOp(expr) === OP_ITE && manager.sorts[expr] !== SORT_BOOL) return true;
213
+ manager.pushArgs(expr, todo);
214
+ }
215
+ return false;
216
+ };
@@ -0,0 +1,219 @@
1
+ import {
2
+ type AstManager,
3
+ OP_AND,
4
+ OP_EQ,
5
+ OP_NOT,
6
+ OP_OR,
7
+ SORT_BOOL,
8
+ SORT_INT,
9
+ SORT_REAL,
10
+ } from "./ast";
11
+ import { assign, release } from "./expr-ref";
12
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
13
+ import { Rational } from "./rational";
14
+ import { RefVector } from "./ref-vector";
15
+ import {
16
+ type RangePredicate,
17
+ guardToRangePredicate,
18
+ intersectRanges,
19
+ mkTopRange,
20
+ } from "./seq-range-predicate";
21
+
22
+ export interface GuardSetEval {
23
+ status: number;
24
+ witness: number;
25
+ }
26
+
27
+ export class GuardSetCache {
28
+ private ranges = new Map<number, RangePredicate | undefined>();
29
+ private trail: RefVector;
30
+
31
+ constructor(manager: AstManager) {
32
+ this.trail = new RefVector(manager);
33
+ }
34
+
35
+ reset() {
36
+ this.ranges.clear();
37
+ this.trail.reset();
38
+ }
39
+
40
+ maybeReset(cap: number) {
41
+ if (this.ranges.size > cap) this.reset();
42
+ }
43
+
44
+ has(guard: number) {
45
+ return this.ranges.has(guard);
46
+ }
47
+
48
+ get(guard: number) {
49
+ return this.ranges.get(guard);
50
+ }
51
+
52
+ insert(guard: number, ranges: RangePredicate | undefined) {
53
+ this.trail.push(guard);
54
+ this.ranges.set(guard, ranges);
55
+ }
56
+ }
57
+
58
+ export class GuardSet {
59
+ private isChar: boolean;
60
+ private isOk = true;
61
+ private ranges: RangePredicate;
62
+ private guard = -1;
63
+
64
+ constructor(
65
+ private manager: AstManager,
66
+ private sort: number,
67
+ private variable: number,
68
+ private cache?: GuardSetCache,
69
+ ) {
70
+ this.isChar = manager.isCharSort(sort);
71
+ this.ranges = this.isChar ? mkTopRange(manager) : [];
72
+ if (!this.isChar) this.guard = assign(manager, -1, manager.trueExpr);
73
+ }
74
+
75
+ release() {
76
+ release(this.manager, this.guard);
77
+ this.guard = -1;
78
+ }
79
+
80
+ clone() {
81
+ const copy = new GuardSet(this.manager, this.sort, this.variable, this.cache);
82
+ copy.isOk = this.isOk;
83
+ copy.ranges = this.ranges;
84
+ if (!this.isChar) copy.guard = assign(this.manager, copy.guard, this.guard);
85
+ return copy;
86
+ }
87
+
88
+ conjoin(guard: number) {
89
+ const manager = this.manager;
90
+ if (!this.isOk) return;
91
+ if (!this.isChar) {
92
+ this.guard = assign(
93
+ manager,
94
+ this.guard,
95
+ manager.mkApp(OP_AND, [this.guard, guard], SORT_BOOL),
96
+ );
97
+ return;
98
+ }
99
+ const cache = this.cache;
100
+ if (cache !== undefined) {
101
+ if (!cache.has(guard))
102
+ cache.insert(guard, guardToRangePredicate(manager, this.variable, guard));
103
+ const cached = cache.get(guard);
104
+ if (cached === undefined) {
105
+ this.isOk = false;
106
+ return;
107
+ }
108
+ this.ranges = intersectRanges(this.ranges, cached);
109
+ return;
110
+ }
111
+ const ranges = guardToRangePredicate(manager, this.variable, guard);
112
+ if (ranges === undefined) this.isOk = false;
113
+ else this.ranges = intersectRanges(this.ranges, ranges);
114
+ }
115
+
116
+ eval(isWitnessWanted: boolean): GuardSetEval {
117
+ if (!this.isOk) return { status: L_UNDEF, witness: -1 };
118
+ if (!this.isChar) return this.evalGeneric(isWitnessWanted);
119
+ if (this.ranges.length === 0) return { status: L_FALSE, witness: -1 };
120
+ return {
121
+ status: L_TRUE,
122
+ witness: isWitnessWanted ? this.manager.mkChar(this.ranges[0]) : -1,
123
+ };
124
+ }
125
+
126
+ private collectConsts(guard: number, consts: number[]) {
127
+ const manager = this.manager;
128
+ const op = manager.getOp(guard);
129
+ if (op === OP_AND || op === OP_OR) {
130
+ for (const arg of manager.getArgs(guard)) this.collectConsts(arg, consts);
131
+ return;
132
+ }
133
+ if (op === OP_NOT) {
134
+ this.collectConsts(manager.getArg(guard, 0), consts);
135
+ return;
136
+ }
137
+ if (op !== OP_EQ) return;
138
+ const first = manager.getArg(guard, 0);
139
+ const second = manager.getArg(guard, 1);
140
+ if (first === this.variable && second !== this.variable) consts.push(second);
141
+ else if (second === this.variable && first !== this.variable) consts.push(first);
142
+ }
143
+
144
+ private evalAt(guard: number, candidate: number): number {
145
+ const manager = this.manager;
146
+ if (manager.isTrue(guard)) return L_TRUE;
147
+ if (manager.isFalse(guard)) return L_FALSE;
148
+ const op = manager.getOp(guard);
149
+ if (op === OP_NOT) return -this.evalAt(manager.getArg(guard, 0), candidate);
150
+ if (op === OP_AND || op === OP_OR) {
151
+ const absorbing = op === OP_AND ? L_FALSE : L_TRUE;
152
+ let result = -absorbing;
153
+ for (const arg of manager.getArgs(guard)) {
154
+ const value = this.evalAt(arg, candidate);
155
+ if (value === absorbing) return absorbing;
156
+ if (value === L_UNDEF) result = L_UNDEF;
157
+ }
158
+ return result;
159
+ }
160
+ if (op !== OP_EQ) return L_UNDEF;
161
+ const first = manager.getArg(guard, 0);
162
+ const second = manager.getArg(guard, 1);
163
+ const other = first === this.variable ? second : second === this.variable ? first : -1;
164
+ if (other === -1) return L_UNDEF;
165
+ if (other === this.variable) return L_TRUE;
166
+ return candidate === other ? L_TRUE : L_FALSE;
167
+ }
168
+
169
+ private mkFresh(consts: number[]) {
170
+ const manager = this.manager;
171
+ const sort = this.sort;
172
+ if (sort === SORT_BOOL) {
173
+ if (!consts.some((expr) => manager.isTrue(expr))) return manager.trueExpr;
174
+ if (!consts.some((expr) => manager.isFalse(expr))) return manager.falseExpr;
175
+ return -1;
176
+ }
177
+ if (sort === SORT_INT || sort === SORT_REAL) {
178
+ let max: Rational | undefined;
179
+ for (const expr of consts) {
180
+ if (!manager.isNumeral(expr)) continue;
181
+ const value = manager.getRationalValue(expr);
182
+ if (max === undefined || value.compare(max) > 0) max = value;
183
+ }
184
+ return manager.mkNumeralOfSort(
185
+ max === undefined ? Rational.zero : max.add(Rational.one),
186
+ sort,
187
+ );
188
+ }
189
+ if (!manager.isBvSort(sort)) return -1;
190
+ const width = manager.getBvSize(sort);
191
+ for (let candidate = 0n; candidate <= BigInt(consts.length); candidate++)
192
+ if (
193
+ !consts.some(
194
+ (expr) => manager.isBvNumeral(expr) && manager.getBvNumeralValue(expr) === candidate,
195
+ )
196
+ )
197
+ return manager.mkBvNumeral(candidate, width);
198
+ return -1;
199
+ }
200
+
201
+ private evalGeneric(isWitnessWanted: boolean): GuardSetEval {
202
+ const consts: number[] = [];
203
+ this.collectConsts(this.guard, consts);
204
+ let isUndefined = false;
205
+ for (const candidate of consts) {
206
+ const value = this.evalAt(this.guard, candidate);
207
+ if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? candidate : -1 };
208
+ if (value === L_UNDEF) isUndefined = true;
209
+ }
210
+ const fresh = this.mkFresh(consts);
211
+ if (fresh === -1) isUndefined = true;
212
+ else {
213
+ const value = this.evalAt(this.guard, fresh);
214
+ if (value === L_TRUE) return { status: L_TRUE, witness: isWitnessWanted ? fresh : -1 };
215
+ if (value === L_UNDEF) isUndefined = true;
216
+ }
217
+ return { status: isUndefined ? L_UNDEF : L_FALSE, witness: -1 };
218
+ }
219
+ }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hash.h, src/util/hash.cpp), MIT license, see z3-license.txt.
2
1
  const GOLDEN_RATIO = 0x9e3779b9;
3
2
 
4
3
  const mix = (state: Uint32Array) => {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/util/hashtable.h, src/util/obj_hashtable.h), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
 
4
3
  const INITIAL_CAPACITY = 8;
@@ -10,14 +9,20 @@ const USED = 2;
10
9
  export const getIdentityHash = (key: number) => key;
11
10
 
12
11
  export class ObjMap<V> {
13
- private capacity = INITIAL_CAPACITY;
14
- private states = new Uint8Array(INITIAL_CAPACITY);
12
+ private capacity: number;
13
+ private states: Uint8Array;
15
14
  private slotKeys: number[] = [];
16
- private values: V[] = [];
15
+ private slotValues: V[] = [];
17
16
  private numDeleted = 0;
18
17
  size = 0;
19
18
 
20
- constructor(private getHash: (key: number) => number) {}
19
+ constructor(
20
+ private getHash: (key: number) => number,
21
+ initialCapacity = INITIAL_CAPACITY,
22
+ ) {
23
+ this.capacity = initialCapacity;
24
+ this.states = new Uint8Array(initialCapacity);
25
+ }
21
26
 
22
27
  private findSlot(key: number) {
23
28
  const mask = this.capacity - 1;
@@ -33,11 +38,11 @@ export class ObjMap<V> {
33
38
  private moveTable(capacity: number) {
34
39
  const states = this.states;
35
40
  const keys = this.slotKeys;
36
- const values = this.values;
41
+ const values = this.slotValues;
37
42
  this.capacity = capacity;
38
43
  this.states = new Uint8Array(capacity);
39
44
  this.slotKeys = [];
40
- this.values = [];
45
+ this.slotValues = [];
41
46
  this.numDeleted = 0;
42
47
  const mask = capacity - 1;
43
48
  for (let slot = 0; slot < states.length; slot++) {
@@ -46,7 +51,7 @@ export class ObjMap<V> {
46
51
  while (this.states[target] !== FREE) target = (target + 1) & mask;
47
52
  this.states[target] = USED;
48
53
  this.slotKeys[target] = keys[slot];
49
- this.values[target] = values[slot];
54
+ this.slotValues[target] = values[slot];
50
55
  }
51
56
  }
52
57
 
@@ -56,12 +61,12 @@ export class ObjMap<V> {
56
61
 
57
62
  get(key: number) {
58
63
  const slot = this.findSlot(key);
59
- return slot === -1 ? undefined : this.values[slot];
64
+ return slot === -1 ? undefined : this.slotValues[slot];
60
65
  }
61
66
 
62
67
  replace(key: number, value: V) {
63
68
  const slot = this.findSlot(key);
64
- if (slot !== -1) this.values[slot] = value;
69
+ if (slot !== -1) this.slotValues[slot] = value;
65
70
  }
66
71
 
67
72
  set(key: number, value: V) {
@@ -73,7 +78,7 @@ export class ObjMap<V> {
73
78
  const slot = (begin + offset) & mask;
74
79
  if (this.states[slot] === USED) {
75
80
  if (this.slotKeys[slot] === key) {
76
- this.values[slot] = value;
81
+ this.slotValues[slot] = value;
77
82
  return;
78
83
  }
79
84
  } else if (this.states[slot] === FREE) {
@@ -81,7 +86,7 @@ export class ObjMap<V> {
81
86
  if (deletedSlot !== -1) this.numDeleted--;
82
87
  this.states[target] = USED;
83
88
  this.slotKeys[target] = key;
84
- this.values[target] = value;
89
+ this.slotValues[target] = value;
85
90
  this.size++;
86
91
  return;
87
92
  } else deletedSlot = slot;
@@ -110,14 +115,19 @@ export class ObjMap<V> {
110
115
  if (this.capacity > 16 && overhead << 2 > this.capacity * 3) this.capacity >>= 1;
111
116
  this.states = new Uint8Array(this.capacity);
112
117
  this.slotKeys = [];
113
- this.values = [];
118
+ this.slotValues = [];
114
119
  this.size = 0;
115
120
  this.numDeleted = 0;
116
121
  }
117
122
 
118
123
  *entries(): IterableIterator<[number, V]> {
119
124
  for (let slot = 0; slot < this.capacity; slot++)
120
- if (this.states[slot] === USED) yield [this.slotKeys[slot], this.values[slot]];
125
+ if (this.states[slot] === USED) yield [this.slotKeys[slot], this.slotValues[slot]];
126
+ }
127
+
128
+ *values(): IterableIterator<V> {
129
+ for (let slot = 0; slot < this.capacity; slot++)
130
+ if (this.states[slot] === USED) yield this.slotValues[slot];
121
131
  }
122
132
 
123
133
  *keys(): IterableIterator<number> {
@@ -133,8 +143,8 @@ export class ObjMap<V> {
133
143
  export class ObjHashtable {
134
144
  private map: ObjMap<true>;
135
145
 
136
- constructor(getHash: (key: number) => number) {
137
- this.map = new ObjMap(getHash);
146
+ constructor(getHash: (key: number) => number, initialCapacity = INITIAL_CAPACITY) {
147
+ this.map = new ObjMap(getHash, initialCapacity);
138
148
  }
139
149
 
140
150
  get size() {
@@ -149,6 +159,10 @@ export class ObjHashtable {
149
159
  this.map.set(key, true);
150
160
  }
151
161
 
162
+ delete(key: number) {
163
+ this.map.delete(key);
164
+ }
165
+
152
166
  [Symbol.iterator]() {
153
167
  return this.map.keys();
154
168
  }
@@ -0,0 +1,63 @@
1
+ // A value infinity * oo + value + epsilon * ε, ordered lexicographically.
2
+ import { Rational } from "./rational";
3
+
4
+ export class InfEps {
5
+ static readonly infinity = new InfEps(Rational.one, Rational.zero);
6
+ static readonly minusInfinity = new InfEps(Rational.minusOne, Rational.zero);
7
+
8
+ constructor(
9
+ readonly infinity: Rational,
10
+ readonly value: Rational,
11
+ readonly epsilon: Rational = Rational.zero,
12
+ ) {}
13
+
14
+ static of(value: Rational, epsilon = Rational.zero) {
15
+ return new InfEps(Rational.zero, value, epsilon);
16
+ }
17
+
18
+ isFinite() {
19
+ return this.infinity.isZero();
20
+ }
21
+
22
+ isPositive() {
23
+ return (
24
+ this.infinity.isPositive() ||
25
+ (this.infinity.isZero() &&
26
+ (this.value.isPositive() || (this.value.isZero() && this.epsilon.isPositive())))
27
+ );
28
+ }
29
+
30
+ isNegative() {
31
+ return (
32
+ this.infinity.isNegative() ||
33
+ (this.infinity.isZero() &&
34
+ (this.value.isNegative() || (this.value.isZero() && this.epsilon.isNegative())))
35
+ );
36
+ }
37
+
38
+ compare(other: InfEps) {
39
+ return (
40
+ this.infinity.compare(other.infinity) ||
41
+ this.value.compare(other.value) ||
42
+ this.epsilon.compare(other.epsilon)
43
+ );
44
+ }
45
+
46
+ equals(other: InfEps) {
47
+ return this.compare(other) === 0;
48
+ }
49
+
50
+ add(other: InfEps) {
51
+ return new InfEps(
52
+ this.infinity.add(other.infinity),
53
+ this.value.add(other.value),
54
+ this.epsilon.add(other.epsilon),
55
+ );
56
+ }
57
+ }
58
+
59
+ export const maxInfEps = (first: InfEps, second: InfEps) =>
60
+ first.compare(second) < 0 ? second : first;
61
+
62
+ export const minInfEps = (first: InfEps, second: InfEps) =>
63
+ second.compare(first) < 0 ? second : first;