tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938

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 (568) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +3 -0
  8. package/dist/index.d.ts +3 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,389 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ FAMILY_FPA,
5
+ OP_CONCAT,
6
+ OP_FPA_BV2RM,
7
+ OP_FPA_BVWRAP,
8
+ OP_FPA_FP,
9
+ OP_FPA_TO_FP,
10
+ OP_FPA_TO_IEEE_BV,
11
+ OP_FPA_TO_REAL,
12
+ OP_FPA_TO_SBV,
13
+ OP_FPA_TO_UBV,
14
+ OP_IMPLIES,
15
+ OP_ULEQ,
16
+ SORT_BOOL,
17
+ } from "./ast";
18
+ import { TACTIC_ARITH_OPTIONS } from "./arith-rewriter";
19
+ import { mkBvApp } from "./bv-decl-plugin";
20
+ import { convertMinMaxSpecials, convertUf2BvUf } from "./bv2fpa-converter";
21
+ import type { Context } from "./context";
22
+ import type { Enode } from "./enode";
23
+ import {
24
+ getFpNumeral,
25
+ getRmNumeral,
26
+ mkFpNumeral,
27
+ mkFpNumeralOfBits,
28
+ mkRmNumeral,
29
+ } from "./fpa-decl-plugin";
30
+ import { WrappedFpa2BvConverter } from "./fpa2bv-converter";
31
+ import { Fpa2BvRewriter } from "./fpa2bv-rewriter";
32
+ import { ObjHashtable } from "./hashtable";
33
+ import type { BoolVar } from "./literal";
34
+ import { mkZero } from "./mpf";
35
+ import { ProtoModel } from "./proto-model";
36
+ import { Rewriter } from "./rewriter";
37
+ import { type DependentValue, Theory } from "./theory";
38
+
39
+ const CONVERTED_OPS = new Set([
40
+ OP_FPA_TO_FP,
41
+ OP_FPA_TO_UBV,
42
+ OP_FPA_TO_SBV,
43
+ OP_FPA_TO_REAL,
44
+ OP_FPA_TO_IEEE_BV,
45
+ ]);
46
+
47
+ // m_th_rw, with arith_lhs, and the converter and the rewriter that share it.
48
+ export const mkFpaConversion = (manager: AstManager) => {
49
+ const theoryRewriter = new Rewriter(manager, {
50
+ isEliminatingAnd: false,
51
+ arith: { ...TACTIC_ARITH_OPTIONS, isArithIneqLhs: true },
52
+ isRewritingPatterns: true,
53
+ });
54
+ const simp = new Rewriter(manager, {
55
+ isEliminatingAnd: false,
56
+ arith: TACTIC_ARITH_OPTIONS,
57
+ isRewritingPatterns: false,
58
+ });
59
+ const converter = new WrappedFpa2BvConverter(manager, simp, theoryRewriter);
60
+ return { theoryRewriter, converter, rewriter: new Fpa2BvRewriter(manager, converter) };
61
+ };
62
+
63
+ export const mkRmValue = (manager: AstManager, value: number) => {
64
+ const rm = Number(manager.getBvNumeralValue(value));
65
+ return mkRmNumeral(manager, rm <= 3 ? rm : 4);
66
+ };
67
+
68
+ // fpa2bv_converter_wrapped::bv2fpa_value, of the sign, exponent and significand or of their
69
+ // concatenation.
70
+ export const mkFpValue = (manager: AstManager, sort: number, values: number[]) => {
71
+ const sbits = BigInt(manager.getSbits(sort));
72
+ const parts = values.map((value) => manager.getBvNumeralValue(value));
73
+ const bits =
74
+ parts.length === 1
75
+ ? parts[0]
76
+ : (parts[0] << (BigInt(manager.getEbits(sort)) + sbits - 1n)) |
77
+ (parts[1] << (sbits - 1n)) |
78
+ parts[2];
79
+ return mkFpNumeralOfBits(manager, sort, bits);
80
+ };
81
+
82
+ export const mkFpZero = (manager: AstManager, sort: number) =>
83
+ mkFpNumeral(manager, mkZero(manager.getEbits(sort), manager.getSbits(sort), false));
84
+
85
+ // finalize_model: the model of the floating-point functions that the conversion made.
86
+ export const finalizeFpaModel = (
87
+ manager: AstManager,
88
+ converter: WrappedFpa2BvConverter,
89
+ model: ProtoModel,
90
+ ) => {
91
+ const target = new ProtoModel(manager);
92
+ target.incRef();
93
+ const seen = new ObjHashtable((decl) => manager.getDeclHash(decl));
94
+ convertMinMaxSpecials(converter, model, target, seen);
95
+ convertUf2BvUf(converter, model, target, seen);
96
+ for (const decl of seen) model.unregisterDecl(decl);
97
+ for (const decl of target.getConstDecls())
98
+ model.registerConst(decl, target.getSomeConstInterp(decl));
99
+ for (const decl of target.getFuncDecls()) {
100
+ const interp = target.funcInterps.get(decl);
101
+ if (interp !== undefined) model.registerFunc(decl, interp.copy());
102
+ }
103
+ target.decRef();
104
+ };
105
+
106
+ export class TheoryFpa extends Theory {
107
+ readonly name = "fpa";
108
+ private theoryRewriter: Rewriter;
109
+ private converter: WrappedFpa2BvConverter;
110
+ private rewriter: Fpa2BvRewriter;
111
+ private conversions = new Map<number, number>();
112
+ private trail: number[] = [];
113
+ private trailLimits: number[] = [];
114
+ private model: ProtoModel | undefined;
115
+
116
+ constructor(context: Context) {
117
+ super(context, FAMILY_FPA);
118
+ const conversion = mkFpaConversion(context.manager);
119
+ this.theoryRewriter = conversion.theoryRewriter;
120
+ this.converter = conversion.converter;
121
+ this.rewriter = conversion.rewriter;
122
+ }
123
+
124
+ private isFloat(expr: number) {
125
+ const sort = this.manager.sorts[expr];
126
+ return this.manager.isFpSort(sort) || this.manager.isRmSort(sort);
127
+ }
128
+
129
+ private convert(expr: number) {
130
+ const existing = this.conversions.get(expr);
131
+ if (existing !== undefined) return existing;
132
+ const manager = this.manager;
133
+ const result = this.rewriter.convert(this.theoryRewriter, expr);
134
+ this.conversions.set(expr, result);
135
+ manager.incRef(expr);
136
+ this.trail.push(expr);
137
+ return result;
138
+ }
139
+
140
+ private mkSideConditions() {
141
+ const manager = this.manager;
142
+ const converter = this.converter;
143
+ const formulas = converter.extraAssertions.items.map((assertion) => {
144
+ const rewritten = this.context.rewriter.rewrite(assertion);
145
+ manager.releaseLater(rewritten);
146
+ return rewritten;
147
+ });
148
+ converter.extraAssertions.reset();
149
+ const result = this.theoryRewriter.rewrite(manager.mkAnd(formulas));
150
+ manager.releaseLater(result);
151
+ return result;
152
+ }
153
+
154
+ private rewrite(expr: number) {
155
+ const result = this.theoryRewriter.rewrite(expr);
156
+ this.manager.releaseLater(result);
157
+ return result;
158
+ }
159
+
160
+ private assertCnstr(expr: number) {
161
+ const context = this.context;
162
+ if (expr === this.manager.trueExpr) return;
163
+ context.internalize(expr, false);
164
+ const literal = context.getLiteral(expr);
165
+ context.markLiteralAsRelevant(literal);
166
+ context.mkThAxiom([literal]);
167
+ }
168
+
169
+ private attachNewThVar(node: Enode) {
170
+ const thVar = this.varEnodes.length;
171
+ this.varEnodes.push(node);
172
+ this.context.attachThVar(node, this, thVar);
173
+ }
174
+
175
+ internalizeAtom(atom: number) {
176
+ const context = this.context;
177
+ const manager = this.manager;
178
+ if (context.isBInternalized(atom)) return true;
179
+ const boolVar = context.mkBoolVar(atom);
180
+ context.setVarTheory(boolVar, this.id);
181
+ for (let index = 0; index < manager.getNumArgs(atom); index++)
182
+ context.internalize(manager.getArg(atom, index), false);
183
+ const outer = manager.beginTemporaries();
184
+ const bvAtom = this.rewriter.convert(this.theoryRewriter, atom);
185
+ manager.releaseLater(bvAtom);
186
+ const withSideConditions = this.rewrite(manager.mkAnd([bvAtom, this.mkSideConditions()]));
187
+ this.assertCnstr(manager.mkEq(atom, withSideConditions));
188
+ manager.endTemporaries(outer);
189
+ return true;
190
+ }
191
+
192
+ internalizeTerm(term: number) {
193
+ const context = this.context;
194
+ const manager = this.manager;
195
+ for (let index = 0; index < manager.getNumArgs(term); index++)
196
+ context.internalize(manager.getArg(term, index), false);
197
+ const node = context.getEnode(term) ?? context.mkEnode(term, false, false, true);
198
+ if (this.isAttachedToVar(node)) return true;
199
+ this.attachNewThVar(node);
200
+ if (CONVERTED_OPS.has(manager.getOp(term))) {
201
+ const outer = manager.beginTemporaries();
202
+ this.assertCnstr(manager.mkEq(term, this.convert(term)));
203
+ this.assertCnstr(this.mkSideConditions());
204
+ manager.endTemporaries(outer);
205
+ }
206
+ if (!context.relevancy.isEnabled) this.relevantEh(term);
207
+ return true;
208
+ }
209
+
210
+ applySortCnstr(node: Enode) {
211
+ const manager = this.manager;
212
+ if (this.isAttachedToVar(node)) return;
213
+ this.attachNewThVar(node);
214
+ const owner = node.owner;
215
+ if (manager.isRmSort(manager.sorts[owner]) && manager.getOp(owner) !== OP_FPA_BV2RM) {
216
+ const outer = manager.beginTemporaries();
217
+ const limit = manager.mkBvNumeral(4n, 3);
218
+ this.assertCnstr(mkBvApp(manager, OP_ULEQ, [this.converter.wrap(owner), limit]));
219
+ manager.endTemporaries(outer);
220
+ }
221
+ if (!this.context.relevancy.isEnabled) this.relevantEh(owner);
222
+ }
223
+
224
+ newEqEh(first: number, second: number) {
225
+ this.assertEquality(first, second, false);
226
+ }
227
+
228
+ newDiseqEh(first: number, second: number) {
229
+ this.assertEquality(first, second, true);
230
+ }
231
+
232
+ private assertEquality(first: number, second: number, isNegated: boolean) {
233
+ const manager = this.manager;
234
+ const firstExpr = this.getExpr(first);
235
+ const secondExpr = this.getExpr(second);
236
+ if (manager.getOp(firstExpr) === OP_FPA_BVWRAP || manager.getOp(secondExpr) === OP_FPA_BVWRAP)
237
+ return;
238
+ const outer = manager.beginTemporaries();
239
+ const firstConverted = this.convert(firstExpr);
240
+ const secondConverted = this.convert(secondExpr);
241
+ const isFloatPair = this.isFloat(firstExpr) && this.isFloat(secondExpr);
242
+ const eq = isFloatPair
243
+ ? this.converter.mkEq(firstConverted, secondConverted)
244
+ : manager.mkEq(firstConverted, secondConverted);
245
+ const condition = this.rewrite(isNegated ? manager.mkNot(eq) : eq);
246
+ const exprEq = manager.mkEq(firstExpr, secondExpr);
247
+ this.assertCnstr(manager.mkEq(isNegated ? manager.mkNot(exprEq) : exprEq, condition));
248
+ this.assertCnstr(this.mkSideConditions());
249
+ manager.endTemporaries(outer);
250
+ }
251
+
252
+ override assignEh(boolVar: BoolVar, isTrue: boolean) {
253
+ const manager = this.manager;
254
+ const expr = this.context.boolVar2Expr[boolVar];
255
+ const outer = manager.beginTemporaries();
256
+ const converted = manager.mkAnd([this.convert(expr), this.mkSideConditions()]);
257
+ const constraint = isTrue
258
+ ? manager.mkApp(OP_IMPLIES, [expr, converted], SORT_BOOL)
259
+ : manager.mkApp(OP_IMPLIES, [converted, expr], SORT_BOOL);
260
+ this.assertCnstr(this.rewrite(constraint));
261
+ manager.endTemporaries(outer);
262
+ }
263
+
264
+ override relevantEh(expr: number) {
265
+ const manager = this.manager;
266
+ const op = manager.getOp(expr);
267
+ if (!this.isFloat(expr)) {
268
+ if (manager.getFamily(expr) === FAMILY_FPA && CONVERTED_OPS.has(op)) {
269
+ const outer = manager.beginTemporaries();
270
+ this.assertCnstr(manager.mkEq(expr, this.convert(expr)));
271
+ this.assertCnstr(this.mkSideConditions());
272
+ manager.endTemporaries(outer);
273
+ }
274
+ return;
275
+ }
276
+ if (op === OP_FPA_FP) return;
277
+ const outer = manager.beginTemporaries();
278
+ this.assertValueConstraints(expr);
279
+ manager.endTemporaries(outer);
280
+ }
281
+
282
+ private assertValueConstraints(expr: number) {
283
+ const manager = this.manager;
284
+ const converter = this.converter;
285
+ const wrapped = converter.wrap(expr);
286
+ const rm = getRmNumeral(manager, expr);
287
+ if (rm !== undefined) {
288
+ this.assertCnstr(manager.mkEq(wrapped, manager.mkBvNumeral(BigInt(rm), 3)));
289
+ return;
290
+ }
291
+ if (getFpNumeral(manager, expr) !== undefined) {
292
+ const value = this.convert(expr);
293
+ const concatenation = mkBvApp(manager, OP_CONCAT, converter.splitFp(value));
294
+ this.assertCnstr(manager.mkEq(wrapped, concatenation));
295
+ this.assertCnstr(this.mkSideConditions());
296
+ this.assertCnstr(manager.mkEq(expr, value));
297
+ return;
298
+ }
299
+ this.assertCnstr(manager.mkEq(converter.unwrap(wrapped, manager.sorts[expr]), expr));
300
+ if (manager.getFamily(expr) === FAMILY_FPA) return;
301
+ const converted = this.convert(expr);
302
+ if (manager.getOp(converted) !== OP_FPA_FP) return;
303
+ const [, exp, sig] = converter.splitFp(converted);
304
+ this.assertCnstr(
305
+ manager.mkEq(wrapped, mkBvApp(manager, OP_CONCAT, converter.splitFp(converted))),
306
+ );
307
+ this.assertCnstr(this.mkSideConditions());
308
+ const ebits = manager.getBvSize(manager.sorts[exp]);
309
+ const sbits = manager.getBvSize(manager.sorts[sig]);
310
+ const topExp = manager.mkBvNumeral((1n << BigInt(ebits)) - 1n, ebits);
311
+ const sigZero = manager.mkBvNumeral(0n, sbits);
312
+ const expIsAllOnes = manager.mkEq(exp, topExp);
313
+ const sigIsZero = manager.mkEq(sig, sigZero);
314
+ const sigIsNonzero = manager.mkNot(sigIsZero);
315
+ const isNan = manager.mkAnd([expIsAllOnes, sigIsNonzero]);
316
+ const canonicalSgn = manager.mkBvNumeral(0n, 1);
317
+ const canonicalSig = manager.mkBvNumeral(1n, sbits);
318
+ const canonicalNan = mkBvApp(manager, OP_CONCAT, [canonicalSgn, topExp, canonicalSig]);
319
+ this.assertCnstr(
320
+ manager.mkApp(OP_IMPLIES, [isNan, manager.mkEq(wrapped, canonicalNan)], SORT_BOOL),
321
+ );
322
+ }
323
+
324
+ override pushScopeEh() {
325
+ super.pushScopeEh();
326
+ this.trailLimits.push(this.trail.length);
327
+ }
328
+
329
+ override popScopeEh(numScopes: number) {
330
+ const manager = this.manager;
331
+ const newLevel = this.trailLimits.length - numScopes;
332
+ const limit = this.trailLimits[newLevel];
333
+ for (let index = this.trail.length - 1; index >= limit; index--) {
334
+ const expr = this.trail[index];
335
+ const converted = this.conversions.get(expr);
336
+ this.conversions.delete(expr);
337
+ if (converted !== undefined) manager.decRef(converted);
338
+ manager.decRef(expr);
339
+ }
340
+ this.trail.length = limit;
341
+ this.trailLimits.length = newLevel;
342
+ this.rewriter.reset();
343
+ super.popScopeEh(numScopes);
344
+ }
345
+
346
+ override mkValue(node: Enode): number | DependentValue | undefined {
347
+ const context = this.context;
348
+ const manager = this.manager;
349
+ const owner = this.getIteValue(node.owner);
350
+ const sort = manager.sorts[owner];
351
+ if (getRmNumeral(manager, owner) !== undefined || getFpNumeral(manager, owner) !== undefined)
352
+ return owner;
353
+ const getEnodes = (exprs: number[]) =>
354
+ exprs.map((expr) => {
355
+ const argNode = context.getEnode(expr);
356
+ if (argNode === undefined) throw new SmtInvariantError("the term was not internalized");
357
+ return argNode;
358
+ });
359
+ const op = manager.getOp(owner);
360
+ if (op === OP_FPA_FP)
361
+ return {
362
+ dependencies: getEnodes(this.converter.splitFp(owner)),
363
+ mkValue: (values) => mkFpValue(manager, sort, values),
364
+ };
365
+ if (op === OP_FPA_BV2RM)
366
+ return {
367
+ dependencies: getEnodes([manager.getArg(owner, 0)]),
368
+ mkValue: (values) => mkRmValue(manager, values[0]),
369
+ };
370
+ const wrapped = this.converter.wrap(owner);
371
+ if (context.isEInternalized(wrapped))
372
+ return {
373
+ dependencies: getEnodes([wrapped]),
374
+ mkValue: (values) =>
375
+ manager.isRmSort(sort) ? mkRmValue(manager, values[0]) : mkFpValue(manager, sort, values),
376
+ };
377
+ return mkFpZero(manager, sort);
378
+ }
379
+
380
+ override initModel(model: ProtoModel) {
381
+ this.model = model;
382
+ }
383
+
384
+ override finalizeModel() {
385
+ const model = this.model;
386
+ if (model === undefined) throw new SmtInvariantError("the model was not initialized");
387
+ finalizeFpaModel(this.manager, this.converter, model);
388
+ }
389
+ }
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/theory_lra.cpp, src/smt/arith_eq_adapter.cpp), MIT license, see z3-license.txt.
2
1
  import { SmtInvariantError } from "../../../errors";
