tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +119 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +224 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +31 -74
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +1 -44
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +0 -2
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1026 -658
- 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 -16
- 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 +615 -53
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- 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 +338 -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 +110 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- 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 +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- 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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- package/src/prover/smt/solver/expr2polynomial.ts +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- 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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -9
- package/src/prover/smt/solver/hashtable.ts +26 -23
- 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 +112 -132
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +91 -135
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 -21
- 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 +19 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -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 +308 -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 +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +8 -23
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +43 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +1986 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -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 +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +67 -41
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +832 -484
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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
|
@@ -1,8 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/math/polynomial/algebraic_numbers.cpp, src/util/basic_interval.h,
|
|
2
|
-
// src/util/mpbq.cpp), MIT license, see z3-license.txt. Real algebraic numbers: a rational, or the
|
|
3
|
-
// root of a square-free integer polynomial in an open isolating interval of binary rationals whose
|
|
4
|
-
// ends the polynomial has opposite signs at. Comparing and evaluating refine these intervals in
|
|
5
|
-
// place, and may find a number rational, as Z3 does, so later operations see Z3's intervals.
|
|
6
1
|
import { SmtInvariantError } from "../../../../errors";
|
|
7
2
|
import { Rational } from "../rational";
|
|
8
3
|
import { getLog2, Mpbq } from "./mpbq";
|
|
@@ -10,13 +5,9 @@ import { PolynomialManager, type Polynomial, type ValueOps } from "./polynomial"
|
|
|
10
5
|
import { UpolynomialManager, type Upolynomial } from "./upolynomial";
|
|
11
6
|
import { factorUpolynomial, type FactorParams } from "./upolynomial-factorization";
|
|
12
7
|
|
|
13
|
-
// algebraic.factor_max_prime, factor_num_primes and factor_search_size.
|
|
14
8
|
const FACTOR_PARAMS: FactorParams = { maxPrime: 31, primeTrials: 1, maxSearchSize: 5000 };
|
|
15
|
-
// -algebraic.min_mag: a refined interval narrower than about 1/2^16 is not kept.
|
|
16
9
|
const MIN_MAGNITUDE = -16;
|
|
17
|
-
// DEFAULT_PRECISION: how far isolate_roots with signs refines each root first.
|
|
18
10
|
const SIGN_PRECISION = 2;
|
|
19
|
-
// The variables of the polynomials the binary operations build, m_x and m_y.
|
|
20
11
|
const X = 0;
|
|
21
12
|
const Y = 1;
|
|
22
13
|
|
|
@@ -28,7 +19,6 @@ class AlgebraicCell {
|
|
|
28
19
|
public isMinimal: boolean,
|
|
29
20
|
public isSignLowerNeg: boolean,
|
|
30
21
|
public isNotRational: boolean,
|
|
31
|
-
// m_i: which root of p the number is, from 1, or 0 when not yet computed.
|
|
32
22
|
public rootIndex: number,
|
|
33
23
|
) {}
|
|
34
24
|
|
|
@@ -49,7 +39,6 @@ class AlgebraicCell {
|
|
|
49
39
|
}
|
|
50
40
|
}
|
|
51
41
|
|
|
52
|
-
// anum: a mutable handle, since refining an algebraic number may turn it into a rational.
|
|
53
42
|
export class Anum {
|
|
54
43
|
constructor(public value: Rational | AlgebraicCell) {}
|
|
55
44
|
}
|
|
@@ -59,14 +48,11 @@ interface BqInterval {
|
|
|
59
48
|
upper: Mpbq;
|
|
60
49
|
}
|
|
61
50
|
|
|
62
|
-
// One end of the interval select_small picks from: a binary rational end is closed, a rational one
|
|
63
|
-
// open.
|
|
64
51
|
interface SelectEnd {
|
|
65
52
|
value: Rational;
|
|
66
53
|
isOpen: boolean;
|
|
67
54
|
}
|
|
68
55
|
|
|
69
|
-
// save_intervals: an interval to restore when refining it made it too narrow to keep.
|
|
70
56
|
interface SavedInterval {
|
|
71
57
|
anum: Anum;
|
|
72
58
|
lower: Mpbq;
|
|
@@ -74,7 +60,6 @@ interface SavedInterval {
|
|
|
74
60
|
isRestored: boolean;
|
|
75
61
|
}
|
|
76
62
|
|
|
77
|
-
// The factor whose Sturm sequence counts the one root in an interval.
|
|
78
63
|
interface IsolatingFactor {
|
|
79
64
|
factor: Upolynomial;
|
|
80
65
|
sequence: Upolynomial[];
|
|
@@ -91,10 +76,17 @@ interface SignedRoots {
|
|
|
91
76
|
signs: number[];
|
|
92
77
|
}
|
|
93
78
|
|
|
94
|
-
const
|
|
95
|
-
const
|
|
79
|
+
const getMinBq = (first: Mpbq, second: Mpbq) => (second.compare(first) < 0 ? second : first);
|
|
80
|
+
const getMaxBq = (first: Mpbq, second: Mpbq) => (second.compare(first) > 0 ? second : first);
|
|
81
|
+
|
|
82
|
+
const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
|
|
83
|
+
const lower = base.lower.power(exponent);
|
|
84
|
+
const upper = base.upper.power(exponent);
|
|
85
|
+
if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
|
|
86
|
+
if (base.upper.isNeg) return { lower: upper, upper: lower };
|
|
87
|
+
return { lower: Mpbq.zero, upper: getMaxBq(lower, upper) };
|
|
88
|
+
};
|
|
96
89
|
|
|
97
|
-
// mpbqi_manager over open intervals, as t_eval uses it.
|
|
98
90
|
const INTERVAL_OPS: ValueOps<BqInterval> = {
|
|
99
91
|
fromInteger: (value) => ({ lower: Mpbq.of(value), upper: Mpbq.of(value) }),
|
|
100
92
|
add: (first, second) => ({
|
|
@@ -108,26 +100,16 @@ const INTERVAL_OPS: ValueOps<BqInterval> = {
|
|
|
108
100
|
first.upper.mul(second.lower),
|
|
109
101
|
first.upper.mul(second.upper),
|
|
110
102
|
];
|
|
111
|
-
return { lower: products.reduce(
|
|
103
|
+
return { lower: products.reduce(getMinBq), upper: products.reduce(getMaxBq) };
|
|
112
104
|
},
|
|
113
|
-
power:
|
|
114
|
-
};
|
|
115
|
-
|
|
116
|
-
const getIntervalPower = (base: BqInterval, exponent: number): BqInterval => {
|
|
117
|
-
const lower = base.lower.power(exponent);
|
|
118
|
-
const upper = base.upper.power(exponent);
|
|
119
|
-
if (exponent % 2 === 1 || !base.lower.isNeg) return { lower, upper };
|
|
120
|
-
if (base.upper.isNeg) return { lower: upper, upper: lower };
|
|
121
|
-
return { lower: Mpbq.zero, upper: maxBq(lower, upper) };
|
|
105
|
+
power: getIntervalPower,
|
|
122
106
|
};
|
|
123
107
|
|
|
124
108
|
const containsZero = (interval: BqInterval) => interval.lower.isNeg && interval.upper.isPos;
|
|
125
109
|
|
|
126
|
-
// mpz log2 and mlog2: 0 outside the sign they expect.
|
|
127
110
|
const getPositiveLog2 = (value: bigint) => (value <= 0n ? 0 : getLog2(value));
|
|
128
111
|
const getNegativeLog2 = (value: bigint) => (value >= 0n ? 0 : getLog2(value));
|
|
129
112
|
|
|
130
|
-
// magnitude_ub
|
|
131
113
|
const getMagnitudeUpperBound = (value: Mpbq) =>
|
|
132
114
|
value.isZero
|
|
133
115
|
? 0
|
|
@@ -135,14 +117,12 @@ const getMagnitudeUpperBound = (value: Mpbq) =>
|
|
|
135
117
|
? getLog2(value.num) - value.k + 1
|
|
136
118
|
: getNegativeLog2(value.num) - value.k;
|
|
137
119
|
|
|
138
|
-
// magnitude: about log2 of the width of (l, u).
|
|
139
120
|
const getMagnitude = (lower: Mpbq, upper: Mpbq) => {
|
|
140
121
|
if (lower.k === upper.k) return getMagnitudeUpperBound(lower);
|
|
141
122
|
const log2 = lower.isNeg ? getNegativeLog2 : getPositiveLog2;
|
|
142
123
|
return log2(upper.num) - log2(lower.num) - upper.k + lower.k - upper.k;
|
|
143
124
|
};
|
|
144
125
|
|
|
145
|
-
// select_integer: the integer select_small takes from scaled ends, preferring a closed end.
|
|
146
126
|
const selectInteger = (
|
|
147
127
|
lower: SelectEnd,
|
|
148
128
|
upper: SelectEnd,
|
|
@@ -158,8 +138,6 @@ const selectInteger = (
|
|
|
158
138
|
return ceilLower <= floorUpper ? ceilLower : null;
|
|
159
139
|
};
|
|
160
140
|
|
|
161
|
-
// select_small_core: the binary rational between two ends with the smallest power of two as its
|
|
162
|
-
// denominator.
|
|
163
141
|
const selectSmall = (lower: SelectEnd, upper: SelectEnd) => {
|
|
164
142
|
for (let k = 0; ; k++) {
|
|
165
143
|
const scale = Rational.of(1n << BigInt(k));
|
|
@@ -189,9 +167,62 @@ const getExtended = (values: readonly (Anum | undefined)[], variable: number, an
|
|
|
189
167
|
return extended;
|
|
190
168
|
};
|
|
191
169
|
|
|
192
|
-
const
|
|
170
|
+
const getSmt2Numeral = (value: bigint) => (value < 0n ? `(- ${-value})` : `${value}`);
|
|
171
|
+
|
|
172
|
+
const getSmt2Monomial = (coeff: bigint, degree: number) => {
|
|
173
|
+
if (degree === 0) return getSmt2Numeral(coeff);
|
|
174
|
+
const power = degree === 1 ? "x" : `(^ x ${degree})`;
|
|
175
|
+
return coeff === 1n ? power : `(* ${getSmt2Numeral(coeff)} ${power})`;
|
|
176
|
+
};
|
|
177
|
+
|
|
178
|
+
const getUpolynomialSmt2 = (p: Upolynomial) => {
|
|
179
|
+
if (p.length === 0) return "0";
|
|
180
|
+
const nonzero = p.flatMap((coeff, degree) => (coeff === 0n ? [] : [degree]));
|
|
181
|
+
if (nonzero.length === 1) return getSmt2Monomial(p[nonzero[0]], nonzero[0]);
|
|
182
|
+
return `(+ ${nonzero
|
|
183
|
+
.reverse()
|
|
184
|
+
.map((degree) => getSmt2Monomial(p[degree], degree))
|
|
185
|
+
.join(" ")})`;
|
|
186
|
+
};
|
|
187
|
+
|
|
188
|
+
const getRationalDecimal = (value: Rational, precision: number) => {
|
|
189
|
+
const magnitude = value.num < 0n ? -value.num : value.num;
|
|
190
|
+
const sign = value.num < 0n ? "-" : "";
|
|
191
|
+
let remainder = magnitude % value.den;
|
|
192
|
+
if (remainder === 0n) return `${sign}${magnitude / value.den}`;
|
|
193
|
+
const digits: string[] = [];
|
|
194
|
+
for (let index = 0; index < precision && remainder !== 0n; index++) {
|
|
195
|
+
digits.push(`${(remainder * 10n) / value.den}`);
|
|
196
|
+
remainder = (remainder * 10n) % value.den;
|
|
197
|
+
}
|
|
198
|
+
return `${sign}${magnitude / value.den}.${digits.join("")}${remainder === 0n ? "" : "?"}`;
|
|
199
|
+
};
|
|
200
|
+
|
|
201
|
+
const hasSameCoeffs = (first: Upolynomial, second: Upolynomial) =>
|
|
193
202
|
first.length === second.length && first.every((coeff, index) => coeff === second[index]);
|
|
194
203
|
|
|
204
|
+
export const mergeSortIndices = (
|
|
205
|
+
count: number,
|
|
206
|
+
isLess: (first: number, second: number) => boolean,
|
|
207
|
+
) => {
|
|
208
|
+
let source = Array.from({ length: count }, (_unused, index) => index);
|
|
209
|
+
for (let width = 1; width < count; width *= 2) {
|
|
210
|
+
const target: number[] = [];
|
|
211
|
+
for (let low = 0; low < count; low += 2 * width) {
|
|
212
|
+
const middle = Math.min(low + width, count);
|
|
213
|
+
const high = Math.min(low + 2 * width, count);
|
|
214
|
+
let left = low;
|
|
215
|
+
let right = middle;
|
|
216
|
+
while (left < middle && right < high)
|
|
217
|
+
target.push(isLess(source[right], source[left]) ? source[right++] : source[left++]);
|
|
218
|
+
while (left < middle) target.push(source[left++]);
|
|
219
|
+
while (right < high) target.push(source[right++]);
|
|
220
|
+
}
|
|
221
|
+
source = target;
|
|
222
|
+
}
|
|
223
|
+
return source;
|
|
224
|
+
};
|
|
225
|
+
|
|
195
226
|
export class AlgebraicManager {
|
|
196
227
|
private um = new UpolynomialManager();
|
|
197
228
|
private pm = new PolynomialManager();
|
|
@@ -202,8 +233,6 @@ export class AlgebraicManager {
|
|
|
202
233
|
power: (base, exponent) => this.power(base, exponent),
|
|
203
234
|
};
|
|
204
235
|
|
|
205
|
-
// Queries.
|
|
206
|
-
|
|
207
236
|
isZero(anum: Anum) {
|
|
208
237
|
return anum.value instanceof Rational && anum.value.isZero();
|
|
209
238
|
}
|
|
@@ -213,11 +242,20 @@ export class AlgebraicManager {
|
|
|
213
242
|
return anum.value instanceof Rational ? 1 : anum.value.p.length - 1;
|
|
214
243
|
}
|
|
215
244
|
|
|
245
|
+
isNeg(anum: Anum) {
|
|
246
|
+
return anum.value instanceof Rational ? anum.value.isNegative() : !anum.value.upper.isPos;
|
|
247
|
+
}
|
|
248
|
+
|
|
249
|
+
toRational(anum: Anum) {
|
|
250
|
+
if (!this.isRational(anum) || !(anum.value instanceof Rational))
|
|
251
|
+
throw new SmtInvariantError("expected a rational algebraic number");
|
|
252
|
+
return anum.value;
|
|
253
|
+
}
|
|
254
|
+
|
|
216
255
|
copy(anum: Anum) {
|
|
217
256
|
return new Anum(anum.value instanceof Rational ? anum.value : anum.value.clone());
|
|
218
257
|
}
|
|
219
258
|
|
|
220
|
-
// is_int: refines the interval until it holds at most one integer, then tests it.
|
|
221
259
|
isInt(anum: Anum): boolean {
|
|
222
260
|
if (anum.value instanceof Rational) return anum.value.isInt();
|
|
223
261
|
const cell = anum.value;
|
|
@@ -231,8 +269,6 @@ export class AlgebraicManager {
|
|
|
231
269
|
return false;
|
|
232
270
|
}
|
|
233
271
|
|
|
234
|
-
// is_rational: by the rational root theorem, the only candidate in an interval narrower than
|
|
235
|
-
// 1/|a_n| is floor(u*|a_n|)/|a_n|.
|
|
236
272
|
isRational(anum: Anum) {
|
|
237
273
|
if (anum.value instanceof Rational) return true;
|
|
238
274
|
const cell = anum.value;
|
|
@@ -250,7 +286,6 @@ export class AlgebraicManager {
|
|
|
250
286
|
return isRoot;
|
|
251
287
|
}
|
|
252
288
|
|
|
253
|
-
// get_i: which root of its polynomial the number is.
|
|
254
289
|
getRootIndex(anum: Anum) {
|
|
255
290
|
if (anum.value instanceof Rational) return this.isZero(anum) ? 0 : 1;
|
|
256
291
|
const cell = anum.value;
|
|
@@ -258,9 +293,6 @@ export class AlgebraicManager {
|
|
|
258
293
|
return cell.rootIndex;
|
|
259
294
|
}
|
|
260
295
|
|
|
261
|
-
// Cells.
|
|
262
|
-
|
|
263
|
-
// mk_algebraic_cell: the coefficients made primitive with a positive leading coefficient.
|
|
264
296
|
private mkCell(p: Upolynomial, lower: Mpbq, upper: Mpbq, isMinimal: boolean) {
|
|
265
297
|
const cell = new AlgebraicCell(p, lower, upper, isMinimal, false, isMinimal, 0);
|
|
266
298
|
this.updateSignLower(cell);
|
|
@@ -276,13 +308,11 @@ export class AlgebraicManager {
|
|
|
276
308
|
cell.isSignLowerNeg = this.um.evalSignAtBq(cell.p, cell.lower) < 0;
|
|
277
309
|
}
|
|
278
310
|
|
|
279
|
-
// set(a, p, l, u, minimal): the root of p in (l, u), a rational when p is linear.
|
|
280
311
|
private mkAnum(p: Upolynomial, lower: Mpbq, upper: Mpbq, isMinimal: boolean) {
|
|
281
312
|
if (p.length === 2) return new Anum(Rational.of(p[0]).div(Rational.of(p[1])).neg());
|
|
282
313
|
return new Anum(this.mkCell(p, lower, upper, isMinimal));
|
|
283
314
|
}
|
|
284
315
|
|
|
285
|
-
// normalize: an interval around zero shrunk to the side of zero holding the root.
|
|
286
316
|
private normalize(anum: Anum) {
|
|
287
317
|
if (anum.value instanceof Rational) return;
|
|
288
318
|
const cell = anum.value;
|
|
@@ -295,9 +325,6 @@ export class AlgebraicManager {
|
|
|
295
325
|
cell.upper = interval.upper;
|
|
296
326
|
}
|
|
297
327
|
|
|
298
|
-
// Refinement.
|
|
299
|
-
|
|
300
|
-
// refine: halves the interval, or finds the number rational and returns false.
|
|
301
328
|
private refine(anum: Anum) {
|
|
302
329
|
if (anum.value instanceof Rational) return false;
|
|
303
330
|
const cell = anum.value;
|
|
@@ -316,7 +343,6 @@ export class AlgebraicManager {
|
|
|
316
343
|
return true;
|
|
317
344
|
}
|
|
318
345
|
|
|
319
|
-
// refine_until_prec: refines until the interval is narrower than 1/2^precision.
|
|
320
346
|
private refineUntilPrecision(anum: Anum, precision: number) {
|
|
321
347
|
if (anum.value instanceof Rational) return true;
|
|
322
348
|
const cell = anum.value;
|
|
@@ -339,7 +365,6 @@ export class AlgebraicManager {
|
|
|
339
365
|
return { anum, lower: cell.lower, upper: cell.upper, isRestored: false };
|
|
340
366
|
}
|
|
341
367
|
|
|
342
|
-
// restore_if_too_small: swaps the saved interval back in when the current one is too narrow.
|
|
343
368
|
private restoreIfTooSmall(saved: SavedInterval) {
|
|
344
369
|
saved.isRestored = true;
|
|
345
370
|
if (saved.anum.value instanceof Rational) return;
|
|
@@ -353,24 +378,20 @@ export class AlgebraicManager {
|
|
|
353
378
|
];
|
|
354
379
|
}
|
|
355
380
|
|
|
356
|
-
// ~save_intervals
|
|
357
381
|
private releaseInterval(saved: SavedInterval) {
|
|
358
382
|
if (!saved.isRestored) this.restoreIfTooSmall(saved);
|
|
359
383
|
}
|
|
360
384
|
|
|
361
|
-
// Root isolation.
|
|
362
|
-
|
|
363
385
|
private factor(p: Upolynomial) {
|
|
364
386
|
return factorUpolynomial(this.um, p, FACTOR_PARAMS);
|
|
365
387
|
}
|
|
366
388
|
|
|
367
|
-
|
|
368
|
-
private isolateUnivariateRoots(up: Upolynomial) {
|
|
389
|
+
isolateUnivariateRoots(coeffs: Upolynomial) {
|
|
369
390
|
const roots: Anum[] = [];
|
|
370
|
-
if (
|
|
371
|
-
const hasZeroRoot = this.um.hasZeroRoots(
|
|
391
|
+
if (coeffs.length === 0) return roots;
|
|
392
|
+
const hasZeroRoot = this.um.hasZeroRoots(coeffs);
|
|
372
393
|
if (hasZeroRoot) roots.push(new Anum(Rational.zero));
|
|
373
|
-
const factored = this.factor(hasZeroRoot ? this.um.removeZeroRoots(
|
|
394
|
+
const factored = this.factor(hasZeroRoot ? this.um.removeZeroRoots(coeffs) : coeffs);
|
|
374
395
|
for (const factor of factored.factors.factors) {
|
|
375
396
|
const degree = factor.length - 1;
|
|
376
397
|
if (degree <= 0) continue;
|
|
@@ -399,32 +420,13 @@ export class AlgebraicManager {
|
|
|
399
420
|
return roots;
|
|
400
421
|
}
|
|
401
422
|
|
|
402
|
-
// sort_roots: Z3's stable bottom-up merge sort, since each comparison may refine the roots.
|
|
403
423
|
private sortRoots(roots: Anum[]) {
|
|
404
|
-
|
|
405
|
-
|
|
406
|
-
|
|
407
|
-
|
|
408
|
-
|
|
409
|
-
|
|
410
|
-
let source = roots.map((_root, index) => index);
|
|
411
|
-
let target = [...source];
|
|
412
|
-
for (let width = 1; width < size; width *= 2) {
|
|
413
|
-
for (let low = 0; low < size; low += 2 * width) {
|
|
414
|
-
const middle = Math.min(low + width, size);
|
|
415
|
-
const high = Math.min(low + 2 * width, size);
|
|
416
|
-
let left = low;
|
|
417
|
-
let right = middle;
|
|
418
|
-
let next = low;
|
|
419
|
-
while (left < middle && right < high)
|
|
420
|
-
target[next++] = isLess(source[right], source[left]) ? source[right++] : source[left++];
|
|
421
|
-
while (left < middle) target[next++] = source[left++];
|
|
422
|
-
while (right < high) target[next++] = source[right++];
|
|
423
|
-
}
|
|
424
|
-
[source, target] = [target, source];
|
|
425
|
-
}
|
|
426
|
-
const sorted = source.map((index) => roots[index]);
|
|
427
|
-
for (let index = 0; index < size; index++) roots[index] = sorted[index];
|
|
424
|
+
if (roots.length < 2) return;
|
|
425
|
+
const sorted = mergeSortIndices(
|
|
426
|
+
roots.length,
|
|
427
|
+
(first, second) => this.compare(roots[first], roots[second]) < 0,
|
|
428
|
+
).map((index) => roots[index]);
|
|
429
|
+
for (let index = 0; index < sorted.length; index++) roots[index] = sorted[index];
|
|
428
430
|
}
|
|
429
431
|
|
|
430
432
|
private getSignVariationsAtQ(sequence: Upolynomial[], value: Rational) {
|
|
@@ -440,7 +442,6 @@ export class AlgebraicManager {
|
|
|
440
442
|
return count;
|
|
441
443
|
}
|
|
442
444
|
|
|
443
|
-
// isolate_kth_root: the i-th real root of a square-free p, by bisecting with its Sturm sequence.
|
|
444
445
|
private isolateKthRoot(p: Upolynomial, sequence: Upolynomial[], rootIndex: number) {
|
|
445
446
|
if (p.length === 2) return new Anum(Rational.of(p[0]).div(Rational.of(p[1])).neg());
|
|
446
447
|
const minusInf = this.um.signVariationsAtMinusInf(sequence);
|
|
@@ -478,8 +479,6 @@ export class AlgebraicManager {
|
|
|
478
479
|
);
|
|
479
480
|
}
|
|
480
481
|
|
|
481
|
-
// rational_root_in_interval: the root of p in (l, u) when it is rational, else the interval
|
|
482
|
-
// refined below 1/|a_n|.
|
|
483
482
|
private getRationalRootIn(p: Upolynomial, lower: Mpbq, upper: Mpbq): Rational | BqInterval {
|
|
484
483
|
const leading = p[p.length - 1];
|
|
485
484
|
const absLeading = leading < 0n ? -leading : leading;
|
|
@@ -491,17 +490,16 @@ export class AlgebraicManager {
|
|
|
491
490
|
return { lower: refined.lower, upper: refined.upper };
|
|
492
491
|
}
|
|
493
492
|
|
|
494
|
-
|
|
495
|
-
private isolateUnivariateClosest(
|
|
493
|
+
private isolateRootsClosestUnivariate(
|
|
496
494
|
pm: PolynomialManager,
|
|
497
495
|
polynomial: Polynomial,
|
|
498
496
|
sample: Rational,
|
|
499
497
|
): ClosestAnums {
|
|
500
498
|
const result: ClosestAnums = { roots: [], indices: [] };
|
|
501
499
|
if (pm.isConst(polynomial)) return result;
|
|
502
|
-
const
|
|
503
|
-
if (
|
|
504
|
-
const p = this.um.squareFree(
|
|
500
|
+
const coeffs = pm.toCoeffs(polynomial);
|
|
501
|
+
if (coeffs.length === 0) return result;
|
|
502
|
+
const p = this.um.squareFree(coeffs);
|
|
505
503
|
if (p.length <= 1) return result;
|
|
506
504
|
const sequence = this.um.sturmSeq(p);
|
|
507
505
|
const minusInf = this.um.signVariationsAtMinusInf(sequence);
|
|
@@ -522,9 +520,6 @@ export class AlgebraicManager {
|
|
|
522
520
|
return result;
|
|
523
521
|
}
|
|
524
522
|
|
|
525
|
-
// isolate_roots(p, x2v): the roots of p in its one unassigned variable at the values of the
|
|
526
|
-
// others. Resultants eliminate the irrational values, and the roots of the result that are not
|
|
527
|
-
// roots of p are filtered out.
|
|
528
523
|
isolateRoots(
|
|
529
524
|
pm: PolynomialManager,
|
|
530
525
|
polynomial: Polynomial,
|
|
@@ -549,15 +544,15 @@ export class AlgebraicManager {
|
|
|
549
544
|
}
|
|
550
545
|
if (q.size > 0) {
|
|
551
546
|
if (pm.isConst(q)) return [];
|
|
552
|
-
return this.
|
|
547
|
+
return this.isolateUnivariateRoots(pm.toCoeffs(q)).filter(
|
|
548
|
+
(root) => this.evalSignAt(pm, reduced, getExtended(values, x, root)) === 0,
|
|
549
|
+
);
|
|
553
550
|
}
|
|
554
551
|
if (isNested)
|
|
555
552
|
throw new SmtInvariantError("resultant vanished during nested isolate_roots call");
|
|
556
553
|
return this.isolateVanishedRoots(pm, reduced, values, xs, x);
|
|
557
554
|
}
|
|
558
555
|
|
|
559
|
-
// The resultant vanished, perhaps at another root of a value's polynomial: p's leading
|
|
560
|
-
// coefficient at the values decides.
|
|
561
556
|
private isolateVanishedRoots(
|
|
562
557
|
pm: PolynomialManager,
|
|
563
558
|
reduced: Polynomial,
|
|
@@ -583,7 +578,6 @@ export class AlgebraicManager {
|
|
|
583
578
|
if (!this.isZero(leading)) break;
|
|
584
579
|
}
|
|
585
580
|
if (power === 0) return [];
|
|
586
|
-
// z*x^i + c_{i-1}*x^{i-1} + ... + c_0, with z the value of the leading coefficient.
|
|
587
581
|
const z = Math.max(...xs) + 1;
|
|
588
582
|
const q = this.pm.add(
|
|
589
583
|
this.pm.mul(this.pm.mkVar(z), this.pm.mkVar(x, power)),
|
|
@@ -592,7 +586,6 @@ export class AlgebraicManager {
|
|
|
592
586
|
return this.isolateRoots(this.pm, q, getExtended(values, z, leading), true);
|
|
593
587
|
}
|
|
594
588
|
|
|
595
|
-
// convert: p in the local manager, without its monomials of degree above maxDegree in x.
|
|
596
589
|
private convert(pm: PolynomialManager, polynomial: Polynomial, x = -1, maxDegree = Infinity) {
|
|
597
590
|
if (pm === this.pm) return polynomial;
|
|
598
591
|
const as: bigint[] = [];
|
|
@@ -606,7 +599,6 @@ export class AlgebraicManager {
|
|
|
606
599
|
return this.pm.mkPolynomial(as, ms);
|
|
607
600
|
}
|
|
608
601
|
|
|
609
|
-
// std::stable_sort with var_degree_lt: by the degree of each value, unassigned last.
|
|
610
602
|
private sortByDegree(xs: number[], values: readonly (Anum | undefined)[]) {
|
|
611
603
|
const getDegree = (variable: number) => {
|
|
612
604
|
const value = values[variable];
|
|
@@ -615,20 +607,6 @@ export class AlgebraicManager {
|
|
|
615
607
|
return [...xs].sort((first, second) => getDegree(first) - getDegree(second));
|
|
616
608
|
}
|
|
617
609
|
|
|
618
|
-
// filter_roots: the roots at which p vanishes.
|
|
619
|
-
private filterRoots(
|
|
620
|
-
pm: PolynomialManager,
|
|
621
|
-
polynomial: Polynomial,
|
|
622
|
-
values: readonly (Anum | undefined)[],
|
|
623
|
-
x: number,
|
|
624
|
-
roots: Anum[],
|
|
625
|
-
) {
|
|
626
|
-
return roots.filter(
|
|
627
|
-
(root) => this.evalSignAt(pm, polynomial, getExtended(values, x, root)) === 0,
|
|
628
|
-
);
|
|
629
|
-
}
|
|
630
|
-
|
|
631
|
-
// isolate_roots_closest: the roots of p next to the rational s, with their indices from 1.
|
|
632
610
|
isolateRootsClosest(
|
|
633
611
|
pm: PolynomialManager,
|
|
634
612
|
polynomial: Polynomial,
|
|
@@ -637,12 +615,13 @@ export class AlgebraicManager {
|
|
|
637
615
|
): ClosestAnums {
|
|
638
616
|
const result: ClosestAnums = { roots: [], indices: [] };
|
|
639
617
|
if (pm.isConst(polynomial)) return result;
|
|
640
|
-
if (pm.isUnivariate(polynomial))
|
|
618
|
+
if (pm.isUnivariate(polynomial))
|
|
619
|
+
return this.isolateRootsClosestUnivariate(pm, polynomial, sample);
|
|
641
620
|
const reduced = pm.substituteRational(polynomial, getRationalValues(values));
|
|
642
621
|
if (pm.isConst(reduced)) return result;
|
|
643
622
|
if (pm.isUnivariate(reduced)) {
|
|
644
623
|
if (values[pm.maxVar(reduced)] !== undefined) return result;
|
|
645
|
-
return this.
|
|
624
|
+
return this.isolateRootsClosestUnivariate(pm, reduced, sample);
|
|
646
625
|
}
|
|
647
626
|
const all = this.isolateRoots(pm, polynomial, values);
|
|
648
627
|
const sampleAnum = new Anum(sample);
|
|
@@ -668,8 +647,6 @@ export class AlgebraicManager {
|
|
|
668
647
|
return result;
|
|
669
648
|
}
|
|
670
649
|
|
|
671
|
-
// isolate_roots(p, x2v, roots, signs): the roots, and the sign of p below, between and above
|
|
672
|
-
// them, at a sample the unassigned variables share.
|
|
673
650
|
isolateRootsWithSigns(
|
|
674
651
|
pm: PolynomialManager,
|
|
675
652
|
polynomial: Polynomial,
|
|
@@ -691,11 +668,6 @@ export class AlgebraicManager {
|
|
|
691
668
|
return { roots, signs };
|
|
692
669
|
}
|
|
693
670
|
|
|
694
|
-
// Signs.
|
|
695
|
-
|
|
696
|
-
// eval_sign_at: the sign of p at the values. Rational values are substituted, interval
|
|
697
|
-
// arithmetic on the irrational ones decides most signs, and otherwise a lower bound on the
|
|
698
|
-
// nonzero roots of the resultant with their polynomials tells zero apart.
|
|
699
671
|
evalSignAt(pm: PolynomialManager, polynomial: Polynomial, values: readonly (Anum | undefined)[]) {
|
|
700
672
|
while (true) {
|
|
701
673
|
const rationalValues = getRationalValues(values);
|
|
@@ -733,7 +705,6 @@ export class AlgebraicManager {
|
|
|
733
705
|
}
|
|
734
706
|
}
|
|
735
707
|
|
|
736
|
-
// The resultant step of eval_sign_at, or null when a value turned rational and it restarts.
|
|
737
708
|
private evalSignByResultant(
|
|
738
709
|
pm: PolynomialManager,
|
|
739
710
|
reduced: Polynomial,
|
|
@@ -767,8 +738,6 @@ export class AlgebraicManager {
|
|
|
767
738
|
return sign;
|
|
768
739
|
}
|
|
769
740
|
|
|
770
|
-
// Arithmetic.
|
|
771
|
-
|
|
772
741
|
add(first: Anum, second: Anum): Anum {
|
|
773
742
|
if (this.isZero(first)) return this.copy(second);
|
|
774
743
|
if (this.isZero(second)) return this.copy(first);
|
|
@@ -780,7 +749,6 @@ export class AlgebraicManager {
|
|
|
780
749
|
return this.mkBinary(first, second, true);
|
|
781
750
|
}
|
|
782
751
|
|
|
783
|
-
// add(cell, basic): p(x - b), with the interval shifted by b.
|
|
784
752
|
private addRational(cell: AlgebraicCell, value: Rational) {
|
|
785
753
|
const p = this.um.translateQ(cell.p, value.neg());
|
|
786
754
|
const shift = Mpbq.fromRational(value);
|
|
@@ -806,7 +774,6 @@ export class AlgebraicManager {
|
|
|
806
774
|
return this.mkBinary(first, second, false);
|
|
807
775
|
}
|
|
808
776
|
|
|
809
|
-
// mul(cell, basic): b^n * p(x/b), with the interval scaled by b.
|
|
810
777
|
private mulRational(cell: AlgebraicCell, value: Rational) {
|
|
811
778
|
const p = this.um.composePQX(cell.p, Rational.one.div(value));
|
|
812
779
|
const scale = Mpbq.fromRational(value);
|
|
@@ -830,7 +797,6 @@ export class AlgebraicManager {
|
|
|
830
797
|
return result;
|
|
831
798
|
}
|
|
832
799
|
|
|
833
|
-
// neg: p(-x) with the interval mirrored, in place.
|
|
834
800
|
neg(anum: Anum) {
|
|
835
801
|
if (anum.value instanceof Rational) {
|
|
836
802
|
anum.value = anum.value.neg();
|
|
@@ -843,7 +809,6 @@ export class AlgebraicManager {
|
|
|
843
809
|
this.updateSignLower(cell);
|
|
844
810
|
}
|
|
845
811
|
|
|
846
|
-
// refine_nz_bound: moves an interval end off zero, halving it until its sign is right.
|
|
847
812
|
private refineNonzeroBound(anum: Anum) {
|
|
848
813
|
if (anum.value instanceof Rational) return;
|
|
849
814
|
const cell = anum.value;
|
|
@@ -864,7 +829,6 @@ export class AlgebraicManager {
|
|
|
864
829
|
}
|
|
865
830
|
}
|
|
866
831
|
|
|
867
|
-
// inv: x^n * p(1/x), with the interval (1/u, 1/l), in place.
|
|
868
832
|
inv(anum: Anum) {
|
|
869
833
|
if (this.isZero(anum)) throw new SmtInvariantError("division by zero");
|
|
870
834
|
this.refineNonzeroBound(anum);
|
|
@@ -902,20 +866,90 @@ export class AlgebraicManager {
|
|
|
902
866
|
return this.mkPower(anum, exponent);
|
|
903
867
|
}
|
|
904
868
|
|
|
905
|
-
|
|
869
|
+
root(anum: Anum, k: number): Anum {
|
|
870
|
+
if (k === 0) throw new SmtInvariantError("0-th root is indeterminate");
|
|
871
|
+
if (k === 1 || this.isZero(anum)) return this.copy(anum);
|
|
872
|
+
if (this.isNeg(anum) && k % 2 === 0)
|
|
873
|
+
throw new SmtInvariantError("even root of negative number is not real");
|
|
874
|
+
if (anum.value instanceof Rational) return this.rootRational(anum.value, k);
|
|
875
|
+
return this.mkRoot(anum, k);
|
|
876
|
+
}
|
|
877
|
+
|
|
878
|
+
private rootRational(value: Rational, k: number) {
|
|
879
|
+
const exact = value.root(k);
|
|
880
|
+
if (exact !== undefined) return new Anum(exact);
|
|
881
|
+
const p = [-value.num, ...Array.from({ length: k - 1 }, () => 0n), value.den];
|
|
882
|
+
const converted = Mpbq.fromRational(value);
|
|
883
|
+
const bound = converted.isExact ? converted.value : converted.value.mul2k(1);
|
|
884
|
+
return value.isNegative()
|
|
885
|
+
? this.mkAnum(p, bound.sub(Mpbq.one), Mpbq.zero, false)
|
|
886
|
+
: this.mkAnum(p, Mpbq.zero, bound.add(Mpbq.one), false);
|
|
887
|
+
}
|
|
888
|
+
|
|
889
|
+
// Res_y(x^k - y, p(y)) has a^(1/k) as a root.
|
|
890
|
+
private mkRoot(anum: Anum, k: number): Anum {
|
|
891
|
+
const cell = getCell(anum);
|
|
892
|
+
const x = this.pm.sub(this.pm.mkVar(X, k), this.pm.mkVar(Y));
|
|
893
|
+
const factored = this.factor(
|
|
894
|
+
this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y)),
|
|
895
|
+
);
|
|
896
|
+
const factors = factored.factors.factors;
|
|
897
|
+
const sequences: (Upolynomial[] | null)[] = factors.map((factor) => this.um.sturmSeq(factor));
|
|
898
|
+
const saved = this.saveInterval(anum);
|
|
899
|
+
while (true) {
|
|
900
|
+
const interval = { lower: cell.lower.rootLower(k), upper: cell.upper.rootUpper(k) };
|
|
901
|
+
const found = this.findIsolatingFactor(factors, sequences, interval);
|
|
902
|
+
if (found !== null) {
|
|
903
|
+
this.restoreIfTooSmall(saved);
|
|
904
|
+
return this.setCore(found, interval, factored.isComplete);
|
|
905
|
+
}
|
|
906
|
+
if (!this.refine(anum)) {
|
|
907
|
+
this.restoreIfTooSmall(saved);
|
|
908
|
+
return this.root(anum, k);
|
|
909
|
+
}
|
|
910
|
+
}
|
|
911
|
+
}
|
|
912
|
+
|
|
913
|
+
getPolynomial(anum: Anum) {
|
|
914
|
+
return anum.value instanceof Rational ? [-anum.value.num, anum.value.den] : [...anum.value.p];
|
|
915
|
+
}
|
|
916
|
+
|
|
917
|
+
getIsolatingInterval(anum: Anum): [Rational, Rational] {
|
|
918
|
+
if (anum.value instanceof Rational) return [anum.value, anum.value];
|
|
919
|
+
return [anum.value.lower.toRational(), anum.value.upper.toRational()];
|
|
920
|
+
}
|
|
921
|
+
|
|
922
|
+
getInterval(anum: Anum, precision: number): [Rational, Rational] {
|
|
923
|
+
if (anum.value instanceof Rational) return [anum.value, anum.value];
|
|
924
|
+
const cell = anum.value;
|
|
925
|
+
const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
|
|
926
|
+
return [refined.lower.toRational(), refined.upper.toRational()];
|
|
927
|
+
}
|
|
928
|
+
|
|
929
|
+
displayRootSmt2(anum: Anum) {
|
|
930
|
+
if (this.isZero(anum)) return "(root-obj x 1)";
|
|
931
|
+
if (anum.value instanceof Rational)
|
|
932
|
+
return `(root-obj ${getUpolynomialSmt2([-anum.value.num, anum.value.den])} 1)`;
|
|
933
|
+
return `(root-obj ${getUpolynomialSmt2(anum.value.p)} ${this.getRootIndex(anum)})`;
|
|
934
|
+
}
|
|
935
|
+
|
|
936
|
+
displayDecimal(anum: Anum, precision: number) {
|
|
937
|
+
if (anum.value instanceof Rational) return getRationalDecimal(anum.value, precision);
|
|
938
|
+
const cell = anum.value;
|
|
939
|
+
const refined = this.um.refineToPrecision(cell.p, cell.lower, cell.upper, precision * 4);
|
|
940
|
+
return (refined.isInterval ? refined.upper : refined.lower).toDecimal(precision);
|
|
941
|
+
}
|
|
942
|
+
|
|
906
943
|
private getSumPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
|
|
907
|
-
const
|
|
908
|
-
return this.pm.toCoeffs(this.pm.resultant(
|
|
944
|
+
const composed = this.pm.composeXMinusY(this.pm.fromCoeffs(first.p, X), Y);
|
|
945
|
+
return this.pm.toCoeffs(this.pm.resultant(composed, this.pm.fromCoeffs(second.p, Y), Y));
|
|
909
946
|
}
|
|
910
947
|
|
|
911
|
-
// mk_mul_polynomial: Res_y(y^n * pa(x/y), pb(y)), which has a*b as a root.
|
|
912
948
|
private getProductPolynomial(first: AlgebraicCell, second: AlgebraicCell) {
|
|
913
|
-
const
|
|
914
|
-
return this.pm.toCoeffs(this.pm.resultant(
|
|
949
|
+
const composed = this.pm.composeXDivY(this.pm.fromCoeffs(first.p, X), Y);
|
|
950
|
+
return this.pm.toCoeffs(this.pm.resultant(composed, this.pm.fromCoeffs(second.p, Y), Y));
|
|
915
951
|
}
|
|
916
952
|
|
|
917
|
-
// The factors of p whose Sturm sequence counts exactly one root in an interval, until only one
|
|
918
|
-
// factor is left.
|
|
919
953
|
private findIsolatingFactor(
|
|
920
954
|
factors: bigint[][],
|
|
921
955
|
sequences: (Upolynomial[] | null)[],
|
|
@@ -945,8 +979,6 @@ export class AlgebraicManager {
|
|
|
945
979
|
: null;
|
|
946
980
|
}
|
|
947
981
|
|
|
948
|
-
// mk_binary: a + b or a*b for irrational a and b, refining both until the interval of the result
|
|
949
|
-
// isolates a root of one factor of the resultant.
|
|
950
982
|
private mkBinary(first: Anum, second: Anum, isAdd: boolean) {
|
|
951
983
|
const cellA = getCell(first);
|
|
952
984
|
const cellB = getCell(second);
|
|
@@ -976,13 +1008,11 @@ export class AlgebraicManager {
|
|
|
976
1008
|
}
|
|
977
1009
|
}
|
|
978
1010
|
|
|
979
|
-
// mk_power_polynomial: Res_y(x - y^k, pa(y)), which has a^k as a root.
|
|
980
1011
|
private getPowerPolynomial(cell: AlgebraicCell, exponent: number) {
|
|
981
1012
|
const x = this.pm.sub(this.pm.mkVar(X), this.pm.mkVar(Y, exponent));
|
|
982
1013
|
return this.pm.toCoeffs(this.pm.resultant(x, this.pm.fromCoeffs(cell.p, Y), Y));
|
|
983
1014
|
}
|
|
984
1015
|
|
|
985
|
-
// mk_unary with mk_power_polynomial: a^k for an irrational a.
|
|
986
1016
|
private mkPower(anum: Anum, exponent: number): Anum {
|
|
987
1017
|
const cell = getCell(anum);
|
|
988
1018
|
const factored = this.factor(this.getPowerPolynomial(cell, exponent));
|
|
@@ -1003,7 +1033,6 @@ export class AlgebraicManager {
|
|
|
1003
1033
|
}
|
|
1004
1034
|
}
|
|
1005
1035
|
|
|
1006
|
-
// set_core: the root of p in an isolating interval that may contain zero.
|
|
1007
1036
|
private setCore(found: IsolatingFactor, interval: BqInterval, isMinimal: boolean) {
|
|
1008
1037
|
const p = found.factor;
|
|
1009
1038
|
let lower = interval.lower;
|
|
@@ -1019,9 +1048,6 @@ export class AlgebraicManager {
|
|
|
1019
1048
|
return this.mkAnum(nonzero, refined.lower, refined.upper, isMinimal);
|
|
1020
1049
|
}
|
|
1021
1050
|
|
|
1022
|
-
// Comparison.
|
|
1023
|
-
|
|
1024
|
-
// compare(cell, b): by the interval, or by the sign of p at b.
|
|
1025
1051
|
private compareRational(cell: AlgebraicCell, value: Rational) {
|
|
1026
1052
|
if (cell.upper.compareRational(value) <= 0) return -1;
|
|
1027
1053
|
if (cell.lower.compareRational(value) >= 0) return 1;
|
|
@@ -1039,8 +1065,6 @@ export class AlgebraicManager {
|
|
|
1039
1065
|
return this.compareCore(first, second);
|
|
1040
1066
|
}
|
|
1041
1067
|
|
|
1042
|
-
// compare_core: refines both intervals to a common magnitude, then tries a wider separation, and
|
|
1043
|
-
// last the sign of pb at a by a Sturm-Tarski sequence.
|
|
1044
1068
|
private compareCore(first: Anum, second: Anum): number {
|
|
1045
1069
|
const cellA = getCell(first);
|
|
1046
1070
|
const cellB = getCell(second);
|
|
@@ -1048,7 +1072,7 @@ export class AlgebraicManager {
|
|
|
1048
1072
|
cellA.upper.compare(cellB.lower) <= 0 ? -1 : cellA.lower.compare(cellB.upper) >= 0 ? 1 : 0;
|
|
1049
1073
|
let sign = compareIntervals();
|
|
1050
1074
|
if (sign !== 0) return sign;
|
|
1051
|
-
if (
|
|
1075
|
+
if (hasSameCoeffs(cellA.p, cellB.p)) return 0;
|
|
1052
1076
|
if (cellA.isMinimal && cellB.isMinimal)
|
|
1053
1077
|
while (true) {
|
|
1054
1078
|
this.refine(first);
|
|
@@ -1074,7 +1098,6 @@ export class AlgebraicManager {
|
|
|
1074
1098
|
sign = compareIntervals();
|
|
1075
1099
|
if (sign !== 0) return sign;
|
|
1076
1100
|
}
|
|
1077
|
-
// get_interval at precision 10: copies of the intervals refined below 1/2^40.
|
|
1078
1101
|
const intervalA = this.um.refineToPrecision(cellA.p, cellA.lower, cellA.upper, 40);
|
|
1079
1102
|
const intervalB = this.um.refineToPrecision(cellB.p, cellB.lower, cellB.upper, 40);
|
|
1080
1103
|
if (intervalA.isInterval && intervalB.isInterval) {
|
|
@@ -1093,9 +1116,6 @@ export class AlgebraicManager {
|
|
|
1093
1116
|
return variations < 0 === cellB.signLower < 0 ? -1 : 1;
|
|
1094
1117
|
}
|
|
1095
1118
|
|
|
1096
|
-
// Sample points.
|
|
1097
|
-
|
|
1098
|
-
// int_lt: an integer below a.
|
|
1099
1119
|
intLt(anum: Anum) {
|
|
1100
1120
|
this.refineUntilPrecision(anum, 1);
|
|
1101
1121
|
return new Anum(
|
|
@@ -1105,7 +1125,6 @@ export class AlgebraicManager {
|
|
|
1105
1125
|
);
|
|
1106
1126
|
}
|
|
1107
1127
|
|
|
1108
|
-
// int_gt: an integer above a.
|
|
1109
1128
|
intGt(anum: Anum) {
|
|
1110
1129
|
this.refineUntilPrecision(anum, 1);
|
|
1111
1130
|
return new Anum(
|
|
@@ -1115,7 +1134,6 @@ export class AlgebraicManager {
|
|
|
1115
1134
|
);
|
|
1116
1135
|
}
|
|
1117
1136
|
|
|
1118
|
-
// separate: refines until the intervals of prev and curr do not touch.
|
|
1119
1137
|
private separate(previous: Anum, current: Anum) {
|
|
1120
1138
|
if (previous.value instanceof Rational) {
|
|
1121
1139
|
const value = previous.value;
|
|
@@ -1145,14 +1163,13 @@ export class AlgebraicManager {
|
|
|
1145
1163
|
}
|
|
1146
1164
|
}
|
|
1147
1165
|
|
|
1148
|
-
// select: a binary rational between prev < curr with the smallest denominator.
|
|
1149
1166
|
select(previous: Anum, current: Anum) {
|
|
1150
1167
|
this.separate(previous, current);
|
|
1151
|
-
const lower
|
|
1168
|
+
const lower =
|
|
1152
1169
|
previous.value instanceof Rational
|
|
1153
1170
|
? { value: previous.value, isOpen: true }
|
|
1154
1171
|
: { value: previous.value.upper.toRational(), isOpen: false };
|
|
1155
|
-
const upper
|
|
1172
|
+
const upper =
|
|
1156
1173
|
current.value instanceof Rational
|
|
1157
1174
|
? { value: current.value, isOpen: true }
|
|
1158
1175
|
: { value: current.value.lower.toRational(), isOpen: false };
|