tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  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 +121 -12
  8. package/dist/index.d.ts +121 -12
  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 +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  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 +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,15 +1,29 @@
1
- // Ported from Z3 (src/ast/rewriter/arith_rewriter.cpp), MIT license, see z3-license.txt. Only
2
- // linear arithmetic and nonlinear factoring are ported, without powers, algebraic numbers or
3
- // hoisting, which tlapm's encoding does not produce.
4
1
  import {
2
+ FAMILY_ARITH,
3
+ KIND_APP,
4
+ OP_ACOS,
5
+ OP_ACOSH,
5
6
  OP_ADD,
7
+ OP_ASIN,
8
+ OP_ASINH,
9
+ OP_ATAN,
10
+ OP_ATANH,
11
+ OP_COS,
12
+ OP_COSH,
13
+ OP_DIV,
6
14
  OP_GE,
15
+ OP_PI,
16
+ OP_POWER,
17
+ OP_SIN,
18
+ OP_SINH,
19
+ OP_TAN,
7
20
  OP_IDIV,
8
21
  OP_ITE,
9
22
  OP_LE,
10
23
  OP_LT,
11
24
  OP_MOD,
12
25
  OP_MUL,
26
+ OP_SEQ_LENGTH,
13
27
  OP_SUB,
14
28
  OP_TO_INT,
15
29
  OP_TO_REAL,
@@ -22,33 +36,47 @@ import { getEuclideanDiv, getEuclideanMod, getGcd, Rational } from "./rational";
22
36
  import { type ArithRewriterOptions, PolyRewriter } from "./poly-rewriter";
23
37
  import type { Rewrite } from "./rewriter-tpl";
24
38
  import { shrink } from "./array";
39
+ import { Anum } from "./nlsat/algebraic";
25
40
 
26
- // The parameters that asserted_formulas gives the kernel's rewriter, which also simplifies instances.
27
41
  export const KERNEL_ARITH_OPTIONS: ArithRewriterOptions = {
28
42
  isSom: true,
29
43
  isSortSums: true,
44
+ isArithLhs: false,
30
45
  isArithIneqLhs: true,
31
46
  isGcdRounding: true,
47
+ isAnumSimp: true,
48
+ isExpandPower: false,
49
+ isExpandTan: false,
50
+ maxDegree: 64,
32
51
  };
33
52
 
34
- // The defaults, which the simplify tactic uses.
35
53
  export const TACTIC_ARITH_OPTIONS: ArithRewriterOptions = {
36
54
  isSom: false,
37
55
  isSortSums: false,
56
+ isArithLhs: false,
38
57
  isArithIneqLhs: false,
39
58
  isGcdRounding: false,
59
+ isAnumSimp: true,
60
+ isExpandPower: false,
61
+ isExpandTan: false,
62
+ maxDegree: 64,
63
+ };
64
+
65
+ const HALF = Rational.of(1n, 2n);
66
+ const TWO = Rational.of(2n);
67
+
68
+ const getHalfTurns = (k: Rational) => {
69
+ const floor = k.floor();
70
+ return Rational.of(getEuclideanMod(floor.num, 2n)).add(k).sub(floor);
40
71
  };
41
72
 
42
- // The ceiling of the quotient by a positive divisor.
43
73
  const getCeilDiv = (dividend: bigint, divisor: bigint) => -getEuclideanDiv(-dividend, divisor);
44
74
 
45
- // symmod: the remainder closest to zero, for a positive modulus.
46
75
  const getSymmetricMod = (value: bigint, modulus: bigint) => {
47
76
  const remainder = getEuclideanMod(value, modulus);
48
77
  return 2n * remainder > modulus ? remainder - modulus : remainder;
49
78
  };
50
79
 
51
- // The running gcd of the coefficients of an atom's sides, and the number of their constants.
52
80
  interface GcdState {
53
81
  gcd: bigint;
54
82
  isFirst: boolean;
@@ -63,8 +91,8 @@ const getInverse = (kind: number) =>
63
91
  kind === KIND_LE ? KIND_GE : kind === KIND_GE ? KIND_LE : KIND_EQ;
64
92
 
65
93
  export class ArithRewriter extends PolyRewriter {
66
- // The buffer of isNonNegative's factors.
67
94
  private factors: number[] = [];
95
+ isEq2Ineq = false;
68
96
 
69
97
  mkLe(left: number, right: number) {
70
98
  return this.mkLeGeEq(left, right, KIND_LE);
@@ -83,11 +111,20 @@ export class ArithRewriter extends PolyRewriter {
83
111
  }
84
112
 
85
113
  mkEq(left: number, right: number) {
86
- if (!this.isArithTerm(left) && !this.isArithTerm(right)) return undefined;
114
+ const manager = this.manager;
115
+ if (this.isEq2Ineq)
116
+ return this.reduce(
117
+ manager.mkAnd([
118
+ manager.mkApp(OP_LE, [left, right], SORT_BOOL),
119
+ manager.mkApp(OP_GE, [left, right], SORT_BOOL),
120
+ ]),
121
+ 2,
122
+ );
123
+ if (!this.options.isArithLhs && !this.isArithTerm(left) && !this.isArithTerm(right))
124
+ return undefined;
87
125
  return this.mkLeGeEq(left, right, KIND_EQ);
88
126
  }
89
127
 
90
- // mk_idiv_core and mk_mod_core: SMT-LIB integer division, whose remainder is non-negative.
91
128
  private mkIdivApp(left: number, right: number) {
92
129
  return this.manager.mkApp(OP_IDIV, [left, right], SORT_INT);
93
130
  }
@@ -96,7 +133,6 @@ export class ArithRewriter extends PolyRewriter {
96
133
  return this.manager.mkApp(OP_MOD, [left, right], SORT_INT);
97
134
  }
98
135
 
99
- // arith_util's mk_mul, which makes no product of one factor.
100
136
  private mkFlatMulApp(args: number[]) {
101
137
  return args.length === 1 ? args[0] : this.manager.mkApp(OP_MUL, args, SORT_INT);
102
138
  }
@@ -105,7 +141,6 @@ export class ArithRewriter extends PolyRewriter {
105
141
  return this.manager.mkApp(OP_ITE, [condition, thenExpr, elseExpr], SORT_INT);
106
142
  }
107
143
 
108
- // flat_mul: the factors of nested products, in Z3's order.
109
144
  private getFlatMul(expr: number) {
110
145
  const args = [expr];
111
146
  for (let index = 0; index < args.length; index++) {
@@ -124,7 +159,6 @@ export class ArithRewriter extends PolyRewriter {
124
159
  args.pop();
125
160
  }
126
161
 
127
- // remove_divisor: div ab ac is div b c when a is positive, and div -b -c when it is negative.
128
162
  private removeDivisor(factor: number, dividend: number, divisor: number) {
129
163
  const manager = this.manager;
130
164
  const dividendArgs = this.getFlatMul(dividend);
@@ -150,7 +184,6 @@ export class ArithRewriter extends PolyRewriter {
150
184
  );
151
185
  }
152
186
 
153
- // get_divides: div ab ac is div b c, and common numeral factors cancel.
154
187
  private getDivides(dividend: number, divisor: number) {
155
188
  const manager = this.manager;
156
189
  const dividendArgs = this.getFlatMul(dividend);
@@ -168,8 +201,7 @@ export class ArithRewriter extends PolyRewriter {
168
201
  }
169
202
  for (const arg of divisorArgs) {
170
203
  const value = manager.getNumeral(arg);
171
- // A common factor of -1 stays, or the rewriting of (div (* -1 x) (* -1 y)) diverges. Z3's
172
- // check stores the -1 as the dividend's value.
204
+ // Z3 stores a common factor of -1 as the dividend's value, or (div (* -1 x) (* -1 y)) diverges.
173
205
  if (marked.has(arg) && value !== -1n) return this.removeDivisor(arg, dividend, divisor);
174
206
  if (marked.has(arg)) dividendValue = -1n;
175
207
  if (value === undefined) continue;
@@ -189,7 +221,6 @@ export class ArithRewriter extends PolyRewriter {
189
221
  );
190
222
  }
191
223
 
192
- // mk_idiv_core.
193
224
  mkIdiv(left: number, right: number) {
194
225
  const manager = this.manager;
195
226
  this.currSort = SORT_INT;
@@ -234,7 +265,31 @@ export class ArithRewriter extends PolyRewriter {
234
265
  );
235
266
  }
236
267
 
237
- // mk_mod_core.
268
+ mkRem(left: number, right: number) {
269
+ const manager = this.manager;
270
+ this.currSort = SORT_INT;
271
+ const dividend = manager.getNumeral(left);
272
+ const divisor = manager.getNumeral(right);
273
+ if (dividend !== undefined && divisor !== undefined && divisor !== 0n) {
274
+ const remainder = getEuclideanMod(dividend, divisor);
275
+ return manager.mkNumeral(divisor < 0n ? -remainder : remainder);
276
+ }
277
+ if (divisor === 1n) return manager.mkNumeral(0n);
278
+ if (divisor !== undefined && divisor !== 0n) {
279
+ if (this.isAdd(left) || this.isMul(left)) return undefined;
280
+ return divisor < 0n
281
+ ? this.reduce(manager.mkApp(OP_UMINUS, [this.mkModApp(left, right)], SORT_INT), 2)
282
+ : this.reduce(this.mkModApp(left, right), 1);
283
+ }
284
+ if (!this.options.isElimRem) return undefined;
285
+ const mod = this.mkModApp(left, right);
286
+ const isNonnegative = manager.mkApp(OP_GE, [right, manager.mkNumeral(0n)], SORT_BOOL);
287
+ return this.reduce(
288
+ this.mkIntIte(isNonnegative, mod, manager.mkApp(OP_UMINUS, [mod], SORT_INT)),
289
+ 3,
290
+ );
291
+ }
292
+
238
293
  mkMod(left: number, right: number) {
239
294
  const manager = this.manager;
240
295
  this.currSort = SORT_INT;
@@ -246,7 +301,6 @@ export class ArithRewriter extends PolyRewriter {
246
301
  const zero = manager.mkNumeral(0n);
247
302
  if (left === right && divisor === undefined)
248
303
  return this.mkIntIte(manager.mkEq(right, zero), this.mkModApp(zero, zero), zero);
249
- // mod is idempotent on a nonzero modulus.
250
304
  if (manager.getOp(left) === OP_MOD && manager.getArg(left, 1) === right) {
251
305
  if (divisor !== undefined && divisor !== 0n) return left;
252
306
  if (divisor === undefined)
@@ -259,7 +313,6 @@ export class ArithRewriter extends PolyRewriter {
259
313
  2,
260
314
  );
261
315
  }
262
- // Propagates mod inside a sum or product only if there is something to reduce.
263
316
  if (divisor !== undefined && divisor > 0n && (this.isAdd(left) || this.isMul(left))) {
264
317
  let isChanged = false;
265
318
  const args = manager.mapArgs(left, (arg) => {
@@ -292,7 +345,6 @@ export class ArithRewriter extends PolyRewriter {
292
345
  3,
293
346
  );
294
347
  }
295
- // For a symbolic modulus, the summands that are multiples of it go: mod (a + k*y) y = mod a y.
296
348
  if (divisor === undefined && this.isAdd(left)) {
297
349
  const args: number[] = [];
298
350
  for (let index = 0; index < manager.getNumArgs(left); index++) {
@@ -333,7 +385,6 @@ export class ArithRewriter extends PolyRewriter {
333
385
  ),
334
386
  1,
335
387
  );
336
- // mod x -y = mod x y.
337
388
  if (
338
389
  this.isMul(right) &&
339
390
  manager.getNumArgs(right) === 2 &&
@@ -369,9 +420,467 @@ export class ArithRewriter extends PolyRewriter {
369
420
  );
370
421
  }
371
422
 
372
- // mk_div_core: division by a numeral other than 0 is a product.
423
+ override mkAddCore(args: number[]) {
424
+ if (!this.isAnumSimpTarget(args)) return super.mkAddCore(args);
425
+ const folded = this.foldAnums(args, true);
426
+ if (typeof folded === "number") return folded;
427
+ return super.mkAddCore(folded) ?? this.manager.mkApp(OP_ADD, folded, SORT_REAL);
428
+ }
429
+
430
+ override mkMul(args: number[]) {
431
+ if (!this.isAnumSimpTarget(args)) return super.mkMul(args);
432
+ const folded = this.foldAnums(args, false);
433
+ if (typeof folded === "number") return folded;
434
+ return super.mkMul(folded) ?? this.manager.mkApp(OP_MUL, folded, SORT_REAL);
435
+ }
436
+
437
+ private isSimpAlgebraic(expr: number) {
438
+ const manager = this.manager;
439
+ return (
440
+ manager.isAlgebraicNumeral(expr) &&
441
+ manager.am.degree(manager.getAlgebraicValue(expr)) <= this.options.maxDegree
442
+ );
443
+ }
444
+
445
+ private isAnumSimpTarget(args: number[]) {
446
+ if (!this.options.isAnumSimp) return false;
447
+ let numIrrational = 0;
448
+ let numRational = 0;
449
+ for (const arg of args) {
450
+ if (this.manager.isNumeral(arg)) {
451
+ numRational++;
452
+ if (numIrrational > 0) return true;
453
+ }
454
+ if (this.isSimpAlgebraic(arg)) {
455
+ numIrrational++;
456
+ if (numIrrational > 1 || numRational > 0) return true;
457
+ }
458
+ }
459
+ return false;
460
+ }
461
+
462
+ private foldAnums(args: number[], isAdd: boolean) {
463
+ const manager = this.manager;
464
+ const am = manager.am;
465
+ const identity = isAdd ? Rational.zero : Rational.one;
466
+ const combine = (first: Anum, second: Anum) =>
467
+ isAdd ? am.add(first, second) : am.mul(first, second);
468
+ let result = new Anum(identity);
469
+ const newArgs: number[] = [];
470
+ for (const arg of args) {
471
+ const degree = am.degree(result);
472
+ if (degree > 1 && degree > this.options.maxDegree) {
473
+ newArgs.push(manager.mkAlgebraicNumeral(result));
474
+ result = new Anum(identity);
475
+ }
476
+ if (manager.isNumeral(arg)) result = combine(result, new Anum(this.getValue(arg)));
477
+ else if (this.isSimpAlgebraic(arg)) result = combine(result, manager.getAlgebraicValue(arg));
478
+ else newArgs.push(arg);
479
+ }
480
+ if (newArgs.length === 0) return manager.mkAlgebraicNumeral(result);
481
+ newArgs.push(manager.mkAlgebraicNumeral(result));
482
+ return newArgs;
483
+ }
484
+
485
+ private getAlgebraicValue(expr: number): Anum | undefined {
486
+ const manager = this.manager;
487
+ const am = manager.am;
488
+ if (manager.isNumeral(expr)) return new Anum(this.getValue(expr));
489
+ if (manager.isAlgebraicNumeral(expr)) return am.copy(manager.getAlgebraicValue(expr));
490
+ const op = manager.getOp(expr);
491
+ if ((op !== OP_ADD && op !== OP_MUL) || manager.getNumArgs(expr) !== 2) return undefined;
492
+ const first = this.getAlgebraicValue(manager.getArg(expr, 0));
493
+ const second = first && this.getAlgebraicValue(manager.getArg(expr, 1));
494
+ if (first === undefined || second === undefined) return undefined;
495
+ return op === OP_ADD ? am.add(first, second) : am.mul(first, second);
496
+ }
497
+
498
+ private mkAnumDiv(left: number, right: number) {
499
+ const manager = this.manager;
500
+ const am = manager.am;
501
+ const isLeftAlgebraic = manager.isAlgebraicNumeral(left);
502
+ const isRightAlgebraic = manager.isAlgebraicNumeral(right);
503
+ if (isLeftAlgebraic && manager.isNumeral(right)) {
504
+ if (this.getValue(right).isZero()) return undefined;
505
+ return manager.mkAlgebraicNumeral(
506
+ am.div(manager.getAlgebraicValue(left), new Anum(this.getValue(right))),
507
+ );
508
+ }
509
+ if (isLeftAlgebraic && isRightAlgebraic) {
510
+ if (!this.isSimpAlgebraic(left) || !this.isSimpAlgebraic(right)) return undefined;
511
+ return manager.mkAlgebraicNumeral(
512
+ am.div(manager.getAlgebraicValue(left), manager.getAlgebraicValue(right)),
513
+ );
514
+ }
515
+ return manager.mkAlgebraicNumeral(
516
+ am.div(new Anum(this.getValue(left)), manager.getAlgebraicValue(right)),
517
+ );
518
+ }
519
+
520
+ private ensureReal(expr: number) {
521
+ const manager = this.manager;
522
+ return manager.isInt(expr) ? manager.mkApp(OP_TO_REAL, [expr], SORT_REAL) : expr;
523
+ }
524
+
525
+ private mkPowerApp(base: number, exponent: number) {
526
+ return this.manager.mkApp(OP_POWER, [base, exponent], SORT_REAL);
527
+ }
528
+
529
+ mkPower(base: number, exponent: number): number | Rewrite | undefined {
530
+ const manager = this.manager;
531
+ const maxDegree = this.options.maxDegree;
532
+ const x = manager.isNumeral(base) ? this.getValue(base) : undefined;
533
+ const y = manager.isNumeral(exponent) ? this.getValue(exponent) : undefined;
534
+ const isSmall = (value: Rational) =>
535
+ value.isInt() && value.num >= 0n && value.num <= BigInt(maxDegree);
536
+ if (x?.equals(Rational.one)) return manager.mkRealNumeral(x);
537
+ if (y?.equals(Rational.one)) return this.reduce(this.ensureReal(base), 1);
538
+ if (x !== undefined && y !== undefined) {
539
+ if (x.isZero() && y.isZero()) return undefined;
540
+ if (y.isZero()) return manager.mkRealNumeral(Rational.one);
541
+ if (x.isZero()) return manager.mkRealNumeral(x);
542
+ if (isSmall(y)) return manager.mkRealNumeral(x.pow(Number(y.num)));
543
+ if (isSmall(y.neg())) return manager.mkRealNumeral(Rational.one.div(x).pow(Number(-y.num)));
544
+ if (y.equals(Rational.minusOne)) return manager.mkRealNumeral(Rational.one.div(x));
545
+ }
546
+ if (manager.getOp(base) === OP_POWER && y !== undefined && y.isInt() && !y.isZero()) {
547
+ const innerExponent = manager.getArg(base, 1);
548
+ const inner = manager.isNumeral(innerExponent) ? this.getValue(innerExponent) : undefined;
549
+ if (inner !== undefined && inner.isInt() && inner.isPositive())
550
+ return this.reduce(
551
+ this.mkPowerApp(
552
+ this.ensureReal(manager.getArg(base, 0)),
553
+ manager.mkRealNumeral(y.mul(inner)),
554
+ ),
555
+ 2,
556
+ );
557
+ }
558
+ const mkZeroIte = (otherwise: number) =>
559
+ manager.mkApp(
560
+ OP_ITE,
561
+ [
562
+ manager.mkEq(base, manager.mkNumeralOfSort(Rational.zero, manager.sorts[base])),
563
+ manager.mkRealNumeral(Rational.zero),
564
+ otherwise,
565
+ ],
566
+ SORT_REAL,
567
+ );
568
+ if (y?.equals(Rational.minusOne)) {
569
+ const one = manager.mkRealNumeral(Rational.one);
570
+ const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
571
+ return this.reduce(mkZeroIte(quotient), 2);
572
+ }
573
+ if (y?.isNegative()) {
574
+ const one = manager.mkRealNumeral(Rational.one);
575
+ const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
576
+ return this.reduce(mkZeroIte(this.mkPowerApp(quotient, manager.mkRealNumeral(y.neg()))), 3);
577
+ }
578
+ if (y !== undefined && !y.isInt() && y.num !== 1n) {
579
+ const root = this.mkPowerApp(
580
+ this.ensureReal(base),
581
+ manager.mkRealNumeral(Rational.of(1n, y.den)),
582
+ );
583
+ return this.reduce(this.mkPowerApp(root, manager.mkRealNumeral(Rational.of(y.num))), 3);
584
+ }
585
+ const isArithBase =
586
+ manager.kinds[base] === KIND_APP &&
587
+ manager.funcDecls[manager.decls[base]].family === FAMILY_ARITH;
588
+ if (
589
+ (this.options.isExpandPower || (this.options.isSom && isArithBase)) &&
590
+ y !== undefined &&
591
+ isSmall(y) &&
592
+ y.num > 1n
593
+ ) {
594
+ const factors = Array.from({ length: Number(y.num) }, () => base);
595
+ return this.reduce(this.ensureReal(manager.mkApp(OP_MUL, factors, manager.sorts[base])), 2);
596
+ }
597
+ if (y === undefined || y.isZero()) return undefined;
598
+ const isIrrationalBase = manager.isAlgebraicNumeral(base);
599
+ if (x === undefined && !isIrrationalBase) return undefined;
600
+ const isNegativeExponent = y.isNegative();
601
+ const numerator = isNegativeExponent ? -y.num : y.num;
602
+ if (numerator > BigInt(maxDegree) || y.den > BigInt(maxDegree)) return undefined;
603
+ const am = manager.am;
604
+ const finish = (value: Anum) => {
605
+ if (isNegativeExponent) am.inv(value);
606
+ return manager.mkAlgebraicNumeral(value);
607
+ };
608
+ if (x !== undefined) {
609
+ const power = x.pow(Number(numerator));
610
+ if (power.isNegative() && y.den % 2n === 0n) return undefined;
611
+ const exact = power.root(Number(y.den));
612
+ if (exact !== undefined)
613
+ return manager.mkRealNumeral(isNegativeExponent ? Rational.one.div(exact) : exact);
614
+ if (!this.options.isAnumSimp) return undefined;
615
+ return finish(am.root(new Anum(power), Number(y.den)));
616
+ }
617
+ const value = manager.getAlgebraicValue(base);
618
+ if (!this.options.isAnumSimp || am.degree(value) > maxDegree) return undefined;
619
+ return finish(am.root(am.power(value, Number(numerator)), Number(y.den)));
620
+ }
621
+
622
+ private isPi(expr: number) {
623
+ return this.manager.getOp(expr) === OP_PI;
624
+ }
625
+
626
+ private isBinary(expr: number, op: number) {
627
+ const manager = this.manager;
628
+ return manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
629
+ }
630
+
631
+ private getPiMultiple(expr: number) {
632
+ const manager = this.manager;
633
+ if (this.isPi(expr)) return Rational.one;
634
+ if (!this.isBinary(expr, OP_MUL) || !this.isPi(manager.getArg(expr, 1))) return undefined;
635
+ const coefficient = manager.getArg(expr, 0);
636
+ return manager.isNumeral(coefficient) ? this.getValue(coefficient) : undefined;
637
+ }
638
+
639
+ private getPiOffset(expr: number) {
640
+ const manager = this.manager;
641
+ if (manager.getOp(expr) !== OP_ADD) return undefined;
642
+ for (let index = 0; index < manager.getNumArgs(expr); index++) {
643
+ const term = manager.getArg(expr, index);
644
+ const k = this.getPiMultiple(term);
645
+ if (k !== undefined) return { k, term };
646
+ }
647
+ return undefined;
648
+ }
649
+
650
+ private isPiTimesToReal(first: number, second: number) {
651
+ const manager = this.manager;
652
+ return (
653
+ (this.isPi(first) && manager.getOp(second) === OP_TO_REAL) ||
654
+ (manager.getOp(first) === OP_TO_REAL && this.isPi(second))
655
+ );
656
+ }
657
+
658
+ private isTwoPiInteger(expr: number) {
659
+ const manager = this.manager;
660
+ if (!this.isBinary(expr, OP_MUL)) return false;
661
+ const coefficient = manager.getArg(expr, 0);
662
+ const product = manager.getArg(expr, 1);
663
+ if (!manager.isNumeral(coefficient)) return false;
664
+ const k = this.getValue(coefficient);
665
+ return (
666
+ k.isInt() &&
667
+ getEuclideanMod(k.num, 2n) === 0n &&
668
+ this.isBinary(product, OP_MUL) &&
669
+ this.isPiTimesToReal(manager.getArg(product, 0), manager.getArg(product, 1))
670
+ );
671
+ }
672
+
673
+ private isPiInteger(expr: number) {
674
+ const manager = this.manager;
675
+ if (!this.isBinary(expr, OP_MUL)) return false;
676
+ const first = manager.getArg(expr, 0);
677
+ const second = manager.getArg(expr, 1);
678
+ if (!manager.isNumeral(first)) return this.isPiTimesToReal(first, second);
679
+ if (!this.getValue(first).isInt() || !this.isBinary(second, OP_MUL)) return false;
680
+ return this.isPiTimesToReal(manager.getArg(second, 0), manager.getArg(second, 1));
681
+ }
682
+
683
+ private findSummand(expr: number, isMatching: (term: number) => boolean) {
684
+ const manager = this.manager;
685
+ if (manager.getOp(expr) !== OP_ADD) return undefined;
686
+ for (let index = 0; index < manager.getNumArgs(expr); index++)
687
+ if (isMatching(manager.getArg(expr, index))) return manager.getArg(expr, index);
688
+ return undefined;
689
+ }
690
+
691
+ private mkReal(value: Rational) {
692
+ return this.manager.mkRealNumeral(value);
693
+ }
694
+
695
+ private mkRealApp(op: number, args: number[]) {
696
+ return this.manager.mkApp(op, args, SORT_REAL);
697
+ }
698
+
699
+ private mkSqrt(value: Rational) {
700
+ return this.mkPowerApp(this.mkReal(value), this.mkReal(HALF));
701
+ }
702
+
703
+ private mkSinValue(k: Rational) {
704
+ const turns = getHalfTurns(k);
705
+ const isNegative = turns.compare(Rational.one) >= 0;
706
+ const kPrime = isNegative ? turns.sub(Rational.one) : turns;
707
+ const mkSigned = (expr: number) => (isNegative ? this.mkRealApp(OP_UMINUS, [expr]) : expr);
708
+ const is = (num: bigint, den: bigint) => kPrime.equals(Rational.of(num, den));
709
+ if (kPrime.isZero() || kPrime.equals(Rational.one)) return this.mkReal(Rational.zero);
710
+ if (is(1n, 2n)) return this.mkReal(isNegative ? Rational.minusOne : Rational.one);
711
+ if (is(1n, 6n) || is(5n, 6n)) return this.mkReal(Rational.of(isNegative ? -1n : 1n, 2n));
712
+ if (is(1n, 4n) || is(3n, 4n)) return mkSigned(this.mkSqrt(HALF));
713
+ if (is(1n, 3n) || is(2n, 3n))
714
+ return mkSigned(this.mkRealApp(OP_DIV, [this.mkSqrt(Rational.of(3n)), this.mkReal(TWO)]));
715
+ const isLow = is(1n, 12n) || is(11n, 12n);
716
+ if (isLow || is(5n, 12n) || is(7n, 12n)) {
717
+ const six = this.mkSqrt(Rational.of(6n));
718
+ const two = this.mkSqrt(TWO);
719
+ const sum = this.mkRealApp(isLow ? OP_SUB : OP_ADD, [six, two]);
720
+ return mkSigned(this.mkRealApp(OP_DIV, [sum, this.mkReal(Rational.of(4n))]));
721
+ }
722
+ return undefined;
723
+ }
724
+
725
+ private mkWithoutTerm(op: number, arg: number, term: number, isNegated: boolean) {
726
+ const app = this.mkRealApp(op, [this.mkRealApp(OP_SUB, [arg, term])]);
727
+ return isNegated ? this.reduce(this.mkRealApp(OP_UMINUS, [app]), 3) : this.reduce(app, 2);
728
+ }
729
+
730
+ private mkSinCos(arg: number, isSin: boolean): number | Rewrite | undefined {
731
+ const manager = this.manager;
732
+ const op = manager.getOp(arg);
733
+ const inverse = manager.getNumArgs(arg) === 1 ? manager.getArg(arg, 0) : -1;
734
+ if (op === (isSin ? OP_ASIN : OP_ACOS)) return inverse;
735
+ if (isSin && op === OP_ACOS) {
736
+ const square = this.mkRealApp(OP_MUL, [inverse, inverse]);
737
+ const difference = this.mkRealApp(OP_SUB, [this.mkReal(Rational.one), square]);
738
+ return this.reduce(this.mkPowerApp(difference, this.mkReal(HALF)), Infinity);
739
+ }
740
+ if (manager.isNumeral(arg) && this.getValue(arg).isZero())
741
+ return isSin ? arg : this.mkReal(Rational.one);
742
+ const multiple = this.getPiMultiple(arg);
743
+ const value =
744
+ multiple === undefined ? undefined : this.mkSinValue(isSin ? multiple : multiple.add(HALF));
745
+ if (value !== undefined) return this.reduce(value, Infinity);
746
+ const offset = this.getPiOffset(arg);
747
+ if (offset !== undefined) {
748
+ const turns = getHalfTurns(offset.k);
749
+ const quarter = turns.isZero()
750
+ ? 0
751
+ : turns.equals(HALF)
752
+ ? 1
753
+ : turns.equals(Rational.one)
754
+ ? 2
755
+ : turns.equals(Rational.of(3n, 2n))
756
+ ? 3
757
+ : -1;
758
+ if (quarter !== -1) {
759
+ // sin(x + q pi/2) is sin, cos, -sin, -cos, and cos(x + q pi/2) is cos, -sin, -cos, sin.
760
+ const shifted = isSin ? quarter : quarter + 1;
761
+ return this.mkWithoutTerm(
762
+ shifted % 2 === 0 ? OP_SIN : OP_COS,
763
+ arg,
764
+ offset.term,
765
+ shifted % 4 >= 2,
766
+ );
767
+ }
768
+ }
769
+ const term = this.findSummand(arg, (summand) => this.isTwoPiInteger(summand));
770
+ if (term !== undefined) return this.mkWithoutTerm(isSin ? OP_SIN : OP_COS, arg, term, false);
771
+ return undefined;
772
+ }
773
+
774
+ mkSin(arg: number) {
775
+ return this.mkSinCos(arg, true);
776
+ }
777
+
778
+ mkCos(arg: number) {
779
+ return this.mkSinCos(arg, false);
780
+ }
781
+
782
+ mkTan(arg: number): number | Rewrite | undefined {
783
+ const manager = this.manager;
784
+ if (manager.getOp(arg) === OP_ATAN) return manager.getArg(arg, 0);
785
+ if (manager.isNumeral(arg) && this.getValue(arg).isZero()) return arg;
786
+ const expanded = this.mkTanCore(arg);
787
+ if (expanded !== undefined || !this.options.isExpandTan) return expanded;
788
+ return this.reduce(
789
+ this.mkRealApp(OP_DIV, [this.mkRealApp(OP_SIN, [arg]), this.mkRealApp(OP_COS, [arg])]),
790
+ 2,
791
+ );
792
+ }
793
+
794
+ private mkTanCore(arg: number) {
795
+ const multiple = this.getPiMultiple(arg);
796
+ if (multiple !== undefined) {
797
+ const sine = this.mkSinValue(multiple);
798
+ if (sine === undefined) return undefined;
799
+ if (this.isZero(sine)) return sine;
800
+ const cosine = this.mkSinValue(multiple.add(HALF));
801
+ if (cosine === undefined || this.isZero(cosine)) return undefined;
802
+ return this.reduce(this.mkRealApp(OP_DIV, [sine, cosine]), Infinity);
803
+ }
804
+ const offset = this.getPiOffset(arg);
805
+ if (offset !== undefined && offset.k.isInt())
806
+ return this.mkWithoutTerm(OP_TAN, arg, offset.term, false);
807
+ const term = this.findSummand(arg, (summand) => this.isPiInteger(summand));
808
+ if (term !== undefined) return this.mkWithoutTerm(OP_TAN, arg, term, false);
809
+ return undefined;
810
+ }
811
+
812
+ private mkPiMultiple(num: bigint, den: bigint) {
813
+ return this.reduce(
814
+ this.mkRealApp(OP_MUL, [this.mkReal(Rational.of(num, den)), this.manager.piExpr]),
815
+ 2,
816
+ );
817
+ }
818
+
819
+ // Like Z3, asin(-x) = -asin(x) even outside [-1, 1].
820
+ private mkNegated(op: number, arg: number) {
821
+ return this.reduce(this.mkRealApp(OP_UMINUS, [this.mkRealApp(op, [arg])]), 2);
822
+ }
823
+
824
+ mkAsin(arg: number) {
825
+ const manager = this.manager;
826
+ if (manager.isNumeral(arg)) {
827
+ const k = this.getValue(arg);
828
+ if (k.isZero()) return arg;
829
+ if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ASIN, this.mkReal(k.neg()));
830
+ if (k.compare(Rational.one) > 0) return undefined;
831
+ const sign = k.isNegative() ? -1n : 1n;
832
+ const magnitude = k.abs();
833
+ if (magnitude.equals(Rational.one)) return this.mkPiMultiple(sign, 2n);
834
+ if (magnitude.equals(HALF)) return this.mkPiMultiple(sign, 6n);
835
+ }
836
+ const negated = manager.getTimesMinusOneArg(arg);
837
+ return negated === undefined ? undefined : this.mkNegated(OP_ASIN, negated);
838
+ }
839
+
840
+ mkAcos(arg: number) {
841
+ const manager = this.manager;
842
+ if (!manager.isNumeral(arg)) return undefined;
843
+ const k = this.getValue(arg);
844
+ if (k.isZero()) return this.mkPiMultiple(1n, 2n);
845
+ if (k.equals(Rational.one)) return this.mkReal(Rational.zero);
846
+ if (k.equals(Rational.minusOne)) return manager.piExpr;
847
+ if (k.equals(HALF)) return this.mkPiMultiple(1n, 3n);
848
+ if (k.equals(HALF.neg())) return this.mkPiMultiple(2n, 3n);
849
+ return undefined;
850
+ }
851
+
852
+ mkAtan(arg: number) {
853
+ const manager = this.manager;
854
+ if (manager.isNumeral(arg)) {
855
+ const k = this.getValue(arg);
856
+ if (k.isZero()) return arg;
857
+ if (k.equals(Rational.one)) return this.mkPiMultiple(1n, 4n);
858
+ if (k.equals(Rational.minusOne)) return this.mkPiMultiple(-1n, 4n);
859
+ if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ATAN, this.mkReal(k.neg()));
860
+ return undefined;
861
+ }
862
+ const negated = manager.getTimesMinusOneArg(arg);
863
+ return negated === undefined ? undefined : this.mkNegated(OP_ATAN, negated);
864
+ }
865
+
866
+ mkHyperbolic(op: number, arg: number) {
867
+ const manager = this.manager;
868
+ const inverse = op === OP_SINH ? OP_ASINH : op === OP_COSH ? OP_ACOSH : OP_ATANH;
869
+ if (manager.getOp(arg) === inverse) return manager.getArg(arg, 0);
870
+ const negated = manager.getTimesMinusOneArg(arg);
871
+ if (negated === undefined) return undefined;
872
+ return op === OP_COSH ? this.mkRealApp(OP_COSH, [negated]) : this.mkNegated(op, negated);
873
+ }
874
+
373
875
  mkDiv(left: number, right: number) {
374
876
  const manager = this.manager;
877
+ if (
878
+ this.options.isAnumSimp &&
879
+ ((manager.isAlgebraicNumeral(left) &&
880
+ (manager.isNumeral(right) || manager.isAlgebraicNumeral(right))) ||
881
+ (manager.isAlgebraicNumeral(right) && manager.isNumeral(left)))
882
+ )
883
+ return this.mkAnumDiv(left, right);
375
884
  this.currSort = manager.sorts[left];
376
885
  if (!manager.isNumeral(right) || this.getValue(right).isZero()) return undefined;
377
886
  const divisor = this.getValue(right);
@@ -382,7 +891,6 @@ export class ArithRewriter extends PolyRewriter {
382
891
  );
383
892
  }
384
893
 
385
- // mk_to_int_core: (to_int (+ 1.0 (to_real x) y)) is (+ 1 x (to_int y)).
386
894
  mkToInt(arg: number) {
387
895
  const manager = this.manager;
388
896
  if (manager.isInt(arg)) return arg;
@@ -399,20 +907,16 @@ export class ArithRewriter extends PolyRewriter {
399
907
  else if (manager.getOp(child) === OP_TO_REAL) intArgs.push(manager.getArg(child, 0));
400
908
  else realArgs.push(child);
401
909
  }
402
- // Z3 makes a sum of one argument, which the manager leaves out.
403
- const mkSum = (args: number[], sort: number) =>
404
- args.length === 1 ? args[0] : manager.mkApp(op, args, sort);
405
- if (realArgs.length === 0) return this.reduce(mkSum(intArgs, SORT_INT), 1);
910
+ if (realArgs.length === 0) return this.reduce(manager.mkApp(op, intArgs, SORT_INT), 1);
406
911
  if (intArgs.length === 0 || op !== OP_ADD) return undefined;
407
- const intSum = mkSum(intArgs, SORT_INT);
408
- const realSum = mkSum(realArgs, SORT_REAL);
912
+ const intSum = manager.mkApp(OP_ADD, intArgs, SORT_INT);
913
+ const realSum = manager.mkApp(OP_ADD, realArgs, SORT_REAL);
409
914
  return this.reduce(
410
915
  manager.mkApp(OP_ADD, [intSum, manager.mkApp(OP_TO_INT, [realSum], SORT_INT)], SORT_INT),
411
916
  3,
412
917
  );
413
918
  }
414
919
 
415
- // mk_to_real_core, with push_to_real: to_real distributes over sums and products.
416
920
  mkToReal(arg: number) {
417
921
  const manager = this.manager;
418
922
  if (manager.isNumeral(arg)) return manager.mkRealNumeral(this.getValue(arg));
@@ -429,8 +933,6 @@ export class ArithRewriter extends PolyRewriter {
429
933
  );
430
934
  }
431
935
 
432
- // mk_is_int: a numeral is decided, and a term built from integers by sums and products is an
433
- // integer. Any other term x is an integer when (to_real (to_int x)) is x.
434
936
  mkIsInt(arg: number) {
435
937
  const manager = this.manager;
436
938
  if (manager.isNumeral(arg))
@@ -473,9 +975,8 @@ export class ArithRewriter extends PolyRewriter {
473
975
  else result.push(expr);
474
976
  }
475
977
 
476
- // is_non_negative, without powers and sequences. It counts each factor's occurrences by scanning
477
- // the factors, which are few, rather than by sorting them.
478
978
  private isNonNegative(expr: number) {
979
+ if (this.isNonNegativeFactor(expr)) return true;
479
980
  if (!this.isMul(expr)) return false;
480
981
  const factors = this.factors;
481
982
  shrink(factors, 0);
@@ -483,6 +984,7 @@ export class ArithRewriter extends PolyRewriter {
483
984
  let isNegative = false;
484
985
  let numFactors = 0;
485
986
  for (const arg of factors) {
987
+ if (this.isNonNegativeFactor(arg)) continue;
486
988
  if (!this.manager.isNumeral(arg)) factors[numFactors++] = arg;
487
989
  else if (this.getValue(arg).isNegative()) isNegative = !isNegative;
488
990
  }
@@ -502,13 +1004,25 @@ export class ArithRewriter extends PolyRewriter {
502
1004
  else return false;
503
1005
  }
504
1006
  if (numOdd === 0) return true;
505
- // x * (x + 1) >= 0 holds for an integer x, as no integer lies strictly between -1 and 0, but
506
- // not for a real one.
507
1007
  if (numOdd !== 2 || !this.manager.isInt(expr)) return false;
508
1008
  return this.isSuccessor(firstOdd, secondOdd) || this.isSuccessor(secondOdd, firstOdd);
509
1009
  }
510
1010
 
511
- // Whether sum is base plus or minus one.
1011
+ private isNonNegativeFactor(expr: number) {
1012
+ const manager = this.manager;
1013
+ const op = manager.getOp(expr);
1014
+ if (op === OP_SEQ_LENGTH) return true;
1015
+ if (op !== OP_POWER) return false;
1016
+ const base = manager.getArg(expr, 0);
1017
+ const exponent = manager.getArg(expr, 1);
1018
+ if (manager.isNumeral(exponent) && manager.isInt(exponent)) {
1019
+ const value = this.getValue(exponent);
1020
+ if (value.isInt() && value.num >= 0n && value.num < 2n ** 32n && value.num % 2n === 0n)
1021
+ return true;
1022
+ }
1023
+ return manager.isNumeral(base) && this.getValue(base).isPositive();
1024
+ }
1025
+
512
1026
  private isSuccessor(base: number, sum: number) {
513
1027
  if (!this.isAdd(sum)) return false;
514
1028
  let offset = Rational.zero;
@@ -553,7 +1067,6 @@ export class ArithRewriter extends PolyRewriter {
553
1067
  );
554
1068
  }
555
1069
 
556
- // is_separated. Like narg, the last negated polynomial lives until is_separated returns.
557
1070
  private getSeparated(left: number, right: number, kind: number) {
558
1071
  const manager = this.manager;
559
1072
  if (kind === KIND_EQ || !this.manager.isNumeral(right)) return undefined;
@@ -613,7 +1126,6 @@ export class ArithRewriter extends PolyRewriter {
613
1126
  return this.reduce(manager.mkAnd(atoms), 2);
614
1127
  }
615
1128
 
616
- // is_bound.
617
1129
  private getBound(inputLeft: number, inputRight: number, inputKind: number) {
618
1130
  const manager = this.manager;
619
1131
  if (
@@ -658,9 +1170,6 @@ export class ArithRewriter extends PolyRewriter {
658
1170
  return undefined;
659
1171
  }
660
1172
 
661
- // div_polynomial: the quotient, with a reference the caller owns, or undefined when a constant is
662
- // not divisible and the atom is an equality. new_args is an expr_ref_buffer, which Z3 releases
663
- // first to last as it returns.
664
1173
  private dividePolynomial(expr: number, divisor: bigint, rounding: "floor" | "ceil" | "none") {
665
1174
  const manager = this.manager;
666
1175
  const newArgs: number[] = [];
@@ -695,8 +1204,6 @@ export class ArithRewriter extends PolyRewriter {
695
1204
  return quotient;
696
1205
  }
697
1206
 
698
- // get_coeffs_gcd: the gcd of the coefficients, or 0 when there is no monomial, and the number of
699
- // non-zero constants.
700
1207
  private getCoeffsGcd(expr: number, state: GcdState) {
701
1208
  for (let index = 0; index < this.getNumMonomials(expr); index++) {
702
1209
  const arg = this.getMonomial(expr, index);
@@ -721,7 +1228,6 @@ export class ArithRewriter extends PolyRewriter {
721
1228
  : comparison === 0;
722
1229
  }
723
1230
 
724
- // mk_le_ge_eq_core. Z3 holds the rewritten sides, new_arg1 and new_arg2, until it returns.
725
1231
  private mkLeGeEq(originalLeft: number, originalRight: number, kind: number) {
726
1232
  const manager = this.manager;
727
1233
  const sides: number[] = [];
@@ -738,13 +1244,30 @@ export class ArithRewriter extends PolyRewriter {
738
1244
  ): number | Rewrite | undefined {
739
1245
  const manager = this.manager;
740
1246
  this.currSort = manager.sorts[originalLeft];
1247
+ if (
1248
+ (this.isZero(originalLeft) && this.isReducePowerTarget(originalRight, kind === KIND_EQ)) ||
1249
+ (this.isZero(originalRight) && this.isReducePowerTarget(originalLeft, kind === KIND_EQ))
1250
+ )
1251
+ return this.reduce(
1252
+ this.mkAtom(
1253
+ this.reducePower(originalLeft, kind === KIND_EQ),
1254
+ this.reducePower(originalRight, kind === KIND_EQ),
1255
+ kind,
1256
+ ),
1257
+ 1,
1258
+ );
741
1259
  const setSide = (index: number, expr: number) => {
742
1260
  manager.incRef(expr);
743
1261
  if (index < sides.length) manager.decRef(sides[index]);
744
1262
  sides[index] = expr;
745
1263
  };
746
1264
  const cancelled = manager.withTemporaries(
747
- () => this.cancelMonomials(originalLeft, originalRight, this.options.isArithIneqLhs),
1265
+ () =>
1266
+ this.cancelMonomials(
1267
+ originalLeft,
1268
+ originalRight,
1269
+ this.options.isArithIneqLhs || this.options.isArithLhs,
1270
+ ),
748
1271
  (result) => (result === undefined ? [] : [result.lhs, result.rhs]),
749
1272
  );
750
1273
  if (cancelled !== undefined) sides.push(cancelled.lhs, cancelled.rhs);
@@ -755,6 +1278,14 @@ export class ArithRewriter extends PolyRewriter {
755
1278
  return this.isHolding(this.getValue(left), this.getValue(right), kind)
756
1279
  ? manager.trueExpr
757
1280
  : manager.falseExpr;
1281
+ const leftValue = this.options.isAnumSimp ? this.getAlgebraicValue(left) : undefined;
1282
+ const rightValue = leftValue && this.getAlgebraicValue(right);
1283
+ if (leftValue !== undefined && rightValue !== undefined) {
1284
+ const comparison = manager.am.compare(leftValue, rightValue);
1285
+ const isHolding =
1286
+ kind === KIND_LE ? comparison <= 0 : kind === KIND_GE ? comparison >= 0 : comparison === 0;
1287
+ return isHolding ? manager.trueExpr : manager.falseExpr;
1288
+ }
758
1289
  const separated = this.getSeparated(left, right, kind);
759
1290
  if (separated !== undefined) return separated;
760
1291
  const bound = this.getBound(left, right, kind) ?? this.getBound(right, left, getInverse(kind));
@@ -791,8 +1322,7 @@ export class ArithRewriter extends PolyRewriter {
791
1322
  const condition = manager.getArg(left, 0);
792
1323
  const rightValue = this.getValue(right);
793
1324
  const holds = (value: Rational) => this.isHolding(value, rightValue, kind);
794
- // Z3 makes the negated condition before it knows whether the result uses it, and its
795
- // conjunctions build an equality with arith_util::mk_eq but its disjunctions with m.mk_eq.
1325
+ // Z3 makes the negated condition even when unused, and only its conjunctions use arith_util::mk_eq.
796
1326
  const mkConjunct = (other: number) =>
797
1327
  kind === KIND_EQ ? this.mkArithEq(other, right) : this.mkAtom(other, right, kind);
798
1328
  if (this.manager.isNumeral(manager.getArg(left, 1))) {
@@ -814,6 +1344,17 @@ export class ArithRewriter extends PolyRewriter {
814
1344
  );
815
1345
  }
816
1346
  }
1347
+ if (manager.getOp(left) === OP_ITE && manager.getRefCount(left) === 1) {
1348
+ const thenAtom = this.mkAtom(manager.getArg(left, 1), right, kind);
1349
+ return this.reduce(
1350
+ manager.mkApp(
1351
+ OP_ITE,
1352
+ [manager.getArg(left, 0), thenAtom, this.mkAtom(manager.getArg(left, 2), right, kind)],
1353
+ SORT_BOOL,
1354
+ ),
1355
+ 2,
1356
+ );
1357
+ }
817
1358
  const isToIntRight = manager.getOp(right) === OP_TO_INT && manager.isNumeral(left);
818
1359
  const toIntArg =
819
1360
  manager.getOp(isToIntRight ? right : left) === OP_TO_INT
@@ -833,7 +1374,7 @@ export class ArithRewriter extends PolyRewriter {
833
1374
  return this.reduce(manager.mkAnd([mkUpper(), lower]), 3);
834
1375
  }
835
1376
  const negated =
836
- this.options.isArithIneqLhs && this.manager.isNumeral(right)
1377
+ (this.options.isArithLhs || this.options.isArithIneqLhs) && this.manager.isNumeral(right)
837
1378
  ? this.getNegatedPolynomial(left)
838
1379
  : undefined;
839
1380
  if (negated !== undefined) {
@@ -847,7 +1388,40 @@ export class ArithRewriter extends PolyRewriter {
847
1388
  return this.factorLeGeEq(left, right, kind);
848
1389
  }
849
1390
 
850
- // factor_le_ge_eq: a sum with a nonlinear factor f, fg >= 0, splits on the signs of f and g.
1391
+ private getReducedPowerBase(expr: number, isEq: boolean) {
1392
+ const manager = this.manager;
1393
+ if (manager.getOp(expr) !== OP_POWER) return undefined;
1394
+ const exponent = manager.getArg(expr, 1);
1395
+ if (!manager.isNumeral(exponent)) return undefined;
1396
+ const k = this.getValue(exponent);
1397
+ return k.isInt() && k.compare(Rational.of(isEq ? 1n : 2n)) > 0 ? k : undefined;
1398
+ }
1399
+
1400
+ private getFactors(expr: number) {
1401
+ return this.isMul(expr) ? this.manager.getArgs(expr) : [expr];
1402
+ }
1403
+
1404
+ private isReducePowerTarget(expr: number, isEq: boolean) {
1405
+ return this.getFactors(expr).some(
1406
+ (factor) => this.getReducedPowerBase(factor, isEq) !== undefined,
1407
+ );
1408
+ }
1409
+
1410
+ // x^k = 0 has the roots of x, and x^k <= 0 those of x or of x^2 by the parity of k.
1411
+ private reducePower(expr: number, isEq: boolean) {
1412
+ const manager = this.manager;
1413
+ if (this.isZero(expr)) return expr;
1414
+ const factors = this.getFactors(expr).map((factor) => {
1415
+ const k = this.getReducedPowerBase(factor, isEq);
1416
+ if (k === undefined) return factor;
1417
+ const base = manager.getArg(factor, 0);
1418
+ return isEq || getEuclideanMod(k.num, 2n) === 1n
1419
+ ? this.ensureReal(base)
1420
+ : this.mkPowerApp(this.ensureReal(base), manager.mkRealNumeral(TWO));
1421
+ });
1422
+ return factors.length === 1 ? factors[0] : manager.mkApp(OP_MUL, factors, SORT_REAL);
1423
+ }
1424
+
851
1425
  private factorLeGeEq(left: number, right: number, kind: number) {
852
1426
  if (!this.isZero(right)) return undefined;
853
1427
  const factor = this.findNlFactor(left);
@@ -868,7 +1442,6 @@ export class ArithRewriter extends PolyRewriter {
868
1442
  );
869
1443
  }
870
1444
 
871
- // arith_util::mk_eq: a numeral goes right, and otherwise the side with the smaller id goes left.
872
1445
  private mkArithEq(left: number, right: number) {
873
1446
  const manager = this.manager;
874
1447
  const isSwapped =
@@ -881,7 +1454,6 @@ export class ArithRewriter extends PolyRewriter {
881
1454
  return manager.mkEq(lhs, rhs);
882
1455
  }
883
1456
 
884
- // find_nl_factor: a factor of the first nonlinear product of a sum that divides every monomial.
885
1457
  private findNlFactor(expr: number) {
886
1458
  const sum = [expr];
887
1459
  for (let index = 0; index < sum.length; index++) {
@@ -899,7 +1471,6 @@ export class ArithRewriter extends PolyRewriter {
899
1471
  return undefined;
900
1472
  }
901
1473
 
902
- // get_nl_muls: the factors of a product that are not numerals.
903
1474
  private getNlMuls(expr: number, muls: number[]) {
904
1475
  if (this.isMul(expr))
905
1476
  for (let index = 0; index < this.manager.getNumArgs(expr); index++)
@@ -918,7 +1489,6 @@ export class ArithRewriter extends PolyRewriter {
918
1489
  return this.isMulFactor(factor, expr);
919
1490
  }
920
1491
 
921
- // remove_factor: the sum or product without one occurrence of the factor in each monomial.
922
1492
  private removeNlFactor(factor: number, expr: number): number {
923
1493
  const manager = this.manager;
924
1494
  const sort = manager.sorts[expr];