Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759000554.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is ShieldPPPt-PT-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759000554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717004723171

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:45:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:45:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:45:24] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-29 17:45:24] [INFO ] Transformed 159 places.
[2024-05-29 17:45:24] [INFO ] Transformed 145 transitions.
[2024-05-29 17:45:24] [INFO ] Found NUPN structural information;
[2024-05-29 17:45:24] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 98 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 153 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 153 transition count 139
Applied a total of 12 rules in 25 ms. Remains 153 /159 variables (removed 6) and now considering 139/145 (removed 6) transitions.
// Phase 1: matrix 139 rows 153 cols
[2024-05-29 17:45:24] [INFO ] Computed 23 invariants in 15 ms
[2024-05-29 17:45:24] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-29 17:45:24] [INFO ] Invariant cache hit.
[2024-05-29 17:45:24] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-29 17:45:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 11 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 3 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 17:45:26] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 17:45:27] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/292 variables, 153/205 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 17:45:29] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/292 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 208 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6781 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 32/55 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:32] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/292 variables, 153/209 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 138/347 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:33] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 17:45:34] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 17:45:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 17:45:37] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/292 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/292 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 355 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9950 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 41/41 constraints]
After SMT, in 16782ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 16799ms
Starting structural reductions in LTL mode, iteration 1 : 153/159 places, 139/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17240 ms. Remains : 153/159 places, 139/145 transitions.
Support contains 98 out of 153 places after structural reductions.
[2024-05-29 17:45:42] [INFO ] Flatten gal took : 36 ms
[2024-05-29 17:45:42] [INFO ] Flatten gal took : 13 ms
[2024-05-29 17:45:42] [INFO ] Input system was already deterministic with 139 transitions.
RANDOM walk for 40000 steps (8 resets) in 1986 ms. (20 steps per ms) remains 7/79 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/6 properties
[2024-05-29 17:45:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 136/153 variables, 23/23 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 139/292 variables, 153/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/292 variables, 0/176 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 176 constraints, problems are : Problem set: 4 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 123/153 variables, 21/23 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 17:45:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 17:45:43] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:45:43] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/26 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 139/292 variables, 153/179 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 1/180 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-29 17:45:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 1/181 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/292 variables, 0/181 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 181 constraints, problems are : Problem set: 4 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 337ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 139/139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 153 transition count 107
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 121 transition count 104
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 119 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 118 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 71 place count 118 transition count 93
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 91 place count 108 transition count 93
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 102 place count 97 transition count 82
Iterating global reduction 4 with 11 rules applied. Total rules applied 113 place count 97 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 113 place count 97 transition count 76
Deduced a syphon composed of 6 places in 8 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 125 place count 91 transition count 76
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 187 place count 60 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 197 place count 55 transition count 45
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 203 place count 55 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 204 place count 54 transition count 44
Applied a total of 204 rules in 72 ms. Remains 54 /153 variables (removed 99) and now considering 44/139 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 54/153 places, 44/139 transitions.
RANDOM walk for 40000 steps (25 resets) in 594 ms. (67 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (18 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2273999 steps, run timeout after 3001 ms. (steps per millisecond=757 ) properties seen :0 out of 1
Probabilistic random walk after 2273999 steps, saw 1114776 distinct states, run finished after 3004 ms. (steps per millisecond=756 ) properties seen :0
// Phase 1: matrix 44 rows 54 cols
[2024-05-29 17:45:46] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 17:45:46] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/54 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 27/81 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/92 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/93 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/93 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/95 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/95 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/98 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/98 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 54/54 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 27/54 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/92 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 17:45:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 17:45:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/92 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/92 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/93 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/93 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/93 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/95 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/95 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/98 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/98 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/98 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/98 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 54/54 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/54 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-05-29 17:45:46] [INFO ] Invariant cache hit.
[2024-05-29 17:45:46] [INFO ] Implicit Places using invariants in 43 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 44/44 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 53 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 42
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 51 cols
[2024-05-29 17:45:46] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 17:45:47] [INFO ] Implicit Places using invariants in 40 ms returned [33, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/54 places, 42/44 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 40
Applied a total of 4 rules in 3 ms. Remains 47 /49 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 47 cols
[2024-05-29 17:45:47] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 17:45:47] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 17:45:47] [INFO ] Invariant cache hit.
[2024-05-29 17:45:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 17:45:47] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 47/54 places, 40/44 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 214 ms. Remains : 47/54 places, 40/44 transitions.
RANDOM walk for 40000 steps (26 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2436450 steps, run timeout after 3001 ms. (steps per millisecond=811 ) properties seen :0 out of 1
Probabilistic random walk after 2436450 steps, saw 970278 distinct states, run finished after 3001 ms. (steps per millisecond=811 ) properties seen :0
[2024-05-29 17:45:50] [INFO ] Invariant cache hit.
[2024-05-29 17:45:50] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 17:45:50] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/43 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/70 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/81 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/81 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/81 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/82 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/82 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/84 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 3/87 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/87 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 72 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/43 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 27/70 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/70 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/81 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/81 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/81 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/82 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/82 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/84 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/84 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/87 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/87 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 17:45:50] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 32 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/87 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/87 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 47/47 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-05-29 17:45:50] [INFO ] Invariant cache hit.
[2024-05-29 17:45:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 17:45:50] [INFO ] Invariant cache hit.
[2024-05-29 17:45:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 17:45:51] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-29 17:45:51] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-29 17:45:51] [INFO ] Invariant cache hit.
[2024-05-29 17:45:51] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 17:45:51] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 17:45:51] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 17:45:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/47 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 17:45:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/87 variables, 47/71 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 75 constraints, problems are : Problem set: 0 solved, 39 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/47 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-29 17:45:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/87 variables, 47/72 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 115 constraints, problems are : Problem set: 0 solved, 39 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 47/47 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 5/5 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1704ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1894 ms. Remains : 47/47 places, 40/40 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 47 transition count 40
Applied a total of 11 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 47 cols
[2024-05-29 17:45:52] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 17:45:52] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 17:45:52] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 17:45:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 17:45:52] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 17:45:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 17:45:52] [INFO ] After 8ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-29 17:45:52] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-29 17:45:52] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 124 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-29 17:45:52] [INFO ] Flatten gal took : 9 ms
[2024-05-29 17:45:52] [INFO ] Flatten gal took : 8 ms
[2024-05-29 17:45:52] [INFO ] Input system was already deterministic with 139 transitions.
Support contains 89 out of 153 places (down from 90) after GAL structural reductions.
Computed a total of 38 stabilizing places and 38 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 141 transition count 127
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 141 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 140 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 140 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 139 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 139 transition count 125
Applied a total of 28 rules in 15 ms. Remains 139 /153 variables (removed 14) and now considering 125/139 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 139/153 places, 125/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 152 transition count 111
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 125 transition count 108
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 61 place count 123 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 121 transition count 106
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 63 place count 121 transition count 95
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 85 place count 110 transition count 95
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 97 place count 98 transition count 83
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 98 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 109 place count 98 transition count 77
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 121 place count 92 transition count 77
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 173 place count 66 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 64 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 176 place count 63 transition count 49
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 63 transition count 47
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 61 transition count 47
Applied a total of 180 rules in 19 ms. Remains 61 /153 variables (removed 92) and now considering 47/139 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 61/153 places, 47/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 123
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 7 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Applied a total of 32 rules in 8 ms. Remains 137 /153 variables (removed 16) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 137/153 places, 123/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 123
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 135 transition count 121
Applied a total of 36 rules in 8 ms. Remains 135 /153 variables (removed 18) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 135/153 places, 121/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 128
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 128
Applied a total of 22 rules in 4 ms. Remains 142 /153 variables (removed 11) and now considering 128/139 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 142/153 places, 128/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 152 transition count 112
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 126 transition count 109
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 124 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 122 transition count 107
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 61 place count 122 transition count 95
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 85 place count 110 transition count 95
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 97 place count 98 transition count 83
Iterating global reduction 4 with 12 rules applied. Total rules applied 109 place count 98 transition count 83
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 109 place count 98 transition count 76
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 123 place count 91 transition count 76
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 157 place count 74 transition count 59
Applied a total of 157 rules in 15 ms. Remains 74 /153 variables (removed 79) and now considering 59/139 (removed 80) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 74/153 places, 59/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 3 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 123
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 135 transition count 121
Applied a total of 36 rules in 7 ms. Remains 135 /153 variables (removed 18) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 135/153 places, 121/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Applied a total of 30 rules in 4 ms. Remains 138 /153 variables (removed 15) and now considering 124/139 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 138/153 places, 124/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 137 transition count 123
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 135 transition count 121
Applied a total of 36 rules in 9 ms. Remains 135 /153 variables (removed 18) and now considering 121/139 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 135/153 places, 121/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 141 transition count 127
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 141 transition count 127
Applied a total of 24 rules in 4 ms. Remains 141 /153 variables (removed 12) and now considering 127/139 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 141/153 places, 127/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Applied a total of 32 rules in 8 ms. Remains 137 /153 variables (removed 16) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 137/153 places, 123/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Applied a total of 32 rules in 7 ms. Remains 137 /153 variables (removed 16) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 137/153 places, 123/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 138 transition count 124
Applied a total of 30 rules in 6 ms. Remains 138 /153 variables (removed 15) and now considering 124/139 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 138/153 places, 124/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 139 transition count 125
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 139 transition count 125
Applied a total of 28 rules in 5 ms. Remains 139 /153 variables (removed 14) and now considering 125/139 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 139/153 places, 125/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 139/139 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 138 transition count 124
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 136 transition count 122
Applied a total of 34 rules in 9 ms. Remains 136 /153 variables (removed 17) and now considering 122/139 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 136/153 places, 122/139 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 17:45:53] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-29 17:45:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 139 transitions and 350 arcs took 2 ms.
Total runtime 29205 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-002B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 153
TRANSITIONS: 139
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 776
MODEL NAME: /home/mcc/execution/412/model
153 places, 139 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA ShieldPPPt-PT-002B-CTLFireability-2024-10 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717005501094

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ShieldPPPt-PT-002B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPt-PT-002B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759000554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;