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
|
@@ -1,7 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/nlsat/levelwise.cpp, src/nlsat/nlsat_common.cpp), MIT license, see
|
|
2
|
-
// z3-license.txt.
|
|
3
|
-
// Deviation from Z3: ties between polynomials break by creation-order id, where Z3 recycles ids of
|
|
4
|
-
// freed polynomials (id_gen in polynomial.cpp), so a cell bound can be another polynomial with the same root.
|
|
5
1
|
import { NlsatUnsupportedError } from "../../../../errors";
|
|
6
2
|
import { Rational } from "../rational";
|
|
7
3
|
import { type AlgebraicManager, type Anum, mergeSortIndices } from "./algebraic";
|
|
@@ -10,14 +6,26 @@ import {
|
|
|
10
6
|
type Polynomial,
|
|
11
7
|
type PolynomialCache,
|
|
12
8
|
type PolynomialManager,
|
|
9
|
+
PolynomialRef,
|
|
10
|
+
PolynomialRefVector,
|
|
13
11
|
} from "./polynomial";
|
|
14
12
|
|
|
15
|
-
|
|
16
|
-
isSection
|
|
17
|
-
lower:
|
|
18
|
-
lowerIndex
|
|
19
|
-
upper:
|
|
20
|
-
upperIndex
|
|
13
|
+
export class CellInterval {
|
|
14
|
+
isSection = false;
|
|
15
|
+
readonly lower: PolynomialRef;
|
|
16
|
+
lowerIndex = 0;
|
|
17
|
+
readonly upper: PolynomialRef;
|
|
18
|
+
upperIndex = 0;
|
|
19
|
+
|
|
20
|
+
constructor(pm: PolynomialManager) {
|
|
21
|
+
this.lower = new PolynomialRef(pm);
|
|
22
|
+
this.upper = new PolynomialRef(pm);
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
release() {
|
|
26
|
+
this.upper.reset();
|
|
27
|
+
this.lower.reset();
|
|
28
|
+
}
|
|
21
29
|
}
|
|
22
30
|
|
|
23
31
|
interface RootFunction {
|
|
@@ -33,98 +41,119 @@ const UNSET = -1;
|
|
|
33
41
|
const BOTH_SIDES = 3;
|
|
34
42
|
const SPANNING_TREE_THRESHOLD = 4;
|
|
35
43
|
|
|
44
|
+
export const releaseIntervals = (intervals: readonly CellInterval[]) => {
|
|
45
|
+
for (let index = intervals.length; index-- > 0;) intervals[index].release();
|
|
46
|
+
};
|
|
47
|
+
|
|
36
48
|
export class TodoSet {
|
|
37
|
-
|
|
38
|
-
private inSet =
|
|
49
|
+
readonly set: PolynomialRefVector;
|
|
50
|
+
private inSet: boolean[] = [];
|
|
39
51
|
|
|
40
52
|
constructor(
|
|
41
|
-
private pm: PolynomialManager,
|
|
42
53
|
private cache: PolynomialCache,
|
|
43
|
-
|
|
54
|
+
private isCanonicalizing: boolean,
|
|
55
|
+
) {
|
|
56
|
+
this.set = new PolynomialRefVector(cache.pm);
|
|
57
|
+
}
|
|
44
58
|
|
|
45
59
|
get isEmpty() {
|
|
46
|
-
return this.
|
|
60
|
+
return this.set.size === 0;
|
|
47
61
|
}
|
|
48
62
|
|
|
49
63
|
reset() {
|
|
50
|
-
this.
|
|
51
|
-
this.
|
|
64
|
+
for (const polynomial of this.set.items) this.inSet[polynomial.id] = false;
|
|
65
|
+
this.set.reset();
|
|
52
66
|
}
|
|
53
67
|
|
|
54
68
|
insert(polynomial: Polynomial) {
|
|
55
|
-
|
|
69
|
+
const pm = this.cache.pm;
|
|
70
|
+
if (this.inSet[polynomial.id] === true) return polynomial;
|
|
56
71
|
if (this.cache.contains(polynomial)) {
|
|
57
|
-
this.inSet
|
|
58
|
-
this.
|
|
72
|
+
this.inSet[polynomial.id] = true;
|
|
73
|
+
this.set.push(polynomial);
|
|
59
74
|
return polynomial;
|
|
60
75
|
}
|
|
61
|
-
const
|
|
62
|
-
|
|
63
|
-
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
68
|
-
|
|
76
|
+
const pinned = new PolynomialRef(pm);
|
|
77
|
+
let p = polynomial;
|
|
78
|
+
if (this.isCanonicalizing) {
|
|
79
|
+
if (!pm.isZero(p) && !pm.isConst(p)) {
|
|
80
|
+
pinned.move(pm.pp(p, pm.maxVar(p)));
|
|
81
|
+
p = pinned.get();
|
|
82
|
+
} else pinned.set(p);
|
|
83
|
+
p = pm.flipSignIfLmNeg(p);
|
|
84
|
+
pinned.set(p);
|
|
85
|
+
}
|
|
86
|
+
p = this.cache.mkUnique(p);
|
|
87
|
+
if (this.inSet[p.id] !== true) {
|
|
88
|
+
this.inSet[p.id] = true;
|
|
89
|
+
this.set.push(p);
|
|
69
90
|
}
|
|
70
|
-
|
|
91
|
+
pinned.reset();
|
|
92
|
+
return p;
|
|
71
93
|
}
|
|
72
94
|
|
|
73
95
|
getMaxVar() {
|
|
74
|
-
return this.pm.getMaxVarOfPolys(this.
|
|
96
|
+
return this.cache.pm.getMaxVarOfPolys(this.set.items);
|
|
75
97
|
}
|
|
76
98
|
|
|
77
|
-
extractMaxPolys(out:
|
|
78
|
-
out.
|
|
99
|
+
extractMaxPolys(out: PolynomialRefVector) {
|
|
100
|
+
out.reset();
|
|
79
101
|
const variable = this.getMaxVar();
|
|
80
102
|
this.extractPolysAtLevel(variable, out);
|
|
81
103
|
return variable;
|
|
82
104
|
}
|
|
83
105
|
|
|
84
|
-
extractPolysAtLevel(variable: number, out:
|
|
85
|
-
const
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
|
|
90
|
-
|
|
91
|
-
|
|
92
|
-
this.
|
|
106
|
+
extractPolysAtLevel(variable: number, out: PolynomialRefVector) {
|
|
107
|
+
const pm = this.cache.pm;
|
|
108
|
+
let kept = 0;
|
|
109
|
+
for (let index = 0; index < this.set.size; index++) {
|
|
110
|
+
const polynomial = this.set.get(index);
|
|
111
|
+
if (pm.maxVar(polynomial) === variable) {
|
|
112
|
+
out.push(polynomial);
|
|
113
|
+
this.inSet[polynomial.id] = false;
|
|
114
|
+
} else this.set.set(kept++, polynomial);
|
|
93
115
|
}
|
|
94
|
-
this.
|
|
116
|
+
this.set.shrink(kept);
|
|
95
117
|
}
|
|
96
118
|
}
|
|
97
119
|
|
|
98
|
-
class Levelwise {
|
|
99
|
-
|
|
100
|
-
private todo: TodoSet;
|
|
120
|
+
export class Levelwise {
|
|
121
|
+
readonly intervals: CellInterval[] = [];
|
|
101
122
|
private level = 0;
|
|
102
|
-
private levelPolys: Polynomial[] = [];
|
|
103
|
-
private witnesses: (Polynomial | null)[] = [];
|
|
104
|
-
private hasRoots: boolean[] = [];
|
|
105
|
-
private rootFunctions: RootFunction[] = [];
|
|
106
|
-
private pairs = new Map<string, [number, number]>();
|
|
107
|
-
private sideMask: number[] = [];
|
|
108
|
-
private isLcOmitted: boolean[] = [];
|
|
109
123
|
private lowerRf = UNSET;
|
|
110
124
|
private upperRf = UNSET;
|
|
125
|
+
private todo: TodoSet;
|
|
126
|
+
private levelPs: PolynomialRefVector;
|
|
127
|
+
private witnesses: PolynomialRef[] = [];
|
|
128
|
+
private polyHasRoots: boolean[] = [];
|
|
129
|
+
private pscTmp: PolynomialRefVector;
|
|
130
|
+
private sideMask: number[] = [];
|
|
131
|
+
private isLcOmitted: boolean[] = [];
|
|
132
|
+
private degInOrderGraph: number[] = [];
|
|
133
|
+
private rootFunctions: RootFunction[] = [];
|
|
134
|
+
private pairs = new Map<string, [number, number]>();
|
|
111
135
|
|
|
112
136
|
constructor(
|
|
113
137
|
private pm: PolynomialManager,
|
|
114
138
|
private am: AlgebraicManager,
|
|
115
139
|
private cache: PolynomialCache,
|
|
116
|
-
private
|
|
140
|
+
private polynomials: PolynomialRefVector,
|
|
117
141
|
private maxVar: number,
|
|
142
|
+
private sample: readonly (Anum | undefined)[],
|
|
118
143
|
private isLinear: boolean,
|
|
119
144
|
) {
|
|
120
|
-
this.todo = new TodoSet(
|
|
121
|
-
this.
|
|
122
|
-
|
|
123
|
-
|
|
124
|
-
|
|
125
|
-
|
|
126
|
-
|
|
127
|
-
|
|
145
|
+
this.todo = new TodoSet(cache, true);
|
|
146
|
+
this.levelPs = new PolynomialRefVector(pm);
|
|
147
|
+
this.pscTmp = new PolynomialRefVector(pm);
|
|
148
|
+
for (let index = 0; index < maxVar; index++) this.intervals.push(new CellInterval(pm));
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
release() {
|
|
152
|
+
this.pscTmp.reset();
|
|
153
|
+
this.clearWitnesses();
|
|
154
|
+
this.levelPs.reset();
|
|
155
|
+
this.todo.set.reset();
|
|
156
|
+
releaseIntervals(this.intervals);
|
|
128
157
|
}
|
|
129
158
|
|
|
130
159
|
private getSign(polynomial: Polynomial) {
|
|
@@ -135,93 +164,200 @@ class Levelwise {
|
|
|
135
164
|
return this.sample.map((value, index) => (index === variable ? undefined : value));
|
|
136
165
|
}
|
|
137
166
|
|
|
138
|
-
private
|
|
139
|
-
|
|
140
|
-
|
|
141
|
-
|
|
142
|
-
|
|
143
|
-
|
|
144
|
-
|
|
145
|
-
|
|
146
|
-
|
|
147
|
-
|
|
148
|
-
|
|
149
|
-
|
|
150
|
-
|
|
151
|
-
|
|
152
|
-
|
|
153
|
-
|
|
154
|
-
|
|
155
|
-
|
|
156
|
-
|
|
157
|
-
|
|
158
|
-
|
|
159
|
-
|
|
160
|
-
|
|
161
|
-
|
|
162
|
-
|
|
163
|
-
|
|
164
|
-
|
|
165
|
-
|
|
166
|
-
|
|
167
|
-
for (let
|
|
168
|
-
if (
|
|
169
|
-
const
|
|
170
|
-
|
|
171
|
-
if (
|
|
172
|
-
|
|
167
|
+
private clearWitnesses() {
|
|
168
|
+
for (let index = this.witnesses.length; index-- > 0;) this.witnesses[index].reset();
|
|
169
|
+
this.witnesses = [];
|
|
170
|
+
}
|
|
171
|
+
|
|
172
|
+
private handleNullifiedPoly(p: Polynomial) {
|
|
173
|
+
const pm = this.pm;
|
|
174
|
+
const degree = pm.degree(p, this.level);
|
|
175
|
+
for (let power = 0; power <= degree; power++) {
|
|
176
|
+
const coeff = new PolynomialRef(pm);
|
|
177
|
+
coeff.set(pm.coeff(p, this.level, power));
|
|
178
|
+
if (!pm.isZero(coeff.get()) && !pm.isConst(coeff.get())) this.requestFactorized(coeff.get());
|
|
179
|
+
coeff.reset();
|
|
180
|
+
}
|
|
181
|
+
let curPolys = new PolynomialRefVector(pm);
|
|
182
|
+
let curMinVar: number[] = [];
|
|
183
|
+
curPolys.push(p);
|
|
184
|
+
curMinVar.push(0);
|
|
185
|
+
while (curPolys.size > 0) {
|
|
186
|
+
const nextPolys = new PolynomialRefVector(pm);
|
|
187
|
+
const nextMinVar: number[] = [];
|
|
188
|
+
for (let index = 0; index < curPolys.size; index++) {
|
|
189
|
+
const q = new PolynomialRef(pm);
|
|
190
|
+
q.set(curPolys.get(index));
|
|
191
|
+
const maxVar = pm.maxVar(q.get());
|
|
192
|
+
if (maxVar === NULL_VAR) {
|
|
193
|
+
q.reset();
|
|
194
|
+
continue;
|
|
195
|
+
}
|
|
196
|
+
for (let x = curMinVar[index]; x <= maxVar; x++) {
|
|
197
|
+
if (pm.degree(q.get(), x) === 0) continue;
|
|
198
|
+
const dq = new PolynomialRef(pm);
|
|
199
|
+
dq.set(pm.derivative(q.get(), x));
|
|
200
|
+
if (pm.isZero(dq.get()) || pm.isConst(dq.get())) {
|
|
201
|
+
dq.reset();
|
|
202
|
+
continue;
|
|
203
|
+
}
|
|
204
|
+
if (this.getSign(dq.get()) !== 0) {
|
|
205
|
+
this.requestFactorized(dq.get());
|
|
206
|
+
dq.reset();
|
|
207
|
+
q.reset();
|
|
208
|
+
nextPolys.reset();
|
|
209
|
+
curPolys.reset();
|
|
173
210
|
return;
|
|
174
211
|
}
|
|
175
|
-
|
|
212
|
+
nextPolys.push(dq.get());
|
|
213
|
+
nextMinVar.push(x);
|
|
214
|
+
dq.reset();
|
|
176
215
|
}
|
|
216
|
+
q.reset();
|
|
177
217
|
}
|
|
178
|
-
for (
|
|
179
|
-
|
|
218
|
+
for (let index = 0; index < nextPolys.size; index++) {
|
|
219
|
+
const dq = new PolynomialRef(pm);
|
|
220
|
+
dq.set(nextPolys.get(index));
|
|
221
|
+
this.requestFactorized(dq.get());
|
|
222
|
+
dq.reset();
|
|
223
|
+
}
|
|
224
|
+
curPolys.reset();
|
|
225
|
+
curPolys = nextPolys;
|
|
226
|
+
curMinVar = nextMinVar;
|
|
227
|
+
}
|
|
228
|
+
}
|
|
229
|
+
|
|
230
|
+
private resetInterval(interval: CellInterval) {
|
|
231
|
+
interval.isSection = false;
|
|
232
|
+
interval.lower.reset();
|
|
233
|
+
interval.upper.reset();
|
|
234
|
+
interval.lowerIndex = 0;
|
|
235
|
+
interval.upperIndex = 0;
|
|
236
|
+
}
|
|
237
|
+
|
|
238
|
+
private getFirstPsc(chain: PolynomialRefVector) {
|
|
239
|
+
const r = new PolynomialRef(this.pm);
|
|
240
|
+
for (let index = 0; index < chain.size; index++) {
|
|
241
|
+
r.set(chain.get(index));
|
|
242
|
+
if (this.pm.isZero(r.get())) continue;
|
|
243
|
+
if (this.pm.isConst(r.get())) {
|
|
244
|
+
r.reset();
|
|
245
|
+
return r;
|
|
246
|
+
}
|
|
247
|
+
return r;
|
|
180
248
|
}
|
|
249
|
+
r.reset();
|
|
250
|
+
return r;
|
|
251
|
+
}
|
|
252
|
+
|
|
253
|
+
private pscDiscriminant(pIn: Polynomial, x: number) {
|
|
254
|
+
const pm = this.pm;
|
|
255
|
+
if (pm.isZero(pIn) || pm.isConst(pIn) || pm.degree(pIn, x) < 2) return new PolynomialRef(pm);
|
|
256
|
+
const p = new PolynomialRef(pm);
|
|
257
|
+
p.set(pIn);
|
|
258
|
+
const d = new PolynomialRef(pm);
|
|
259
|
+
d.set(pm.derivative(p.get(), x));
|
|
260
|
+
const chain = this.pscTmp;
|
|
261
|
+
chain.reset();
|
|
262
|
+
this.cache.pscChain(p.get(), d.get(), x, chain);
|
|
263
|
+
const disc = this.getFirstPsc(chain);
|
|
264
|
+
d.reset();
|
|
265
|
+
p.reset();
|
|
266
|
+
return disc;
|
|
267
|
+
}
|
|
268
|
+
|
|
269
|
+
private pscResultant(a: Polynomial, b: Polynomial, x: number) {
|
|
270
|
+
const pa = new PolynomialRef(this.pm);
|
|
271
|
+
pa.set(a);
|
|
272
|
+
const pb = new PolynomialRef(this.pm);
|
|
273
|
+
pb.set(b);
|
|
274
|
+
const chain = this.pscTmp;
|
|
275
|
+
chain.reset();
|
|
276
|
+
this.cache.pscChain(pa.get(), pb.get(), x, chain);
|
|
277
|
+
const r = this.getFirstPsc(chain);
|
|
278
|
+
pb.reset();
|
|
279
|
+
pa.reset();
|
|
280
|
+
return r;
|
|
181
281
|
}
|
|
182
282
|
|
|
183
|
-
private
|
|
184
|
-
const
|
|
283
|
+
private requestFactorized(polynomial: Polynomial | null) {
|
|
284
|
+
const pm = this.pm;
|
|
285
|
+
if (polynomial === null || pm.isZero(polynomial) || pm.isConst(polynomial)) return;
|
|
286
|
+
const factors = new PolynomialRefVector(pm);
|
|
287
|
+
this.cache.factor(polynomial, factors);
|
|
288
|
+
for (let index = 0; index < factors.size; index++) {
|
|
289
|
+
const f = new PolynomialRef(pm);
|
|
290
|
+
f.set(factors.get(index));
|
|
291
|
+
if (!pm.isZero(f.get()) && !pm.isConst(f.get())) this.todo.insert(f.get());
|
|
292
|
+
f.reset();
|
|
293
|
+
}
|
|
294
|
+
factors.reset();
|
|
295
|
+
}
|
|
296
|
+
|
|
297
|
+
private chooseNonzeroCoeff(p: Polynomial, x: number) {
|
|
298
|
+
const pm = this.pm;
|
|
299
|
+
const degree = pm.degree(p, x);
|
|
300
|
+
const coeff = new PolynomialRef(pm);
|
|
185
301
|
for (let power = 0; power <= degree; power++) {
|
|
186
|
-
|
|
187
|
-
if (
|
|
302
|
+
coeff.set(pm.coeff(p, x, power));
|
|
303
|
+
if (pm.isZero(coeff.get())) continue;
|
|
304
|
+
if (pm.isConst(coeff.get())) return coeff;
|
|
188
305
|
}
|
|
189
|
-
|
|
306
|
+
const best = new PolynomialRef(pm);
|
|
307
|
+
let bestTotalDegree = 0;
|
|
308
|
+
let bestSize = 0;
|
|
309
|
+
let bestMaxVar = NULL_VAR;
|
|
190
310
|
for (let power = 0; power <= degree; power++) {
|
|
191
|
-
|
|
192
|
-
|
|
193
|
-
|
|
194
|
-
const
|
|
311
|
+
coeff.set(pm.coeff(p, x, power));
|
|
312
|
+
const current = coeff.get();
|
|
313
|
+
if (pm.isZero(current) || this.getSign(current) === 0) continue;
|
|
314
|
+
const totalDegree = pm.totalDegree(current);
|
|
315
|
+
const size = current.size;
|
|
316
|
+
const maxVar = pm.maxVar(current);
|
|
195
317
|
if (
|
|
196
|
-
best === null ||
|
|
197
|
-
totalDegree <
|
|
198
|
-
(totalDegree ===
|
|
199
|
-
(
|
|
200
|
-
(
|
|
201
|
-
)
|
|
202
|
-
best
|
|
318
|
+
best.getOrNull() === null ||
|
|
319
|
+
totalDegree < bestTotalDegree ||
|
|
320
|
+
(totalDegree === bestTotalDegree &&
|
|
321
|
+
(size < bestSize ||
|
|
322
|
+
(size === bestSize && (bestMaxVar === NULL_VAR || maxVar < bestMaxVar))))
|
|
323
|
+
) {
|
|
324
|
+
best.copy(coeff);
|
|
325
|
+
bestTotalDegree = totalDegree;
|
|
326
|
+
bestSize = size;
|
|
327
|
+
bestMaxVar = maxVar;
|
|
328
|
+
}
|
|
203
329
|
}
|
|
330
|
+
coeff.reset();
|
|
204
331
|
return best;
|
|
205
332
|
}
|
|
206
333
|
|
|
207
334
|
private addProjectionForPoly(
|
|
208
|
-
|
|
209
|
-
|
|
210
|
-
|
|
335
|
+
p: Polynomial,
|
|
336
|
+
x: number,
|
|
337
|
+
nonzeroCoeff: Polynomial | null,
|
|
211
338
|
isLcAdded: boolean,
|
|
339
|
+
isDiscAdded: boolean,
|
|
212
340
|
) {
|
|
213
|
-
|
|
341
|
+
const pm = this.pm;
|
|
342
|
+
let isNonzeroCoeffAdded = nonzeroCoeff !== null && !pm.isConst(nonzeroCoeff);
|
|
214
343
|
if (isLcAdded) {
|
|
215
|
-
const
|
|
216
|
-
|
|
217
|
-
|
|
344
|
+
const lc = new PolynomialRef(pm);
|
|
345
|
+
lc.set(pm.coeff(p, x, pm.degree(p, x)));
|
|
346
|
+
this.requestFactorized(lc.get());
|
|
347
|
+
if (isNonzeroCoeffAdded && this.getSign(lc.get()) !== 0) isNonzeroCoeffAdded = false;
|
|
348
|
+
lc.reset();
|
|
218
349
|
}
|
|
219
|
-
|
|
220
|
-
|
|
221
|
-
this.
|
|
222
|
-
|
|
350
|
+
if (isDiscAdded) {
|
|
351
|
+
const disc = new PolynomialRef(pm);
|
|
352
|
+
disc.move(this.pscDiscriminant(p, x));
|
|
353
|
+
const value = disc.getOrNull();
|
|
354
|
+
if (value !== null) {
|
|
355
|
+
this.requestFactorized(value);
|
|
356
|
+
if (isNonzeroCoeffAdded && this.getSign(value) !== 0) isNonzeroCoeffAdded = false;
|
|
357
|
+
}
|
|
358
|
+
disc.reset();
|
|
223
359
|
}
|
|
224
|
-
if (
|
|
360
|
+
if (isNonzeroCoeffAdded) this.requestFactorized(nonzeroCoeff);
|
|
225
361
|
}
|
|
226
362
|
|
|
227
363
|
private addPair(first: number, second: number) {
|
|
@@ -243,7 +379,7 @@ class Levelwise {
|
|
|
243
379
|
|
|
244
380
|
private computeSideMask() {
|
|
245
381
|
if (this.lowerRf === UNSET) return;
|
|
246
|
-
while (this.sideMask.length < this.
|
|
382
|
+
while (this.sideMask.length < this.levelPs.size) this.sideMask.push(0);
|
|
247
383
|
this.rootFunctions.forEach((rootFunction, index) => {
|
|
248
384
|
this.sideMask[rootFunction.psIndex] |= index <= this.lowerRf ? 1 : 2;
|
|
249
385
|
});
|
|
@@ -253,20 +389,24 @@ class Levelwise {
|
|
|
253
389
|
return rootFunctionIndex === UNSET ? UNSET : this.rootFunctions[rootFunctionIndex].psIndex;
|
|
254
390
|
}
|
|
255
391
|
|
|
392
|
+
private computeResultantGraphDegree() {
|
|
393
|
+
this.degInOrderGraph = Array.from({ length: this.levelPs.size }, () => 0);
|
|
394
|
+
for (const pair of this.pairs.values()) {
|
|
395
|
+
this.degInOrderGraph[pair[0]]++;
|
|
396
|
+
this.degInOrderGraph[pair[1]]++;
|
|
397
|
+
}
|
|
398
|
+
}
|
|
399
|
+
|
|
256
400
|
private computeOmitLcBothSides(isLeafRequired: boolean) {
|
|
257
|
-
this.isLcOmitted = this.
|
|
401
|
+
this.isLcOmitted = Array.from({ length: this.levelPs.size }, () => false);
|
|
258
402
|
if (this.rootFunctions.length === 0 || this.pairs.size === 0 || this.sideMask.length === 0)
|
|
259
403
|
return;
|
|
260
|
-
|
|
261
|
-
for (const pair of this.pairs.values()) {
|
|
262
|
-
degrees[pair[0]]++;
|
|
263
|
-
degrees[pair[1]]++;
|
|
264
|
-
}
|
|
404
|
+
if (isLeafRequired) this.computeResultantGraphDegree();
|
|
265
405
|
const lowerBound = this.getBoundIndex(this.lowerRf);
|
|
266
406
|
const upperBound = this.getBoundIndex(this.upperRf);
|
|
267
|
-
for (let index = 0; index < this.
|
|
407
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
268
408
|
if (this.sideMask[index] !== BOTH_SIDES) continue;
|
|
269
|
-
if (isLeafRequired &&
|
|
409
|
+
if (isLeafRequired && this.degInOrderGraph[index] !== 1) continue;
|
|
270
410
|
if (index === lowerBound || index === upperBound) continue;
|
|
271
411
|
this.isLcOmitted[index] = true;
|
|
272
412
|
}
|
|
@@ -282,26 +422,24 @@ class Levelwise {
|
|
|
282
422
|
}
|
|
283
423
|
|
|
284
424
|
private fillRelationSection() {
|
|
425
|
+
if (this.rootFunctions.length === 0) return;
|
|
285
426
|
for (let index = 0; index < this.lowerRf; index++) this.addPair(index, this.lowerRf);
|
|
286
427
|
for (let index = this.lowerRf + 1; index < this.rootFunctions.length; index++)
|
|
287
428
|
this.addPair(this.lowerRf, index);
|
|
288
429
|
}
|
|
289
430
|
|
|
290
431
|
private buildBothSideSpanningTree() {
|
|
291
|
-
const lowerRfs = this.
|
|
292
|
-
const upperRfs = this.
|
|
432
|
+
const lowerRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
433
|
+
const upperRfs = Array.from({ length: this.levelPs.size }, () => UNSET);
|
|
293
434
|
for (let index = 0; index <= this.lowerRf; index++)
|
|
294
435
|
lowerRfs[this.rootFunctions[index].psIndex] = index;
|
|
295
436
|
for (let index = this.upperRf; index < this.rootFunctions.length; index++)
|
|
296
437
|
upperRfs[this.rootFunctions[index].psIndex] = index;
|
|
297
|
-
const both =
|
|
298
|
-
|
|
299
|
-
|
|
300
|
-
lowerRf: lowerRfs[psIndex],
|
|
301
|
-
|
|
302
|
-
}))
|
|
303
|
-
.filter((info) => this.sideMask[info.psIndex] === BOTH_SIDES)
|
|
304
|
-
.sort((first, second) => first.lowerRf - second.lowerRf);
|
|
438
|
+
const both: { psIndex: number; lowerRf: number; upperRf: number }[] = [];
|
|
439
|
+
for (let psIndex = 0; psIndex < this.levelPs.size; psIndex++)
|
|
440
|
+
if (this.sideMask[psIndex] === BOTH_SIDES)
|
|
441
|
+
both.push({ psIndex, lowerRf: lowerRfs[psIndex], upperRf: upperRfs[psIndex] });
|
|
442
|
+
both.sort((first, second) => first.lowerRf - second.lowerRf);
|
|
305
443
|
for (let first = 0; first < both.length - 1; first++) {
|
|
306
444
|
let closest = first + 1;
|
|
307
445
|
for (let index = first + 2; index < both.length; index++)
|
|
@@ -332,21 +470,21 @@ class Levelwise {
|
|
|
332
470
|
}
|
|
333
471
|
|
|
334
472
|
private isolateRootsAroundSample(
|
|
473
|
+
p: Polynomial,
|
|
335
474
|
psIndex: number,
|
|
336
475
|
value: Anum,
|
|
337
476
|
lower: RootFunction[],
|
|
338
477
|
upper: RootFunction[],
|
|
339
478
|
) {
|
|
340
|
-
const polynomial = this.levelPolys[psIndex];
|
|
341
479
|
const values = this.getValuesWithout(this.level);
|
|
342
480
|
const mkRootFunction = (root: Anum, index: number) => ({
|
|
343
481
|
value: this.am.copy(root),
|
|
344
|
-
polynomial,
|
|
482
|
+
polynomial: p,
|
|
345
483
|
index,
|
|
346
484
|
psIndex,
|
|
347
485
|
});
|
|
348
486
|
if (value.value instanceof Rational) {
|
|
349
|
-
const closest = this.am.isolateRootsClosest(this.pm,
|
|
487
|
+
const closest = this.am.isolateRootsClosest(this.pm, p, values, value.value);
|
|
350
488
|
closest.roots.forEach((root, index) => {
|
|
351
489
|
(this.am.compare(root, value) <= 0 ? lower : upper).push(
|
|
352
490
|
mkRootFunction(root, closest.indices[index]),
|
|
@@ -354,7 +492,7 @@ class Levelwise {
|
|
|
354
492
|
});
|
|
355
493
|
return closest.roots.length > 0;
|
|
356
494
|
}
|
|
357
|
-
const roots = this.am.isolateRoots(this.pm,
|
|
495
|
+
const roots = this.am.isolateRoots(this.pm, p, values);
|
|
358
496
|
let lowerIndex = UNSET;
|
|
359
497
|
let upperIndex = UNSET;
|
|
360
498
|
let isSection = false;
|
|
@@ -401,95 +539,115 @@ class Levelwise {
|
|
|
401
539
|
if (middle === 0) {
|
|
402
540
|
this.lowerRf = UNSET;
|
|
403
541
|
this.upperRf = 0;
|
|
404
|
-
interval.upper
|
|
542
|
+
interval.upper.set(rootFunctions[0].polynomial);
|
|
405
543
|
interval.upperIndex = rootFunctions[0].index;
|
|
406
544
|
return;
|
|
407
545
|
}
|
|
408
546
|
this.lowerRf = middle - 1;
|
|
409
547
|
const lower = rootFunctions[middle - 1];
|
|
410
|
-
interval.lower = lower.polynomial;
|
|
411
|
-
interval.lowerIndex = lower.index;
|
|
412
548
|
if (this.am.compare(lower.value, value) === 0) {
|
|
413
549
|
interval.isSection = true;
|
|
550
|
+
interval.lower.set(lower.polynomial);
|
|
551
|
+
interval.lowerIndex = lower.index;
|
|
414
552
|
this.upperRf = this.lowerRf;
|
|
415
553
|
return;
|
|
416
554
|
}
|
|
555
|
+
interval.lower.set(lower.polynomial);
|
|
556
|
+
interval.lowerIndex = lower.index;
|
|
417
557
|
if (middle < rootFunctions.length) {
|
|
418
558
|
this.upperRf = this.lowerRf + 1;
|
|
419
|
-
interval.upper
|
|
559
|
+
interval.upper.set(rootFunctions[middle].polynomial);
|
|
420
560
|
interval.upperIndex = rootFunctions[middle].index;
|
|
421
561
|
}
|
|
422
562
|
}
|
|
423
563
|
|
|
424
|
-
private addLinearPolyFromRoot(root: Anum, isLower: boolean) {
|
|
425
|
-
const
|
|
426
|
-
const
|
|
427
|
-
|
|
428
|
-
|
|
429
|
-
);
|
|
564
|
+
private addLinearPolyFromRoot(root: Anum, isLower: boolean, p: PolynomialRef) {
|
|
565
|
+
const pm = this.pm;
|
|
566
|
+
const value = this.am.toRational(root);
|
|
567
|
+
p.set(pm.mkVar(this.level));
|
|
568
|
+
const scaled = new PolynomialRef(pm);
|
|
569
|
+
scaled.set(pm.mulConst(value.den, p.get()));
|
|
570
|
+
const constant = new PolynomialRef(pm);
|
|
571
|
+
constant.set(pm.mkConst(value.num));
|
|
572
|
+
const difference = new PolynomialRef(pm);
|
|
573
|
+
difference.set(pm.sub(scaled.get(), constant.get()));
|
|
574
|
+
constant.reset();
|
|
575
|
+
p.move(difference);
|
|
576
|
+
scaled.reset();
|
|
430
577
|
const interval = this.intervals[this.level];
|
|
431
578
|
if (isLower) {
|
|
432
|
-
interval.lower
|
|
579
|
+
interval.lower.copy(p);
|
|
433
580
|
interval.lowerIndex = 1;
|
|
434
581
|
} else {
|
|
435
|
-
interval.upper
|
|
582
|
+
interval.upper.copy(p);
|
|
436
583
|
interval.upperIndex = 1;
|
|
437
584
|
}
|
|
438
|
-
this.
|
|
439
|
-
this.
|
|
440
|
-
this.
|
|
441
|
-
|
|
585
|
+
this.levelPs.push(p.get());
|
|
586
|
+
this.polyHasRoots.push(true);
|
|
587
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
588
|
+
const copy = new PolynomialRef(pm);
|
|
589
|
+
copy.copy(witness);
|
|
590
|
+
this.witnesses.push(copy);
|
|
591
|
+
witness.reset();
|
|
442
592
|
}
|
|
443
593
|
|
|
444
594
|
private addLinearApproximations(value: Anum) {
|
|
595
|
+
const pLower = new PolynomialRef(this.pm);
|
|
596
|
+
const pUpper = new PolynomialRef(this.pm);
|
|
445
597
|
const interval = this.intervals[this.level];
|
|
446
598
|
const mkRootFunction = (polynomial: Polynomial, root: Anum) => ({
|
|
447
599
|
value: this.am.copy(root),
|
|
448
600
|
polynomial,
|
|
449
601
|
index: 1,
|
|
450
|
-
psIndex: this.
|
|
602
|
+
psIndex: this.levelPs.size - 1,
|
|
451
603
|
});
|
|
452
604
|
if (interval.isSection) {
|
|
453
605
|
if (!this.am.isRational(value))
|
|
454
606
|
throw new NlsatUnsupportedError("a linear cell around an irrational section");
|
|
455
|
-
if (this.pm.totalDegree(interval.lower
|
|
456
|
-
|
|
457
|
-
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(
|
|
607
|
+
if (this.pm.totalDegree(interval.lower.get()) > 1) {
|
|
608
|
+
this.addLinearPolyFromRoot(value, true, pLower);
|
|
609
|
+
this.rootFunctions.splice(this.lowerRf, 0, mkRootFunction(pLower.get(), value));
|
|
458
610
|
}
|
|
611
|
+
pUpper.reset();
|
|
612
|
+
pLower.reset();
|
|
459
613
|
return;
|
|
460
614
|
}
|
|
461
|
-
|
|
615
|
+
const lower = interval.lower.getOrNull();
|
|
616
|
+
if (lower !== null && this.pm.totalDegree(lower) > 1) {
|
|
462
617
|
const between = this.am.select(this.rootFunctions[this.lowerRf].value, value);
|
|
463
|
-
|
|
464
|
-
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(
|
|
618
|
+
this.addLinearPolyFromRoot(between, true, pLower);
|
|
619
|
+
this.rootFunctions.splice(this.lowerRf + 1, 0, mkRootFunction(pLower.get(), between));
|
|
465
620
|
this.lowerRf++;
|
|
466
621
|
if (this.upperRf !== UNSET) this.upperRf++;
|
|
467
622
|
}
|
|
468
|
-
|
|
623
|
+
const upper = interval.upper.getOrNull();
|
|
624
|
+
if (upper !== null && this.pm.totalDegree(upper) > 1) {
|
|
469
625
|
const between = this.am.select(value, this.rootFunctions[this.upperRf].value);
|
|
470
|
-
|
|
471
|
-
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(
|
|
626
|
+
this.addLinearPolyFromRoot(between, false, pUpper);
|
|
627
|
+
this.rootFunctions.splice(this.upperRf, 0, mkRootFunction(pUpper.get(), between));
|
|
472
628
|
}
|
|
629
|
+
pUpper.reset();
|
|
630
|
+
pLower.reset();
|
|
473
631
|
}
|
|
474
632
|
|
|
475
633
|
private buildInterval() {
|
|
476
634
|
this.rootFunctions = [];
|
|
477
635
|
this.pairs.clear();
|
|
478
|
-
|
|
479
|
-
isSection: false,
|
|
480
|
-
lower: null,
|
|
481
|
-
lowerIndex: 0,
|
|
482
|
-
upper: null,
|
|
483
|
-
upperIndex: 0,
|
|
484
|
-
});
|
|
636
|
+
this.resetInterval(this.intervals[this.level]);
|
|
485
637
|
this.lowerRf = UNSET;
|
|
486
638
|
this.upperRf = UNSET;
|
|
487
639
|
const value = this.sample[this.level]!;
|
|
640
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
488
641
|
const lower: RootFunction[] = [];
|
|
489
642
|
const upper: RootFunction[] = [];
|
|
490
|
-
|
|
491
|
-
this.isolateRootsAroundSample(
|
|
492
|
-
|
|
643
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
644
|
+
this.polyHasRoots[index] = this.isolateRootsAroundSample(
|
|
645
|
+
this.levelPs.get(index),
|
|
646
|
+
index,
|
|
647
|
+
value,
|
|
648
|
+
lower,
|
|
649
|
+
upper,
|
|
650
|
+
);
|
|
493
651
|
if (lower.length === 0 && upper.length === 0) return false;
|
|
494
652
|
this.rootFunctions = [
|
|
495
653
|
...this.sortRootFunctions(lower, true),
|
|
@@ -502,20 +660,27 @@ class Levelwise {
|
|
|
502
660
|
}
|
|
503
661
|
|
|
504
662
|
private addRelationResultants() {
|
|
505
|
-
for (const pair of this.getSortedPairs())
|
|
506
|
-
this.
|
|
507
|
-
this.
|
|
663
|
+
for (const pair of this.getSortedPairs()) {
|
|
664
|
+
const res = this.pscResultant(
|
|
665
|
+
this.levelPs.get(pair[0]),
|
|
666
|
+
this.levelPs.get(pair[1]),
|
|
667
|
+
this.level,
|
|
508
668
|
);
|
|
669
|
+
this.requestFactorized(res.getOrNull());
|
|
670
|
+
res.reset();
|
|
671
|
+
}
|
|
509
672
|
}
|
|
510
673
|
|
|
511
674
|
private addAdjacentRootResultants() {
|
|
675
|
+
this.polyHasRoots = Array.from({ length: this.levelPs.size }, () => false);
|
|
512
676
|
const rootValues: { root: Anum; polynomial: Polynomial }[] = [];
|
|
513
677
|
const values = this.getValuesWithout(this.maxVar);
|
|
514
|
-
|
|
678
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
679
|
+
const polynomial = this.levelPs.get(index);
|
|
515
680
|
const roots = this.am.isolateRoots(this.pm, polynomial, values);
|
|
681
|
+
this.polyHasRoots[index] = roots.length > 0;
|
|
516
682
|
for (const root of roots) rootValues.push({ root: this.am.copy(root), polynomial });
|
|
517
|
-
|
|
518
|
-
});
|
|
683
|
+
}
|
|
519
684
|
if (rootValues.length < 2) return;
|
|
520
685
|
const order = mergeSortIndices(
|
|
521
686
|
rootValues.length,
|
|
@@ -530,32 +695,51 @@ class Levelwise {
|
|
|
530
695
|
const key = `${low.id},${high.id}`;
|
|
531
696
|
if (added.has(key)) continue;
|
|
532
697
|
added.add(key);
|
|
533
|
-
this.
|
|
698
|
+
const res = this.pscResultant(low, high, this.maxVar);
|
|
699
|
+
this.requestFactorized(res.getOrNull());
|
|
700
|
+
res.reset();
|
|
534
701
|
}
|
|
535
702
|
}
|
|
536
703
|
|
|
537
704
|
private addSectionProjections() {
|
|
538
|
-
const sectionPolynomial = this.intervals[this.level].lower;
|
|
705
|
+
const sectionPolynomial = this.intervals[this.level].lower.get();
|
|
539
706
|
const withRoots = new Set(this.rootFunctions.map((rootFunction) => rootFunction.psIndex));
|
|
540
|
-
this.
|
|
541
|
-
const
|
|
542
|
-
|
|
543
|
-
|
|
707
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
708
|
+
const p = new PolynomialRef(this.pm);
|
|
709
|
+
p.set(this.levelPs.get(index));
|
|
710
|
+
const witness = new PolynomialRef(this.pm);
|
|
711
|
+
witness.copy(this.witnesses[index]);
|
|
712
|
+
const isFull = this.levelPs.get(index) === sectionPolynomial || !withRoots.has(index);
|
|
713
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isFull, true);
|
|
714
|
+
witness.reset();
|
|
715
|
+
p.reset();
|
|
716
|
+
}
|
|
544
717
|
}
|
|
545
718
|
|
|
546
719
|
private addSectorProjections() {
|
|
547
|
-
|
|
720
|
+
const pm = this.pm;
|
|
721
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
722
|
+
const p = new PolynomialRef(pm);
|
|
723
|
+
p.set(this.levelPs.get(index));
|
|
724
|
+
const lc = new PolynomialRef(pm);
|
|
725
|
+
lc.set(pm.coeff(p.get(), this.level, pm.degree(p.get(), this.level)));
|
|
548
726
|
const isLcAdded = !(this.isLcOmitted[index] ?? false);
|
|
549
|
-
|
|
727
|
+
const witness = new PolynomialRef(pm);
|
|
728
|
+
witness.copy(this.witnesses[index]);
|
|
729
|
+
const value = witness.getOrNull();
|
|
550
730
|
if (
|
|
551
731
|
isLcAdded &&
|
|
552
|
-
|
|
553
|
-
!
|
|
554
|
-
|
|
732
|
+
value !== null &&
|
|
733
|
+
!pm.isConst(value) &&
|
|
734
|
+
!pm.isZero(lc.get()) &&
|
|
735
|
+
this.getSign(lc.get()) !== 0
|
|
555
736
|
)
|
|
556
|
-
witness
|
|
557
|
-
this.addProjectionForPoly(
|
|
558
|
-
|
|
737
|
+
witness.reset();
|
|
738
|
+
this.addProjectionForPoly(p.get(), this.level, witness.getOrNull(), isLcAdded, true);
|
|
739
|
+
witness.reset();
|
|
740
|
+
lc.reset();
|
|
741
|
+
p.reset();
|
|
742
|
+
}
|
|
559
743
|
}
|
|
560
744
|
|
|
561
745
|
private shouldUseSpanningTree() {
|
|
@@ -563,12 +747,19 @@ class Levelwise {
|
|
|
563
747
|
if (this.lowerRf === UNSET || this.upperRf === UNSET) return false;
|
|
564
748
|
if (this.getBoundIndex(this.lowerRf) === this.getBoundIndex(this.upperRf)) return false;
|
|
565
749
|
let bothCount = 0;
|
|
566
|
-
for (let index = 0; index < this.
|
|
750
|
+
for (let index = 0; index < this.levelPs.size; index++)
|
|
567
751
|
if (this.sideMask[index] === BOTH_SIDES && ++bothCount >= SPANNING_TREE_THRESHOLD)
|
|
568
752
|
return true;
|
|
569
753
|
return false;
|
|
570
754
|
}
|
|
571
755
|
|
|
756
|
+
private clearLevelState() {
|
|
757
|
+
this.isLcOmitted = [];
|
|
758
|
+
this.pairs.clear();
|
|
759
|
+
this.sideMask = [];
|
|
760
|
+
this.degInOrderGraph = [];
|
|
761
|
+
}
|
|
762
|
+
|
|
572
763
|
private processLevelWithMode(mode: ProjectionMode, hasInterval: boolean) {
|
|
573
764
|
if (hasInterval) {
|
|
574
765
|
if (mode === "section") this.fillRelationSection();
|
|
@@ -585,21 +776,23 @@ class Levelwise {
|
|
|
585
776
|
}
|
|
586
777
|
|
|
587
778
|
private collectNonNullWitnesses() {
|
|
588
|
-
this.
|
|
589
|
-
for (let index = 0; index < this.
|
|
590
|
-
const
|
|
591
|
-
|
|
592
|
-
|
|
593
|
-
this.
|
|
594
|
-
|
|
595
|
-
|
|
779
|
+
this.clearWitnesses();
|
|
780
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
781
|
+
const p = new PolynomialRef(this.pm);
|
|
782
|
+
p.set(this.levelPs.get(index));
|
|
783
|
+
const witness = this.chooseNonzeroCoeff(p.get(), this.level);
|
|
784
|
+
if (witness.getOrNull() === null) this.handleNullifiedPoly(p.get());
|
|
785
|
+
const copy = new PolynomialRef(this.pm);
|
|
786
|
+
copy.copy(witness);
|
|
787
|
+
this.witnesses.push(copy);
|
|
788
|
+
if (index + 1 === this.levelPs.size) this.todo.extractPolysAtLevel(this.level, this.levelPs);
|
|
789
|
+
witness.reset();
|
|
790
|
+
p.reset();
|
|
596
791
|
}
|
|
597
792
|
}
|
|
598
793
|
|
|
599
794
|
private processLevel() {
|
|
600
|
-
this.
|
|
601
|
-
this.pairs.clear();
|
|
602
|
-
this.sideMask = [];
|
|
795
|
+
this.clearLevelState();
|
|
603
796
|
this.collectNonNullWitnesses();
|
|
604
797
|
const hasInterval = this.buildInterval();
|
|
605
798
|
this.processLevelWithMode(
|
|
@@ -613,39 +806,65 @@ class Levelwise {
|
|
|
613
806
|
}
|
|
614
807
|
|
|
615
808
|
private processTopLevel() {
|
|
809
|
+
const pm = this.pm;
|
|
616
810
|
this.collectNonNullWitnesses();
|
|
617
811
|
this.addAdjacentRootResultants();
|
|
618
|
-
this.
|
|
619
|
-
const
|
|
620
|
-
|
|
621
|
-
|
|
622
|
-
|
|
623
|
-
|
|
812
|
+
for (let index = 0; index < this.levelPs.size; index++) {
|
|
813
|
+
const p = new PolynomialRef(pm);
|
|
814
|
+
p.set(this.levelPs.get(index));
|
|
815
|
+
const lc = new PolynomialRef(pm);
|
|
816
|
+
lc.set(pm.coeff(p.get(), this.maxVar, pm.degree(p.get(), this.maxVar)));
|
|
817
|
+
let isLcAdded = true;
|
|
818
|
+
if (
|
|
819
|
+
!(this.polyHasRoots[index] ?? false) &&
|
|
820
|
+
!pm.isZero(lc.get()) &&
|
|
821
|
+
this.getSign(lc.get()) !== 0
|
|
822
|
+
) {
|
|
823
|
+
isLcAdded = false;
|
|
824
|
+
this.witnesses[index].reset();
|
|
825
|
+
}
|
|
826
|
+
this.addProjectionForPoly(
|
|
827
|
+
p.get(),
|
|
828
|
+
this.maxVar,
|
|
829
|
+
this.witnesses[index].getOrNull(),
|
|
830
|
+
isLcAdded,
|
|
831
|
+
true,
|
|
832
|
+
);
|
|
833
|
+
lc.reset();
|
|
834
|
+
p.reset();
|
|
835
|
+
}
|
|
836
|
+
}
|
|
837
|
+
|
|
838
|
+
private copyIntervals() {
|
|
839
|
+
return this.intervals.map((interval) => {
|
|
840
|
+
const copy = new CellInterval(this.pm);
|
|
841
|
+
copy.isSection = interval.isSection;
|
|
842
|
+
copy.lower.copy(interval.lower);
|
|
843
|
+
copy.lowerIndex = interval.lowerIndex;
|
|
844
|
+
copy.upper.copy(interval.upper);
|
|
845
|
+
copy.upperIndex = interval.upperIndex;
|
|
846
|
+
return copy;
|
|
624
847
|
});
|
|
625
848
|
}
|
|
626
849
|
|
|
627
|
-
|
|
628
|
-
if (this.maxVar === 0) return this.
|
|
629
|
-
|
|
630
|
-
|
|
850
|
+
singleCell() {
|
|
851
|
+
if (this.maxVar === 0) return this.copyIntervals();
|
|
852
|
+
this.todo.reset();
|
|
853
|
+
for (let index = 0; index < this.polynomials.size; index++) {
|
|
854
|
+
const p = new PolynomialRef(this.pm);
|
|
855
|
+
p.set(this.polynomials.get(index));
|
|
856
|
+
this.requestFactorized(p.get());
|
|
857
|
+
p.reset();
|
|
858
|
+
}
|
|
859
|
+
if (this.todo.isEmpty) return this.copyIntervals();
|
|
631
860
|
if (this.todo.getMaxVar() === this.maxVar) {
|
|
632
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
861
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
633
862
|
this.processTopLevel();
|
|
634
863
|
}
|
|
635
864
|
while (!this.todo.isEmpty) {
|
|
636
|
-
this.level = this.todo.extractMaxPolys(this.
|
|
865
|
+
this.level = this.todo.extractMaxPolys(this.levelPs);
|
|
637
866
|
this.processLevel();
|
|
638
867
|
}
|
|
639
|
-
return this.
|
|
868
|
+
return this.copyIntervals();
|
|
640
869
|
}
|
|
641
870
|
}
|
|
642
|
-
|
|
643
|
-
export const getSingleCell = (
|
|
644
|
-
pm: PolynomialManager,
|
|
645
|
-
am: AlgebraicManager,
|
|
646
|
-
cache: PolynomialCache,
|
|
647
|
-
polynomials: readonly Polynomial[],
|
|
648
|
-
maxVar: number,
|
|
649
|
-
sample: readonly (Anum | undefined)[],
|
|
650
|
-
isLinear: boolean,
|
|
651
|
-
) => new Levelwise(pm, am, cache, sample, maxVar, isLinear).computeSingleCell(polynomials);
|