3
2
  import {
4
3
  OP_ADD,
@@ -9,13 +8,18 @@ import {
9
8
  OP_LE,
10
9
  OP_MOD,
11
10
  OP_MUL,
11
+ OP_POWER,
12
+ OP_POWER0,
13
+ OP_REM,
12
14
  OP_SUB,
13
15
  OP_TO_INT,
14
16
  OP_TO_REAL,
17
+ OP_UMINUS,
15
18
  SORT_BOOL,
16
19
  SORT_INT,
17
20
  SORT_REAL,
18
21
  } from "./ast";
22
+ import { getExtendedNumeral } from "./ast-util";
19
23
  import type { Enode } from "./enode";
20
24
  import { FALSE_LITERAL, getVar, isNegated, Literal, negate, TRUE_LITERAL } from "./literal";
21
25
  import { Rational } from "./rational";
@@ -109,7 +113,8 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
109
113
  const first = context.getEnode(this.manager.getArg(expr, 0));
110
114
  const second = context.getEnode(this.manager.getArg(expr, 1));
111
115
  if (first === undefined || second === undefined) return;
112
- if (first.thVar >= 0 && second.thVar >= 0 && first !== second) this.mkEqAxioms(first, second);
116
+ if (this.getThVar(first) >= 0 && this.getThVar(second) >= 0 && first !== second)
117
+ this.mkEqAxioms(first, second);
113
118
  }
