Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r016-smll-174853765300525.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-q3m064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r016-smll-174853765300525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q3m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749151572963

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-q3m064
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-05 19:26:15] [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 19:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 19:26:16] [INFO ] Load time of PNML (sax parser for PT used): 1502 ms
[2025-06-05 19:26:16] [INFO ] Transformed 754 places.
[2025-06-05 19:26:16] [INFO ] Transformed 27370 transitions.
[2025-06-05 19:26:16] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1877 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 514 places in 203 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 19:26:17] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2025-06-05 19:26:17] [INFO ] Computed 10 invariants in 82 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, +inf, 1, +inf, +inf, +inf, +inf]
RANDOM walk for 10041 steps (4 resets) in 190 ms. (52 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 414 ms. (168 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1, 157, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 19:26:18] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2025-06-05 19:26:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:18] [INFO ] [Real]Absence check using 10 positive place invariants in 21 ms returned sat
[2025-06-05 19:26:19] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2025-06-05 19:26:20] [INFO ] State equation strengthened by 255 read => feed constraints.
[2025-06-05 19:26:20] [INFO ] [Real]Added 255 Read/Feed constraints in 101 ms returned sat
[2025-06-05 19:26:20] [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 19:26:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 19:26:21] [INFO ] [Nat]Absence check using state equation in 877 ms returned sat
[2025-06-05 19:26:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 266 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:22] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 23 ms to minimize.
[2025-06-05 19:26:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 527 ms
[2025-06-05 19:26:22] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 573 ms.
[2025-06-05 19:26:23] [INFO ] Added : 13 causal constraints over 3 iterations in 1787 ms. Result :sat
Minimization took 954 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:24] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 19:26:25] [INFO ] [Real]Absence check using state equation in 846 ms returned sat
[2025-06-05 19:26:25] [INFO ] [Real]Added 255 Read/Feed constraints in 54 ms returned sat
[2025-06-05 19:26:26] [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 19:26:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 19:26:26] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2025-06-05 19:26:26] [INFO ] [Nat]Added 255 Read/Feed constraints in 131 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:27] [INFO ] Deduced a trap composed of 17 places in 1068 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:29] [INFO ] Deduced a trap composed of 12 places in 1106 ms of which 37 ms to minimize.
[2025-06-05 19:26:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2680 ms
[2025-06-05 19:26:29] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 390 ms.
[2025-06-05 19:26:30] [INFO ] Added : 6 causal constraints over 2 iterations in 1133 ms. Result :sat
Minimization took 327 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:31] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 19:26:31] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2025-06-05 19:26:32] [INFO ] [Real]Added 255 Read/Feed constraints in 90 ms returned sat
[2025-06-05 19:26:32] [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 19:26:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 19:26:33] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2025-06-05 19:26:33] [INFO ] [Nat]Added 255 Read/Feed constraints in 106 ms returned sat
[2025-06-05 19:26:33] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 354 ms.
[2025-06-05 19:26:34] [INFO ] Added : 2 causal constraints over 1 iterations in 856 ms. Result :sat
Minimization took 889 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:35] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-05 19:26:36] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2025-06-05 19:26:36] [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 19:26:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 19:26:36] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2025-06-05 19:26:37] [INFO ] [Nat]Added 255 Read/Feed constraints in 231 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:37] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 18 ms to minimize.
[2025-06-05 19:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 574 ms
[2025-06-05 19:26:38] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 275 ms.
[2025-06-05 19:26:38] [INFO ] Added : 5 causal constraints over 1 iterations in 704 ms. Result :sat
Minimization took 799 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:39] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 19:26:40] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2025-06-05 19:26:40] [INFO ] [Real]Added 255 Read/Feed constraints in 78 ms returned sat
[2025-06-05 19:26:40] [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 19:26:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 19:26:41] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2025-06-05 19:26:41] [INFO ] [Nat]Added 255 Read/Feed constraints in 155 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:41] [INFO ] Deduced a trap composed of 12 places in 388 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:42] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 13 ms to minimize.
[2025-06-05 19:26:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1039 ms
[2025-06-05 19:26:42] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 252 ms.
[2025-06-05 19:26:43] [INFO ] Added : 6 causal constraints over 2 iterations in 760 ms. Result :sat
Minimization took 841 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:44] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-05 19:26:44] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2025-06-05 19:26:44] [INFO ] [Real]Added 255 Read/Feed constraints in 88 ms returned sat
[2025-06-05 19:26:45] [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 19:26:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-06-05 19:26:45] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2025-06-05 19:26:46] [INFO ] [Nat]Added 255 Read/Feed constraints in 124 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:46] [INFO ] Deduced a trap composed of 13 places in 913 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:26:47] [INFO ] Deduced a trap composed of 17 places in 798 ms of which 18 ms to minimize.
[2025-06-05 19:26:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1969 ms
[2025-06-05 19:26:48] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 220 ms.
[2025-06-05 19:26:48] [INFO ] Added : 4 causal constraints over 1 iterations in 518 ms. Result :sat
Minimization took 753 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-05 19:26:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-06-05 19:26:49] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2025-06-05 19:26:50] [INFO ] [Real]Added 255 Read/Feed constraints in 62 ms returned sat
[2025-06-05 19:26:50] [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 19:26:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-06-05 19:26:51] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2025-06-05 19:26:51] [INFO ] [Nat]Added 255 Read/Feed constraints in 230 ms returned sat
[2025-06-05 19:26:51] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 310 ms.
[2025-06-05 19:26:52] [INFO ] Added : 4 causal constraints over 1 iterations in 837 ms. Result :sat
Minimization took 853 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1, 157, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1, 157, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
Support contains 7 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.21 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 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 236 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 11 place count 236 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 17 place count 230 transition count 2747
Applied a total of 17 rules in 488 ms. Remains 230 /240 variables (removed 10) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 230/240 places, 2747/2769 transitions.
[2025-06-05 19:26:53] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 1723=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 1723=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 7) seen :[0, 0, 0, 2147483647, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 1, +inf, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
[2025-06-05 19:26:55] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2025-06-05 19:26:55] [INFO ] Computed 8 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, +inf, 0, 0, 0] Max Struct:[1, 1, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000011 steps (2 resets) in 1630 ms. (613 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-08 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m064-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000004 steps (10 resets) in 17051 ms. (293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-06-05 19:27:14] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:27:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:27:14] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-06-05 19:27:15] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2025-06-05 19:27:15] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-06-05 19:27:15] [INFO ] [Real]Added 240 Read/Feed constraints in 84 ms returned sat
[2025-06-05 19:27:15] [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 19:27:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 19:27:16] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2025-06-05 19:27:16] [INFO ] [Nat]Added 240 Read/Feed constraints in 118 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:17] [INFO ] Deduced a trap composed of 15 places in 584 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:17] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 11 ms to minimize.
[2025-06-05 19:27:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1181 ms
[2025-06-05 19:27:18] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 325 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:19] [INFO ] Deduced a trap composed of 5 places in 782 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:20] [INFO ] Deduced a trap composed of 43 places in 766 ms of which 51 ms to minimize.
[2025-06-05 19:27:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2029 ms
[2025-06-05 19:27:20] [INFO ] Added : 9 causal constraints over 2 iterations in 3195 ms. Result :sat
Minimization took 2344 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:27:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:27:24] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2025-06-05 19:27:24] [INFO ] [Real]Added 240 Read/Feed constraints in 87 ms returned sat
[2025-06-05 19:27:24] [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 19:27:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:27:25] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2025-06-05 19:27:25] [INFO ] [Nat]Added 240 Read/Feed constraints in 90 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:26] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 20 ms to minimize.
[2025-06-05 19:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 626 ms
[2025-06-05 19:27:26] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 227 ms.
[2025-06-05 19:27:26] [INFO ] Added : 2 causal constraints over 1 iterations in 533 ms. Result :sat
Minimization took 2402 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:27:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:27:30] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2025-06-05 19:27:30] [INFO ] [Real]Added 240 Read/Feed constraints in 81 ms returned sat
[2025-06-05 19:27:30] [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 19:27:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 19:27:31] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2025-06-05 19:27:31] [INFO ] [Nat]Added 240 Read/Feed constraints in 308 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:32] [INFO ] Deduced a trap composed of 7 places in 644 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:33] [INFO ] Deduced a trap composed of 12 places in 656 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:33] [INFO ] Deduced a trap composed of 10 places in 635 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:34] [INFO ] Deduced a trap composed of 24 places in 511 ms of which 25 ms to minimize.
[2025-06-05 19:27:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2984 ms
[2025-06-05 19:27:35] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 362 ms.
[2025-06-05 19:27:35] [INFO ] Added : 4 causal constraints over 2 iterations in 1053 ms. Result :sat
Minimization took 2414 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:27:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:27:38] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2025-06-05 19:27:39] [INFO ] [Real]Added 240 Read/Feed constraints in 81 ms returned sat
[2025-06-05 19:27:39] [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 19:27:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-06-05 19:27:40] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2025-06-05 19:27:40] [INFO ] [Nat]Added 240 Read/Feed constraints in 175 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:41] [INFO ] Deduced a trap composed of 19 places in 743 ms of which 21 ms to minimize.
[2025-06-05 19:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 906 ms
[2025-06-05 19:27:41] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 218 ms.
[2025-06-05 19:27:42] [INFO ] Added : 2 causal constraints over 1 iterations in 678 ms. Result :sat
Minimization took 2268 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:27:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:27:45] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2025-06-05 19:27:45] [INFO ] [Real]Added 240 Read/Feed constraints in 54 ms returned sat
[2025-06-05 19:27:45] [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 19:27:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:27:45] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2025-06-05 19:27:46] [INFO ] [Nat]Added 240 Read/Feed constraints in 140 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:46] [INFO ] Deduced a trap composed of 15 places in 682 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:47] [INFO ] Deduced a trap composed of 19 places in 634 ms of which 28 ms to minimize.
[2025-06-05 19:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1562 ms
[2025-06-05 19:27:48] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 349 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:49] [INFO ] Deduced a trap composed of 5 places in 899 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:27:50] [INFO ] Deduced a trap composed of 43 places in 812 ms of which 35 ms to minimize.
[2025-06-05 19:27:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2149 ms
[2025-06-05 19:27:50] [INFO ] Added : 5 causal constraints over 2 iterations in 3172 ms. Result :sat
Minimization took 2225 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 95 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 230/230 places, 2747/2747 transitions.
[2025-06-05 19:27:54] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {3=1, 1723=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 1723=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-06-05 19:27:55] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:27:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
RANDOM walk for 1000059 steps (2 resets) in 1662 ms. (601 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 17326 ms. (288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-06-05 19:28:14] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:28:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:28:14] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:28:15] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2025-06-05 19:28:15] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-06-05 19:28:15] [INFO ] [Real]Added 240 Read/Feed constraints in 50 ms returned sat
[2025-06-05 19:28:15] [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 19:28:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:28:16] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2025-06-05 19:28:16] [INFO ] [Nat]Added 240 Read/Feed constraints in 119 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:17] [INFO ] Deduced a trap composed of 15 places in 577 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:18] [INFO ] Deduced a trap composed of 19 places in 542 ms of which 18 ms to minimize.
[2025-06-05 19:28:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1396 ms
[2025-06-05 19:28:18] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 350 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:20] [INFO ] Deduced a trap composed of 5 places in 763 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:20] [INFO ] Deduced a trap composed of 43 places in 507 ms of which 53 ms to minimize.
[2025-06-05 19:28:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1691 ms
[2025-06-05 19:28:21] [INFO ] Added : 9 causal constraints over 2 iterations in 2858 ms. Result :sat
Minimization took 2372 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:28:23] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:28:24] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2025-06-05 19:28:24] [INFO ] [Real]Added 240 Read/Feed constraints in 79 ms returned sat
[2025-06-05 19:28:24] [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 19:28:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:28:25] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2025-06-05 19:28:25] [INFO ] [Nat]Added 240 Read/Feed constraints in 68 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:26] [INFO ] Deduced a trap composed of 11 places in 519 ms of which 24 ms to minimize.
[2025-06-05 19:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2025-06-05 19:28:26] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 369 ms.
[2025-06-05 19:28:27] [INFO ] Added : 2 causal constraints over 1 iterations in 844 ms. Result :sat
Minimization took 2300 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:28:29] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:28:30] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2025-06-05 19:28:30] [INFO ] [Real]Added 240 Read/Feed constraints in 52 ms returned sat
[2025-06-05 19:28:30] [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 19:28:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:28:31] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2025-06-05 19:28:31] [INFO ] [Nat]Added 240 Read/Feed constraints in 294 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:32] [INFO ] Deduced a trap composed of 7 places in 713 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:33] [INFO ] Deduced a trap composed of 12 places in 635 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:34] [INFO ] Deduced a trap composed of 10 places in 635 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:34] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 14 ms to minimize.
[2025-06-05 19:28:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2797 ms
[2025-06-05 19:28:35] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 349 ms.
[2025-06-05 19:28:35] [INFO ] Added : 4 causal constraints over 2 iterations in 1007 ms. Result :sat
Minimization took 2463 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:28:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:28:38] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2025-06-05 19:28:39] [INFO ] [Real]Added 240 Read/Feed constraints in 58 ms returned sat
[2025-06-05 19:28:39] [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 19:28:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:28:39] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2025-06-05 19:28:39] [INFO ] [Nat]Added 240 Read/Feed constraints in 135 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:40] [INFO ] Deduced a trap composed of 19 places in 542 ms of which 22 ms to minimize.
[2025-06-05 19:28:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 710 ms
[2025-06-05 19:28:41] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 367 ms.
[2025-06-05 19:28:41] [INFO ] Added : 2 causal constraints over 1 iterations in 870 ms. Result :sat
Minimization took 2295 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:28:44] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:28:44] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2025-06-05 19:28:44] [INFO ] [Real]Added 240 Read/Feed constraints in 57 ms returned sat
[2025-06-05 19:28:44] [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 19:28:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:28:45] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2025-06-05 19:28:45] [INFO ] [Nat]Added 240 Read/Feed constraints in 143 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:46] [INFO ] Deduced a trap composed of 15 places in 810 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:47] [INFO ] Deduced a trap composed of 19 places in 529 ms of which 23 ms to minimize.
[2025-06-05 19:28:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1551 ms
[2025-06-05 19:28:47] [INFO ] Computed and/alt/rep : 344/1318/344 causal constraints (skipped 2274 transitions) in 222 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:48] [INFO ] Deduced a trap composed of 5 places in 734 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:28:49] [INFO ] Deduced a trap composed of 43 places in 713 ms of which 34 ms to minimize.
[2025-06-05 19:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1783 ms
[2025-06-05 19:28:49] [INFO ] Added : 5 causal constraints over 2 iterations in 2623 ms. Result :sat
Minimization took 2260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 83 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 230/230 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 230/230 places, 2747/2747 transitions.
Applied a total of 0 rules in 81 ms. Remains 230 /230 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2025-06-05 19:28:52] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:28:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:28:53] [INFO ] Implicit Places using invariants in 844 ms returned []
[2025-06-05 19:28:53] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:28:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:28:54] [INFO ] State equation strengthened by 240 read => feed constraints.
[2025-06-05 19:28:58] [INFO ] Implicit Places using invariants and state equation in 5028 ms returned []
Implicit Place search using SMT with State Equation took 5878 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:28:59] [INFO ] Redundant transitions in 621 ms returned []
Running 2746 sub problems to find dead transitions.
[2025-06-05 19:28:59] [INFO ] Flow matrix only has 2619 transitions (discarded 128 similar events)
[2025-06-05 19:28:59] [INFO ] Invariant cache hit.
[2025-06-05 19:28:59] [INFO ] State equation strengthened by 240 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/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2849 variables, and 8 constraints, problems are : Problem set: 0 solved, 2746 unsolved in 30170 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 2746/1184 constraints, Known Traps: 0/0 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/230 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 19:29:51] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:51] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 6 ms to minimize.
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:54] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 10 ms to minimize.
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
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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:54] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:54] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 12 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
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:56] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 15 ms to minimize.
Problem TDEAD1751 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 TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:57] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 16 ms to minimize.
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1779 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1787 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1799 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:57] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 16 ms to minimize.
Problem TDEAD1800 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:58] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 13 ms to minimize.
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:29:58] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 12 ms to minimize.
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2849 variables, and 18 constraints, problems are : Problem set: 484 solved, 2262 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/240 constraints, PredecessorRefiner: 1562/1184 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67472ms problems are : Problem set: 484 solved, 2262 unsolved
Search for dead transitions found 484 dead transitions in 67554ms
Found 484 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 484 transitions
Dead transitions reduction (with SMT) removed 484 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2263/2747 transitions.
Graph (complete) has 2816 edges and 230 vertex of which 222 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 28 places and 592 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 194 transition count 1671
Reduce places removed 14 places and 264 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 43 place count 180 transition count 1407
Reduce places removed 8 places and 100 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 51 place count 172 transition count 1307
Reduce places removed 5 places and 71 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 56 place count 167 transition count 1236
Reduce places removed 3 places and 23 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 59 place count 164 transition count 1213
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 70 place count 153 transition count 1170
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 9 places and 144 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 90 place count 144 transition count 1026
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 137 transition count 963
Deduced a syphon composed of 1 places in 2 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 137 transition count 963
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 104 rules in 120 ms. Remains 137 /230 variables (removed 93) and now considering 963/2263 (removed 1300) transitions.
[2025-06-05 19:30:07] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
// Phase 1: matrix 889 rows 137 cols
[2025-06-05 19:30:07] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:30:07] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-06-05 19:30:07] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:30:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 19:30:08] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 137/230 places, 963/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75860 ms. Remains : 137/230 places, 963/2747 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 19:30:08] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 477=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 477=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
[2025-06-05 19:30:09] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
// Phase 1: matrix 889 rows 136 cols
[2025-06-05 19:30:09] [INFO ] Computed 7 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0] Max Struct:[1, +inf, +inf, +inf, +inf]
RANDOM walk for 1000019 steps (2 resets) in 1026 ms. (973 steps per ms)
FORMULA BugTracking-PT-q3m064-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000001 steps (6 resets) in 5773 ms. (519 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:30:16] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:16] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:16] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2025-06-05 19:30:16] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 19:30:16] [INFO ] [Real]Added 111 Read/Feed constraints in 36 ms returned sat
[2025-06-05 19:30:16] [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 19:30:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:17] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2025-06-05 19:30:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 101 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:17] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 5 ms to minimize.
[2025-06-05 19:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2025-06-05 19:30:17] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 99 ms.
[2025-06-05 19:30:17] [INFO ] Added : 8 causal constraints over 2 iterations in 283 ms. Result :sat
Minimization took 495 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:18] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:18] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-05 19:30:18] [INFO ] [Real]Added 111 Read/Feed constraints in 37 ms returned sat
[2025-06-05 19:30:18] [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 19:30:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-06-05 19:30:19] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2025-06-05 19:30:19] [INFO ] [Nat]Added 111 Read/Feed constraints in 72 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:19] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 19 ms to minimize.
[2025-06-05 19:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2025-06-05 19:30:19] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 117 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:20] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:20] [INFO ] Deduced a trap composed of 11 places in 327 ms of which 13 ms to minimize.
[2025-06-05 19:30:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 904 ms
[2025-06-05 19:30:21] [INFO ] Added : 14 causal constraints over 5 iterations in 1500 ms. Result :sat
Minimization took 587 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:21] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:22] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2025-06-05 19:30:22] [INFO ] [Real]Added 111 Read/Feed constraints in 42 ms returned sat
[2025-06-05 19:30:22] [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 19:30:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-05 19:30:22] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2025-06-05 19:30:22] [INFO ] [Nat]Added 111 Read/Feed constraints in 71 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:23] [INFO ] Deduced a trap composed of 25 places in 313 ms of which 19 ms to minimize.
[2025-06-05 19:30:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2025-06-05 19:30:23] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 116 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:23] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:24] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:24] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 14 ms to minimize.
[2025-06-05 19:30:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1362 ms
[2025-06-05 19:30:24] [INFO ] Added : 6 causal constraints over 3 iterations in 1813 ms. Result :sat
Minimization took 525 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 24 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 136/136 places, 963/963 transitions.
[2025-06-05 19:30:25] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 477=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 477=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:30:26] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000053 steps (2 resets) in 1221 ms. (818 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 6009 ms. (499 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:30:33] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:33] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 19:30:34] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2025-06-05 19:30:34] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 19:30:34] [INFO ] [Real]Added 111 Read/Feed constraints in 24 ms returned sat
[2025-06-05 19:30:34] [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 19:30:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-05 19:30:34] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2025-06-05 19:30:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 68 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:34] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 6 ms to minimize.
[2025-06-05 19:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2025-06-05 19:30:34] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 108 ms.
[2025-06-05 19:30:34] [INFO ] Added : 8 causal constraints over 2 iterations in 344 ms. Result :sat
Minimization took 503 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:35] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:35] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2025-06-05 19:30:36] [INFO ] [Real]Added 111 Read/Feed constraints in 35 ms returned sat
[2025-06-05 19:30:36] [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 19:30:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:36] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-06-05 19:30:36] [INFO ] [Nat]Added 111 Read/Feed constraints in 70 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:36] [INFO ] Deduced a trap composed of 25 places in 285 ms of which 20 ms to minimize.
[2025-06-05 19:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2025-06-05 19:30:36] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 109 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:37] [INFO ] Deduced a trap composed of 10 places in 379 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:38] [INFO ] Deduced a trap composed of 11 places in 313 ms of which 13 ms to minimize.
[2025-06-05 19:30:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 865 ms
[2025-06-05 19:30:38] [INFO ] Added : 14 causal constraints over 5 iterations in 1454 ms. Result :sat
Minimization took 555 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:30:39] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-06-05 19:30:39] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2025-06-05 19:30:39] [INFO ] [Real]Added 111 Read/Feed constraints in 42 ms returned sat
[2025-06-05 19:30:39] [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 19:30:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-05 19:30:39] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2025-06-05 19:30:39] [INFO ] [Nat]Added 111 Read/Feed constraints in 77 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:40] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 19 ms to minimize.
[2025-06-05 19:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 379 ms
[2025-06-05 19:30:40] [INFO ] Computed and/alt/rep : 198/678/197 causal constraints (skipped 691 transitions) in 111 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:41] [INFO ] Deduced a trap composed of 5 places in 370 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:41] [INFO ] Deduced a trap composed of 11 places in 360 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:41] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 14 ms to minimize.
[2025-06-05 19:30:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1292 ms
[2025-06-05 19:30:42] [INFO ] Added : 6 causal constraints over 3 iterations in 1735 ms. Result :sat
Minimization took 512 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 136/136 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 963/963 transitions.
Applied a total of 0 rules in 21 ms. Remains 136 /136 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2025-06-05 19:30:42] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:30:43] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 19:30:43] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:30:43] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-05 19:30:44] [INFO ] Implicit Places using invariants and state equation in 851 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:30:44] [INFO ] Redundant transitions in 41 ms returned []
Running 962 sub problems to find dead transitions.
[2025-06-05 19:30:44] [INFO ] Flow matrix only has 889 transitions (discarded 74 similar events)
[2025-06-05 19:30:44] [INFO ] Invariant cache hit.
[2025-06-05 19:30:44] [INFO ] State equation strengthened by 111 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:54] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:55] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:30:58] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 3 ms to minimize.
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD948 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 3/10 constraints. Problems are: Problem set: 19 solved, 943 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 943 unsolved
Problem TDEAD528 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 889/1025 variables, 136/146 constraints. Problems are: Problem set: 20 solved, 942 unsolved
SMT process timed out in 31610ms, After SMT, problems are : Problem set: 20 solved, 942 unsolved
Search for dead transitions found 20 dead transitions in 31616ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/136 places, 943/963 transitions.
Reduce places removed 2 places and 38 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 905
Reduce places removed 1 places and 15 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 133 transition count 890
Reduce places removed 2 places and 29 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 131 transition count 861
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 130 transition count 843
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 7 place count 129 transition count 825
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 96 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 15 place count 122 transition count 729
Applied a total of 15 rules in 44 ms. Remains 122 /136 variables (removed 14) and now considering 729/943 (removed 214) transitions.
[2025-06-05 19:31:15] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
// Phase 1: matrix 665 rows 122 cols
[2025-06-05 19:31:15] [INFO ] Computed 8 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:31:16] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-06-05 19:31:16] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:31:16] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-05 19:31:17] [INFO ] Implicit Places using invariants and state equation in 938 ms returned []
Implicit Place search using SMT with State Equation took 1241 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/136 places, 729/963 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34191 ms. Remains : 122/136 places, 729/963 transitions.
[2025-06-05 19:31:17] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {6=1, 366=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {6=1, 366=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:31:17] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000014 steps (2 resets) in 974 ms. (1025 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 4208 ms. (712 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:31:22] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:31:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:31:23] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2025-06-05 19:31:23] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-05 19:31:23] [INFO ] [Real]Added 87 Read/Feed constraints in 16 ms returned sat
[2025-06-05 19:31:23] [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 19:31:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 19:31:23] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2025-06-05 19:31:23] [INFO ] [Nat]Added 87 Read/Feed constraints in 31 ms returned sat
[2025-06-05 19:31:23] [INFO ] Computed and/alt/rep : 178/538/177 causal constraints (skipped 487 transitions) in 71 ms.
[2025-06-05 19:31:23] [INFO ] Added : 2 causal constraints over 1 iterations in 183 ms. Result :sat
Minimization took 399 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:31:24] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:31:24] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-05 19:31:24] [INFO ] [Real]Added 87 Read/Feed constraints in 25 ms returned sat
[2025-06-05 19:31:24] [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 19:31:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:31:24] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2025-06-05 19:31:24] [INFO ] [Nat]Added 87 Read/Feed constraints in 42 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:25] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 10 ms to minimize.
[2025-06-05 19:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2025-06-05 19:31:25] [INFO ] Computed and/alt/rep : 178/538/177 causal constraints (skipped 487 transitions) in 81 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:25] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:25] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:26] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 11 ms to minimize.
[2025-06-05 19:31:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 879 ms
[2025-06-05 19:31:26] [INFO ] Added : 7 causal constraints over 2 iterations in 1191 ms. Result :sat
Minimization took 471 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:31:26] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:31:27] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2025-06-05 19:31:27] [INFO ] [Real]Added 87 Read/Feed constraints in 22 ms returned sat
[2025-06-05 19:31:27] [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 19:31:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:31:27] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2025-06-05 19:31:27] [INFO ] [Nat]Added 87 Read/Feed constraints in 58 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:27] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 17 ms to minimize.
[2025-06-05 19:31:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2025-06-05 19:31:27] [INFO ] Computed and/alt/rep : 178/538/177 causal constraints (skipped 487 transitions) in 80 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:28] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:28] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 16 ms to minimize.
[2025-06-05 19:31:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 706 ms
[2025-06-05 19:31:29] [INFO ] Added : 11 causal constraints over 5 iterations in 1193 ms. Result :sat
Minimization took 426 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 122 /122 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 122/122 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 122 /122 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2025-06-05 19:31:29] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:31:30] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-05 19:31:30] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:31:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-06-05 19:31:30] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:31:31] [INFO ] Redundant transitions in 28 ms returned []
Running 728 sub problems to find dead transitions.
[2025-06-05 19:31:31] [INFO ] Flow matrix only has 665 transitions (discarded 64 similar events)
[2025-06-05 19:31:31] [INFO ] Invariant cache hit.
[2025-06-05 19:31:31] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 728 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:31:35] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 4 ms to minimize.
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 3 (OVERLAPS) 665/787 variables, 122/131 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 87/218 constraints. Problems are: Problem set: 4 solved, 724 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 787/787 variables, and 218 constraints, problems are : Problem set: 4 solved, 724 unsolved in 30167 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 728/728 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 724 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 8/8 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 3 (OVERLAPS) 665/787 variables, 122/131 constraints. Problems are: Problem set: 4 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/787 variables, 87/218 constraints. Problems are: Problem set: 4 solved, 724 unsolved
Problem TDEAD105 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/787 variables, 724/942 constraints. Problems are: Problem set: 5 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 787/787 variables, and 942 constraints, problems are : Problem set: 5 solved, 723 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 122/122 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 724/728 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61266ms problems are : Problem set: 5 solved, 723 unsolved
Search for dead transitions found 5 dead transitions in 61271ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 724/729 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 120 transition count 710
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 120 transition count 710
Applied a total of 4 rules in 14 ms. Remains 120 /122 variables (removed 2) and now considering 710/724 (removed 14) transitions.
[2025-06-05 19:32:32] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
// Phase 1: matrix 649 rows 120 cols
[2025-06-05 19:32:32] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:32:32] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-06-05 19:32:32] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:32:32] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 19:32:33] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 120/122 places, 710/729 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64201 ms. Remains : 120/122 places, 710/729 transitions.
[2025-06-05 19:32:33] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {7=1, 353=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {2=1, 353=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :[0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:32:34] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
RANDOM walk for 1000029 steps (2 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 4191 ms. (715 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
[2025-06-05 19:32:39] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:32:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-05 19:32:39] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-05 19:32:39] [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 19:32:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:32:40] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-06-05 19:32:40] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 19:32:40] [INFO ] [Nat]Added 86 Read/Feed constraints in 39 ms returned sat
[2025-06-05 19:32:40] [INFO ] Computed and/alt/rep : 179/627/178 causal constraints (skipped 470 transitions) in 79 ms.
[2025-06-05 19:32:40] [INFO ] Added : 4 causal constraints over 2 iterations in 254 ms. Result :sat
Minimization took 451 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:32:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:32:41] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2025-06-05 19:32:41] [INFO ] [Real]Added 86 Read/Feed constraints in 27 ms returned sat
[2025-06-05 19:32:41] [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 19:32:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-06-05 19:32:41] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2025-06-05 19:32:41] [INFO ] [Nat]Added 86 Read/Feed constraints in 49 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:42] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:42] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 15 ms to minimize.
[2025-06-05 19:32:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 573 ms
[2025-06-05 19:32:42] [INFO ] Computed and/alt/rep : 179/627/178 causal constraints (skipped 470 transitions) in 67 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:42] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:43] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:43] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 12 ms to minimize.
[2025-06-05 19:32:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 965 ms
[2025-06-05 19:32:43] [INFO ] Added : 15 causal constraints over 5 iterations in 1399 ms. Result :sat
Minimization took 457 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-05 19:32:44] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-05 19:32:44] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2025-06-05 19:32:44] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2025-06-05 19:32:44] [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 19:32:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-06-05 19:32:44] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2025-06-05 19:32:44] [INFO ] [Nat]Added 86 Read/Feed constraints in 54 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:45] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:32:45] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 10 ms to minimize.
[2025-06-05 19:32:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 524 ms
[2025-06-05 19:32:45] [INFO ] Computed and/alt/rep : 179/627/178 causal constraints (skipped 470 transitions) in 70 ms.
[2025-06-05 19:32:45] [INFO ] Added : 6 causal constraints over 2 iterations in 234 ms. Result :sat
Minimization took 406 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 710/710 transitions.
Applied a total of 0 rules in 13 ms. Remains 120 /120 variables (removed 0) and now considering 710/710 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 120/120 places, 710/710 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 710/710 transitions.
Applied a total of 0 rules in 14 ms. Remains 120 /120 variables (removed 0) and now considering 710/710 (removed 0) transitions.
[2025-06-05 19:32:46] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:32:46] [INFO ] Implicit Places using invariants in 255 ms returned []
[2025-06-05 19:32:46] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:32:46] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-06-05 19:32:48] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 19:32:48] [INFO ] Redundant transitions in 9 ms returned []
Running 709 sub problems to find dead transitions.
[2025-06-05 19:32:48] [INFO ] Flow matrix only has 649 transitions (discarded 61 similar events)
[2025-06-05 19:32:48] [INFO ] Invariant cache hit.
[2025-06-05 19:32:48] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (OVERLAPS) 649/769 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 709 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/769 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/769 variables, and 214 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 120/120 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (OVERLAPS) 649/769 variables, 120/128 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/769 variables, 86/214 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Problem TDEAD254 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 TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 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 TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD305 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 TDEAD376 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD704 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/769 variables, 709/923 constraints. Problems are: Problem set: 75 solved, 634 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 19:33:49] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 5 ms to minimize.
SMT process timed out in 60937ms, After SMT, problems are : Problem set: 75 solved, 634 unsolved
Search for dead transitions found 75 dead transitions in 60941ms
Found 75 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 75 transitions
Dead transitions reduction (with SMT) removed 75 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 120/120 places, 635/710 transitions.
Reduce places removed 11 places and 181 transitions.
Graph (complete) has 701 edges and 109 vertex of which 3 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.0 ms
Discarding 106 places :
Also discarding 454 output transitions
Drop transitions (Output transitions of discarded places.) removed 454 transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 3 transition count 0
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 12 rules in 4 ms. Remains 3 /120 variables (removed 117) and now considering 0/635 (removed 635) transitions.
[2025-06-05 19:33:49] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:33:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-05 19:33:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 19:33:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 3/120 places, 0/710 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62703 ms. Remains : 3/120 places, 0/710 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 454002 ms.

BK_STOP 1749152029162

--------------------
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-q3m064"
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-q3m064, 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-174853765300525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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