Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r047-tall-177946846400050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is BugTracking-PT-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846400050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Mar 5 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 5 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 5 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779484148086

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:09:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:09:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:09:10] [INFO ] Load time of PNML (sax parser for PT used): 820 ms
[2026-05-22 21:09:10] [INFO ] Transformed 754 places.
[2026-05-22 21:09:10] [INFO ] Transformed 27370 transitions.
[2026-05-22 21:09:10] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1006 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 474 places in 101 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-22 21:09:10] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2026-05-22 21:09:10] [INFO ] Computed 10 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1, 1, +inf]
RANDOM walk for 10001 steps (118 resets) in 128 ms. (77 steps per ms)
FORMULA BugTracking-PT-q8m004-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q8m004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (154 resets) in 200 ms. (298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:09:10] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2026-05-22 21:09:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:11] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-22 21:09:11] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2026-05-22 21:09:11] [INFO ] State equation strengthened by 303 read => feed constraints.
[2026-05-22 21:09:12] [INFO ] [Real]Added 303 Read/Feed constraints in 126 ms returned sat
[2026-05-22 21:09:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-22 21:09:12] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2026-05-22 21:09:13] [INFO ] [Nat]Added 303 Read/Feed constraints in 335 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:13] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 9 ms to minimize.
[2026-05-22 21:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2026-05-22 21:09:14] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 358 ms.
[2026-05-22 21:09:14] [INFO ] Added : 7 causal constraints over 2 iterations in 875 ms. Result :sat
Minimization took 984 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:15] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:16] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2026-05-22 21:09:16] [INFO ] [Real]Added 303 Read/Feed constraints in 73 ms returned sat
[2026-05-22 21:09:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:17] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2026-05-22 21:09:17] [INFO ] [Nat]Added 303 Read/Feed constraints in 211 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:17] [INFO ] Deduced a trap composed of 19 places in 404 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:18] [INFO ] Deduced a trap composed of 33 places in 389 ms of which 23 ms to minimize.
[2026-05-22 21:09:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1018 ms
[2026-05-22 21:09:18] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 401 ms.
[2026-05-22 21:09:19] [INFO ] Added : 4 causal constraints over 1 iterations in 737 ms. Result :sat
Minimization took 1228 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:20] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-22 21:09:21] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2026-05-22 21:09:21] [INFO ] [Real]Added 303 Read/Feed constraints in 71 ms returned sat
[2026-05-22 21:09:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:21] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2026-05-22 21:09:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 85 ms returned sat
[2026-05-22 21:09:22] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 224 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:23] [INFO ] Deduced a trap composed of 14 places in 590 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:24] [INFO ] Deduced a trap composed of 19 places in 504 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:24] [INFO ] Deduced a trap composed of 7 places in 332 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:24] [INFO ] Deduced a trap composed of 56 places in 298 ms of which 9 ms to minimize.
[2026-05-22 21:09:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2319 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:26] [INFO ] Deduced a trap composed of 14 places in 449 ms of which 22 ms to minimize.
[2026-05-22 21:09:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:26] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-22 21:09:27] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2026-05-22 21:09:27] [INFO ] [Real]Added 303 Read/Feed constraints in 75 ms returned sat
[2026-05-22 21:09:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:27] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2026-05-22 21:09:28] [INFO ] [Nat]Added 303 Read/Feed constraints in 365 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:28] [INFO ] Deduced a trap composed of 12 places in 478 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:29] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:29] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:30] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 12 ms to minimize.
[2026-05-22 21:09:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2097 ms
[2026-05-22 21:09:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 224 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:31] [INFO ] Deduced a trap composed of 55 places in 523 ms of which 36 ms to minimize.
[2026-05-22 21:09:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 754 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:32] [INFO ] Deduced a trap composed of 56 places in 461 ms of which 19 ms to minimize.
[2026-05-22 21:09:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:33] [INFO ] [Real]Absence check using state equation in 555 ms returned sat
[2026-05-22 21:09:33] [INFO ] [Real]Added 303 Read/Feed constraints in 110 ms returned sat
[2026-05-22 21:09:33] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:34] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2026-05-22 21:09:34] [INFO ] [Nat]Added 303 Read/Feed constraints in 180 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:34] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:35] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 10 ms to minimize.
[2026-05-22 21:09:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 773 ms
[2026-05-22 21:09:35] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 203 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:36] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:36] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:37] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 6 ms to minimize.
[2026-05-22 21:09:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1273 ms
[2026-05-22 21:09:37] [INFO ] Added : 15 causal constraints over 4 iterations in 2431 ms. Result :sat
Minimization took 1020 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:38] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:39] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2026-05-22 21:09:39] [INFO ] [Real]Added 303 Read/Feed constraints in 76 ms returned sat
[2026-05-22 21:09:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:09:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:09:39] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2026-05-22 21:09:40] [INFO ] [Nat]Added 303 Read/Feed constraints in 151 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:09:40] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 15 ms to minimize.
[2026-05-22 21:09:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 604 ms
[2026-05-22 21:09:40] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 211 ms.
[2026-05-22 21:09:41] [INFO ] Added : 6 causal constraints over 2 iterations in 673 ms. Result :sat
Minimization took 995 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 334 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 269/280 places, 3871/3904 transitions.
[2026-05-22 21:09:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:09:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2026-05-22 21:09:43] [INFO ] Computed 8 invariants in 24 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000002 steps (2 resets) in 6008 ms. (166 steps per ms)
BEST_FIRST walk for 6000005 steps (13 resets) in 11758 ms. (510 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:10:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:10:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:10:02] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2026-05-22 21:10:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:10:02] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2026-05-22 21:10:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-22 21:10:03] [INFO ] [Nat]Added 283 Read/Feed constraints in 249 ms returned sat
[2026-05-22 21:10:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 246 ms.
[2026-05-22 21:10:03] [INFO ] Added : 4 causal constraints over 1 iterations in 600 ms. Result :sat
Minimization took 3305 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:10:07] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-22 21:10:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:08] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2026-05-22 21:10:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 180 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:09] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:09] [INFO ] Deduced a trap composed of 35 places in 435 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:10] [INFO ] Deduced a trap composed of 60 places in 441 ms of which 27 ms to minimize.
[2026-05-22 21:10:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1636 ms
[2026-05-22 21:10:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 214 ms.
[2026-05-22 21:10:11] [INFO ] Added : 3 causal constraints over 2 iterations in 810 ms. Result :sat
Minimization took 3258 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:15] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2026-05-22 21:10:15] [INFO ] [Real]Added 283 Read/Feed constraints in 71 ms returned sat
[2026-05-22 21:10:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:15] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2026-05-22 21:10:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 236 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:16] [INFO ] Deduced a trap composed of 7 places in 361 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:16] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:17] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:17] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 19 ms to minimize.
[2026-05-22 21:10:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1719 ms
[2026-05-22 21:10:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2026-05-22 21:10:18] [INFO ] Added : 8 causal constraints over 2 iterations in 683 ms. Result :sat
Minimization took 3138 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:10:22] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2026-05-22 21:10:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:22] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2026-05-22 21:10:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 477 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:23] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:24] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:24] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:24] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 10 ms to minimize.
[2026-05-22 21:10:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1559 ms
[2026-05-22 21:10:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 237 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:26] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:26] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 14 ms to minimize.
[2026-05-22 21:10:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1048 ms
[2026-05-22 21:10:27] [INFO ] Added : 10 causal constraints over 4 iterations in 2327 ms. Result :sat
Minimization took 3195 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:31] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2026-05-22 21:10:31] [INFO ] [Real]Added 283 Read/Feed constraints in 61 ms returned sat
[2026-05-22 21:10:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:31] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2026-05-22 21:10:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 275 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:32] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 16 ms to minimize.
[2026-05-22 21:10:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2026-05-22 21:10:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 215 ms.
[2026-05-22 21:10:33] [INFO ] Added : 7 causal constraints over 2 iterations in 705 ms. Result :sat
Minimization took 3230 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:10:37] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2026-05-22 21:10:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:10:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:10:37] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2026-05-22 21:10:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 313 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:38] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:38] [INFO ] Deduced a trap composed of 14 places in 223 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:10:39] [INFO ] Deduced a trap composed of 9 places in 383 ms of which 15 ms to minimize.
[2026-05-22 21:10:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1282 ms
[2026-05-22 21:10:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 231 ms.
[2026-05-22 21:10:40] [INFO ] Added : 13 causal constraints over 3 iterations in 870 ms. Result :sat
Minimization took 4164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2026-05-22 21:10:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:10:45] [INFO ] Implicit Places using invariants in 438 ms returned []
[2026-05-22 21:10:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:10:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:10:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-22 21:10:49] [INFO ] Implicit Places using invariants and state equation in 3901 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:10:49] [INFO ] Redundant transitions in 269 ms returned []
Running 3870 sub problems to find dead transitions.
[2026-05-22 21:10:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:10:49] [INFO ] Invariant cache hit.
[2026-05-22 21:10:49] [INFO ] State equation strengthened by 283 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:42] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 3 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:44] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 5 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:44] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:44] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 6 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:56] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 5 ms to minimize.
Problem TDEAD3803 is UNSAT
Problem TDEAD3815 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:11:56] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 3 ms to minimize.
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 7/15 constraints. Problems are: Problem set: 936 solved, 2934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 15 constraints, problems are : Problem set: 936 solved, 2934 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3272/598 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68283ms problems are : Problem set: 936 solved, 2934 unsolved
Search for dead transitions found 936 dead transitions in 68314ms
Found 936 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 936 transitions
Dead transitions reduction (with SMT) removed 936 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 2935/3871 transitions.
Reduce places removed 32 places and 960 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 237 transition count 1975
Reduce places removed 25 places and 409 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 57 place count 212 transition count 1566
Reduce places removed 11 places and 147 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 68 place count 201 transition count 1419
Reduce places removed 8 places and 49 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 76 place count 193 transition count 1370
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 191 transition count 1318
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 79 place count 190 transition count 1299
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 80 place count 189 transition count 1290
Discarding 19 places :
Symmetric choice reduction at 7 with 19 rule applications. Total rules 99 place count 170 transition count 1236
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 7 with 19 rules applied. Total rules applied 118 place count 170 transition count 1236
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 133 place count 155 transition count 1076
Deduced a syphon composed of 3 places in 2 ms
Iterating global reduction 7 with 15 rules applied. Total rules applied 148 place count 155 transition count 1076
Deduced a syphon composed of 3 places in 2 ms
Applied a total of 148 rules in 76 ms. Remains 155 /269 variables (removed 114) and now considering 1076/2935 (removed 1859) transitions.
[2026-05-22 21:11:58] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
// Phase 1: matrix 961 rows 155 cols
[2026-05-22 21:11:58] [INFO ] Computed 11 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:11:58] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-22 21:11:58] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
[2026-05-22 21:11:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:11:58] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-22 21:11:59] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/269 places, 1076/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 74582 ms. Remains : 155/269 places, 1076/3871 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 21:11:59] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {6=1, 71=1, 779=1, 938=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1, 779=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :[0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:11:59] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
// Phase 1: matrix 961 rows 152 cols
[2026-05-22 21:11:59] [INFO ] Computed 8 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000003 steps (4 resets) in 2052 ms. (487 steps per ms)
BEST_FIRST walk for 3000002 steps (7 resets) in 2650 ms. (1131 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:12:04] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
[2026-05-22 21:12:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:04] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:12:04] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2026-05-22 21:12:04] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-22 21:12:04] [INFO ] [Real]Added 108 Read/Feed constraints in 36 ms returned sat
[2026-05-22 21:12:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:12:05] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2026-05-22 21:12:05] [INFO ] [Nat]Added 108 Read/Feed constraints in 52 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:05] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 8 ms to minimize.
[2026-05-22 21:12:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2026-05-22 21:12:05] [INFO ] Computed and/alt/rep : 381/1498/381 causal constraints (skipped 579 transitions) in 44 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:05] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:05] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:06] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:06] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 7 ms to minimize.
[2026-05-22 21:12:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 597 ms
[2026-05-22 21:12:06] [INFO ] Added : 23 causal constraints over 6 iterations in 1003 ms. Result :sat
Minimization took 379 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:06] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:12:06] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-22 21:12:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:12:07] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2026-05-22 21:12:07] [INFO ] [Nat]Added 108 Read/Feed constraints in 35 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:07] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:07] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:07] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 7 ms to minimize.
[2026-05-22 21:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2026-05-22 21:12:07] [INFO ] Computed and/alt/rep : 381/1498/381 causal constraints (skipped 579 transitions) in 44 ms.
[2026-05-22 21:12:07] [INFO ] Added : 5 causal constraints over 2 iterations in 182 ms. Result :sat
Minimization took 316 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:12:08] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-22 21:12:08] [INFO ] [Real]Added 108 Read/Feed constraints in 20 ms returned sat
[2026-05-22 21:12:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:12:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:12:08] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2026-05-22 21:12:08] [INFO ] [Nat]Added 108 Read/Feed constraints in 31 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:08] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:08] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 6 ms to minimize.
[2026-05-22 21:12:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2026-05-22 21:12:08] [INFO ] Computed and/alt/rep : 381/1498/381 causal constraints (skipped 579 transitions) in 51 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:09] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 2 ms to minimize.
[2026-05-22 21:12:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2026-05-22 21:12:09] [INFO ] Added : 12 causal constraints over 4 iterations in 399 ms. Result :sat
Minimization took 314 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Support contains 3 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 1076/1076 transitions.
Applied a total of 0 rules in 12 ms. Remains 152 /152 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 152/152 places, 1076/1076 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 1076/1076 transitions.
Applied a total of 0 rules in 13 ms. Remains 152 /152 variables (removed 0) and now considering 1076/1076 (removed 0) transitions.
[2026-05-22 21:12:09] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
[2026-05-22 21:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:12:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-22 21:12:09] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
[2026-05-22 21:12:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:12:10] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-22 21:12:10] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:12:10] [INFO ] Redundant transitions in 40 ms returned []
Running 1075 sub problems to find dead transitions.
[2026-05-22 21:12:10] [INFO ] Flow matrix only has 961 transitions (discarded 115 similar events)
[2026-05-22 21:12:10] [INFO ] Invariant cache hit.
[2026-05-22 21:12:10] [INFO ] State equation strengthened by 108 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:15] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Problem TDEAD838 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 3/11 constraints. Problems are: Problem set: 16 solved, 1059 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 16 solved, 1059 unsolved
At refinement iteration 3 (OVERLAPS) 961/1113 variables, 152/163 constraints. Problems are: Problem set: 16 solved, 1059 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1113 variables, 108/271 constraints. Problems are: Problem set: 16 solved, 1059 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:12:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 272 constraints, problems are : Problem set: 114 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 1075/1075 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 114 solved, 961 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 8/8 constraints. Problems are: Problem set: 114 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 4/12 constraints. Problems are: Problem set: 114 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 114 solved, 961 unsolved
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
At refinement iteration 3 (OVERLAPS) 961/1113 variables, 152/164 constraints. Problems are: Problem set: 135 solved, 940 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1113 variables, 108/272 constraints. Problems are: Problem set: 135 solved, 940 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1068 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1113 variables, 940/1212 constraints. Problems are: Problem set: 257 solved, 818 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 1212 constraints, problems are : Problem set: 257 solved, 818 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 940/1075 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61352ms problems are : Problem set: 257 solved, 818 unsolved
Search for dead transitions found 257 dead transitions in 61356ms
Found 257 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 257 transitions
Dead transitions reduction (with SMT) removed 257 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 819/1076 transitions.
Graph (complete) has 1132 edges and 152 vertex of which 144 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 27 places and 336 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 117 transition count 483
Reduce places removed 8 places and 73 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 109 transition count 410
Reduce places removed 3 places and 26 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 106 transition count 384
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 41 place count 104 transition count 368
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 42 place count 103 transition count 363
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 47 place count 98 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 5 with 5 rules applied. Total rules applied 52 place count 98 transition count 318
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 52 rules in 12 ms. Remains 98 /152 variables (removed 54) and now considering 318/819 (removed 501) transitions.
[2026-05-22 21:13:12] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
// Phase 1: matrix 297 rows 98 cols
[2026-05-22 21:13:12] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:13:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-22 21:13:12] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:13:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-22 21:13:12] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/152 places, 318/1076 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62600 ms. Remains : 98/152 places, 318/1076 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 21:13:12] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 38=1, 224=1, 282=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 224=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :[1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:13:12] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
// Phase 1: matrix 297 rows 97 cols
[2026-05-22 21:13:12] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1379 ms. (724 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 1185 ms. (1686 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-22 21:13:15] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:13:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:13:15] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:13:15] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-22 21:13:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-22 21:13:15] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-22 21:13:15] [INFO ] [Real]Added 60 Read/Feed constraints in 10 ms returned sat
[2026-05-22 21:13:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:13:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:13:15] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2026-05-22 21:13:15] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2026-05-22 21:13:15] [INFO ] Computed and/alt/rep : 206/991/206 causal constraints (skipped 90 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
[2026-05-22 21:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2026-05-22 21:13:15] [INFO ] Added : 18 causal constraints over 4 iterations in 253 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 2, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, 1, +inf]
FORMULA BugTracking-PT-q8m004-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 318/318 transitions.
[2026-05-22 21:13:15] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 38=1, 224=1, 282=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 224=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:13:15] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:15] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000000 steps (3 resets) in 1468 ms. (680 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 598 ms. (1669 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:13:17] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:13:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:13:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2026-05-22 21:13:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-22 21:13:18] [INFO ] [Real]Added 60 Read/Feed constraints in 7 ms returned sat
[2026-05-22 21:13:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:13:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:13:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-22 21:13:18] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2026-05-22 21:13:18] [INFO ] Computed and/alt/rep : 206/991/206 causal constraints (skipped 90 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:18] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
[2026-05-22 21:13:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2026-05-22 21:13:18] [INFO ] Added : 18 causal constraints over 4 iterations in 227 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2026-05-22 21:13:18] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:13:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 21:13:18] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:13:18] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-22 21:13:18] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:13:18] [INFO ] Redundant transitions in 2 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-22 21:13:18] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-22 21:13:18] [INFO ] Invariant cache hit.
[2026-05-22 21:13:18] [INFO ] State equation strengthened by 60 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 2 (OVERLAPS) 297/394 variables, 97/104 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 60/164 constraints. Problems are: Problem set: 3 solved, 314 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:22] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 165 constraints, problems are : Problem set: 3 solved, 314 unsolved in 14916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 314 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 297/394 variables, 97/105 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 60/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 314/479 constraints. Problems are: Problem set: 5 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:37] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:41] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:41] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/482 constraints. Problems are: Problem set: 5 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:13:49] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/483 constraints. Problems are: Problem set: 5 solved, 312 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:01] [INFO ] Deduced a trap along path composed of 6 places in 20 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 484 constraints, problems are : Problem set: 10 solved, 307 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 314/317 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 45059ms problems are : Problem set: 10 solved, 307 unsolved
Search for dead transitions found 10 dead transitions in 45060ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 308/318 transitions.
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 299
Applied a total of 1 rules in 4 ms. Remains 96 /97 variables (removed 1) and now considering 299/308 (removed 9) transitions.
[2026-05-22 21:14:03] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
// Phase 1: matrix 279 rows 96 cols
[2026-05-22 21:14:03] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:03] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-22 21:14:03] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 21:14:04] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/97 places, 299/318 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45757 ms. Remains : 96/97 places, 299/318 transitions.
[2026-05-22 21:14:04] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 206=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 206=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:14:04] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000000 steps (3 resets) in 1426 ms. (700 steps per ms)
BEST_FIRST walk for 1000000 steps (3 resets) in 564 ms. (1769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:14:06] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:14:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:14:06] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-22 21:14:06] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 21:14:06] [INFO ] [Real]Added 59 Read/Feed constraints in 11 ms returned sat
[2026-05-22 21:14:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:14:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:14:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-22 21:14:06] [INFO ] [Nat]Added 59 Read/Feed constraints in 10 ms returned sat
[2026-05-22 21:14:06] [INFO ] Computed and/alt/rep : 231/1293/231 causal constraints (skipped 47 transitions) in 14 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:06] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 3 ms to minimize.
[2026-05-22 21:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2026-05-22 21:14:06] [INFO ] Added : 30 causal constraints over 6 iterations in 214 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 299/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 299/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-22 21:14:06] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 21:14:06] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:06] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 21:14:07] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:14:07] [INFO ] Redundant transitions in 1 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-22 21:14:07] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-22 21:14:07] [INFO ] Invariant cache hit.
[2026-05-22 21:14:07] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 2 (OVERLAPS) 279/375 variables, 96/103 constraints. Problems are: Problem set: 32 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 59/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/375 variables, 0/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 162 constraints, problems are : Problem set: 32 solved, 266 unsolved in 6068 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 279/375 variables, 96/103 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 59/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 266/428 constraints. Problems are: Problem set: 32 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:17] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:17] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 3/431 constraints. Problems are: Problem set: 32 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:20] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:20] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:20] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:21] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:24] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 5/436 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 0/436 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 8 (OVERLAPS) 0/375 variables, 0/436 constraints. Problems are: Problem set: 32 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 375/375 variables, and 436 constraints, problems are : Problem set: 32 solved, 266 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 266/298 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36176ms problems are : Problem set: 32 solved, 266 unsolved
Search for dead transitions found 32 dead transitions in 36176ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/96 places, 267/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:14:43] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36528 ms. Remains : 96/96 places, 267/299 transitions.
[2026-05-22 21:14:43] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:14:43] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
// Phase 1: matrix 247 rows 96 cols
[2026-05-22 21:14:43] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000000 steps (7 resets) in 1295 ms. (771 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 567 ms. (1760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
[2026-05-22 21:14:45] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:14:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:14:45] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:14:45] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-22 21:14:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:14:45] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-22 21:14:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:14:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:14:45] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-22 21:14:45] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:45] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:45] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:45] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 6 ms to minimize.
[2026-05-22 21:14:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 219 ms
[2026-05-22 21:14:45] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 11 ms.
[2026-05-22 21:14:45] [INFO ] Added : 49 causal constraints over 10 iterations in 167 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-22 21:14:45] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:14:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 21:14:46] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:14:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:14:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:14:46] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:14:46] [INFO ] Redundant transitions in 1 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-22 21:14:46] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:14:46] [INFO ] Invariant cache hit.
[2026-05-22 21:14:46] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 10145 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:59] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 12/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:11] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:17] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:17] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:18] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:19] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 7/445 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 445 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40228ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 40230ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40518 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-22 21:15:26] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
RANDOM walk for 40006 steps (12 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
[2026-05-22 21:15:26] [INFO ] Flatten gal took : 75 ms
[2026-05-22 21:15:26] [INFO ] Flatten gal took : 34 ms
[2026-05-22 21:15:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8043797699583999053.gal : 12 ms
[2026-05-22 21:15:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5905825587553667011.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8043797699583999053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5905825587553667011.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5905825587553667011.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 249
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :249 after 574
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :574 after 1219
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1219 after 2504
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2504 after 5069
Interrupted probabilistic random walk after 1212008 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 1
Probabilistic random walk after 1212008 steps, saw 728407 distinct states, run finished after 3004 ms. (steps per millisecond=403 ) properties seen :0
[2026-05-22 21:15:29] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:29] [INFO ] Invariant cache hit.
[2026-05-22 21:15:29] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 316ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
RANDOM walk for 40003 steps (9 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5069 after 10194
BEST_FIRST walk for 30503 steps (6 resets) in 57 ms. (525 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 2, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf]
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2026-05-22 21:15:30] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (3 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10001 steps (3 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-22 21:15:30] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:15:30] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-22 21:15:30] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2026-05-22 21:15:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:15:30] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-22 21:15:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:15:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-22 21:15:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-22 21:15:30] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:30] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:30] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:30] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 6 ms to minimize.
[2026-05-22 21:15:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 215 ms
[2026-05-22 21:15:30] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 19 ms.
[2026-05-22 21:15:30] [INFO ] Added : 49 causal constraints over 10 iterations in 191 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-22 21:15:30] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2026-05-22 21:15:31] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1242 ms. (804 steps per ms)
BEST_FIRST walk for 1000001 steps (4 resets) in 562 ms. (1776 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-22 21:15:32] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:15:32] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-22 21:15:32] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:15:32] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-22 21:15:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-22 21:15:32] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-22 21:15:33] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:33] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:33] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:33] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
[2026-05-22 21:15:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2026-05-22 21:15:33] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 14 ms.
[2026-05-22 21:15:33] [INFO ] Added : 49 causal constraints over 10 iterations in 180 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-22 21:15:33] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:15:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-22 21:15:33] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:15:33] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:15:33] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:15:33] [INFO ] Redundant transitions in 2 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-22 21:15:33] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:15:33] [INFO ] Invariant cache hit.
[2026-05-22 21:15:33] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 9956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:46] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:46] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:46] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:46] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:47] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:47] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:47] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:47] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:49] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:49] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:49] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 12/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:58] [INFO ] Deduced a trap along path composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:05] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:05] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:05] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:05] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:06] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:06] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 7/445 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 445 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40068ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 40070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40372 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-22 21:16:13] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 174=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 174=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (10 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
[2026-05-22 21:16:14] [INFO ] Flatten gal took : 50 ms
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
[2026-05-22 21:16:14] [INFO ] Flatten gal took : 28 ms
[2026-05-22 21:16:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7312100899290472884.gal : 6 ms
[2026-05-22 21:16:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9226979983045356505.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7312100899290472884.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9226979983045356505.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9226979983045356505.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 249
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :249 after 574
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :574 after 1219
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1219 after 2504
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2504 after 5069
Interrupted probabilistic random walk after 1134027 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1134027 steps, saw 703647 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2026-05-22 21:16:17] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:16:17] [INFO ] Invariant cache hit.
[2026-05-22 21:16:17] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5069 after 10194
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 318ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1134264 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :0 out of 1
Probabilistic random walk after 1134264 steps, saw 703714 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
[2026-05-22 21:16:20] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:16:20] [INFO ] Invariant cache hit.
[2026-05-22 21:16:20] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-22 21:16:20] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:16:20] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 21:16:20] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:16:20] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:16:21] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:16:21] [INFO ] Redundant transitions in 0 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-22 21:16:21] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-22 21:16:21] [INFO ] Invariant cache hit.
[2026-05-22 21:16:21] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10194 after 20439
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 9895 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:33] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:33] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:33] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:36] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:36] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 12/436 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:46] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:52] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:52] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:53] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:53] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:54] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 7/445 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 445 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 39990ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 39991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40290 ms. Remains : 96/96 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 401 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 92 transition count 246
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 77 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 77 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 77 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 76 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 76 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 75 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 75 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 75 transition count 170
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 70 transition count 165
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 66 transition count 183
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 66 transition count 178
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 87 place count 61 transition count 178
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 61 transition count 178
Applied a total of 89 rules in 33 ms. Remains 61 /96 variables (removed 35) and now considering 178/267 (removed 89) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 178 rows 61 cols
[2026-05-22 21:17:01] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-22 21:17:01] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-22 21:17:01] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2026-05-22 21:17:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-22 21:17:01] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:01] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 2 ms to minimize.
[2026-05-22 21:17:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2026-05-22 21:17:01] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:17:01] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 21:17:01] [INFO ] Flatten gal took : 17 ms
[2026-05-22 21:17:01] [INFO ] Flatten gal took : 12 ms
[2026-05-22 21:17:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17248089902001388535.gal : 5 ms
[2026-05-22 21:17:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17639207699831942649.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17248089902001388535.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17639207699831942649.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17639207699831942649.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 109
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :109 after 274
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :274 after 599
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :599 after 1244
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1244 after 2529
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2529 after 5094
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5094 after 10219
Detected timeout of ITS tools.
[2026-05-22 21:17:04] [INFO ] Flatten gal took : 22 ms
[2026-05-22 21:17:04] [INFO ] Applying decomposition
[2026-05-22 21:17:04] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14644540337942639173.txt' '-o' '/tmp/graph14644540337942639173.bin' '-w' '/tmp/graph14644540337942639173.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14644540337942639173.bin' '-l' '-1' '-v' '-w' '/tmp/graph14644540337942639173.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:17:04] [INFO ] Decomposing Gal with order
[2026-05-22 21:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:17:04] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-22 21:17:04] [INFO ] Flatten gal took : 59 ms
[2026-05-22 21:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2026-05-22 21:17:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17989080500516515723.gal : 4 ms
[2026-05-22 21:17:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2417358504967348124.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17989080500516515723.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2417358504967348124.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2417358504967348124.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 73
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :73 after 114
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :114 after 298
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :298 after 479
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :479 after 916
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :916 after 2206
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2206 after 4309
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4309 after 7819
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7819 after 16339
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :16339 after 39339
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :39339 after 107798
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10219 after 20464
Detected timeout of ITS tools.
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 21:17:16] [INFO ] Applying decomposition
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17978941223274014183.txt' '-o' '/tmp/graph17978941223274014183.bin' '-w' '/tmp/graph17978941223274014183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17978941223274014183.bin' '-l' '-1' '-v' '-w' '/tmp/graph17978941223274014183.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:17:16] [INFO ] Decomposing Gal with order
[2026-05-22 21:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:17:16] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 14 ms
[2026-05-22 21:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 2 ms.
[2026-05-22 21:17:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6689071873492812369.gal : 2 ms
[2026-05-22 21:17:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7990046867926542389.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6689071873492812369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7990046867926542389.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7990046867926542389.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 45
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :45 after 427
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :427 after 784
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :784 after 5851
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,200144,0.075048,5620,36,866,238,3503,99,226,240,8331,0
Total reachable state count : 200144

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,159,0.075602,5876,12,176,238,3503,103,226,244,8331,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15523 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-04 in 106393 ms.
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:17:16] [INFO ] Applying decomposition
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9960524292574291760.txt' '-o' '/tmp/graph9960524292574291760.bin' '-w' '/tmp/graph9960524292574291760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9960524292574291760.bin' '-l' '-1' '-v' '-w' '/tmp/graph9960524292574291760.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:17:16] [INFO ] Decomposing Gal with order
[2026-05-22 21:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:17:16] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-22 21:17:16] [INFO ] Flatten gal took : 40 ms
[2026-05-22 21:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2026-05-22 21:17:16] [INFO ] Time to serialize gal into /tmp/UpperBounds7661488329998509047.gal : 3 ms
[2026-05-22 21:17:16] [INFO ] Time to serialize properties into /tmp/UpperBounds7646930839711629970.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7661488329998509047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7646930839711629970.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7646930839711629970.prop.
Detected timeout of ITS tools.
[2026-05-22 21:40:07] [INFO ] Flatten gal took : 217 ms
[2026-05-22 21:40:08] [INFO ] Time to serialize gal into /tmp/UpperBounds15310595385811563436.gal : 58 ms
[2026-05-22 21:40:08] [INFO ] Time to serialize properties into /tmp/UpperBounds17959836772242098070.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15310595385811563436.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17959836772242098070.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds17959836772242098070.prop.
Detected timeout of ITS tools.
[2026-05-22 22:02:51] [INFO ] Flatten gal took : 86 ms
[2026-05-22 22:02:51] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-22 22:02:51] [INFO ] Transformed 96 places.
[2026-05-22 22:02:51] [INFO ] Transformed 267 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 22:02:52] [INFO ] Time to serialize gal into /tmp/UpperBounds4596534567738248187.gal : 4 ms
[2026-05-22 22:02:52] [INFO ] Time to serialize properties into /tmp/UpperBounds10664027213260239100.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4596534567738248187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10664027213260239100.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds10664027213260239100.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is BugTracking-PT-q8m004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tall-177946846400050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;