114
119
 
115
120
  newEqEh(first: number, second: number) {
@@ -127,6 +132,39 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
127
132
  else if (op === OP_TO_INT) this.mkToIntAxiom(expr);
128
133
  else if (op === OP_IS_INT) this.mkIsIntAxiom(expr);
129
134
  else if (op === OP_MOD) this.mkIdivModAxioms(manager.getArg(expr, 0), manager.getArg(expr, 1));
135
+ else if (op === OP_REM) this.mkRemAxiom(manager.getArg(expr, 0), manager.getArg(expr, 1));
136
+ else if (op === OP_POWER) this.mkPowerAxiom(expr);
137
+ }
138
+
139
+ private mkPowerAxiom(power: number) {
140
+ const manager = this.manager;
141
+ const context = this.context;
142
+ const base = manager.getArg(power, 0);
143
+ const exponent = manager.getArg(power, 1);
144
+ const zero = manager.mkRealNumeral(Rational.zero);
145
+ const baseValue = getExtendedNumeral(manager, base);
146
+ if (baseValue?.isPositive())
147
+ this.mkAxiom([negate(this.mkLiteral(manager.mkApp(OP_LE, [power, zero], SORT_BOOL)))]);
148
+ const exponentValue = getExtendedNumeral(manager, exponent);
149
+ if (exponentValue?.isPositive() && exponentValue.num === 1n && exponentValue.den > 1n) {
150
+ const isNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [base, zero], SORT_BOOL));
151
+ const root = manager.mkApp(
152
+ OP_POWER,
153
+ [power, manager.mkRealNumeral(Rational.of(exponentValue.den))],
154
+ SORT_REAL,
155
+ );
156
+ const isRoot = this.mkLiteral(manager.mkEq(base, root));
157
+ this.mkAxiom([negate(isNonnegative), isRoot]);
158
+ }
159
+ const isZeroBase =
160
+ manager.isNumeral(base) &&
161
+ manager.getRationalValue(base).isZero() &&
162
+ (!manager.isNumeral(exponent) || manager.getRationalValue(exponent).isZero());
163
+ if (isZeroBase || (baseValue === undefined && exponentValue === undefined)) {
164
+ const literal = this.mkEq(power, manager.mkApp(OP_POWER0, [base, exponent], SORT_REAL));
165
+ context.markLiteralAsRelevant(literal);
166
+ context.assign(literal, null);
167
+ }
130
168
  }
