About the Execution of ITS-Tools for Medical-PT-24
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | 0 0 0 0 0 0 0 1 0 0 0 ? 0 0 0 1 | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876523900093.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 Medical-PT-24, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876523900093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M 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 Medical-PT-24-UpperBounds-00
FORMULA_NAME Medical-PT-24-UpperBounds-01
FORMULA_NAME Medical-PT-24-UpperBounds-02
FORMULA_NAME Medical-PT-24-UpperBounds-03
FORMULA_NAME Medical-PT-24-UpperBounds-04
FORMULA_NAME Medical-PT-24-UpperBounds-05
FORMULA_NAME Medical-PT-24-UpperBounds-06
FORMULA_NAME Medical-PT-24-UpperBounds-07
FORMULA_NAME Medical-PT-24-UpperBounds-08
FORMULA_NAME Medical-PT-24-UpperBounds-09
FORMULA_NAME Medical-PT-24-UpperBounds-10
FORMULA_NAME Medical-PT-24-UpperBounds-11
FORMULA_NAME Medical-PT-24-UpperBounds-12
FORMULA_NAME Medical-PT-24-UpperBounds-13
FORMULA_NAME Medical-PT-24-UpperBounds-14
FORMULA_NAME Medical-PT-24-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748837198488
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 04:06:40] [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-02 04:06:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 04:06:41] [INFO ] Load time of PNML (sax parser for PT used): 822 ms
[2025-06-02 04:06:41] [INFO ] Transformed 312 places.
[2025-06-02 04:06:41] [INFO ] Transformed 5431 transitions.
[2025-06-02 04:06:41] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1033 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 242 places in 51 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2025-06-02 04:06:42] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 69 cols
[2025-06-02 04:06:42] [INFO ] Computed 10 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, 1]
RANDOM walk for 10005 steps (32 resets) in 50 ms. (196 steps per ms)
FORMULA Medical-PT-24-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Medical-PT-24-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (21 resets) in 70 ms. (422 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:06:42] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-02 04:06:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:06:42] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-06-02 04:06:42] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2025-06-02 04:06:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-02 04:06:42] [INFO ] [Real]Added 56 Read/Feed constraints in 28 ms returned sat
[2025-06-02 04:06:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:06:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-06-02 04:06:42] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-02 04:06:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:43] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 7 ms to minimize.
[2025-06-02 04:06:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 907 ms
[2025-06-02 04:06:43] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 26 ms.
[2025-06-02 04:06:44] [INFO ] Added : 59 causal constraints over 13 iterations in 289 ms. Result :sat
Minimization took 89 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:06:44] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 04:06:44] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2025-06-02 04:06:44] [INFO ] [Real]Added 56 Read/Feed constraints in 19 ms returned sat
[2025-06-02 04:06:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:06:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 04:06:44] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2025-06-02 04:06:44] [INFO ] [Nat]Added 56 Read/Feed constraints in 22 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:44] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:44] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:44] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:45] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:45] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:45] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 9 ms to minimize.
[2025-06-02 04:06:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 658 ms
[2025-06-02 04:06:45] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 21 ms.
[2025-06-02 04:06:45] [INFO ] Added : 54 causal constraints over 12 iterations in 241 ms. Result :sat
Minimization took 72 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:06:45] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 04:06:45] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-06-02 04:06:45] [INFO ] [Real]Added 56 Read/Feed constraints in 13 ms returned sat
[2025-06-02 04:06: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-02 04:06:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-06-02 04:06:45] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-06-02 04:06:45] [INFO ] [Nat]Added 56 Read/Feed constraints in 15 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:45] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:46] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:46] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:46] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 8 ms to minimize.
[2025-06-02 04:06:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2025-06-02 04:06:46] [INFO ] Computed and/alt/rep : 122/716/121 causal constraints (skipped 56 transitions) in 33 ms.
[2025-06-02 04:06:46] [INFO ] Added : 36 causal constraints over 8 iterations in 205 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 227/227 transitions.
Graph (complete) has 347 edges and 69 vertex of which 67 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 64 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 63 transition count 224
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 63 transition count 222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 61 transition count 222
Applied a total of 13 rules in 75 ms. Remains 61 /69 variables (removed 8) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 61/69 places, 222/227 transitions.
[2025-06-02 04:06:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 151=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 151=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :[0, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:06:47] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
// Phase 1: matrix 176 rows 61 cols
[2025-06-02 04:06:47] [INFO ] Computed 8 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000019 steps (2 resets) in 491 ms. (2032 steps per ms)
BEST_FIRST walk for 3000001 steps (6 resets) in 2177 ms. (1377 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:06:50] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 04:06:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-06-02 04:06:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 04:06:50] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2025-06-02 04:06:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:50] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 3 ms to minimize.
[2025-06-02 04:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-02 04:06:50] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 22 ms.
[2025-06-02 04:06:50] [INFO ] Added : 5 causal constraints over 1 iterations in 53 ms. Result :sat
Minimization took 44 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Real]Added 57 Read/Feed constraints in 12 ms returned sat
[2025-06-02 04:06:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-02 04:06:50] [INFO ] [Nat]Added 57 Read/Feed constraints in 21 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:50] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:50] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 4 ms to minimize.
[2025-06-02 04:06:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2025-06-02 04:06:51] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 31 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:51] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 6 ms to minimize.
[2025-06-02 04:06:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2025-06-02 04:06:51] [INFO ] Added : 11 causal constraints over 3 iterations in 324 ms. Result :sat
Minimization took 46 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:06:51] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2025-06-02 04:06:51] [INFO ] [Real]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-06-02 04:06:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:06:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-06-02 04:06:51] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-06-02 04:06:51] [INFO ] [Nat]Added 57 Read/Feed constraints in 25 ms returned sat
[2025-06-02 04:06:51] [INFO ] Computed and/alt/rep : 119/604/118 causal constraints (skipped 57 transitions) in 31 ms.
[2025-06-02 04:06:51] [INFO ] Added : 22 causal constraints over 5 iterations in 147 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 34] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 10 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 61/61 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 222/222 transitions.
Applied a total of 0 rules in 11 ms. Remains 61 /61 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-06-02 04:06:51] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 04:06:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:06:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-06-02 04:06:52] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 04:06:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:06:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-02 04:06:52] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:06:52] [INFO ] Redundant transitions in 11 ms returned []
Running 221 sub problems to find dead transitions.
[2025-06-02 04:06:52] [INFO ] Flow matrix only has 176 transitions (discarded 46 similar events)
[2025-06-02 04:06:52] [INFO ] Invariant cache hit.
[2025-06-02 04:06:52] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:06:53] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 127 constraints, problems are : Problem set: 0 solved, 221 unsolved in 6381 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 57/127 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 221/348 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:02] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:02] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:03] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 3/351 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:05] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:06] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 4/355 constraints. Problems are: Problem set: 43 solved, 178 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:09] [INFO ] Deduced a trap along path composed of 6 places in 32 ms of which 5 ms to minimize.
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:09] [INFO ] Deduced a trap along path composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD148 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 2/357 constraints. Problems are: Problem set: 49 solved, 172 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:16] [INFO ] Deduced a trap along path composed of 4 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:16] [INFO ] Deduced a trap along path composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD141 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 2/359 constraints. Problems are: Problem set: 50 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:22] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:23] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 2/361 constraints. Problems are: Problem set: 50 solved, 171 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/362 constraints. Problems are: Problem set: 50 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 362 constraints, problems are : Problem set: 50 solved, 171 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 36646ms problems are : Problem set: 50 solved, 171 unsolved
Search for dead transitions found 50 dead transitions in 36659ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 172/222 transitions.
Reduce places removed 9 places and 60 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 52 transition count 112
Reduce places removed 7 places and 31 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 45 transition count 81
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 43 transition count 71
Reduce places removed 3 places and 12 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 21 place count 40 transition count 59
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 22 place count 39 transition count 55
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 22 rules in 8 ms. Remains 39 /61 variables (removed 22) and now considering 55/172 (removed 117) transitions.
[2025-06-02 04:07:29] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 39 cols
[2025-06-02 04:07:29] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-02 04:07:29] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2025-06-02 04:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:29] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 39/61 places, 55/222 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37334 ms. Remains : 39/61 places, 55/222 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA Medical-PT-24-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-24-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 04:07:29] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {1=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:07:29] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 37 cols
[2025-06-02 04:07:29] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 34] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000012 steps (2 resets) in 357 ms. (2793 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 508 ms. (1964 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:07:30] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2025-06-02 04:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:07:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 04:07:30] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-02 04:07: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-02 04:07:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 04:07:30] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-02 04:07:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:30] [INFO ] [Nat]Added 27 Read/Feed constraints in 8 ms returned sat
[2025-06-02 04:07:30] [INFO ] Computed and/alt/rep : 43/151/42 causal constraints (skipped 6 transitions) in 6 ms.
[2025-06-02 04:07:30] [INFO ] Added : 19 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 55/55 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 55/55 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2025-06-02 04:07:30] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2025-06-02 04:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:30] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-02 04:07:30] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2025-06-02 04:07:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:30] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:30] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:07:30] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-02 04:07:30] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2025-06-02 04:07:30] [INFO ] Invariant cache hit.
[2025-06-02 04:07:30] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 49/86 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 0/86 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 72 constraints, problems are : Problem set: 0 solved, 54 unsolved in 785 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 49/86 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 54/126 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:32] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:33] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:34] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 5 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/86 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:35] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 1/137 constraints. Problems are: Problem set: 2 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:35] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 52 unsolved
At refinement iteration 13 (OVERLAPS) 0/86 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 138 constraints, problems are : Problem set: 2 solved, 52 unsolved in 8699 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 9509ms problems are : Problem set: 2 solved, 52 unsolved
Search for dead transitions found 2 dead transitions in 9510ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 37/37 places, 53/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:07:40] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9715 ms. Remains : 37/37 places, 53/55 transitions.
[2025-06-02 04:07:40] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:07:40] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
// Phase 1: matrix 47 rows 37 cols
[2025-06-02 04:07:40] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000013 steps (2 resets) in 371 ms. (2688 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 560 ms. (1782 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
[2025-06-02 04:07:41] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:07:41] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 04:07:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-02 04:07: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-02 04:07:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2025-06-02 04:07:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-02 04:07:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:41] [INFO ] [Nat]Added 27 Read/Feed constraints in 6 ms returned sat
[2025-06-02 04:07:41] [INFO ] Computed and/alt/rep : 41/143/40 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 04:07:41] [INFO ] Added : 17 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 37/37 places, 53/53 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-02 04:07:41] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 04:07:41] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:07:41] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-02 04:07:41] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:41] [INFO ] Invariant cache hit.
[2025-06-02 04:07:41] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/84 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 72 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1462 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/84 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 52/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:44] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:44] [INFO ] Deduced a trap along path composed of 2 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 127 constraints, problems are : Problem set: 0 solved, 52 unsolved in 3529 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 5001ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 5002ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5159 ms. Remains : 37/37 places, 53/53 transitions.
[2025-06-02 04:07:46] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 40047 steps (8 resets) in 368 ms. (108 steps per ms) remains 1/1 properties
BEST_FIRST walk for 37929 steps (8 resets) in 182 ms. (207 steps per ms) remains 0/1 properties
[2025-06-02 04:07:46] [INFO ] Flatten gal took : 47 ms
[2025-06-02 04:07:46] [INFO ] Flatten gal took : 16 ms
[2025-06-02 04:07:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16673916514531415093.gal : 8 ms
[2025-06-02 04:07:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9667181761381002085.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16673916514531415093.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9667181761381002085.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9667181761381002085.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.023254,4428,2,44,5,140,6,0,194,55,0
Total reachable state count : 5
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[10, 0, 34] Max Struct:[+inf, +inf, +inf]
Starting property specific reduction for Medical-PT-24-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2025-06-02 04:07:47] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10002 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2025-06-02 04:07:47] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:07:47] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:07:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 04:07:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 04:07:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:07:47] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 04:07:47] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:47] [INFO ] [Nat]Added 27 Read/Feed constraints in 10 ms returned sat
[2025-06-02 04:07:47] [INFO ] Computed and/alt/rep : 41/143/40 causal constraints (skipped 6 transitions) in 11 ms.
[2025-06-02 04:07:47] [INFO ] Added : 17 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 37/37 places, 53/53 transitions.
[2025-06-02 04:07:47] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
[2025-06-02 04:07:47] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 1000021 steps (2 resets) in 370 ms. (2695 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 436 ms. (2288 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[+inf]
[2025-06-02 04:07:48] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:07:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:07:48] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2025-06-02 04:07:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 04:07:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-06-02 04:07:48] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-02 04:07:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:48] [INFO ] [Nat]Added 27 Read/Feed constraints in 9 ms returned sat
[2025-06-02 04:07:48] [INFO ] Computed and/alt/rep : 41/143/40 causal constraints (skipped 6 transitions) in 4 ms.
[2025-06-02 04:07:48] [INFO ] Added : 17 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[12] Max Struct:[+inf]
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 37/37 places, 53/53 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 53/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2025-06-02 04:07:48] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:48] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-02 04:07:48] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 04:07:48] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-06-02 04:07:48] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 04:07:48] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-02 04:07:48] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
[2025-06-02 04:07:48] [INFO ] Invariant cache hit.
[2025-06-02 04:07:48] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/84 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 72 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1109 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 47/84 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 27/72 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 52/124 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:50] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:50] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 04:07:50] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/84 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 127 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 3598ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3599ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3778 ms. Remains : 37/37 places, 53/53 transitions.
[2025-06-02 04:07:52] [INFO ] Flow matrix only has 47 transitions (discarded 6 similar events)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Found an invariant !
This invariant on transitions {0=1, 40=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1, 40=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[12] Max Struct:[+inf]
RANDOM walk for 40058 steps (8 resets) in 45 ms. (870 steps per ms) remains 1/1 properties
BEST_FIRST walk for 31761 steps (6 resets) in 60 ms. (520 steps per ms) remains 0/1 properties
[2025-06-02 04:07:52] [INFO ] Flatten gal took : 33 ms
[2025-06-02 04:07:52] [INFO ] Flatten gal took : 17 ms
[2025-06-02 04:07:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality258218710792005972.gal : 5 ms
[2025-06-02 04:07:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10665571915500296500.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality258218710792005972.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10665571915500296500.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
ITS runner timed out or was interrupted.
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality10665571915500296500.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[12] Max Struct:[+inf]
Ending property specific reduction for Medical-PT-24-UpperBounds-11 in 5340 ms.
[2025-06-02 04:07:52] [INFO ] Flatten gal took : 13 ms
[2025-06-02 04:07:52] [INFO ] Applying decomposition
[2025-06-02 04:07:52] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3166594483597316236.txt' '-o' '/tmp/graph3166594483597316236.bin' '-w' '/tmp/graph3166594483597316236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3166594483597316236.bin' '-l' '-1' '-v' '-w' '/tmp/graph3166594483597316236.weights' '-q' '0' '-e' '0.001'
[2025-06-02 04:07:52] [INFO ] Decomposing Gal with order
[2025-06-02 04:07:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 04:07:52] [INFO ] Removed a total of 15 redundant transitions.
[2025-06-02 04:07:52] [INFO ] Flatten gal took : 82 ms
[2025-06-02 04:07:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2025-06-02 04:07:52] [INFO ] Time to serialize gal into /tmp/UpperBounds11929976744271148958.gal : 6 ms
[2025-06-02 04:07:52] [INFO ] Time to serialize properties into /tmp/UpperBounds13022748509371446931.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11929976744271148958.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13022748509371446931.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds13022748509371446931.prop.
Detected timeout of ITS tools.
[2025-06-02 04:28:15] [INFO ] Flatten gal took : 7 ms
[2025-06-02 04:28:15] [INFO ] Time to serialize gal into /tmp/UpperBounds2193942916736508677.gal : 2 ms
[2025-06-02 04:28:15] [INFO ] Time to serialize properties into /tmp/UpperBounds11669235192625546649.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2193942916736508677.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11669235192625546649.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds11669235192625546649.prop.
Detected timeout of ITS tools.
[2025-06-02 04:48:39] [INFO ] Flatten gal took : 10 ms
[2025-06-02 04:48:39] [INFO ] Input system was already deterministic with 53 transitions.
[2025-06-02 04:48:39] [INFO ] Transformed 37 places.
[2025-06-02 04:48:39] [INFO ] Transformed 53 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 04:48:39] [INFO ] Time to serialize gal into /tmp/UpperBounds634469424628519625.gal : 2 ms
[2025-06-02 04:48:39] [INFO ] Time to serialize properties into /tmp/UpperBounds16444310216684378644.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds634469424628519625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16444310216684378644.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16444310216684378644.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Medical-PT-24"
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 Medical-PT-24, 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 r128-smll-174876523900093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Medical-PT-24.tgz
mv Medical-PT-24 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;