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-177946846400053.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-q8m032, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846400053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 5 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 15 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:41 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-q8m032-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m032-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779484470369

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:14:31] [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:14:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:14:32] [INFO ] Load time of PNML (sax parser for PT used): 797 ms
[2026-05-22 21:14:32] [INFO ] Transformed 754 places.
[2026-05-22 21:14:32] [INFO ] Transformed 27370 transitions.
[2026-05-22 21:14:32] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 989 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 124 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-22 21:14:33] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2026-05-22 21:14:33] [INFO ] Computed 10 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, +inf, 1, +inf, 1, +inf]
RANDOM walk for 10000 steps (11 resets) in 98 ms. (101 steps per ms)
FORMULA BugTracking-PT-q8m032-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (16 resets) in 164 ms. (303 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 11, 0, 1] Max Struct:[+inf, 1, +inf, 1, +inf]
[2026-05-22 21:14:33] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2026-05-22 21:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:14:33] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-22 21:14:34] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2026-05-22 21:14:34] [INFO ] State equation strengthened by 303 read => feed constraints.
[2026-05-22 21:14:34] [INFO ] [Real]Added 303 Read/Feed constraints in 119 ms returned sat
[2026-05-22 21:14:34] [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:14:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-22 21:14:35] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-22 21:14:35] [INFO ] [Nat]Added 303 Read/Feed constraints in 214 ms returned sat
[2026-05-22 21:14:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 389 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:36] [INFO ] Deduced a trap composed of 55 places in 264 ms of which 8 ms to minimize.
[2026-05-22 21:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:37] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
[2026-05-22 21:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2026-05-22 21:14:38] [INFO ] Added : 11 causal constraints over 4 iterations in 2209 ms. Result :sat
Minimization took 989 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:14:39] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:39] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2026-05-22 21:14:39] [INFO ] [Real]Added 303 Read/Feed constraints in 84 ms returned sat
[2026-05-22 21:14: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:14:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-22 21:14:40] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2026-05-22 21:14:40] [INFO ] [Nat]Added 303 Read/Feed constraints in 175 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:40] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 9 ms to minimize.
[2026-05-22 21:14:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2026-05-22 21:14:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 443 ms.
[2026-05-22 21:14:41] [INFO ] Added : 7 causal constraints over 2 iterations in 929 ms. Result :sat
Minimization took 1322 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:14:43] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:43] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2026-05-22 21:14:44] [INFO ] [Real]Added 303 Read/Feed constraints in 215 ms returned sat
[2026-05-22 21:14:44] [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:14:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:44] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2026-05-22 21:14:44] [INFO ] [Nat]Added 303 Read/Feed constraints in 60 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 33 places in 408 ms of which 38 ms to minimize.
[2026-05-22 21:14:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2026-05-22 21:14:45] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 227 ms.
[2026-05-22 21:14:45] [INFO ] Added : 2 causal constraints over 1 iterations in 535 ms. Result :sat
Minimization took 1022 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:14:47] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:47] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-22 21:14:47] [INFO ] [Real]Added 303 Read/Feed constraints in 73 ms returned sat
[2026-05-22 21:14:47] [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:14:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:48] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2026-05-22 21:14:48] [INFO ] [Nat]Added 303 Read/Feed constraints in 259 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:48] [INFO ] Deduced a trap composed of 15 places in 245 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:49] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:49] [INFO ] Deduced a trap composed of 78 places in 418 ms of which 25 ms to minimize.
[2026-05-22 21:14:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1375 ms
[2026-05-22 21:14:50] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 216 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:51] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 14 ms to minimize.
[2026-05-22 21:14:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 618 ms
[2026-05-22 21:14:51] [INFO ] Added : 16 causal constraints over 4 iterations in 1785 ms. Result :sat
Minimization took 996 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:14:52] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:53] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2026-05-22 21:14:53] [INFO ] [Real]Added 303 Read/Feed constraints in 96 ms returned sat
[2026-05-22 21:14:53] [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:14:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-22 21:14:54] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2026-05-22 21:14:54] [INFO ] [Nat]Added 303 Read/Feed constraints in 138 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:54] [INFO ] Deduced a trap composed of 33 places in 479 ms of which 30 ms to minimize.
[2026-05-22 21:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 642 ms
[2026-05-22 21:14:55] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 232 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:14:55] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 13 ms to minimize.
[2026-05-22 21:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2026-05-22 21:14:56] [INFO ] Added : 6 causal constraints over 3 iterations in 1474 ms. Result :sat
Minimization took 1057 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 11, 0, 1] Max Struct:[+inf, 1, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 11, 0, 1] Max Struct:[+inf, 1, +inf, 1, +inf]
Support contains 5 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 327 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 339 ms. Remains : 269/280 places, 3871/3904 transitions.
[2026-05-22 21:14:57] [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 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :[0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, +inf, 0, 1] Max Struct:[+inf, 1, +inf, 1, +inf]
[2026-05-22 21:14:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2026-05-22 21:14:59] [INFO ] Computed 8 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, +inf, 0, 1] Max Struct:[+inf, 1, +inf, 1, +inf]
RANDOM walk for 1000025 steps (2 resets) in 1569 ms. (636 steps per ms)
FORMULA BugTracking-PT-q8m032-UpperBounds-09 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4000002 steps (8 resets) in 7206 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:15:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:15:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:15:08] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2026-05-22 21:15: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:15:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:15:08] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2026-05-22 21:15:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-22 21:15:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 234 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:09] [INFO ] Deduced a trap composed of 17 places in 462 ms of which 22 ms to minimize.
[2026-05-22 21:15:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 632 ms
[2026-05-22 21:15:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 226 ms.
[2026-05-22 21:15:10] [INFO ] Added : 3 causal constraints over 1 iterations in 569 ms. Result :sat
Minimization took 3310 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:14] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2026-05-22 21:15:14] [INFO ] [Real]Added 283 Read/Feed constraints in 64 ms returned sat
[2026-05-22 21:15:14] [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:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:15] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2026-05-22 21:15:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 298 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:15] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:16] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:16] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:16] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 15 ms to minimize.
[2026-05-22 21:15:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1374 ms
[2026-05-22 21:15:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 239 ms.
[2026-05-22 21:15:17] [INFO ] Added : 3 causal constraints over 1 iterations in 578 ms. Result :sat
Minimization took 3248 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:21] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2026-05-22 21:15:21] [INFO ] [Real]Added 283 Read/Feed constraints in 50 ms returned sat
[2026-05-22 21:15:21] [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:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:21] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2026-05-22 21:15:22] [INFO ] [Nat]Added 283 Read/Feed constraints in 131 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:22] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:22] [INFO ] Deduced a trap composed of 14 places in 216 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:22] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 12 ms to minimize.
[2026-05-22 21:15:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1015 ms
[2026-05-22 21:15:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 233 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:23] [INFO ] Deduced a trap composed of 7 places in 293 ms of which 9 ms to minimize.
[2026-05-22 21:15:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 473 ms
[2026-05-22 21:15:24] [INFO ] Added : 6 causal constraints over 2 iterations in 1253 ms. Result :sat
Minimization took 3212 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:28] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2026-05-22 21:15:28] [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:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:28] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2026-05-22 21:15:28] [INFO ] [Nat]Added 283 Read/Feed constraints in 195 ms returned sat
[2026-05-22 21:15:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 227 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:29] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 8 ms to minimize.
[2026-05-22 21:15:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2026-05-22 21:15:30] [INFO ] Added : 4 causal constraints over 2 iterations in 1218 ms. Result :sat
Minimization took 3243 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 4 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 54 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 54 ms. Remains : 269/269 places, 3871/3871 transitions.
[2026-05-22 21:15:33] [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 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:15:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:15:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000001 steps (2 resets) in 1398 ms. (714 steps per ms)
BEST_FIRST walk for 4000002 steps (8 resets) in 6939 ms. (576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:15:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:15:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:43] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2026-05-22 21:15:43] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2026-05-22 21:15:43] [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:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:44] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2026-05-22 21:15:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-22 21:15:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 242 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:45] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 21 ms to minimize.
[2026-05-22 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 594 ms
[2026-05-22 21:15:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 251 ms.
[2026-05-22 21:15:45] [INFO ] Added : 3 causal constraints over 1 iterations in 604 ms. Result :sat
Minimization took 3286 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:49] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2026-05-22 21:15:49] [INFO ] [Real]Added 283 Read/Feed constraints in 66 ms returned sat
[2026-05-22 21:15:49] [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:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:15:50] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2026-05-22 21:15:50] [INFO ] [Nat]Added 283 Read/Feed constraints in 298 ms returned sat
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 39 places in 281 ms of which 16 ms to minimize.
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 35 places in 268 ms of which 19 ms to minimize.
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 23 places in 219 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:52] [INFO ] Deduced a trap composed of 43 places in 210 ms of which 14 ms to minimize.
[2026-05-22 21:15:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1391 ms
[2026-05-22 21:15:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 243 ms.
[2026-05-22 21:15:52] [INFO ] Added : 3 causal constraints over 1 iterations in 574 ms. Result :sat
Minimization took 4321 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:15:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-22 21:15:57] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2026-05-22 21:15:57] [INFO ] [Real]Added 283 Read/Feed constraints in 51 ms returned sat
[2026-05-22 21:15:57] [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:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:15:58] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2026-05-22 21:15:58] [INFO ] [Nat]Added 283 Read/Feed constraints in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:58] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:15:59] [INFO ] Deduced a trap composed of 14 places in 223 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:59] [INFO ] Deduced a trap composed of 26 places in 239 ms of which 13 ms to minimize.
[2026-05-22 21:15:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1039 ms
[2026-05-22 21:15:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 220 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:16:00] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 10 ms to minimize.
[2026-05-22 21:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2026-05-22 21:16:00] [INFO ] Added : 6 causal constraints over 2 iterations in 1290 ms. Result :sat
Minimization took 3415 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:16:04] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:16:04] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2026-05-22 21:16: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:16:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:16:05] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2026-05-22 21:16:05] [INFO ] [Nat]Added 283 Read/Feed constraints in 192 ms returned sat
[2026-05-22 21:16:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 222 ms.
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 10 places in 179 ms of which 8 ms to minimize.
[2026-05-22 21:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2026-05-22 21:16:06] [INFO ] Added : 4 causal constraints over 2 iterations in 1199 ms. Result :sat
Minimization took 3396 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 4 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 54 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 54 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 50 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2026-05-22 21:16:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:16:11] [INFO ] Implicit Places using invariants in 478 ms returned []
[2026-05-22 21:16:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:16:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-22 21:16:14] [INFO ] Implicit Places using invariants and state equation in 2953 ms returned []
Implicit Place search using SMT with State Equation took 3443 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:16:14] [INFO ] Redundant transitions in 262 ms returned []
Running 3870 sub problems to find dead transitions.
[2026-05-22 21:16:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-22 21:16:14] [INFO ] Invariant cache hit.
[2026-05-22 21:16:14] [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
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 30076 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:17:08] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:08] [INFO ] Deduced a trap composed of 10 places in 79 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:17:10] [INFO ] Deduced a trap composed of 8 places in 94 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:17:10] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:11] [INFO ] Deduced a trap composed of 17 places in 147 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:17:23] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 14 constraints, problems are : Problem set: 916 solved, 2954 unsolved in 30055 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: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 68974ms problems are : Problem set: 916 solved, 2954 unsolved
Search for dead transitions found 916 dead transitions in 69008ms
Found 916 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 916 transitions
Dead transitions reduction (with SMT) removed 916 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 2955/3871 transitions.
Reduce places removed 28 places and 823 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 241 transition count 2132
Reduce places removed 21 places and 379 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 49 place count 220 transition count 1753
Reduce places removed 6 places and 92 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 214 transition count 1661
Reduce places removed 3 places and 24 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 211 transition count 1637
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 76 place count 193 transition count 1592
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 13 places and 186 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 107 place count 180 transition count 1406
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 123 place count 164 transition count 1232
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 4 with 16 rules applied. Total rules applied 139 place count 164 transition count 1232
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 139 rules in 70 ms. Remains 164 /269 variables (removed 105) and now considering 1232/2955 (removed 1723) transitions.
[2026-05-22 21:17:23] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
// Phase 1: matrix 1106 rows 164 cols
[2026-05-22 21:17:23] [INFO ] Computed 11 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:17:23] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-22 21:17:23] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
[2026-05-22 21:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:17:24] [INFO ] State equation strengthened by 124 read => feed constraints.
[2026-05-22 21:17:24] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1141 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 164/269 places, 1232/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 74023 ms. Remains : 164/269 places, 1232/3871 transitions.
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m032-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 21:17:24] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {5=1, 895=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 895=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:17:24] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
// Phase 1: matrix 1106 rows 161 cols
[2026-05-22 21:17:24] [INFO ] Computed 8 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000018 steps (2 resets) in 696 ms. (1434 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 901 ms. (1108 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:17:26] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
[2026-05-22 21:17:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:17:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-22 21:17:26] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-22 21:17:26] [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:17:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:17:26] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-22 21:17:26] [INFO ] State equation strengthened by 124 read => feed constraints.
[2026-05-22 21:17:27] [INFO ] [Nat]Added 124 Read/Feed constraints in 27 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:27] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:27] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:27] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:27] [INFO ] Deduced a trap composed of 24 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:28] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 9 ms to minimize.
[2026-05-22 21:17:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1077 ms
[2026-05-22 21:17:28] [INFO ] Computed and/alt/rep : 401/1648/401 causal constraints (skipped 704 transitions) in 57 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:28] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 8 ms to minimize.
[2026-05-22 21:17:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2026-05-22 21:17:28] [INFO ] Added : 10 causal constraints over 3 iterations in 557 ms. Result :sat
Minimization took 474 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 1232/1232 transitions.
Applied a total of 0 rules in 15 ms. Remains 161 /161 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 161/161 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 1232/1232 transitions.
Applied a total of 0 rules in 13 ms. Remains 161 /161 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2026-05-22 21:17:29] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
[2026-05-22 21:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:17:29] [INFO ] Implicit Places using invariants in 166 ms returned []
[2026-05-22 21:17:29] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
[2026-05-22 21:17:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:17:29] [INFO ] State equation strengthened by 124 read => feed constraints.
[2026-05-22 21:17:30] [INFO ] Implicit Places using invariants and state equation in 779 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:17:30] [INFO ] Redundant transitions in 53 ms returned []
Running 1231 sub problems to find dead transitions.
[2026-05-22 21:17:30] [INFO ] Flow matrix only has 1106 transitions (discarded 126 similar events)
[2026-05-22 21:17:30] [INFO ] Invariant cache hit.
[2026-05-22 21:17:30] [INFO ] State equation strengthened by 124 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:38] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:39] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 2 ms to minimize.
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
Problem TDEAD959 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:17:41] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 2 ms to minimize.
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 4/12 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 3 (OVERLAPS) 1106/1267 variables, 161/173 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1267/1267 variables, and 297 constraints, problems are : Problem set: 29 solved, 1202 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 29 solved, 1202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 8/8 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 4/12 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 3 (OVERLAPS) 1106/1267 variables, 161/173 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1267 variables, 124/297 constraints. Problems are: Problem set: 29 solved, 1202 unsolved
Problem TDEAD84 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 TDEAD544 is UNSAT
Problem TDEAD545 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 TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1267 variables, 1202/1499 constraints. Problems are: Problem set: 142 solved, 1089 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1267/1267 variables, and 1499 constraints, problems are : Problem set: 142 solved, 1089 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 124/124 constraints, PredecessorRefiner: 1202/1231 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62159ms problems are : Problem set: 142 solved, 1089 unsolved
Search for dead transitions found 142 dead transitions in 62163ms
Found 142 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 142 transitions
Dead transitions reduction (with SMT) removed 142 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/161 places, 1090/1232 transitions.
Reduce places removed 21 places and 333 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 140 transition count 757
Reduce places removed 9 places and 75 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 30 place count 131 transition count 682
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 130 transition count 670
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 35 place count 126 transition count 630
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 126 transition count 630
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 41 place count 124 transition count 610
Iterating global reduction 3 with 2 rules applied. Total rules applied 43 place count 124 transition count 610
Applied a total of 43 rules in 16 ms. Remains 124 /161 variables (removed 37) and now considering 610/1090 (removed 480) transitions.
[2026-05-22 21:18:32] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
// Phase 1: matrix 571 rows 124 cols
[2026-05-22 21:18:32] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:18:32] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-22 21:18:32] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:18:32] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-22 21:18:33] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 124/161 places, 610/1232 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63863 ms. Remains : 124/161 places, 610/1232 transitions.
[2026-05-22 21:18:33] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 413=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 413=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:18:33] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 606 ms. (1647 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 747 ms. (1336 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:18:34] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:18:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:18:34] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2026-05-22 21:18:34] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-22 21:18:34] [INFO ] [Real]Added 82 Read/Feed constraints in 11 ms returned sat
[2026-05-22 21:18:34] [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:18:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:18:34] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2026-05-22 21:18:34] [INFO ] [Nat]Added 82 Read/Feed constraints in 13 ms returned sat
[2026-05-22 21:18:35] [INFO ] Computed and/alt/rep : 242/1008/241 causal constraints (skipped 329 transitions) in 30 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:18:35] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:18:35] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 5 ms to minimize.
[2026-05-22 21:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2026-05-22 21:18:35] [INFO ] Added : 8 causal constraints over 3 iterations in 450 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 610/610 transitions.
Applied a total of 0 rules in 6 ms. Remains 124 /124 variables (removed 0) and now considering 610/610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 610/610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 610/610 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 610/610 (removed 0) transitions.
[2026-05-22 21:18:35] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:18:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-22 21:18:35] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:18:35] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-22 21:18:36] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:18:36] [INFO ] Redundant transitions in 9 ms returned []
Running 609 sub problems to find dead transitions.
[2026-05-22 21:18:36] [INFO ] Flow matrix only has 571 transitions (discarded 39 similar events)
[2026-05-22 21:18:36] [INFO ] Invariant cache hit.
[2026-05-22 21:18:36] [INFO ] State equation strengthened by 82 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:18:38] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 605 unsolved
Problem TDEAD288 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
At refinement iteration 3 (OVERLAPS) 571/695 variables, 124/133 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 82/215 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/215 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 6 (OVERLAPS) 0/695 variables, 0/215 constraints. Problems are: Problem set: 20 solved, 589 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 215 constraints, problems are : Problem set: 20 solved, 589 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 589 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/9 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/9 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 3 (OVERLAPS) 571/695 variables, 124/133 constraints. Problems are: Problem set: 20 solved, 589 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 82/215 constraints. Problems are: Problem set: 20 solved, 589 unsolved
Problem TDEAD279 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD602 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 589/804 constraints. Problems are: Problem set: 49 solved, 560 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:28] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:28] [INFO ] Deduced a trap composed of 11 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:19:31] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/695 variables, and 807 constraints, problems are : Problem set: 49 solved, 560 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 589/609 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 49 solved, 560 unsolved
Search for dead transitions found 49 dead transitions in 60460ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 561/610 transitions.
Graph (complete) has 838 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 10 places and 89 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 113 transition count 472
Reduce places removed 5 places and 46 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 108 transition count 426
Reduce places removed 2 places and 17 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 409
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 105 transition count 401
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 104 transition count 393
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 104 transition count 393
Applied a total of 21 rules in 21 ms. Remains 104 /124 variables (removed 20) and now considering 393/561 (removed 168) transitions.
[2026-05-22 21:19:36] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
// Phase 1: matrix 373 rows 104 cols
[2026-05-22 21:19:36] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:19:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-22 21:19:36] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:19:36] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:19:37] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/124 places, 393/610 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61567 ms. Remains : 104/124 places, 393/610 transitions.
[2026-05-22 21:19:37] [INFO ] Flow matrix only has 373 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 {0=1, 298=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 298=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:19:37] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 549 ms. (1818 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 559 ms. (1785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:19:38] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:19:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:19:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2026-05-22 21:19:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:19:38] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2026-05-22 21:19:38] [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:19:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:19:38] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-22 21:19:38] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:38] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
[2026-05-22 21:19:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2026-05-22 21:19:38] [INFO ] Computed and/alt/rep : 220/990/220 causal constraints (skipped 152 transitions) in 18 ms.
[2026-05-22 21:19:38] [INFO ] Added : 10 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 393/393 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 104/104 places, 393/393 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 393/393 transitions.
Applied a total of 0 rules in 9 ms. Remains 104 /104 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2026-05-22 21:19:38] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:19:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-22 21:19:39] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:19:39] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:19:39] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:19:39] [INFO ] Redundant transitions in 5 ms returned []
Running 392 sub problems to find dead transitions.
[2026-05-22 21:19:39] [INFO ] Flow matrix only has 373 transitions (discarded 20 similar events)
[2026-05-22 21:19:39] [INFO ] Invariant cache hit.
[2026-05-22 21:19:39] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 373/477 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 66/178 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:19:46] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 179 constraints, problems are : Problem set: 0 solved, 392 unsolved in 23116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (OVERLAPS) 373/477 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 66/179 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 392/571 constraints. Problems are: Problem set: 2 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 1/572 constraints. Problems are: Problem set: 2 solved, 390 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:25] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 1/573 constraints. Problems are: Problem set: 2 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 573 constraints, problems are : Problem set: 2 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53330ms problems are : Problem set: 2 solved, 390 unsolved
Search for dead transitions found 2 dead transitions in 53332ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/104 places, 391/393 transitions.
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 380
Applied a total of 1 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 380/391 (removed 11) transitions.
[2026-05-22 21:20:32] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
// Phase 1: matrix 361 rows 103 cols
[2026-05-22 21:20:32] [INFO ] Computed 8 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:20:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 21:20:32] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:20:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:20:33] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 103/104 places, 380/393 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54197 ms. Remains : 103/104 places, 380/393 transitions.
[2026-05-22 21:20:33] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {2=1, 286=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 286=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:20:33] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000006 steps (2 resets) in 551 ms. (1811 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:20:34] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:20:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:20:34] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2026-05-22 21:20:34] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:20:34] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2026-05-22 21:20:34] [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:20:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-22 21:20:34] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-22 21:20:34] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2026-05-22 21:20:34] [INFO ] Computed and/alt/rep : 208/954/208 causal constraints (skipped 152 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:34] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 7 ms to minimize.
[2026-05-22 21:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2026-05-22 21:20:34] [INFO ] Added : 12 causal constraints over 3 iterations in 197 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 380/380 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 380/380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 380/380 transitions.
Applied a total of 0 rules in 7 ms. Remains 103 /103 variables (removed 0) and now considering 380/380 (removed 0) transitions.
[2026-05-22 21:20:34] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:20:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-22 21:20:35] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:20:35] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-22 21:20:35] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:20:35] [INFO ] Redundant transitions in 5 ms returned []
Running 379 sub problems to find dead transitions.
[2026-05-22 21:20:35] [INFO ] Flow matrix only has 361 transitions (discarded 19 similar events)
[2026-05-22 21:20:35] [INFO ] Invariant cache hit.
[2026-05-22 21:20:35] [INFO ] State equation strengthened by 66 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 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 TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 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 TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
At refinement iteration 2 (OVERLAPS) 361/464 variables, 103/111 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 66/177 constraints. Problems are: Problem set: 90 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:40] [INFO ] Deduced a trap composed of 11 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:20:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/464 variables, 2/179 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/464 variables, 0/179 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/464 variables, 0/179 constraints. Problems are: Problem set: 90 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 179 constraints, problems are : Problem set: 90 solved, 289 unsolved in 15967 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 90 solved, 289 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/9 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/9 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 3/103 variables, 1/10 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 361/464 variables, 103/113 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 66/179 constraints. Problems are: Problem set: 90 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/464 variables, 289/468 constraints. Problems are: Problem set: 90 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:57] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:57] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:58] [INFO ] Deduced a trap composed of 5 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:20:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:20:59] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/464 variables, 5/473 constraints. Problems are: Problem set: 90 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:03] [INFO ] Deduced a trap composed of 8 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:21:04] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/464 variables, 2/475 constraints. Problems are: Problem set: 90 solved, 289 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:10] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:10] [INFO ] Deduced a trap composed of 18 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:21:13] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/464 variables, 3/478 constraints. Problems are: Problem set: 90 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 478 constraints, problems are : Problem set: 90 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 289/379 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46163ms problems are : Problem set: 90 solved, 289 unsolved
Search for dead transitions found 90 dead transitions in 46168ms
Found 90 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 90 transitions
Dead transitions reduction (with SMT) removed 90 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 103/103 places, 290/380 transitions.
Graph (complete) has 523 edges and 103 vertex of which 100 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 98 transition count 280
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 98 transition count 280
Applied a total of 5 rules in 4 ms. Remains 98 /103 variables (removed 5) and now considering 280/290 (removed 10) transitions.
[2026-05-22 21:21:21] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
// Phase 1: matrix 259 rows 98 cols
[2026-05-22 21:21:21] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:21:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-22 21:21:21] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:21:21] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:21:21] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/103 places, 280/380 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46897 ms. Remains : 98/103 places, 280/380 transitions.
[2026-05-22 21:21:21] [INFO ] Flow matrix only has 259 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 {0=1, 186=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 186=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:21:21] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 548 ms. (1821 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 543 ms. (1838 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:21:23] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:21:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:21:23] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-22 21:21:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:21:23] [INFO ] [Real]Added 55 Read/Feed constraints in 6 ms returned sat
[2026-05-22 21:21:23] [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:21:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:21:23] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-22 21:21:23] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-22 21:21:23] [INFO ] Computed and/alt/rep : 217/1043/217 causal constraints (skipped 41 transitions) in 12 ms.
[2026-05-22 21:21:23] [INFO ] Added : 10 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 280/280 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 280/280 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 280/280 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 280/280 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 280/280 (removed 0) transitions.
[2026-05-22 21:21:23] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:21:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 21:21:23] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:21:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:21:23] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:21:23] [INFO ] Redundant transitions in 1 ms returned []
Running 279 sub problems to find dead transitions.
[2026-05-22 21:21:23] [INFO ] Flow matrix only has 259 transitions (discarded 21 similar events)
[2026-05-22 21:21:23] [INFO ] Invariant cache hit.
[2026-05-22 21:21:23] [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/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 259/357 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/357 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 357/357 variables, and 160 constraints, problems are : Problem set: 0 solved, 279 unsolved in 11318 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (OVERLAPS) 259/357 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 279/439 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:38] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:41] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:46] [INFO ] Deduced a trap along path composed of 8 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:46] [INFO ] Deduced a trap along path composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:49] [INFO ] Deduced a trap along path composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 3/445 constraints. Problems are: Problem set: 5 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:51] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/357 variables, 1/446 constraints. Problems are: Problem set: 5 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:56] [INFO ] Deduced a trap composed of 7 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:21:56] [INFO ] Deduced a trap composed of 19 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:21:56] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:56] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:56] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:57] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:21:57] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 357/357 variables, and 453 constraints, problems are : Problem set: 5 solved, 274 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41412ms problems are : Problem set: 5 solved, 274 unsolved
Search for dead transitions found 5 dead transitions in 41413ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 98/98 places, 275/280 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:22:05] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41731 ms. Remains : 98/98 places, 275/280 transitions.
[2026-05-22 21:22:05] [INFO ] Flow matrix only has 254 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 {1=1, 181=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 181=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:22:05] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
// Phase 1: matrix 254 rows 98 cols
[2026-05-22 21:22:05] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 436 ms. (2288 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 528 ms. (1890 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
[2026-05-22 21:22:06] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:22:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:22:06] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-22 21:22:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:22:06] [INFO ] [Real]Added 55 Read/Feed constraints in 11 ms returned sat
[2026-05-22 21:22: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:22:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:22:06] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-22 21:22:06] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-22 21:22:06] [INFO ] Computed and/alt/rep : 218/1068/218 causal constraints (skipped 35 transitions) in 17 ms.
[2026-05-22 21:22:06] [INFO ] Added : 9 causal constraints over 3 iterations in 73 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-22 21:22:06] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:22:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 21:22:06] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:22:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:22:06] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:22:06] [INFO ] Redundant transitions in 2 ms returned []
Running 274 sub problems to find dead transitions.
[2026-05-22 21:22:06] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:06] [INFO ] Invariant cache hit.
[2026-05-22 21:22:06] [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/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 254/352 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 160 constraints, problems are : Problem set: 0 solved, 274 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 254/352 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 274/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:16] [INFO ] Deduced a trap composed of 9 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:22:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:19] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:37] [INFO ] Deduced a trap along path composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/352 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:41] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:41] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 441 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35571ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 35572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35896 ms. Remains : 98/98 places, 275/275 transitions.
[2026-05-22 21:22:42] [INFO ] Flow matrix only has 254 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 {1=1, 181=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 181=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
RANDOM walk for 40056 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
[2026-05-22 21:22:43] [INFO ] Flatten gal took : 75 ms
[2026-05-22 21:22:43] [INFO ] Flatten gal took : 56 ms
[2026-05-22 21:22:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9363176526053004928.gal : 22 ms
[2026-05-22 21:22:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3079707854402963084.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/ReachabilityCardinality9363176526053004928.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3079707854402963084.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/ReachabilityCardinality3079707854402963084.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 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 33
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :33 after 692
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :692 after 2837
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2837 after 7094
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7094 after 15575
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :15575 after 32504
Interrupted probabilistic random walk after 1261158 steps, run timeout after 3001 ms. (steps per millisecond=420 ) properties seen :0 out of 1
Probabilistic random walk after 1261158 steps, saw 729311 distinct states, run finished after 3005 ms. (steps per millisecond=419 ) properties seen :0
[2026-05-22 21:22:45] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:45] [INFO ] Invariant cache hit.
[2026-05-22 21:22:45] [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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/106 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/110 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/184 variables, 31/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 71/255 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 22/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/259 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/259 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 73/332 variables, 19/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/332 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 10/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/332 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 20/352 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/352 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/352 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 160 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 97/106 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/110 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/184 variables, 31/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 71/255 variables, 16/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/259 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/259 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/259 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 73/332 variables, 19/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/332 variables, 10/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:22:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :32504 after 66329
At refinement iteration 23 (INCLUDED_ONLY) 0/332 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/332 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/352 variables, 11/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/352 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/352 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/352 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/352 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 719ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 275/275 transitions.
RANDOM walk for 40073 steps (8 resets) in 37 ms. (1054 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1261226 steps, run visited all 1 properties in 2876 ms. (steps per millisecond=438 )
Probabilistic random walk after 1261226 steps, saw 729332 distinct states, run finished after 2880 ms. (steps per millisecond=437 ) properties seen :1
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:[1, 0, 0, 1] Max Struct:[+inf, 1, 1, +inf]
Starting property specific reduction for BugTracking-PT-q8m032-UpperBounds-14
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:22:49] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10019 steps (2 resets) in 6 ms. (1431 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2026-05-22 21:22:49] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:22:49] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:22:49] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-22 21:22:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:22:49] [INFO ] [Real]Added 55 Read/Feed constraints in 13 ms returned sat
[2026-05-22 21:22:49] [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:22:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-22 21:22:49] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2026-05-22 21:22:49] [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:22:49] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2026-05-22 21:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2026-05-22 21:22:49] [INFO ] Computed and/alt/rep : 218/1068/218 causal constraints (skipped 35 transitions) in 18 ms.
[2026-05-22 21:22:49] [INFO ] Added : 27 causal constraints over 6 iterations in 139 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 98/98 places, 275/275 transitions.
[2026-05-22 21:22:49] [INFO ] Flow matrix only has 254 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 {1=1, 181=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 181=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2026-05-22 21:22:50] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:50] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000016 steps (2 resets) in 475 ms. (2100 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2026-05-22 21:22:51] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-22 21:22:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:22:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2026-05-22 21:22:51] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:22:51] [INFO ] [Real]Added 55 Read/Feed constraints in 7 ms returned sat
[2026-05-22 21:22:51] [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:22:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-22 21:22:51] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2026-05-22 21:22:51] [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:22:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 3 ms to minimize.
[2026-05-22 21:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2026-05-22 21:22:51] [INFO ] Computed and/alt/rep : 218/1068/218 causal constraints (skipped 35 transitions) in 11 ms.
[2026-05-22 21:22:51] [INFO ] Added : 27 causal constraints over 6 iterations in 117 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 275/275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 275/275 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2026-05-22 21:22:51] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:22:52] [INFO ] Implicit Places using invariants in 767 ms returned []
[2026-05-22 21:22:52] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-22 21:22:52] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 21:22:52] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-22 21:22:52] [INFO ] Redundant transitions in 3 ms returned []
Running 274 sub problems to find dead transitions.
[2026-05-22 21:22:52] [INFO ] Flow matrix only has 254 transitions (discarded 21 similar events)
[2026-05-22 21:22:52] [INFO ] Invariant cache hit.
[2026-05-22 21:22:52] [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/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 254/352 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 274 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (OVERLAPS) 0/352 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 160 constraints, problems are : Problem set: 0 solved, 274 unsolved in 5431 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 254/352 variables, 98/105 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 55/160 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 274/434 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:01] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:05] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:23] [INFO ] Deduced a trap along path composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/352 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 274 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:27] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:23:27] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 441 constraints, problems are : Problem set: 0 solved, 274 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 35557ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 35558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36561 ms. Remains : 98/98 places, 275/275 transitions.
[2026-05-22 21:23:28] [INFO ] Flow matrix only has 254 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 {1=1, 181=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 181=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 22282 steps (5 resets) in 28 ms. (768 steps per ms) remains 0/1 properties
[2026-05-22 21:23:28] [INFO ] Flatten gal took : 31 ms
[2026-05-22 21:23:28] [INFO ] Flatten gal took : 19 ms
[2026-05-22 21:23:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9045421214314103024.gal : 14 ms
[2026-05-22 21:23:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14956107796131170810.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/ReachabilityCardinality9045421214314103024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14956107796131170810.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 ...329
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality14956107796131170810.prop.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m032-UpperBounds-14 in 39033 ms.
[2026-05-22 21:23:28] [INFO ] Flatten gal took : 27 ms
[2026-05-22 21:23:28] [INFO ] Applying decomposition
[2026-05-22 21:23:28] [INFO ] Flatten gal took : 28 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/graph4779156979985774556.txt' '-o' '/tmp/graph4779156979985774556.bin' '-w' '/tmp/graph4779156979985774556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4779156979985774556.bin' '-l' '-1' '-v' '-w' '/tmp/graph4779156979985774556.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:23:28] [INFO ] Decomposing Gal with order
[2026-05-22 21:23:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:23:28] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-22 21:23:28] [INFO ] Flatten gal took : 79 ms
[2026-05-22 21:23:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 2 ms.
[2026-05-22 21:23:28] [INFO ] Time to serialize gal into /tmp/UpperBounds6878993057170612903.gal : 4 ms
[2026-05-22 21:23:28] [INFO ] Time to serialize properties into /tmp/UpperBounds16751284131670896508.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/UpperBounds6878993057170612903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16751284131670896508.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 ...284
Loading property file /tmp/UpperBounds16751284131670896508.prop.
Detected timeout of ITS tools.
[2026-05-22 21:46:37] [INFO ] Flatten gal took : 235 ms
[2026-05-22 21:46:37] [INFO ] Time to serialize gal into /tmp/UpperBounds7129639216875003973.gal : 62 ms
[2026-05-22 21:46:37] [INFO ] Time to serialize properties into /tmp/UpperBounds2362799812145486434.prop : 5 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/UpperBounds7129639216875003973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2362799812145486434.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 ...304
Loading property file /tmp/UpperBounds2362799812145486434.prop.
Detected timeout of ITS tools.
[2026-05-22 22:09:36] [INFO ] Flatten gal took : 81 ms
[2026-05-22 22:09:37] [INFO ] Input system was already deterministic with 275 transitions.
[2026-05-22 22:09:37] [INFO ] Transformed 98 places.
[2026-05-22 22:09:37] [INFO ] Transformed 275 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:09:37] [INFO ] Time to serialize gal into /tmp/UpperBounds16744840821879060058.gal : 15 ms
[2026-05-22 22:09:37] [INFO ] Time to serialize properties into /tmp/UpperBounds14974659287454742069.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/UpperBounds16744840821879060058.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14974659287454742069.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 ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14974659287454742069.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-q8m032"
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-q8m032, 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-177946846400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 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 ;