131
169
 
132
170
  protected mkLiteral(atom: number) {
@@ -161,6 +199,19 @@ export abstract class TheoryLraAxioms extends TheoryLraState {
161
199
  );
162
200
  }
163
201
 
202
+ private mkRemAxiom(dividend: number, divisor: number) {
203
+ const manager = this.manager;
204
+ const zero = manager.mkNumeral(0n);
205
+ const remainder = manager.mkApp(OP_REM, [dividend, divisor], SORT_INT);
206
+ const mod = manager.mkApp(OP_MOD, [dividend, divisor], SORT_INT);
207
+ const negatedMod = manager.mkApp(OP_UMINUS, [mod], SORT_INT);
208
+ const isNonnegative = this.mkLiteral(manager.mkApp(OP_GE, [divisor, zero], SORT_BOOL));
209
+ const isPositiveCase = this.mkEq(remainder, mod);
210
+ const isNegativeCase = this.mkEq(remainder, negatedMod);
211
+ this.mkAxiom([negate(isNonnegative), isPositiveCase]);
212
+ this.mkAxiom([isNonnegative, isNegativeCase]);
213
+ }
214
+
164
215
  private mkDivAxiom(dividend: number, divisor: number) {
165
216
  const manager = this.manager;
166
217
  if (this.isZeroNumeral(divisor)) return;
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/theory_lra.cpp, src/math/lp/lp_api.h), MIT license, see z3-license.txt.
2
1
  import { OP_GE, OP_IS_INT, OP_LE } from "./ast";
