About the Execution of ITS-Tools for BugTracking-PT-q3m128
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 0 0 0 0 1 0 0 0 0 0 0 0 ? inf 0 0 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765300533.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BugTracking-PT-q3m128, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765300533
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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-q3m128-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m128-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1749159864915
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 21:44:26] [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]
[2025-06-05 21:44:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 21:44:28] [INFO ] Load time of PNML (sax parser for PT used): 1395 ms
[2025-06-05 21:44:28] [INFO ] Transformed 754 places.
[2025-06-05 21:44:28] [INFO ] Transformed 27370 transitions.
[2025-06-05 21:44:28] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1702 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 30 ms.
Deduced a syphon composed of 514 places in 221 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 21:44:29] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 21:44:29] [INFO ] Computed 10 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, +inf, +inf, 1]
RANDOM walk for 10000 steps (11 resets) in 134 ms. (74 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (12 resets) in 240 ms. (248 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
[2025-06-05 21:44:29] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-06-05 21:44:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:30] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2025-06-05 21:44:31] [INFO ] [Real]Absence check using state equation in 1023 ms returned sat
[2025-06-05 21:44:31] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 21:44:31] [INFO ] [Real]Added 255 Read/Feed constraints in 124 ms returned sat
[2025-06-05 21:44:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 21:44:32] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2025-06-05 21:44:32] [INFO ] [Nat]Added 255 Read/Feed constraints in 116 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:33] [INFO ] Deduced a trap composed of 45 places in 531 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:33] [INFO ] Deduced a trap composed of 12 places in 496 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:34] [INFO ] Deduced a trap composed of 46 places in 470 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:35] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:35] [INFO ] Deduced a trap composed of 46 places in 504 ms of which 19 ms to minimize.
[2025-06-05 21:44:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3029 ms
[2025-06-05 21:44:36] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 379 ms.
[2025-06-05 21:44:36] [INFO ] Added : 6 causal constraints over 2 iterations in 968 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:36] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:37] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2025-06-05 21:44:37] [INFO ] [Real]Added 255 Read/Feed constraints in 67 ms returned sat
[2025-06-05 21:44:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 21:44:38] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2025-06-05 21:44:38] [INFO ] [Nat]Added 255 Read/Feed constraints in 241 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:39] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 21 ms to minimize.
[2025-06-05 21:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 590 ms
[2025-06-05 21:44:39] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 238 ms.
[2025-06-05 21:44:40] [INFO ] Added : 8 causal constraints over 2 iterations in 743 ms. Result :sat
Minimization took 715 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:40] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 21:44:41] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2025-06-05 21:44:41] [INFO ] [Real]Added 255 Read/Feed constraints in 93 ms returned sat
[2025-06-05 21:44:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:42] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2025-06-05 21:44:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 79 ms returned sat
[2025-06-05 21:44:42] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 239 ms.
[2025-06-05 21:44:43] [INFO ] Added : 2 causal constraints over 1 iterations in 560 ms. Result :sat
Minimization took 668 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:43] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:44] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2025-06-05 21:44:44] [INFO ] [Real]Added 255 Read/Feed constraints in 92 ms returned sat
[2025-06-05 21:44:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:45] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2025-06-05 21:44:45] [INFO ] [Nat]Added 255 Read/Feed constraints in 101 ms returned sat
[2025-06-05 21:44:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 229 ms.
[2025-06-05 21:44:46] [INFO ] Added : 3 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 662 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:46] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:47] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2025-06-05 21:44:47] [INFO ] [Real]Added 255 Read/Feed constraints in 55 ms returned sat
[2025-06-05 21:44:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:48] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2025-06-05 21:44:48] [INFO ] [Nat]Added 255 Read/Feed constraints in 278 ms returned sat
[2025-06-05 21:44:49] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 244 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:44:49] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 3 ms to minimize.
[2025-06-05 21:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 287 ms
[2025-06-05 21:44:50] [INFO ] Added : 13 causal constraints over 4 iterations in 1298 ms. Result :sat
Minimization took 666 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:50] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 21:44:51] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2025-06-05 21:44:51] [INFO ] [Real]Added 255 Read/Feed constraints in 73 ms returned sat
[2025-06-05 21:44:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:44:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 21:44:52] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2025-06-05 21:44:52] [INFO ] [Nat]Added 255 Read/Feed constraints in 78 ms returned sat
[2025-06-05 21:44:52] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 253 ms.
[2025-06-05 21:44:53] [INFO ] Added : 2 causal constraints over 1 iterations in 564 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 29, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 389 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 229/240 places, 2747/2769 transitions.
[2025-06-05 21:44:54] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 6) seen :[0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
[2025-06-05 21:44:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2025-06-05 21:44:55] [INFO ] Computed 8 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, +inf, 0, 0] Max Struct:[+inf, 1, +inf, +inf, +inf, 1]
RANDOM walk for 1000105 steps (2 resets) in 1051 ms. (950 steps per ms)
FORMULA BugTracking-PT-q3m128-UpperBounds-13 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 15067 ms. (331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:45:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:45:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:12] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 21:45:12] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2025-06-05 21:45:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 21:45:12] [INFO ] [Real]Added 241 Read/Feed constraints in 65 ms returned sat
[2025-06-05 21:45:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:13] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2025-06-05 21:45:13] [INFO ] [Nat]Added 241 Read/Feed constraints in 116 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:14] [INFO ] Deduced a trap composed of 19 places in 617 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:15] [INFO ] Deduced a trap composed of 31 places in 641 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:15] [INFO ] Deduced a trap composed of 43 places in 601 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:16] [INFO ] Deduced a trap composed of 43 places in 593 ms of which 35 ms to minimize.
[2025-06-05 21:45:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3016 ms
[2025-06-05 21:45:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 237 ms.
[2025-06-05 21:45:17] [INFO ] Added : 4 causal constraints over 1 iterations in 606 ms. Result :sat
Minimization took 2395 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:45:20] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-06-05 21:45:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:45:21] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2025-06-05 21:45:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 176 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:22] [INFO ] Deduced a trap composed of 15 places in 446 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:22] [INFO ] Deduced a trap composed of 19 places in 394 ms of which 13 ms to minimize.
[2025-06-05 21:45:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1070 ms
[2025-06-05 21:45:22] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 228 ms.
[2025-06-05 21:45:23] [INFO ] Added : 4 causal constraints over 1 iterations in 568 ms. Result :sat
Minimization took 2397 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:26] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2025-06-05 21:45:26] [INFO ] [Real]Added 241 Read/Feed constraints in 62 ms returned sat
[2025-06-05 21:45:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:27] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2025-06-05 21:45:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 63 ms returned sat
[2025-06-05 21:45:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 235 ms.
[2025-06-05 21:45:27] [INFO ] Added : 2 causal constraints over 1 iterations in 531 ms. Result :sat
Minimization took 2246 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:30] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:30] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2025-06-05 21:45:31] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2025-06-05 21:45:31] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:31] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2025-06-05 21:45:32] [INFO ] [Nat]Added 241 Read/Feed constraints in 195 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:32] [INFO ] Deduced a trap composed of 10 places in 641 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:33] [INFO ] Deduced a trap composed of 11 places in 604 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:34] [INFO ] Deduced a trap composed of 34 places in 627 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:45:34] [INFO ] Deduced a trap composed of 35 places in 619 ms of which 21 ms to minimize.
[2025-06-05 21:45:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2845 ms
[2025-06-05 21:45:35] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 225 ms.
[2025-06-05 21:45:35] [INFO ] Added : 2 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 2305 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:38] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-06-05 21:45:38] [INFO ] [Real]Added 241 Read/Feed constraints in 52 ms returned sat
[2025-06-05 21:45:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:45:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:45:39] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2025-06-05 21:45:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 65 ms returned sat
[2025-06-05 21:45:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 227 ms.
[2025-06-05 21:45:40] [INFO ] Added : 2 causal constraints over 1 iterations in 528 ms. Result :sat
Minimization took 2264 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 54 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 229/229 places, 2747/2747 transitions.
[2025-06-05 21:45:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 5) seen :[0, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:45:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:45:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000088 steps (2 resets) in 991 ms. (1008 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 14898 ms. (335 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:46:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:01] [INFO ] [Real]Absence check using state equation in 636 ms returned sat
[2025-06-05 21:46:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 21:46:01] [INFO ] [Real]Added 241 Read/Feed constraints in 60 ms returned sat
[2025-06-05 21:46:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:46:02] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2025-06-05 21:46:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 119 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:02] [INFO ] Deduced a trap composed of 19 places in 578 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:03] [INFO ] Deduced a trap composed of 31 places in 598 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:04] [INFO ] Deduced a trap composed of 43 places in 587 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:04] [INFO ] Deduced a trap composed of 43 places in 600 ms of which 37 ms to minimize.
[2025-06-05 21:46:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2899 ms
[2025-06-05 21:46:05] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 234 ms.
[2025-06-05 21:46:05] [INFO ] Added : 4 causal constraints over 1 iterations in 618 ms. Result :sat
Minimization took 2365 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:08] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:08] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2025-06-05 21:46:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:46:09] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2025-06-05 21:46:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 174 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:10] [INFO ] Deduced a trap composed of 15 places in 448 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:10] [INFO ] Deduced a trap composed of 19 places in 380 ms of which 12 ms to minimize.
[2025-06-05 21:46:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1043 ms
[2025-06-05 21:46:11] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 234 ms.
[2025-06-05 21:46:11] [INFO ] Added : 4 causal constraints over 1 iterations in 554 ms. Result :sat
Minimization took 2316 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:46:14] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2025-06-05 21:46:14] [INFO ] [Real]Added 241 Read/Feed constraints in 61 ms returned sat
[2025-06-05 21:46:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:15] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2025-06-05 21:46:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 65 ms returned sat
[2025-06-05 21:46:15] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 226 ms.
[2025-06-05 21:46:15] [INFO ] Added : 2 causal constraints over 1 iterations in 541 ms. Result :sat
Minimization took 2237 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:18] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:19] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2025-06-05 21:46:19] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2025-06-05 21:46:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:19] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2025-06-05 21:46:20] [INFO ] [Nat]Added 241 Read/Feed constraints in 198 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:20] [INFO ] Deduced a trap composed of 10 places in 626 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:21] [INFO ] Deduced a trap composed of 11 places in 635 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:22] [INFO ] Deduced a trap composed of 34 places in 630 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:46:22] [INFO ] Deduced a trap composed of 35 places in 632 ms of which 20 ms to minimize.
[2025-06-05 21:46:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2880 ms
[2025-06-05 21:46:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 238 ms.
[2025-06-05 21:46:23] [INFO ] Added : 2 causal constraints over 1 iterations in 552 ms. Result :sat
Minimization took 2308 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:26] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2025-06-05 21:46:26] [INFO ] [Real]Added 241 Read/Feed constraints in 53 ms returned sat
[2025-06-05 21:46:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:46:27] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2025-06-05 21:46:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 64 ms returned sat
[2025-06-05 21:46:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 232 ms.
[2025-06-05 21:46:28] [INFO ] Added : 2 causal constraints over 1 iterations in 533 ms. Result :sat
Minimization took 2308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 21:46:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:46:32] [INFO ] Implicit Places using invariants in 733 ms returned []
[2025-06-05 21:46:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:46:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2025-06-05 21:46:36] [INFO ] Implicit Places using invariants and state equation in 4798 ms returned []
Implicit Place search using SMT with State Equation took 5543 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:46:37] [INFO ] Redundant transitions in 453 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 21:46:37] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2025-06-05 21:46:37] [INFO ] Invariant cache hit.
[2025-06-05 21:46:37] [INFO ] State equation strengthened by 241 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.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:11] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/2847 variables, and 9 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2746 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 2738 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:29] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 4 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:29] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 4 ms to minimize.
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:30] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 3 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 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 TDEAD1575 is UNSAT
Problem TDEAD1576 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 TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 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 TDEAD1595 is UNSAT
Problem TDEAD1596 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 TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 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 TDEAD1615 is UNSAT
Problem TDEAD1616 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 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 TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:39] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 3 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 4/13 constraints. Problems are: Problem set: 222 solved, 2524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/2847 variables, and 13 constraints, problems are : Problem set: 222 solved, 2524 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67535ms problems are : Problem set: 222 solved, 2524 unsolved
Search for dead transitions found 222 dead transitions in 67589ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2525/2747 transitions.
Reduce places removed 26 places and 563 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 203 transition count 1962
Reduce places removed 19 places and 260 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 45 place count 184 transition count 1702
Reduce places removed 8 places and 198 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 53 place count 176 transition count 1504
Reduce places removed 9 places and 118 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 62 place count 167 transition count 1386
Reduce places removed 3 places and 66 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 164 transition count 1320
Reduce places removed 3 places and 52 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 68 place count 161 transition count 1268
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 71 place count 158 transition count 1225
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 16 places and 270 transitions.
Iterating global reduction 6 with 19 rules applied. Total rules applied 90 place count 142 transition count 955
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 90 rules in 64 ms. Remains 142 /229 variables (removed 87) and now considering 955/2525 (removed 1570) transitions.
[2025-06-05 21:47:44] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 142 cols
[2025-06-05 21:47:45] [INFO ] Computed 12 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:47:45] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-05 21:47:45] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 21:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:47:45] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 21:47:47] [INFO ] Implicit Places using invariants and state equation in 1859 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 142/229 places, 955/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75981 ms. Remains : 142/229 places, 955/2747 transitions.
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
FORMULA BugTracking-PT-q3m128-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m128-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 21:47:47] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 589=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 589=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:47:47] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
// Phase 1: matrix 904 rows 138 cols
[2025-06-05 21:47:47] [INFO ] Computed 8 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000057 steps (2 resets) in 691 ms. (1445 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 1476 ms. (677 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:47:49] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 21:47:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:47:49] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 21:47:50] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-06-05 21:47:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:47:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:47:50] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2025-06-05 21:47:50] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 21:47:50] [INFO ] [Nat]Added 113 Read/Feed constraints in 44 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:50] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:50] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:50] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 7 ms to minimize.
[2025-06-05 21:47:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 441 ms
[2025-06-05 21:47:51] [INFO ] Computed and/alt/rep : 231/857/230 causal constraints (skipped 673 transitions) in 71 ms.
[2025-06-05 21:47:51] [INFO ] Added : 15 causal constraints over 4 iterations in 362 ms. Result :sat
Minimization took 532 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 15 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 138/138 places, 955/955 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 955/955 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 955/955 (removed 0) transitions.
[2025-06-05 21:47:51] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 21:47:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:47:52] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 21:47:52] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 21:47:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:47:52] [INFO ] State equation strengthened by 113 read => feed constraints.
[2025-06-05 21:47:53] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:47:53] [INFO ] Redundant transitions in 42 ms returned []
Running 954 sub problems to find dead transitions.
[2025-06-05 21:47:53] [INFO ] Flow matrix only has 904 transitions (discarded 51 similar events)
[2025-06-05 21:47:53] [INFO ] Invariant cache hit.
[2025-06-05 21:47:53] [INFO ] State equation strengthened by 113 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 954 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:47:59] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:48:01] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 4 ms to minimize.
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:48:01] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 3/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 150 solved, 804 unsolved
Problem TDEAD619 is UNSAT
At refinement iteration 3 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 114.0)
(s1 1.0)
(s2 13.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 (/ 1.0 52.0))
(s79 (/ 51.0 52.0))
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 (/ 11.0 13.0))
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 262 constraints, problems are : Problem set: 151 solved, 803 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 954/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 151 solved, 803 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 7/7 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 3/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/10 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 3 (OVERLAPS) 1/138 variables, 1/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/11 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 5 (OVERLAPS) 904/1042 variables, 138/149 constraints. Problems are: Problem set: 151 solved, 803 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 113/262 constraints. Problems are: Problem set: 151 solved, 803 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 803/1065 constraints. Problems are: Problem set: 221 solved, 733 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 1065 constraints, problems are : Problem set: 221 solved, 733 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 138/138 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 803/954 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61453ms problems are : Problem set: 221 solved, 733 unsolved
Search for dead transitions found 221 dead transitions in 61459ms
Found 221 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 221 transitions
Dead transitions reduction (with SMT) removed 221 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/138 places, 734/955 transitions.
Graph (complete) has 1052 edges and 138 vertex of which 137 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 19 places and 231 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 118 transition count 503
Reduce places removed 16 places and 91 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 36 place count 102 transition count 412
Reduce places removed 4 places and 31 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 98 transition count 381
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 96 transition count 365
Reduce places removed 1 places and 14 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 95 transition count 351
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 48 place count 90 transition count 316
Iterating global reduction 5 with 5 rules applied. Total rules applied 53 place count 90 transition count 316
Applied a total of 53 rules in 18 ms. Remains 90 /138 variables (removed 48) and now considering 316/734 (removed 418) transitions.
[2025-06-05 21:48:55] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
// Phase 1: matrix 296 rows 90 cols
[2025-06-05 21:48:55] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:48:55] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-05 21:48:55] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:48:55] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 21:48:55] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/138 places, 316/955 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63712 ms. Remains : 90/138 places, 316/955 transitions.
[2025-06-05 21:48:55] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {5=1, 220=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, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:48:55] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000089 steps (2 resets) in 497 ms. (2008 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 825 ms. (1210 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:48:57] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:48:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 21:48:57] [INFO ] [Real]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:48:57] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2025-06-05 21:48:57] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 21:48:57] [INFO ] [Real]Added 54 Read/Feed constraints in 14 ms returned sat
[2025-06-05 21:48:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:48:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 21:48:57] [INFO ] [Nat]Absence check using 8 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:48:57] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2025-06-05 21:48:57] [INFO ] [Nat]Added 54 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:48:57] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:48:57] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 9 ms to minimize.
[2025-06-05 21:48:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2025-06-05 21:48:57] [INFO ] Computed and/alt/rep : 182/885/182 causal constraints (skipped 113 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:48:58] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 3 ms to minimize.
[2025-06-05 21:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2025-06-05 21:48:58] [INFO ] Added : 41 causal constraints over 9 iterations in 324 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 316/316 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 316/316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 90/90 places, 316/316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 316/316 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 316/316 (removed 0) transitions.
[2025-06-05 21:48:58] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:48:58] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-05 21:48:58] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:48:58] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-06-05 21:48:58] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:48:58] [INFO ] Redundant transitions in 2 ms returned []
Running 315 sub problems to find dead transitions.
[2025-06-05 21:48:58] [INFO ] Flow matrix only has 296 transitions (discarded 20 similar events)
[2025-06-05 21:48:58] [INFO ] Invariant cache hit.
[2025-06-05 21:48:58] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 315 unsolved
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
At refinement iteration 3 (OVERLAPS) 296/386 variables, 90/99 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 54/153 constraints. Problems are: Problem set: 4 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:04] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:05] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 2/155 constraints. Problems are: Problem set: 4 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/155 constraints. Problems are: Problem set: 4 solved, 311 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 2 ms to minimize.
Problem TDEAD294 is UNSAT
Problem TDEAD302 is UNSAT
At refinement iteration 7 (OVERLAPS) 0/386 variables, 1/156 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/156 constraints. Problems are: Problem set: 6 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 156 constraints, problems are : Problem set: 6 solved, 309 unsolved in 25273 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 309 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 8/8 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 1/9 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 3/12 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 296/386 variables, 90/102 constraints. Problems are: Problem set: 6 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 54/156 constraints. Problems are: Problem set: 6 solved, 309 unsolved
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 309/465 constraints. Problems are: Problem set: 12 solved, 303 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:31] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:31] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:32] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 5 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 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 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:33] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:33] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:34] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 4 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 6/471 constraints. Problems are: Problem set: 53 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:38] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:40] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 4 ms to minimize.
Problem TDEAD181 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:41] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 3 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 3/474 constraints. Problems are: Problem set: 57 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:51] [INFO ] Deduced a trap along path composed of 6 places in 29 ms of which 3 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 475 constraints, problems are : Problem set: 68 solved, 247 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 309/315 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 55438ms problems are : Problem set: 68 solved, 247 unsolved
Search for dead transitions found 68 dead transitions in 55440ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 90/90 places, 248/316 transitions.
Graph (complete) has 444 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 82 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 82 transition count 226
Applied a total of 6 rules in 9 ms. Remains 82 /90 variables (removed 8) and now considering 226/248 (removed 22) transitions.
[2025-06-05 21:49:54] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
// Phase 1: matrix 210 rows 82 cols
[2025-06-05 21:49:54] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:49:54] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-05 21:49:54] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:49:54] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 21:49:54] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/90 places, 226/316 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 56516 ms. Remains : 82/90 places, 226/316 transitions.
[2025-06-05 21:49:54] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {4=1, 139=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 139=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:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:49:54] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000044 steps (2 resets) in 496 ms. (2012 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 777 ms. (1285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:49:56] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:49:56] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-05 21:49:56] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-05 21:49:56] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2025-06-05 21:49:56] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 21:49:56] [INFO ] [Real]Added 47 Read/Feed constraints in 10 ms returned sat
[2025-06-05 21:49:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:49:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 21:49:56] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:49:56] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-06-05 21:49:56] [INFO ] [Nat]Added 47 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:56] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:56] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 10 ms to minimize.
[2025-06-05 21:49:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2025-06-05 21:49:56] [INFO ] Computed and/alt/rep : 179/980/179 causal constraints (skipped 30 transitions) in 13 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2025-06-05 21:49:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:57] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:49:57] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
[2025-06-05 21:49:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2025-06-05 21:49:57] [INFO ] Added : 39 causal constraints over 11 iterations in 446 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2025-06-05 21:49:57] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:49:57] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-05 21:49:57] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:49:57] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-05 21:49:57] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:49:57] [INFO ] Redundant transitions in 1 ms returned []
Running 225 sub problems to find dead transitions.
[2025-06-05 21:49:57] [INFO ] Flow matrix only has 210 transitions (discarded 16 similar events)
[2025-06-05 21:49:57] [INFO ] Invariant cache hit.
[2025-06-05 21:49:57] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 3 (OVERLAPS) 210/292 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:01] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 138 constraints, problems are : Problem set: 12 solved, 213 unsolved in 10784 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 1/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 210/292 variables, 82/91 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 47/138 constraints. Problems are: Problem set: 12 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 213/351 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:11] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:12] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/353 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:16] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 1/354 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:21] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 1/355 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:29] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/356 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:34] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:34] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:34] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 3/359 constraints. Problems are: Problem set: 12 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/292 variables, and 359 constraints, problems are : Problem set: 12 solved, 213 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 213/225 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40876ms problems are : Problem set: 12 solved, 213 unsolved
Search for dead transitions found 12 dead transitions in 40877ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 214/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:50:38] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41329 ms. Remains : 82/82 places, 214/226 transitions.
[2025-06-05 21:50:38] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:50:38] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
// Phase 1: matrix 198 rows 82 cols
[2025-06-05 21:50:38] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 1000021 steps (2 resets) in 490 ms. (2036 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 797 ms. (1253 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
[2025-06-05 21:50:40] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:50:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:50:40] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 21:50:40] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:50:40] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2025-06-05 21:50:40] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:50:40] [INFO ] [Real]Added 45 Read/Feed constraints in 11 ms returned sat
[2025-06-05 21:50:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:50:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-05 21:50:40] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:50:40] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-06-05 21:50:40] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:40] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:40] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:40] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:40] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 8 ms to minimize.
[2025-06-05 21:50:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 398 ms
[2025-06-05 21:50:40] [INFO ] Computed and/alt/rep : 167/872/167 causal constraints (skipped 30 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:40] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 3 ms to minimize.
[2025-06-05 21:50:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-06-05 21:50:40] [INFO ] Added : 40 causal constraints over 10 iterations in 274 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 21:50:41] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:50:41] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-05 21:50:41] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:50:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:50:41] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:50:41] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 21:50:41] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:50:41] [INFO ] Invariant cache hit.
[2025-06-05 21:50:41] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 213/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:55] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:50:59] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:02] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:03] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:03] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:03] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:07] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:07] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:07] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:11] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:12] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:18] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 363 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40275ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 40276ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40705 ms. Remains : 82/82 places, 214/214 transitions.
[2025-06-05 21:51:21] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
RANDOM walk for 40232 steps (8 resets) in 120 ms. (332 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2025-06-05 21:51:22] [INFO ] Flatten gal took : 104 ms
[2025-06-05 21:51:22] [INFO ] Flatten gal took : 48 ms
[2025-06-05 21:51:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18008947643730356494.gal : 19 ms
[2025-06-05 21:51:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9579789234039528842.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/ReachabilityCardinality18008947643730356494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9579789234039528842.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
Loading property file /tmp/ReachabilityCardinality9579789234039528842.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 979111 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 1
Probabilistic random walk after 979111 steps, saw 621506 distinct states, run finished after 3010 ms. (steps per millisecond=325 ) properties seen :0
[2025-06-05 21:51:25] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:51:25] [INFO ] Invariant cache hit.
[2025-06-05 21:51:25] [INFO ] State equation strengthened by 45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/151 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/236 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/236 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/238 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/278 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/278 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/280 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 58/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/151 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/236 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/236 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/238 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/278 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/278 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/280 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:25] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 6 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/280 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 214/214 transitions.
RANDOM walk for 40272 steps (8 resets) in 35 ms. (1118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114422 after 246647
Interrupted probabilistic random walk after 1069377 steps, run timeout after 3001 ms. (steps per millisecond=356 ) properties seen :0 out of 1
Probabilistic random walk after 1069377 steps, saw 682335 distinct states, run finished after 3001 ms. (steps per millisecond=356 ) properties seen :0
[2025-06-05 21:51:28] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:51:28] [INFO ] Invariant cache hit.
[2025-06-05 21:51:28] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/151 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/236 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/236 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/238 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/278 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/278 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/280 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 58/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/151 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/236 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/236 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/238 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/278 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/278 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/280 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:29] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 6 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/280 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 527ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 21:51:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:51:29] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-05 21:51:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:51:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:51:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:51:29] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:51:29] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 21:51:29] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:51:29] [INFO ] Invariant cache hit.
[2025-06-05 21:51:29] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10300 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 213/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:44] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:48] [INFO ] Deduced a trap along path composed of 6 places in 37 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :246647 after 510968
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:52] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:52] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:52] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:52] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:53] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:54] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:57] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:51:57] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:02] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:02] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:08] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:08] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 363 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40442ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 40445ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40840 ms. Remains : 82/82 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 326 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 196
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 152
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 54 transition count 145
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 74 place count 54 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 79 place count 49 transition count 140
Applied a total of 79 rules in 48 ms. Remains 49 /82 variables (removed 33) and now considering 140/214 (removed 74) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 140 rows 49 cols
[2025-06-05 21:52:10] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:52:10] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-06-05 21:52:10] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:52:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-05 21:52:10] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 21:52:10] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:52:10] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:52:10] [INFO ] Flatten gal took : 21 ms
[2025-06-05 21:52:10] [INFO ] Flatten gal took : 29 ms
[2025-06-05 21:52:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16842370264695953775.gal : 10 ms
[2025-06-05 21:52:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13313278969259419514.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/ReachabilityCardinality16842370264695953775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13313278969259419514.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13313278969259419514.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15608
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15608 after 48761
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48761 after 114938
Detected timeout of ITS tools.
[2025-06-05 21:52:12] [INFO ] Flatten gal took : 26 ms
[2025-06-05 21:52:12] [INFO ] Applying decomposition
[2025-06-05 21:52:12] [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/graph10361878405201559677.txt' '-o' '/tmp/graph10361878405201559677.bin' '-w' '/tmp/graph10361878405201559677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10361878405201559677.bin' '-l' '-1' '-v' '-w' '/tmp/graph10361878405201559677.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:52:12] [INFO ] Decomposing Gal with order
[2025-06-05 21:52:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:52:12] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-05 21:52:13] [INFO ] Flatten gal took : 83 ms
[2025-06-05 21:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 4 ms.
[2025-06-05 21:52:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6175670680252291632.gal : 6 ms
[2025-06-05 21:52:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2512372328429548756.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/ReachabilityCardinality6175670680252291632.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2512372328429548756.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2512372328429548756.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 6642
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6642 after 14177
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :14177 after 23870
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :23870 after 46803
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114938 after 247163
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :46803 after 146472
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :146472 after 407396
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :407396 after 1.06408e+06
Detected timeout of ITS tools.
[2025-06-05 21:52:25] [INFO ] Flatten gal took : 15 ms
[2025-06-05 21:52:25] [INFO ] Applying decomposition
[2025-06-05 21:52:25] [INFO ] Flatten gal took : 14 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/graph4930602843823344308.txt' '-o' '/tmp/graph4930602843823344308.bin' '-w' '/tmp/graph4930602843823344308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4930602843823344308.bin' '-l' '-1' '-v' '-w' '/tmp/graph4930602843823344308.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:52:25] [INFO ] Decomposing Gal with order
[2025-06-05 21:52:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:52:25] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-05 21:52:25] [INFO ] Flatten gal took : 24 ms
[2025-06-05 21:52:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2025-06-05 21:52:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12008124064764848369.gal : 4 ms
[2025-06-05 21:52:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality714158891704274692.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/ReachabilityCardinality12008124064764848369.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality714158891704274692.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality714158891704274692.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 1153
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1153 after 3.07748e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.07748e+07 after 1.14375e+10
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.14375e+10 after 3.97642e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.97642e+12 after 1.08064e+15
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.06408e+06 after 2.31839e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30613 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[+inf, 1, +inf, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m128-UpperBounds-12
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]
[2025-06-05 21:52:40] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
// Phase 1: matrix 198 rows 82 cols
[2025-06-05 21:52:40] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10120 steps (2 resets) in 6 ms. (1445 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2025-06-05 21:52:40] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:52:40] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-05 21:52:40] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:52:41] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-06-05 21:52:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:52:41] [INFO ] [Real]Added 45 Read/Feed constraints in 10 ms returned sat
[2025-06-05 21:52:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 21:52:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 21:52:41] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:52:41] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-06-05 21:52:41] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:41] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:41] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:41] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:41] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 7 ms to minimize.
[2025-06-05 21:52:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2025-06-05 21:52:41] [INFO ] Computed and/alt/rep : 167/872/167 causal constraints (skipped 30 transitions) in 19 ms.
[2025-06-05 21:52:41] [INFO ] Added : 67 causal constraints over 14 iterations in 288 ms. Result :sat
Minimization took 73 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:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 214/214 transitions.
[2025-06-05 21:52:42] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 127=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2025-06-05 21:52:42] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000021 steps (2 resets) in 521 ms. (1915 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 810 ms. (1233 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2025-06-05 21:52:43] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:52:43] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-05 21:52:43] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:52:43] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-06-05 21:52:43] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:52:43] [INFO ] [Real]Added 45 Read/Feed constraints in 12 ms returned sat
[2025-06-05 21:52:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 21:52:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 21:52:43] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-05 21:52:43] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-06-05 21:52:43] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:43] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:43] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:44] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:44] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 7 ms to minimize.
[2025-06-05 21:52:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2025-06-05 21:52:44] [INFO ] Computed and/alt/rep : 167/872/167 causal constraints (skipped 30 transitions) in 20 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:44] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 2 ms to minimize.
[2025-06-05 21:52:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2025-06-05 21:52:44] [INFO ] Added : 40 causal constraints over 10 iterations in 275 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 21:52:44] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:52:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-05 21:52:44] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:52:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:52:44] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:52:44] [INFO ] Redundant transitions in 0 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 21:52:44] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:52:44] [INFO ] Invariant cache hit.
[2025-06-05 21:52:44] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 10102 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 213/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:52:59] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:02] [INFO ] Deduced a trap along path composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:06] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:06] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:06] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:07] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:08] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:10] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:11] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:11] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:15] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:21] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:21] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 363 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40192ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 40193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40672 ms. Remains : 82/82 places, 214/214 transitions.
[2025-06-05 21:53:25] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 127=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 127=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:[1] Max Struct:[+inf]
RANDOM walk for 40345 steps (8 resets) in 28 ms. (1391 steps per ms) remains 1/1 properties
[2025-06-05 21:53:25] [INFO ] Flatten gal took : 40 ms
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
[2025-06-05 21:53:25] [INFO ] Flatten gal took : 29 ms
[2025-06-05 21:53:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8332916210307862596.gal : 4 ms
[2025-06-05 21:53:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4591606821515240611.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/ReachabilityCardinality8332916210307862596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4591606821515240611.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/ReachabilityCardinality4591606821515240611.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15092
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15092 after 48245
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48245 after 114422
Interrupted probabilistic random walk after 999382 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :0 out of 1
Probabilistic random walk after 999382 steps, saw 635165 distinct states, run finished after 3001 ms. (steps per millisecond=333 ) properties seen :0
[2025-06-05 21:53:28] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:53:28] [INFO ] Invariant cache hit.
[2025-06-05 21:53:28] [INFO ] State equation strengthened by 45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/151 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/236 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/236 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/238 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/278 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/278 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/280 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 58/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/151 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/236 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/236 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/238 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/278 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/278 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/280 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:28] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 6 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/280 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 214/214 transitions.
RANDOM walk for 40184 steps (8 resets) in 33 ms. (1181 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114422 after 246647
Interrupted probabilistic random walk after 1078798 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :0 out of 1
Probabilistic random walk after 1078798 steps, saw 688684 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
[2025-06-05 21:53:31] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:53:31] [INFO ] Invariant cache hit.
[2025-06-05 21:53:31] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 58/151 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 85/236 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/236 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/238 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/238 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 40/278 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/278 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/280 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 76/86 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/88 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/91 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 58/151 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/151 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 85/236 variables, 14/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/236 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/236 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/236 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/238 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/238 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 40/278 variables, 32/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/278 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/278 variables, 11/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/278 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/280 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:32] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/280 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 137 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2025-06-05 21:53:32] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:53:32] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-05 21:53:32] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:53:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 21:53:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-06-05 21:53:32] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 21:53:32] [INFO ] Redundant transitions in 1 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-05 21:53:32] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2025-06-05 21:53:32] [INFO ] Invariant cache hit.
[2025-06-05 21:53:32] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 213 unsolved in 9932 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 198/280 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 213/348 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:46] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:50] [INFO ] Deduced a trap along path composed of 6 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:54] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:54] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:54] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:54] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:55] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 4 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :246647 after 510968
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:58] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:58] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:53:58] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:54:03] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:54:03] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:54:09] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 21:54:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 363 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40008ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 40010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40450 ms. Remains : 82/82 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 326 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 196
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 196
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 152
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 150
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 54 transition count 145
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 74 place count 54 transition count 140
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 79 place count 49 transition count 140
Applied a total of 79 rules in 36 ms. Remains 49 /82 variables (removed 33) and now considering 140/214 (removed 74) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 140 rows 49 cols
[2025-06-05 21:54:13] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:54:13] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-06-05 21:54:13] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-05 21:54:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2025-06-05 21:54:13] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-05 21:54:13] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:54:13] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-05 21:54:13] [INFO ] Flatten gal took : 15 ms
[2025-06-05 21:54:13] [INFO ] Flatten gal took : 14 ms
[2025-06-05 21:54:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11739965719981269759.gal : 2 ms
[2025-06-05 21:54:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9672785793268527210.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/ReachabilityCardinality11739965719981269759.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9672785793268527210.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
Loading property file /tmp/ReachabilityCardinality9672785793268527210.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 15608
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15608 after 48761
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :48761 after 114938
Detected timeout of ITS tools.
[2025-06-05 21:54:15] [INFO ] Flatten gal took : 16 ms
[2025-06-05 21:54:15] [INFO ] Applying decomposition
[2025-06-05 21:54:15] [INFO ] Flatten gal took : 25 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/graph9182735191730543141.txt' '-o' '/tmp/graph9182735191730543141.bin' '-w' '/tmp/graph9182735191730543141.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9182735191730543141.bin' '-l' '-1' '-v' '-w' '/tmp/graph9182735191730543141.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:54:15] [INFO ] Decomposing Gal with order
[2025-06-05 21:54:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:54:15] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-05 21:54:15] [INFO ] Flatten gal took : 37 ms
[2025-06-05 21:54:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 2 ms.
[2025-06-05 21:54:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17926923136915907971.gal : 4 ms
[2025-06-05 21:54:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality323913692090415482.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/ReachabilityCardinality17926923136915907971.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality323913692090415482.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality323913692090415482.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 129
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :129 after 5385
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5385 after 5385
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5385 after 12665
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :12665 after 33435
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :114938 after 247163
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :33435 after 112081
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :112081 after 343541
Detected timeout of ITS tools.
[2025-06-05 21:54:28] [INFO ] Flatten gal took : 14 ms
[2025-06-05 21:54:28] [INFO ] Applying decomposition
[2025-06-05 21:54:28] [INFO ] Flatten gal took : 9 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/graph12240144751209201037.txt' '-o' '/tmp/graph12240144751209201037.bin' '-w' '/tmp/graph12240144751209201037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12240144751209201037.bin' '-l' '-1' '-v' '-w' '/tmp/graph12240144751209201037.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:54:28] [INFO ] Decomposing Gal with order
[2025-06-05 21:54:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:54:28] [INFO ] Removed a total of 144 redundant transitions.
[2025-06-05 21:54:28] [INFO ] Flatten gal took : 18 ms
[2025-06-05 21:54:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 3 ms.
[2025-06-05 21:54:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12361247535738435308.gal : 2 ms
[2025-06-05 21:54:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2393277547411160447.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/ReachabilityCardinality12361247535738435308.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2393277547411160447.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2393277547411160447.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 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 1921
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1921 after 1.41034e+07
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.41034e+07 after 2.49735e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.49735e+09 after 4.03304e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :343541 after 1.37939e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :4.03304e+11 after 1.00408e+14
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30443 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m128-UpperBounds-12 in 122606 ms.
[2025-06-05 21:54:43] [INFO ] Flatten gal took : 14 ms
[2025-06-05 21:54:43] [INFO ] Applying decomposition
[2025-06-05 21:54:43] [INFO ] Flatten gal took : 17 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/graph14497406774666134148.txt' '-o' '/tmp/graph14497406774666134148.bin' '-w' '/tmp/graph14497406774666134148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14497406774666134148.bin' '-l' '-1' '-v' '-w' '/tmp/graph14497406774666134148.weights' '-q' '0' '-e' '0.001'
[2025-06-05 21:54:43] [INFO ] Decomposing Gal with order
[2025-06-05 21:54:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 21:54:43] [INFO ] Removed a total of 5 redundant transitions.
[2025-06-05 21:54:43] [INFO ] Flatten gal took : 21 ms
[2025-06-05 21:54:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2025-06-05 21:54:43] [INFO ] Time to serialize gal into /tmp/UpperBounds1214142664414676562.gal : 3 ms
[2025-06-05 21:54:43] [INFO ] Time to serialize properties into /tmp/UpperBounds6524327822213944848.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/UpperBounds1214142664414676562.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6524327822213944848.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds6524327822213944848.prop.
Detected timeout of ITS tools.
[2025-06-05 22:18:10] [INFO ] Flatten gal took : 128 ms
[2025-06-05 22:18:10] [INFO ] Time to serialize gal into /tmp/UpperBounds13336398173924757815.gal : 16 ms
[2025-06-05 22:18:10] [INFO ] Time to serialize properties into /tmp/UpperBounds2957477434226641028.prop : 4 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/UpperBounds13336398173924757815.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2957477434226641028.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 ...305
Loading property file /tmp/UpperBounds2957477434226641028.prop.
Detected timeout of ITS tools.
[2025-06-05 22:41:36] [INFO ] Flatten gal took : 13 ms
[2025-06-05 22:41:37] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-05 22:41:37] [INFO ] Transformed 82 places.
[2025-06-05 22:41:37] [INFO ] Transformed 214 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
[2025-06-05 22:41:37] [INFO ] Time to serialize gal into /tmp/UpperBounds5238654663844776424.gal : 1 ms
[2025-06-05 22:41:37] [INFO ] Time to serialize properties into /tmp/UpperBounds4095053057149916594.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/UpperBounds5238654663844776424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4095053057149916594.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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4095053057149916594.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-q3m128"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m128, 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 r016-smll-174853765300533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m128.tgz
mv BugTracking-PT-q3m128 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 '
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 ;