tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
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.
- package/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +664 -287
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +4 -11
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +309 -0
- package/src/prover/smt/solver/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +205 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +884 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +105 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +410 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2105 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1200 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +37 -16
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -0,0 +1,632 @@
|
|
|
1
|
+
import {
|
|
2
|
+
type AstManager,
|
|
3
|
+
FAMILY_ARITH,
|
|
4
|
+
KIND_APP,
|
|
5
|
+
KIND_QUANTIFIER,
|
|
6
|
+
OP_ACOS,
|
|
7
|
+
OP_ADD,
|
|
8
|
+
OP_AND,
|
|
9
|
+
OP_ASIN,
|
|
10
|
+
OP_ATAN,
|
|
11
|
+
OP_COS,
|
|
12
|
+
OP_DIV,
|
|
13
|
+
OP_DIV0,
|
|
14
|
+
OP_EQ,
|
|
15
|
+
OP_GE,
|
|
16
|
+
OP_GT,
|
|
17
|
+
OP_IDIV,
|
|
18
|
+
OP_IDIV0,
|
|
19
|
+
OP_IMPLIES,
|
|
20
|
+
OP_ITE,
|
|
21
|
+
OP_LE,
|
|
22
|
+
OP_LT,
|
|
23
|
+
OP_MOD,
|
|
24
|
+
OP_MOD0,
|
|
25
|
+
OP_MUL,
|
|
26
|
+
OP_NEG_ROOT,
|
|
27
|
+
OP_NOT,
|
|
28
|
+
OP_OR,
|
|
29
|
+
OP_POWER,
|
|
30
|
+
OP_POWER0,
|
|
31
|
+
OP_SIN,
|
|
32
|
+
OP_TAN,
|
|
33
|
+
OP_TO_INT,
|
|
34
|
+
OP_TO_REAL,
|
|
35
|
+
OP_U_ACOS,
|
|
36
|
+
OP_U_ASIN,
|
|
37
|
+
OP_UMINUS,
|
|
38
|
+
SORT_BOOL,
|
|
39
|
+
SORT_INT,
|
|
40
|
+
SORT_REAL,
|
|
41
|
+
} from "./ast";
|
|
42
|
+
import type { Definition, Goal } from "./goal";
|
|
43
|
+
import { ObjMap } from "./hashtable";
|
|
44
|
+
import { Rational } from "./rational";
|
|
45
|
+
import { RefVector } from "./ref-vector";
|
|
46
|
+
import { RewriterTpl } from "./rewriter-tpl";
|
|
47
|
+
|
|
48
|
+
interface BinDef {
|
|
49
|
+
x: number;
|
|
50
|
+
y: number;
|
|
51
|
+
d: number;
|
|
52
|
+
}
|
|
53
|
+
|
|
54
|
+
interface PurifyOptions {
|
|
55
|
+
isElimRootObjects: boolean;
|
|
56
|
+
isElimInverses: boolean;
|
|
57
|
+
isComplete: boolean;
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
class PurifyState {
|
|
61
|
+
readonly pinned: RefVector;
|
|
62
|
+
readonly unsafe = new Set<number>();
|
|
63
|
+
isUnsafeFound = false;
|
|
64
|
+
readonly sinCos: ObjMap<[number, number]>;
|
|
65
|
+
readonly cannotPurify = new Set<number>();
|
|
66
|
+
readonly appToFresh: ObjMap<number>;
|
|
67
|
+
readonly newConstraints: number[] = [];
|
|
68
|
+
readonly divs: BinDef[] = [];
|
|
69
|
+
readonly idivs: BinDef[] = [];
|
|
70
|
+
readonly mods: BinDef[] = [];
|
|
71
|
+
ipower0 = -1;
|
|
72
|
+
rpower0 = -1;
|
|
73
|
+
|
|
74
|
+
constructor(
|
|
75
|
+
readonly manager: AstManager,
|
|
76
|
+
readonly goal: Goal,
|
|
77
|
+
readonly options: PurifyOptions,
|
|
78
|
+
) {
|
|
79
|
+
this.pinned = new RefVector(manager);
|
|
80
|
+
this.sinCos = new ObjMap((expr) => manager.hashes[expr]);
|
|
81
|
+
this.appToFresh = new ObjMap((expr) => manager.hashes[expr]);
|
|
82
|
+
this.initCannotPurify();
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
pin(expr: number) {
|
|
86
|
+
this.pinned.push(expr);
|
|
87
|
+
return expr;
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
private forEachApp(visit: (expr: number) => void) {
|
|
91
|
+
const manager = this.manager;
|
|
92
|
+
const seen = new Set<number>();
|
|
93
|
+
for (const form of this.goal.forms.items) {
|
|
94
|
+
const todo = [form];
|
|
95
|
+
for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
|
|
96
|
+
if (seen.has(expr)) continue;
|
|
97
|
+
seen.add(expr);
|
|
98
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
99
|
+
todo.push(manager.getQuantifier(expr).body);
|
|
100
|
+
continue;
|
|
101
|
+
}
|
|
102
|
+
if (manager.kinds[expr] !== KIND_APP) continue;
|
|
103
|
+
visit(expr);
|
|
104
|
+
manager.pushArgs(expr, todo);
|
|
105
|
+
}
|
|
106
|
+
}
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
private initCannotPurify() {
|
|
110
|
+
const manager = this.manager;
|
|
111
|
+
this.forEachApp((expr) => {
|
|
112
|
+
if (manager.getArgs(expr).some((arg) => !manager.isGroundApp(arg)))
|
|
113
|
+
this.cannotPurify.add(manager.decls[expr]);
|
|
114
|
+
});
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
private findUnsafe() {
|
|
118
|
+
if (this.isUnsafeFound) return;
|
|
119
|
+
const manager = this.manager;
|
|
120
|
+
this.forEachApp((expr) => {
|
|
121
|
+
const op = manager.getFamily(expr) === FAMILY_ARITH ? manager.getOp(expr) : -1;
|
|
122
|
+
if (op === OP_SIN || op === OP_COS) return;
|
|
123
|
+
for (const arg of manager.getArgs(expr)) this.unsafe.add(arg);
|
|
124
|
+
});
|
|
125
|
+
this.isUnsafeFound = true;
|
|
126
|
+
}
|
|
127
|
+
|
|
128
|
+
convertBasis(theta: number): [number, number] | undefined {
|
|
129
|
+
const manager = this.manager;
|
|
130
|
+
if (manager.kinds[theta] !== KIND_APP || !manager.isUninterpretedConst(theta)) return undefined;
|
|
131
|
+
this.findUnsafe();
|
|
132
|
+
if (this.unsafe.has(theta)) return undefined;
|
|
133
|
+
const existing = this.sinCos.get(theta);
|
|
134
|
+
if (existing !== undefined) return existing;
|
|
135
|
+
const pair: [number, number] = [
|
|
136
|
+
this.pin(manager.mkFreshConst(null, SORT_REAL)),
|
|
137
|
+
this.pin(manager.mkFreshConst(null, SORT_REAL)),
|
|
138
|
+
];
|
|
139
|
+
this.sinCos.set(theta, pair);
|
|
140
|
+
this.pin(theta);
|
|
141
|
+
return pair;
|
|
142
|
+
}
|
|
143
|
+
}
|
|
144
|
+
|
|
145
|
+
class PurifyRewriter extends RewriterTpl {
|
|
146
|
+
constructor(
|
|
147
|
+
manager: AstManager,
|
|
148
|
+
private state: PurifyState,
|
|
149
|
+
) {
|
|
150
|
+
super(manager);
|
|
151
|
+
}
|
|
152
|
+
|
|
153
|
+
private mk(op: number, args: number[], sort = SORT_BOOL) {
|
|
154
|
+
return this.state.pin(this.manager.mkApp(op, args, sort));
|
|
155
|
+
}
|
|
156
|
+
|
|
157
|
+
private mkNumeral(value: Rational, isInt: boolean) {
|
|
158
|
+
return this.state.pin(this.manager.mkNumeralOfSort(value, isInt ? SORT_INT : SORT_REAL));
|
|
159
|
+
}
|
|
160
|
+
|
|
161
|
+
private mkFreshVar(isInt: boolean) {
|
|
162
|
+
return this.state.pin(this.manager.mkFreshConst(null, isInt ? SORT_INT : SORT_REAL));
|
|
163
|
+
}
|
|
164
|
+
|
|
165
|
+
private cacheResult(expr: number, result: number) {
|
|
166
|
+
this.state.appToFresh.set(this.state.pin(expr), this.state.pin(result));
|
|
167
|
+
}
|
|
168
|
+
|
|
169
|
+
private pushConstraint(constraint: number) {
|
|
170
|
+
this.state.newConstraints.push(constraint);
|
|
171
|
+
}
|
|
172
|
+
|
|
173
|
+
private processDiv(decl: number, args: number[]) {
|
|
174
|
+
const state = this.state;
|
|
175
|
+
const expr = this.mk(decl, args, SORT_REAL);
|
|
176
|
+
const processed = state.appToFresh.get(expr);
|
|
177
|
+
if (processed !== undefined) return processed;
|
|
178
|
+
const fresh = this.mkFreshVar(false);
|
|
179
|
+
this.cacheResult(expr, fresh);
|
|
180
|
+
const [x, y] = args;
|
|
181
|
+
const yIsZero = this.mk(OP_EQ, [y, this.mkNumeral(Rational.zero, false)]);
|
|
182
|
+
this.pushConstraint(
|
|
183
|
+
this.mk(OP_OR, [yIsZero, this.mk(OP_EQ, [this.mk(OP_MUL, [y, fresh], SORT_REAL), x])]),
|
|
184
|
+
);
|
|
185
|
+
if (state.options.isComplete)
|
|
186
|
+
this.pushConstraint(
|
|
187
|
+
this.mk(OP_OR, [
|
|
188
|
+
this.mk(OP_NOT, [yIsZero]),
|
|
189
|
+
this.mk(OP_EQ, [
|
|
190
|
+
fresh,
|
|
191
|
+
this.mk(OP_DIV, [x, this.mkNumeral(Rational.zero, false)], SORT_REAL),
|
|
192
|
+
]),
|
|
193
|
+
]),
|
|
194
|
+
);
|
|
195
|
+
state.divs.push({ x, y, d: fresh });
|
|
196
|
+
return fresh;
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
private processIdiv(decl: number, args: number[]) {
|
|
200
|
+
const manager = this.manager;
|
|
201
|
+
const state = this.state;
|
|
202
|
+
const divApp = this.mk(decl, args, SORT_INT);
|
|
203
|
+
const processed = state.appToFresh.get(divApp);
|
|
204
|
+
if (processed !== undefined) return processed;
|
|
205
|
+
const quotient = this.mkFreshVar(true);
|
|
206
|
+
this.cacheResult(divApp, quotient);
|
|
207
|
+
const remainder = this.mkFreshVar(true);
|
|
208
|
+
const [x, y] = args;
|
|
209
|
+
const modApp = this.mk(OP_MOD, [x, y], SORT_INT);
|
|
210
|
+
this.cacheResult(modApp, remainder);
|
|
211
|
+
state.mods.push({ x, y, d: remainder });
|
|
212
|
+
const zero = this.mkNumeral(Rational.zero, true);
|
|
213
|
+
const yIsZero = this.mk(OP_EQ, [y, zero]);
|
|
214
|
+
const product = this.mk(OP_MUL, [quotient, y], SORT_INT);
|
|
215
|
+
this.pushConstraint(
|
|
216
|
+
this.mk(OP_OR, [
|
|
217
|
+
yIsZero,
|
|
218
|
+
this.mk(OP_EQ, [x, this.mk(OP_ADD, [product, remainder], SORT_INT)]),
|
|
219
|
+
]),
|
|
220
|
+
);
|
|
221
|
+
this.pushConstraint(this.mk(OP_OR, [yIsZero, this.mk(OP_LE, [zero, remainder])]));
|
|
222
|
+
this.pushConstraint(
|
|
223
|
+
this.mk(OP_OR, [this.mk(OP_LE, [y, zero]), this.mk(OP_LT, [remainder, y])]),
|
|
224
|
+
);
|
|
225
|
+
const negated = this.mk(OP_MUL, [this.mkNumeral(Rational.minusOne, true), y], SORT_INT);
|
|
226
|
+
this.pushConstraint(
|
|
227
|
+
this.mk(OP_OR, [this.mk(OP_GE, [y, zero]), this.mk(OP_LT, [remainder, negated])]),
|
|
228
|
+
);
|
|
229
|
+
if (
|
|
230
|
+
state.options.isComplete &&
|
|
231
|
+
(!manager.isNumeral(y) || manager.getRationalValue(y).isZero())
|
|
232
|
+
) {
|
|
233
|
+
const yIsNonzero = this.mk(OP_NOT, [yIsZero]);
|
|
234
|
+
this.pushConstraint(
|
|
235
|
+
this.mk(OP_OR, [
|
|
236
|
+
yIsNonzero,
|
|
237
|
+
this.mk(OP_EQ, [quotient, this.mk(OP_IDIV, [x, zero], SORT_INT)]),
|
|
238
|
+
]),
|
|
239
|
+
);
|
|
240
|
+
this.pushConstraint(
|
|
241
|
+
this.mk(OP_OR, [
|
|
242
|
+
yIsNonzero,
|
|
243
|
+
this.mk(OP_EQ, [remainder, this.mk(OP_MOD, [x, zero], SORT_INT)]),
|
|
244
|
+
]),
|
|
245
|
+
);
|
|
246
|
+
}
|
|
247
|
+
state.idivs.push({ x, y, d: quotient });
|
|
248
|
+
return quotient;
|
|
249
|
+
}
|
|
250
|
+
|
|
251
|
+
private processMod(decl: number, args: number[]) {
|
|
252
|
+
const expr = this.mk(decl, args, SORT_INT);
|
|
253
|
+
const processed = this.state.appToFresh.get(expr);
|
|
254
|
+
if (processed !== undefined) return processed;
|
|
255
|
+
this.processIdiv(decl, args);
|
|
256
|
+
return this.state.appToFresh.get(expr) as number;
|
|
257
|
+
}
|
|
258
|
+
|
|
259
|
+
private processToInt(decl: number, args: number[]) {
|
|
260
|
+
const expr = this.mk(decl, args, SORT_INT);
|
|
261
|
+
const processed = this.state.appToFresh.get(expr);
|
|
262
|
+
if (processed !== undefined) return processed;
|
|
263
|
+
const fresh = this.mkFreshVar(true);
|
|
264
|
+
this.cacheResult(expr, fresh);
|
|
265
|
+
const minusOne = this.mkNumeral(Rational.minusOne, false);
|
|
266
|
+
const realFresh = this.mk(OP_TO_REAL, [fresh], SORT_REAL);
|
|
267
|
+
const diff = this.mk(
|
|
268
|
+
OP_ADD,
|
|
269
|
+
[args[0], this.mk(OP_MUL, [minusOne, realFresh], SORT_REAL)],
|
|
270
|
+
SORT_REAL,
|
|
271
|
+
);
|
|
272
|
+
this.pushConstraint(this.mk(OP_GE, [diff, this.mkNumeral(Rational.zero, false)]));
|
|
273
|
+
this.pushConstraint(
|
|
274
|
+
this.mk(OP_NOT, [this.mk(OP_GE, [diff, this.mkNumeral(Rational.one, false)])]),
|
|
275
|
+
);
|
|
276
|
+
return fresh;
|
|
277
|
+
}
|
|
278
|
+
|
|
279
|
+
private processPower(decl: number, args: number[]) {
|
|
280
|
+
const manager = this.manager;
|
|
281
|
+
const state = this.state;
|
|
282
|
+
if (!manager.isNumeral(args[1])) return -1;
|
|
283
|
+
const exponent = manager.getRationalValue(args[1]);
|
|
284
|
+
if (exponent.isInt() && !exponent.isZero()) return -1;
|
|
285
|
+
const expr = this.mk(decl, args, SORT_REAL);
|
|
286
|
+
const processed = state.appToFresh.get(expr);
|
|
287
|
+
if (processed !== undefined) return processed;
|
|
288
|
+
const x = args[0];
|
|
289
|
+
const isInt = manager.sorts[x] === SORT_INT;
|
|
290
|
+
const fresh = this.mkFreshVar(false);
|
|
291
|
+
this.cacheResult(expr, fresh);
|
|
292
|
+
const zero = this.mkNumeral(Rational.zero, isInt);
|
|
293
|
+
const one = this.mkNumeral(Rational.one, isInt);
|
|
294
|
+
if (exponent.isZero()) {
|
|
295
|
+
if (isInt && state.ipower0 === -1) state.ipower0 = this.mkFreshVar(false);
|
|
296
|
+
if (!isInt && state.rpower0 === -1) state.rpower0 = this.mkFreshVar(false);
|
|
297
|
+
const power0 = isInt ? state.ipower0 : state.rpower0;
|
|
298
|
+
const xIsZero = this.mk(OP_EQ, [x, zero]);
|
|
299
|
+
this.pushConstraint(this.mk(OP_OR, [xIsZero, this.mk(OP_EQ, [fresh, one])]));
|
|
300
|
+
this.pushConstraint(
|
|
301
|
+
this.mk(OP_OR, [this.mk(OP_NOT, [xIsZero]), this.mk(OP_EQ, [fresh, power0])]),
|
|
302
|
+
);
|
|
303
|
+
return fresh;
|
|
304
|
+
}
|
|
305
|
+
// Z3 leaves a root of an integer, though it keeps the fresh constant it cached for it.
|
|
306
|
+
if (isInt) return -1;
|
|
307
|
+
const degree = this.mkNumeral(Rational.of(exponent.den), false);
|
|
308
|
+
const rootEq = this.mk(OP_EQ, [x, this.mk(OP_POWER, [fresh, degree], SORT_REAL)]);
|
|
309
|
+
if (exponent.den % 2n !== 0n) {
|
|
310
|
+
this.pushConstraint(rootEq);
|
|
311
|
+
return fresh;
|
|
312
|
+
}
|
|
313
|
+
const xGeZero = this.mk(OP_GE, [x, zero]);
|
|
314
|
+
this.pushConstraint(
|
|
315
|
+
this.mk(OP_OR, [
|
|
316
|
+
this.mk(OP_NOT, [xGeZero]),
|
|
317
|
+
this.mk(OP_AND, [rootEq, this.mk(OP_GE, [fresh, zero])]),
|
|
318
|
+
]),
|
|
319
|
+
);
|
|
320
|
+
this.pushConstraint(
|
|
321
|
+
this.mk(OP_OR, [
|
|
322
|
+
xGeZero,
|
|
323
|
+
this.mk(OP_EQ, [fresh, this.mk(OP_NEG_ROOT, [x, degree], SORT_REAL)]),
|
|
324
|
+
]),
|
|
325
|
+
);
|
|
326
|
+
return fresh;
|
|
327
|
+
}
|
|
328
|
+
|
|
329
|
+
private processIrrational(expr: number) {
|
|
330
|
+
const manager = this.manager;
|
|
331
|
+
const state = this.state;
|
|
332
|
+
const processed = state.appToFresh.get(expr);
|
|
333
|
+
if (processed !== undefined) return processed;
|
|
334
|
+
const fresh = this.mkFreshVar(false);
|
|
335
|
+
this.cacheResult(expr, fresh);
|
|
336
|
+
const am = manager.am;
|
|
337
|
+
const value = manager.getAlgebraicValue(expr);
|
|
338
|
+
const terms = am.getPolynomial(value).flatMap((coeff, degree) => {
|
|
339
|
+
if (coeff === 0n) return [];
|
|
340
|
+
const numeral = this.mkNumeral(Rational.of(coeff), false);
|
|
341
|
+
if (degree === 0) return [numeral];
|
|
342
|
+
const power =
|
|
343
|
+
degree === 1
|
|
344
|
+
? fresh
|
|
345
|
+
: this.mk(
|
|
346
|
+
OP_POWER,
|
|
347
|
+
[fresh, this.mkNumeral(Rational.of(BigInt(degree)), false)],
|
|
348
|
+
SORT_REAL,
|
|
349
|
+
);
|
|
350
|
+
return [this.mk(OP_MUL, [numeral, power], SORT_REAL)];
|
|
351
|
+
});
|
|
352
|
+
const interval = am.getIsolatingInterval(value);
|
|
353
|
+
this.pushConstraint(
|
|
354
|
+
this.mk(OP_EQ, [this.mk(OP_ADD, terms, SORT_REAL), this.mkNumeral(Rational.zero, false)]),
|
|
355
|
+
);
|
|
356
|
+
this.pushConstraint(this.mk(OP_LT, [this.mkNumeral(interval[0], false), fresh]));
|
|
357
|
+
this.pushConstraint(this.mk(OP_LT, [fresh, this.mkNumeral(interval[1], false)]));
|
|
358
|
+
return fresh;
|
|
359
|
+
}
|
|
360
|
+
|
|
361
|
+
private processSinCos(isSin: boolean, decl: number, theta: number) {
|
|
362
|
+
const pair = this.state.convertBasis(theta);
|
|
363
|
+
const one = this.mkNumeral(Rational.one, false);
|
|
364
|
+
if (pair !== undefined) {
|
|
365
|
+
const result = isSin ? pair[0] : pair[1];
|
|
366
|
+
this.cacheResult(this.mk(decl, [theta], SORT_REAL), result);
|
|
367
|
+
const squares = pair.map((value) => this.mk(OP_MUL, [value, value], SORT_REAL));
|
|
368
|
+
this.pushConstraint(this.mk(OP_EQ, [one, this.mk(OP_ADD, squares, SORT_REAL)]));
|
|
369
|
+
return result;
|
|
370
|
+
}
|
|
371
|
+
const squares = [OP_SIN, OP_COS].map((op) => {
|
|
372
|
+
const value = this.mk(op, [theta], SORT_REAL);
|
|
373
|
+
return this.mk(OP_MUL, [value, value], SORT_REAL);
|
|
374
|
+
});
|
|
375
|
+
this.pushConstraint(this.mk(OP_EQ, [one, this.mk(OP_ADD, squares, SORT_REAL)]));
|
|
376
|
+
return -1;
|
|
377
|
+
}
|
|
378
|
+
|
|
379
|
+
// Inside [-1, 1], k is asin on its principal range. Outside it, k is asin-u when the
|
|
380
|
+
// purification is complete.
|
|
381
|
+
private processAsin(decl: number, x: number) {
|
|
382
|
+
const state = this.state;
|
|
383
|
+
if (!state.options.isElimInverses) return -1;
|
|
384
|
+
const expr = this.mk(decl, [x], SORT_REAL);
|
|
385
|
+
const processed = state.appToFresh.get(expr);
|
|
386
|
+
if (processed !== undefined) return processed;
|
|
387
|
+
const fresh = this.mkFreshVar(false);
|
|
388
|
+
this.cacheResult(expr, fresh);
|
|
389
|
+
const one = this.mkNumeral(Rational.one, false);
|
|
390
|
+
const minusOne = this.mkNumeral(Rational.minusOne, false);
|
|
391
|
+
const halfPi = this.mkHalfPi(1n);
|
|
392
|
+
const minusHalfPi = this.mkHalfPi(-1n);
|
|
393
|
+
const xGeMinusOne = this.mk(OP_GE, [x, minusOne]);
|
|
394
|
+
const xLtMinusOne = this.mk(OP_NOT, [xGeMinusOne]);
|
|
395
|
+
const xLeOne = this.mk(OP_LE, [x, one]);
|
|
396
|
+
const outside = this.mk(OP_OR, [xLtMinusOne, this.mk(OP_NOT, [xLeOne])]);
|
|
397
|
+
const sinEq = this.mk(OP_EQ, [x, this.mk(OP_SIN, [fresh], SORT_REAL)]);
|
|
398
|
+
const freshGeMinusHalfPi = this.mk(OP_GE, [fresh, minusHalfPi]);
|
|
399
|
+
this.pushConstraint(
|
|
400
|
+
this.mk(OP_OR, [
|
|
401
|
+
outside,
|
|
402
|
+
this.mk(OP_AND, [
|
|
403
|
+
sinEq,
|
|
404
|
+
this.mk(OP_AND, [freshGeMinusHalfPi, this.mk(OP_LE, [fresh, halfPi])]),
|
|
405
|
+
]),
|
|
406
|
+
]),
|
|
407
|
+
);
|
|
408
|
+
if (state.options.isComplete) {
|
|
409
|
+
const unspecified = this.mk(OP_U_ASIN, [x], SORT_REAL);
|
|
410
|
+
this.pushConstraint(this.mk(OP_OR, [xGeMinusOne, this.mk(OP_EQ, [fresh, unspecified])]));
|
|
411
|
+
this.pushConstraint(this.mk(OP_OR, [xLeOne, this.mk(OP_EQ, [fresh, unspecified])]));
|
|
412
|
+
}
|
|
413
|
+
return fresh;
|
|
414
|
+
}
|
|
415
|
+
|
|
416
|
+
// Inside [-1, 1], k is acos on its principal range. Outside it, k is acos-u when the
|
|
417
|
+
// purification is complete.
|
|
418
|
+
private processAcos(decl: number, x: number) {
|
|
419
|
+
const state = this.state;
|
|
420
|
+
if (!state.options.isElimInverses) return -1;
|
|
421
|
+
const expr = this.mk(decl, [x], SORT_REAL);
|
|
422
|
+
const processed = state.appToFresh.get(expr);
|
|
423
|
+
if (processed !== undefined) return processed;
|
|
424
|
+
const fresh = this.mkFreshVar(false);
|
|
425
|
+
this.cacheResult(expr, fresh);
|
|
426
|
+
const one = this.mkNumeral(Rational.one, false);
|
|
427
|
+
const minusOne = this.mkNumeral(Rational.minusOne, false);
|
|
428
|
+
const pi = this.manager.piExpr;
|
|
429
|
+
const zero = this.mkNumeral(Rational.zero, false);
|
|
430
|
+
const xGeMinusOne = this.mk(OP_GE, [x, minusOne]);
|
|
431
|
+
const xLtMinusOne = this.mk(OP_NOT, [xGeMinusOne]);
|
|
432
|
+
const xLeOne = this.mk(OP_LE, [x, one]);
|
|
433
|
+
const outside = this.mk(OP_OR, [xLtMinusOne, this.mk(OP_NOT, [xLeOne])]);
|
|
434
|
+
const cosEq = this.mk(OP_EQ, [x, this.mk(OP_COS, [fresh], SORT_REAL)]);
|
|
435
|
+
const freshGeZero = this.mk(OP_GE, [fresh, zero]);
|
|
436
|
+
this.pushConstraint(
|
|
437
|
+
this.mk(OP_OR, [
|
|
438
|
+
outside,
|
|
439
|
+
this.mk(OP_AND, [cosEq, this.mk(OP_AND, [freshGeZero, this.mk(OP_LE, [fresh, pi])])]),
|
|
440
|
+
]),
|
|
441
|
+
);
|
|
442
|
+
if (state.options.isComplete) {
|
|
443
|
+
const unspecified = this.mk(OP_U_ACOS, [x], SORT_REAL);
|
|
444
|
+
this.pushConstraint(this.mk(OP_OR, [xGeMinusOne, this.mk(OP_EQ, [fresh, unspecified])]));
|
|
445
|
+
this.pushConstraint(this.mk(OP_OR, [xLeOne, this.mk(OP_EQ, [fresh, unspecified])]));
|
|
446
|
+
}
|
|
447
|
+
return fresh;
|
|
448
|
+
}
|
|
449
|
+
|
|
450
|
+
private mkHalfPi(sign: bigint) {
|
|
451
|
+
return this.mk(
|
|
452
|
+
OP_MUL,
|
|
453
|
+
[this.mkNumeral(Rational.of(sign, 2n), false), this.manager.piExpr],
|
|
454
|
+
SORT_REAL,
|
|
455
|
+
);
|
|
456
|
+
}
|
|
457
|
+
|
|
458
|
+
private processAtan(decl: number, x: number) {
|
|
459
|
+
const state = this.state;
|
|
460
|
+
if (!state.options.isElimInverses) return -1;
|
|
461
|
+
const expr = this.mk(decl, [x], SORT_REAL);
|
|
462
|
+
const processed = state.appToFresh.get(expr);
|
|
463
|
+
if (processed !== undefined) return processed;
|
|
464
|
+
const fresh = this.mkFreshVar(false);
|
|
465
|
+
this.cacheResult(expr, fresh);
|
|
466
|
+
const halfPi = this.mkHalfPi(1n);
|
|
467
|
+
const minusHalfPi = this.mkHalfPi(-1n);
|
|
468
|
+
const tanEq = this.mk(OP_EQ, [x, this.mk(OP_TAN, [fresh], SORT_REAL)]);
|
|
469
|
+
this.pushConstraint(
|
|
470
|
+
this.mk(OP_AND, [
|
|
471
|
+
tanEq,
|
|
472
|
+
this.mk(OP_AND, [this.mk(OP_GT, [fresh, minusHalfPi]), this.mk(OP_LT, [fresh, halfPi])]),
|
|
473
|
+
]),
|
|
474
|
+
);
|
|
475
|
+
return fresh;
|
|
476
|
+
}
|
|
477
|
+
|
|
478
|
+
private reduce(decl: number, args: number[]) {
|
|
479
|
+
const manager = this.manager;
|
|
480
|
+
const state = this.state;
|
|
481
|
+
const funcDecl = manager.funcDecls[decl];
|
|
482
|
+
if (funcDecl.family !== FAMILY_ARITH || state.cannotPurify.has(decl)) return -1;
|
|
483
|
+
switch (funcDecl.op) {
|
|
484
|
+
case OP_DIV:
|
|
485
|
+
return this.processDiv(decl, args);
|
|
486
|
+
case OP_IDIV:
|
|
487
|
+
return state.cannotPurify.size > 0 ? -1 : this.processIdiv(decl, args);
|
|
488
|
+
case OP_MOD:
|
|
489
|
+
return state.cannotPurify.size > 0 ? -1 : this.processMod(decl, args);
|
|
490
|
+
case OP_TO_INT:
|
|
491
|
+
return this.processToInt(decl, args);
|
|
492
|
+
case OP_POWER:
|
|
493
|
+
return this.processPower(decl, args);
|
|
494
|
+
case OP_ASIN:
|
|
495
|
+
return this.processAsin(decl, args[0]);
|
|
496
|
+
case OP_ACOS:
|
|
497
|
+
return this.processAcos(decl, args[0]);
|
|
498
|
+
case OP_SIN:
|
|
499
|
+
return this.processSinCos(true, decl, args[0]);
|
|
500
|
+
case OP_COS:
|
|
501
|
+
return this.processSinCos(false, decl, args[0]);
|
|
502
|
+
case OP_ATAN:
|
|
503
|
+
return this.processAtan(decl, args[0]);
|
|
504
|
+
default:
|
|
505
|
+
return -1;
|
|
506
|
+
}
|
|
507
|
+
}
|
|
508
|
+
|
|
509
|
+
reduceApp(decl: number, args: number[]) {
|
|
510
|
+
const result = this.reduce(decl, args);
|
|
511
|
+
if (result !== -1) this.manager.incRef(result);
|
|
512
|
+
return result;
|
|
513
|
+
}
|
|
514
|
+
|
|
515
|
+
getSubst(expr: number) {
|
|
516
|
+
const manager = this.manager;
|
|
517
|
+
if (manager.kinds[expr] === KIND_QUANTIFIER) {
|
|
518
|
+
const nested = new PurifyRewriter(manager, this.state);
|
|
519
|
+
const data = manager.getQuantifier(expr);
|
|
520
|
+
const body = nested.engine.rewrite(data.body);
|
|
521
|
+
nested.release();
|
|
522
|
+
const result = this.state.pin(manager.mkQuantifier({ ...data, body }));
|
|
523
|
+
manager.decRef(body);
|
|
524
|
+
return result;
|
|
525
|
+
}
|
|
526
|
+
if (manager.isAlgebraicNumeral(expr) && this.state.options.isElimRootObjects)
|
|
527
|
+
return this.processIrrational(expr);
|
|
528
|
+
return undefined;
|
|
529
|
+
}
|
|
530
|
+
}
|
|
531
|
+
|
|
532
|
+
const mkCongruence = (state: PurifyState, defs: BinDef[], goal: Goal) => {
|
|
533
|
+
const manager = state.manager;
|
|
534
|
+
for (const [index, first] of defs.entries())
|
|
535
|
+
for (const second of defs.slice(index + 1)) {
|
|
536
|
+
const sameX = state.pin(manager.mkApp(OP_EQ, [first.x, second.x], SORT_BOOL));
|
|
537
|
+
const sameY = state.pin(manager.mkApp(OP_EQ, [first.y, second.y], SORT_BOOL));
|
|
538
|
+
const sameArgs = state.pin(manager.mkApp(OP_AND, [sameX, sameY], SORT_BOOL));
|
|
539
|
+
const sameD = state.pin(manager.mkApp(OP_EQ, [first.d, second.d], SORT_BOOL));
|
|
540
|
+
goal.assert(state.pin(manager.mkApp(OP_IMPLIES, [sameArgs, sameD], SORT_BOOL)));
|
|
541
|
+
}
|
|
542
|
+
};
|
|
543
|
+
|
|
544
|
+
// The interpretation of an unspecified operator that maps the arguments of each purified
|
|
545
|
+
// application to its fresh constant.
|
|
546
|
+
const mkTable = (state: PurifyState, defs: BinDef[], sort: number) => {
|
|
547
|
+
const manager = state.manager;
|
|
548
|
+
const pin = (expr: number) => state.pin(expr);
|
|
549
|
+
const first = pin(manager.mkVar(0, sort));
|
|
550
|
+
const second = pin(manager.mkVar(1, sort));
|
|
551
|
+
return defs.reduce(
|
|
552
|
+
(body, def) => {
|
|
553
|
+
const sameX = pin(manager.mkApp(OP_EQ, [first, def.x], SORT_BOOL));
|
|
554
|
+
const sameArgs = pin(
|
|
555
|
+
manager.mkApp(
|
|
556
|
+
OP_AND,
|
|
557
|
+
[sameX, pin(manager.mkApp(OP_EQ, [second, def.y], SORT_BOOL))],
|
|
558
|
+
SORT_BOOL,
|
|
559
|
+
),
|
|
560
|
+
);
|
|
561
|
+
return pin(manager.mkApp(OP_ITE, [sameArgs, def.d, body], sort));
|
|
562
|
+
},
|
|
563
|
+
pin(manager.mkNumeralOfSort(Rational.zero, sort)),
|
|
564
|
+
);
|
|
565
|
+
};
|
|
566
|
+
|
|
567
|
+
export const purifyArith = (manager: AstManager, goal: Goal, options: PurifyOptions) => {
|
|
568
|
+
const state = new PurifyState(manager, goal, options);
|
|
569
|
+
const rewriter = new PurifyRewriter(manager, state);
|
|
570
|
+
const pin = (expr: number) => state.pin(expr);
|
|
571
|
+
for (let index = 0; !goal.isInconsistent && index < goal.forms.size; index++) {
|
|
572
|
+
const rewritten = rewriter.engine.rewrite(goal.forms.items[index]);
|
|
573
|
+
goal.update(index, rewritten);
|
|
574
|
+
manager.decRef(rewritten);
|
|
575
|
+
}
|
|
576
|
+
rewriter.release();
|
|
577
|
+
for (const constraint of state.newConstraints) goal.assert(constraint);
|
|
578
|
+
mkCongruence(state, state.divs, goal);
|
|
579
|
+
mkCongruence(state, state.mods, goal);
|
|
580
|
+
mkCongruence(state, state.idivs, goal);
|
|
581
|
+
const definitions: Definition[] = [...state.appToFresh.entries()].map((entry) => ({
|
|
582
|
+
decl: manager.decls[entry[1]],
|
|
583
|
+
def: -1,
|
|
584
|
+
}));
|
|
585
|
+
if (state.divs.length > 0)
|
|
586
|
+
definitions.push({ decl: OP_DIV0, def: mkTable(state, state.divs, SORT_REAL) });
|
|
587
|
+
if (state.mods.length > 0) {
|
|
588
|
+
const body = mkTable(state, state.mods, SORT_INT);
|
|
589
|
+
definitions.push({ decl: OP_MOD0, def: body });
|
|
590
|
+
const isNonneg = pin(
|
|
591
|
+
manager.mkApp(
|
|
592
|
+
OP_GE,
|
|
593
|
+
[pin(manager.mkVar(1, SORT_INT)), pin(manager.mkNumeralOfSort(Rational.zero, SORT_INT))],
|
|
594
|
+
SORT_BOOL,
|
|
595
|
+
),
|
|
596
|
+
);
|
|
597
|
+
const negated = pin(manager.mkApp(OP_UMINUS, [body], SORT_INT));
|
|
598
|
+
definitions.push({
|
|
599
|
+
decl: OP_MOD0,
|
|
600
|
+
def: pin(manager.mkApp(OP_ITE, [isNonneg, body, negated], SORT_INT)),
|
|
601
|
+
});
|
|
602
|
+
}
|
|
603
|
+
if (state.idivs.length > 0)
|
|
604
|
+
definitions.push({ decl: OP_IDIV0, def: mkTable(state, state.idivs, SORT_INT) });
|
|
605
|
+
if (state.ipower0 !== -1) definitions.push({ decl: OP_POWER0, def: state.ipower0 });
|
|
606
|
+
if (state.rpower0 !== -1) definitions.push({ decl: OP_POWER0, def: state.rpower0 });
|
|
607
|
+
goal.addDefinitions(definitions);
|
|
608
|
+
if (state.sinCos.size > 0) {
|
|
609
|
+
const zero = pin(manager.mkRealNumeral(Rational.zero));
|
|
610
|
+
goal.addDefinitions(
|
|
611
|
+
[...state.sinCos.entries()].map((entry) => {
|
|
612
|
+
const [sin, cos] = entry[1];
|
|
613
|
+
const isNonneg = pin(manager.mkApp(OP_GE, [sin, zero], SORT_BOOL));
|
|
614
|
+
const acos = pin(manager.mkApp(OP_ACOS, [cos], SORT_REAL));
|
|
615
|
+
const negated = pin(manager.mkApp(OP_UMINUS, [cos], SORT_REAL));
|
|
616
|
+
const shifted = pin(
|
|
617
|
+
manager.mkApp(
|
|
618
|
+
OP_ADD,
|
|
619
|
+
[pin(manager.mkApp(OP_ACOS, [negated], SORT_REAL)), manager.piExpr],
|
|
620
|
+
SORT_REAL,
|
|
621
|
+
),
|
|
622
|
+
);
|
|
623
|
+
return {
|
|
624
|
+
decl: manager.decls[entry[0]],
|
|
625
|
+
def: pin(manager.mkApp(OP_ITE, [isNonneg, acos, shifted], SORT_REAL)),
|
|
626
|
+
};
|
|
627
|
+
}),
|
|
628
|
+
);
|
|
629
|
+
}
|
|
630
|
+
goal.depth++;
|
|
631
|
+
state.pinned.reset();
|
|
632
|
+
};
|