3
2
  import { BoolVar, Literal, mkLiteral, negate } from "./literal";
4
3
  import { Rational } from "./rational";
@@ -25,7 +24,7 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
25
24
  const op = manager.getOp(expr);
26
25
  const boolVar = context.mkBoolVar(expr);
27
26
  this.boolVarToBound[boolVar] = undefined;
28
- context.setVarTheory(boolVar);
27
+ context.setVarTheory(boolVar, this.id);
29
28
  if (op === OP_IS_INT) {
30
29
  this.mkEnode(expr);
31
30
  if (!context.relevancy.isEnabled) this.mkIsIntAxiom(expr);
@@ -58,6 +57,27 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
58
57
  return true;
59
58
  }
60
59
 
60
+ // mk_ge of theory_lra: the atom of an objective bound, without the enode of its term.
61
+ protected mkObjectiveBound(
62
+ atom: number,
63
+ thVar: number,
64
+ isLower: boolean,
65
+ value: Rational,
66
+ eps: Rational,
67
+ ) {
68
+ const context = this.context;
69
+ if (context.isBInternalized(atom)) return;
70
+ const boolVar = context.mkBoolVar(atom);
71
+ this.boolVarToBound[boolVar] = undefined;
72
+ context.setVarTheory(boolVar, this.id);
73
+ const apiBound = this.mkVarBound(boolVar, thVar, isLower, value, eps);
74
+ this.mkBoundAxioms(apiBound);
75
+ this.updateUnassignedBounds(thVar, 1);
76
+ this.bounds[thVar].push(apiBound);
77
+ this.boundsTrail.push(thVar);
78
+ this.boolVarToBound[boolVar] = apiBound;
79
+ }
80
+
61
81
  private updateUnassignedBounds(thVar: number, increment: number) {
62
82
  const saved = this.unassignedBounds[thVar];
63
83
  this.context.pushTrail(() => {
@@ -71,15 +91,20 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
71
91
  return isTrue ? KIND_LE : bound.isInt ? KIND_GE : KIND_GT;
72
92
  }
73
93
 
74
- private mkVarBound(boolVar: BoolVar, thVar: number, isLower: boolean, value: Rational) {
94
+ private mkVarBound(
95
+ boolVar: BoolVar,
96
+ thVar: number,
97
+ isLower: boolean,
98
+ value: Rational,
99
+ eps = Rational.zero,
100
+ ) {
75
101
  this.pushInternalizeState();
76
102
  this.internalizeHead--;
77
103
  const column = this.registerVar(thVar);
78
104
  const isInt = this.isIntVar(thVar);
79
- const partial = { isLower, isInt };
80
105
  const kindTrue = isLower ? KIND_GE : KIND_LE;
81
106
  const kindFalse = isLower ? (isInt ? KIND_LE : KIND_LT) : isInt ? KIND_GE : KIND_GT;
82
- const constraintTrue = this.solver.mkVarBound(column, kindTrue, value);
107
+ const constraintTrue = this.solver.mkVarBound(column, kindTrue, value, eps);
83
108
  const falseValue = isInt
84
109
  ? isLower
85
110
  ? value.sub(Rational.one)
@@ -88,7 +113,7 @@ export abstract class TheoryLraBounds extends TheoryLraInternalize {
88
113
  const constraintFalse = this.solver.mkVarBound(column, kindFalse, falseValue);
89
114
  this.constraintSources[constraintTrue] = mkLiteral(boolVar);
90
115
  this.constraintSources[constraintFalse] = mkLiteral(boolVar, true);
91
- return { boolVar, thVar, column, value, constraintTrue, constraintFalse, ...partial };
116
+ return { boolVar, thVar, column, value, eps, constraintTrue, constraintFalse, isLower, isInt };
92
117
  }
93
118
 
94
119
  private mkBoundAxioms(bound: ApiBound) {