Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857200449.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is FlexibleBarrier-PT-04b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857200449
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 12:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Feb 25 12:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 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 FlexibleBarrier-PT-04b-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678549940145

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 15:52:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 15:52:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:52:21] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-11 15:52:21] [INFO ] Transformed 268 places.
[2023-03-11 15:52:21] [INFO ] Transformed 305 transitions.
[2023-03-11 15:52:21] [INFO ] Found NUPN structural information;
[2023-03-11 15:52:21] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 90 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 305/305 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 224 transition count 261
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 224 transition count 261
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 97 place count 215 transition count 252
Iterating global reduction 0 with 9 rules applied. Total rules applied 106 place count 215 transition count 252
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 213 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 213 transition count 250
Applied a total of 110 rules in 53 ms. Remains 213 /268 variables (removed 55) and now considering 250/305 (removed 55) transitions.
// Phase 1: matrix 250 rows 213 cols
[2023-03-11 15:52:22] [INFO ] Computed 6 place invariants in 19 ms
[2023-03-11 15:52:22] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-11 15:52:22] [INFO ] Invariant cache hit.
[2023-03-11 15:52:22] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-11 15:52:22] [INFO ] Invariant cache hit.
[2023-03-11 15:52:22] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/268 places, 250/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 213/268 places, 250/305 transitions.
Support contains 90 out of 213 places after structural reductions.
[2023-03-11 15:52:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-11 15:52:22] [INFO ] Flatten gal took : 43 ms
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 15:52:22] [INFO ] Flatten gal took : 17 ms
[2023-03-11 15:52:22] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 72 out of 213 places (down from 90) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 237 resets, run finished after 512 ms. (steps per millisecond=19 ) properties (out of 46) seen :38
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2023-03-11 15:52:23] [INFO ] Invariant cache hit.
[2023-03-11 15:52:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 15:52:24] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 15:52:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 15:52:24] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 15:52:24] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 5 ms to minimize.
[2023-03-11 15:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-11 15:52:24] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2023-03-11 15:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-11 15:52:24] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 2 ms to minimize.
[2023-03-11 15:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-03-11 15:52:24] [INFO ] After 462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-11 15:52:24] [INFO ] After 612ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 3 properties in 13 ms.
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 194 edges and 213 vertex of which 26 / 213 are part of one of the 4 SCC in 3 ms
Free SCC test removed 22 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 191 transition count 180
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 148 transition count 180
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 87 place count 148 transition count 166
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 115 place count 134 transition count 166
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 158 place count 91 transition count 123
Iterating global reduction 2 with 43 rules applied. Total rules applied 201 place count 91 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 91 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 202 place count 91 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 208 place count 88 transition count 119
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 88 transition count 117
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 215 place count 83 transition count 112
Iterating global reduction 4 with 5 rules applied. Total rules applied 220 place count 83 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 225 place count 83 transition count 107
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 269 place count 61 transition count 85
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 275 place count 61 transition count 79
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 281 place count 55 transition count 73
Iterating global reduction 6 with 6 rules applied. Total rules applied 287 place count 55 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 290 place count 55 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 292 place count 54 transition count 87
Free-agglomeration rule applied 23 times.
Iterating global reduction 7 with 23 rules applied. Total rules applied 315 place count 54 transition count 64
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 7 with 32 rules applied. Total rules applied 347 place count 31 transition count 55
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 354 place count 31 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 355 place count 30 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 356 place count 29 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 356 place count 29 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 358 place count 28 transition count 46
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 364 place count 25 transition count 43
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 367 place count 25 transition count 40
Applied a total of 367 rules in 54 ms. Remains 25 /213 variables (removed 188) and now considering 40/250 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 25/213 places, 40/250 transitions.
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=18 )
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 11 ms
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 12 ms
[2023-03-11 15:52:24] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 173 transition count 210
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 173 transition count 210
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 98 place count 155 transition count 192
Iterating global reduction 0 with 18 rules applied. Total rules applied 116 place count 155 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 121 place count 155 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 127 place count 149 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 133 place count 149 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 136 place count 149 transition count 178
Applied a total of 136 rules in 11 ms. Remains 149 /213 variables (removed 64) and now considering 178/250 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 149/213 places, 178/250 transitions.
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 8 ms
[2023-03-11 15:52:24] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:24] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 192 edges and 213 vertex of which 20 / 213 are part of one of the 3 SCC in 0 ms
Free SCC test removed 17 places
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 195 transition count 185
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 149 transition count 185
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 93 place count 149 transition count 171
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 121 place count 135 transition count 171
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 162 place count 94 transition count 130
Iterating global reduction 2 with 41 rules applied. Total rules applied 203 place count 94 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 94 transition count 129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 204 place count 94 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 210 place count 91 transition count 126
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 216 place count 85 transition count 120
Iterating global reduction 3 with 6 rules applied. Total rules applied 222 place count 85 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 228 place count 85 transition count 114
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 254 place count 72 transition count 101
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 255 place count 71 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 71 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 257 place count 71 transition count 99
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 71 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 263 place count 69 transition count 93
Applied a total of 263 rules in 33 ms. Remains 69 /213 variables (removed 144) and now considering 93/250 (removed 157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 69/213 places, 93/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 168 transition count 205
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 168 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 204
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 110 place count 149 transition count 185
Iterating global reduction 1 with 19 rules applied. Total rules applied 129 place count 149 transition count 185
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 134 place count 149 transition count 180
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 139 place count 144 transition count 175
Iterating global reduction 2 with 5 rules applied. Total rules applied 144 place count 144 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 144 transition count 173
Applied a total of 146 rules in 19 ms. Remains 144 /213 variables (removed 69) and now considering 173/250 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 144/213 places, 173/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 8 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 167 transition count 204
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 167 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 93 place count 167 transition count 203
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 112 place count 148 transition count 184
Iterating global reduction 1 with 19 rules applied. Total rules applied 131 place count 148 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 135 place count 148 transition count 180
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 141 transition count 173
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 141 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 141 transition count 170
Applied a total of 152 rules in 11 ms. Remains 141 /213 variables (removed 72) and now considering 170/250 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 141/213 places, 170/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 166 transition count 203
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 166 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 95 place count 166 transition count 202
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 116 place count 145 transition count 181
Iterating global reduction 1 with 21 rules applied. Total rules applied 137 place count 145 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 142 place count 145 transition count 176
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 148 place count 139 transition count 170
Iterating global reduction 2 with 6 rules applied. Total rules applied 154 place count 139 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 139 transition count 168
Applied a total of 156 rules in 11 ms. Remains 139 /213 variables (removed 74) and now considering 168/250 (removed 82) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 139/213 places, 168/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 174 edges and 213 vertex of which 14 / 213 are part of one of the 2 SCC in 1 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 200 transition count 197
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 161 transition count 195
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 159 transition count 195
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 83 place count 159 transition count 183
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 107 place count 147 transition count 183
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 142 place count 112 transition count 148
Iterating global reduction 3 with 35 rules applied. Total rules applied 177 place count 112 transition count 148
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 177 place count 112 transition count 145
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 183 place count 109 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 106 transition count 142
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 106 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 191 place count 106 transition count 140
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 225 place count 89 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 86 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 86 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 234 place count 86 transition count 117
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 238 place count 86 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 86 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 84 transition count 111
Applied a total of 241 rules in 41 ms. Remains 84 /213 variables (removed 129) and now considering 111/250 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 84/213 places, 111/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 196 edges and 213 vertex of which 26 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 190 transition count 184
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 148 transition count 184
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 85 place count 148 transition count 169
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 115 place count 133 transition count 169
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 158 place count 90 transition count 126
Iterating global reduction 2 with 43 rules applied. Total rules applied 201 place count 90 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 202 place count 90 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 202 place count 90 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 89 transition count 124
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 209 place count 84 transition count 119
Iterating global reduction 3 with 5 rules applied. Total rules applied 214 place count 84 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 219 place count 84 transition count 114
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 243 place count 72 transition count 102
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 246 place count 69 transition count 99
Iterating global reduction 4 with 3 rules applied. Total rules applied 249 place count 69 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 252 place count 69 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 256 place count 69 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 67 transition count 90
Applied a total of 258 rules in 27 ms. Remains 67 /213 variables (removed 146) and now considering 90/250 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 67/213 places, 90/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 177 transition count 214
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 177 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 177 transition count 213
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 88 place count 162 transition count 198
Iterating global reduction 1 with 15 rules applied. Total rules applied 103 place count 162 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 162 transition count 196
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 159 transition count 193
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 159 transition count 193
Applied a total of 111 rules in 10 ms. Remains 159 /213 variables (removed 54) and now considering 193/250 (removed 57) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 159/213 places, 193/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 193 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 198 edges and 213 vertex of which 26 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 190 transition count 181
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 145 transition count 181
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 145 transition count 168
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 117 place count 132 transition count 168
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 160 place count 89 transition count 125
Iterating global reduction 2 with 43 rules applied. Total rules applied 203 place count 89 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 204 place count 89 transition count 124
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 204 place count 89 transition count 122
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 208 place count 87 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 212 place count 83 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 216 place count 83 transition count 118
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 220 place count 83 transition count 114
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
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 244 place count 71 transition count 102
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 247 place count 68 transition count 99
Iterating global reduction 4 with 3 rules applied. Total rules applied 250 place count 68 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 253 place count 68 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 257 place count 68 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 259 place count 66 transition count 90
Applied a total of 259 rules in 22 ms. Remains 66 /213 variables (removed 147) and now considering 90/250 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 66/213 places, 90/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 4 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 168 transition count 205
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 168 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 91 place count 168 transition count 204
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 108 place count 151 transition count 187
Iterating global reduction 1 with 17 rules applied. Total rules applied 125 place count 151 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 129 place count 151 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 134 place count 146 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 139 place count 146 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 146 transition count 176
Applied a total of 141 rules in 10 ms. Remains 146 /213 variables (removed 67) and now considering 176/250 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 146/213 places, 176/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 5 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 173 transition count 210
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 173 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 81 place count 173 transition count 209
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 99 place count 155 transition count 191
Iterating global reduction 1 with 18 rules applied. Total rules applied 117 place count 155 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 155 transition count 188
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 126 place count 149 transition count 182
Iterating global reduction 2 with 6 rules applied. Total rules applied 132 place count 149 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 134 place count 149 transition count 180
Applied a total of 134 rules in 11 ms. Remains 149 /213 variables (removed 64) and now considering 180/250 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 149/213 places, 180/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 6 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 7 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (trivial) has 195 edges and 213 vertex of which 26 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 190 transition count 184
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 148 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 147 transition count 183
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 87 place count 147 transition count 169
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 115 place count 133 transition count 169
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 158 place count 90 transition count 126
Iterating global reduction 3 with 43 rules applied. Total rules applied 201 place count 90 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 90 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 202 place count 90 transition count 124
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 89 transition count 124
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 209 place count 84 transition count 119
Iterating global reduction 4 with 5 rules applied. Total rules applied 214 place count 84 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 219 place count 84 transition count 114
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 243 place count 72 transition count 102
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 246 place count 69 transition count 99
Iterating global reduction 5 with 3 rules applied. Total rules applied 249 place count 69 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 252 place count 69 transition count 96
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 256 place count 69 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 67 transition count 90
Applied a total of 258 rules in 22 ms. Remains 67 /213 variables (removed 146) and now considering 90/250 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 67/213 places, 90/250 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 3 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 2 ms
[2023-03-11 15:52:25] [INFO ] Input system was already deterministic with 90 transitions.
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 8 ms
[2023-03-11 15:52:25] [INFO ] Flatten gal took : 9 ms
[2023-03-11 15:52:25] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 15:52:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 213 places, 250 transitions and 633 arcs took 1 ms.
Total runtime 3921 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 213 NrTr: 250 NrArc: 633)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec

net check time: 0m 0.000sec

init dd package: 0m 2.814sec


RS generation: 0m51.030sec


-> reachability set: #nodes 122308 (1.2e+05) #states 274,063,083 (8)



starting MCC model checker
--------------------------

checking: EG [AG [[p53<=0 & 0<=p53]]]
normalized: EG [~ [E [true U ~ [[p53<=0 & 0<=p53]]]]]

abstracting: (0<=p53)
states: 274,063,083 (8)
abstracting: (p53<=0)
states: 268,800,510 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m47.903sec

checking: EF [EG [A [~ [[p98<=1 & 1<=p98]] U [p41<=1 & 1<=p41]]]]
normalized: E [true U EG [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [[p98<=1 & 1<=p98] & ~ [[p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)
abstracting: (1<=p98)
states: 5,488,332 (6)
abstracting: (p98<=1)
states: 274,063,083 (8)
abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)

before gc: list nodes free: 954086

after gc: idd nodes used:402528, unused:63597472; list nodes free:289713106
abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)
.....................
EG iterations: 21
......................
EG iterations: 22

before gc: list nodes free: 717773

after gc: idd nodes used:395005, unused:63604995; list nodes free:291860106
MC time: 5m 8.011sec

checking: EG [AX [~ [A [AG [[p94<=0 & 0<=p94]] U AG [[p185<=1 & 1<=p185]]]]]]
normalized: EG [~ [EX [[~ [EG [E [true U ~ [[p185<=1 & 1<=p185]]]]] & ~ [E [E [true U ~ [[p185<=1 & 1<=p185]]] U [E [true U ~ [[p94<=0 & 0<=p94]]] & E [true U ~ [[p185<=1 & 1<=p185]]]]]]]]]]

abstracting: (1<=p185)
states: 5,131,442 (6)
abstracting: (p185<=1)
states: 274,063,083 (8)
abstracting: (0<=p94)
states: 274,063,083 (8)
abstracting: (p94<=0)
states: 268,942,707 (8)
abstracting: (1<=p185)
states: 5,131,442 (6)
abstracting: (p185<=1)
states: 274,063,083 (8)
abstracting: (1<=p185)
states: 5,131,442 (6)
abstracting: (p185<=1)
states: 274,063,083 (8)

EG iterations: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m48.856sec

checking: AX [EF [[[p11<=1 & 1<=p11] | [p114<=1 & 1<=p114]]]]
normalized: ~ [EX [~ [E [true U [[p114<=1 & 1<=p114] | [p11<=1 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 4,860,164 (6)
abstracting: (p11<=1)
states: 274,063,083 (8)
abstracting: (1<=p114)
states: 8,626,025 (6)
abstracting: (p114<=1)
states: 274,063,083 (8)

before gc: list nodes free: 2694510

after gc: idd nodes used:283676, unused:63716324; list nodes free:292334125
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m13.135sec

checking: [AG [[p197<=0 & 0<=p197]] & EF [[p153<=1 & 1<=p153]]]
normalized: [E [true U [p153<=1 & 1<=p153]] & ~ [E [true U ~ [[p197<=0 & 0<=p197]]]]]

abstracting: (0<=p197)
states: 274,063,083 (8)
abstracting: (p197<=0)
states: 268,300,814 (8)

before gc: list nodes free: 2880136

after gc: idd nodes used:468557, unused:63531443; list nodes free:291526247
abstracting: (1<=p153)
states: 8,351,226 (6)
abstracting: (p153<=1)
states: 274,063,083 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m31.472sec

checking: E [~ [[p205<=1 & 1<=p205]] U AG [EF [~ [[p155<=1 & 1<=p155]]]]]
normalized: E [~ [[p205<=1 & 1<=p205]] U ~ [E [true U ~ [E [true U ~ [[p155<=1 & 1<=p155]]]]]]]

abstracting: (1<=p155)
states: 8,351,226 (6)
abstracting: (p155<=1)
states: 274,063,083 (8)
abstracting: (1<=p205)
states: 4,707,616 (6)
abstracting: (p205<=1)
states: 274,063,083 (8)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.190sec

checking: [AG [[[p77<=0 & 0<=p77] | [[p84<=1 & 1<=p84] | EF [AG [[[p69<=1 & 1<=p69] | [p174<=1 & 1<=p174]]]]]]] | EX [AF [[AX [1<=0] & EG [~ [[p166<=1 & 1<=p166]]]]]]]
normalized: [EX [~ [EG [~ [[EG [~ [[p166<=1 & 1<=p166]]] & ~ [EX [~ [1<=0]]]]]]]] | ~ [E [true U ~ [[[E [true U ~ [E [true U ~ [[[p174<=1 & 1<=p174] | [p69<=1 & 1<=p69]]]]]] | [p84<=1 & 1<=p84]] | [p77<=0 & 0<=p77]]]]]]

abstracting: (0<=p77)
states: 274,063,083 (8)
abstracting: (p77<=0)
states: 266,878,512 (8)
abstracting: (1<=p84)
states: 6,166,343 (6)
abstracting: (p84<=1)
states: 274,063,083 (8)
abstracting: (1<=p69)
states: 5,931,561 (6)
abstracting: (p69<=1)
states: 274,063,083 (8)
abstracting: (1<=p174)
states: 4,345,632 (6)
abstracting: (p174<=1)
states: 274,063,083 (8)

before gc: list nodes free: 983781

after gc: idd nodes used:518250, unused:63481750; list nodes free:291275997
abstracting: (1<=0)
states: 0
.abstracting: (1<=p166)
states: 4,345,632 (6)
abstracting: (p166<=1)
states: 274,063,083 (8)
...........
EG iterations: 11
.....................
EG iterations: 21
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m29.025sec

checking: EG [[AG [E [~ [[[[p176<=0 & 0<=p176] | [p36<=1 & 1<=p36]] & [p156<=1 & 1<=p156]]] U [EF [[p69<=1 & 1<=p69]] | EX [[p174<=1 & 1<=p174]]]]] | [p50<=1 & 1<=p50]]]
normalized: EG [[[p50<=1 & 1<=p50] | ~ [E [true U ~ [E [~ [[[p156<=1 & 1<=p156] & [[p36<=1 & 1<=p36] | [p176<=0 & 0<=p176]]]] U [EX [[p174<=1 & 1<=p174]] | E [true U [p69<=1 & 1<=p69]]]]]]]]]

abstracting: (1<=p69)
states: 5,931,561 (6)
abstracting: (p69<=1)
states: 274,063,083 (8)
abstracting: (1<=p174)
states: 4,345,632 (6)
abstracting: (p174<=1)
states: 274,063,083 (8)
.abstracting: (0<=p176)
states: 274,063,083 (8)
abstracting: (p176<=0)
states: 269,425,991 (8)
abstracting: (1<=p36)
states: 7,699,320 (6)
abstracting: (p36<=1)
states: 274,063,083 (8)
abstracting: (1<=p156)
states: 8,351,226 (6)
abstracting: (p156<=1)
states: 274,063,083 (8)

before gc: list nodes free: 3733445

after gc: idd nodes used:605474, unused:63394526; list nodes free:290880518
abstracting: (1<=p50)
states: 4,812,843 (6)
abstracting: (p50<=1)
states: 274,063,083 (8)
..................
EG iterations: 18
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m36.817sec

checking: E [~ [[[[p91<=0 & 0<=p91] | [p104<=1 & 1<=p104]] & [[p74<=0 & 0<=p74] | [[p143<=0 & 0<=p143] | [p187<=1 & 1<=p187]]]]] U AG [[A [[[p190<=0 & 0<=p190] | [p28<=1 & 1<=p28]] U ~ [[p109<=0 & 0<=p109]]] | [AF [[[p107<=0 & 0<=p107] | [p137<=1 & 1<=p137]]] | [~ [EG [[[p86<=0 & 0<=p86] | [p9<=1 & 1<=p9]]]] & [~ [[p170<=1 & 1<=p170]] | [p83<=1 & 1<=p83]]]]]]]
normalized: E [~ [[[[[p187<=1 & 1<=p187] | [p143<=0 & 0<=p143]] | [p74<=0 & 0<=p74]] & [[p104<=1 & 1<=p104] | [p91<=0 & 0<=p91]]]] U ~ [E [true U ~ [[[[[[p83<=1 & 1<=p83] | ~ [[p170<=1 & 1<=p170]]] & ~ [EG [[[p9<=1 & 1<=p9] | [p86<=0 & 0<=p86]]]]] | ~ [EG [~ [[[p137<=1 & 1<=p137] | [p107<=0 & 0<=p107]]]]]] | [~ [EG [[p109<=0 & 0<=p109]]] & ~ [E [[p109<=0 & 0<=p109] U [~ [[[p28<=1 & 1<=p28] | [p190<=0 & 0<=p190]]] & [p109<=0 & 0<=p109]]]]]]]]]]

abstracting: (0<=p109)
states: 274,063,083 (8)
abstracting: (p109<=0)
states: 269,523,776 (8)
abstracting: (0<=p190)
states: 274,063,083 (8)
abstracting: (p190<=0)
states: 268,461,307 (8)
abstracting: (1<=p28)
states: 6,122,594 (6)
abstracting: (p28<=1)
states: 274,063,083 (8)
abstracting: (0<=p109)
states: 274,063,083 (8)
abstracting: (p109<=0)
states: 269,523,776 (8)
abstracting: (0<=p109)
states: 274,063,083 (8)
abstracting: (p109<=0)
states: 269,523,776 (8)
.
EG iterations: 1
abstracting: (0<=p107)
states: 274,063,083 (8)
abstracting: (p107<=0)
states: 267,300,498 (8)
abstracting: (1<=p137)
states: 8,351,226 (6)
abstracting: (p137<=1)
states: 274,063,083 (8)
..................
EG iterations: 18
abstracting: (0<=p86)
states: 274,063,083 (8)
abstracting: (p86<=0)
states: 268,877,271 (8)
abstracting: (1<=p9)
states: 5,216,283 (6)
abstracting: (p9<=1)
states: 274,063,083 (8)
...........
EG iterations: 11
abstracting: (1<=p170)
states: 4,881,138 (6)
abstracting: (p170<=1)
states: 274,063,083 (8)
abstracting: (1<=p83)
states: 7,184,571 (6)
abstracting: (p83<=1)
states: 274,063,083 (8)

before gc: list nodes free: 3291672

after gc: idd nodes used:711506, unused:63288494; list nodes free:290383151
abstracting: (0<=p91)
states: 274,063,083 (8)
abstracting: (p91<=0)
states: 265,790,397 (8)
abstracting: (1<=p104)
states: 6,762,585 (6)
abstracting: (p104<=1)
states: 274,063,083 (8)
abstracting: (0<=p74)
states: 274,063,083 (8)
abstracting: (p74<=0)
states: 266,893,464 (8)
abstracting: (0<=p143)
states: 274,063,083 (8)
abstracting: (p143<=0)
states: 268,071,723 (8)
abstracting: (1<=p187)
states: 11,192,741 (7)
abstracting: (p187<=1)
states: 274,063,083 (8)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m39.716sec

checking: E [A [[[p156<=0 & 0<=p156] & [[p115<=1 & 1<=p115] & [[p19<=0 & 0<=p19] | [p163<=1 & 1<=p163]]]] U EX [[[[p166<=0 & 0<=p166] | [p89<=1 & 1<=p89]] & [~ [[[p33<=0 & 0<=p33] | [p142<=1 & 1<=p142]]] | [[p121<=0 & 0<=p121] & [[p43<=0 & 0<=p43] | [p130<=1 & 1<=p130]]]]]]] U ~ [AF [[AF [[[p142<=0 & 0<=p142] | [p15<=0 & 0<=p15]]] | [p74<=0 & 0<=p74]]]]]
normalized: E [[~ [EG [~ [EX [[[[[[p130<=1 & 1<=p130] | [p43<=0 & 0<=p43]] & [p121<=0 & 0<=p121]] | ~ [[[p142<=1 & 1<=p142] | [p33<=0 & 0<=p33]]]] & [[p89<=1 & 1<=p89] | [p166<=0 & 0<=p166]]]]]]] & ~ [E [~ [EX [[[[[[p130<=1 & 1<=p130] | [p43<=0 & 0<=p43]] & [p121<=0 & 0<=p121]] | ~ [[[p142<=1 & 1<=p142] | [p33<=0 & 0<=p33]]]] & [[p89<=1 & 1<=p89] | [p166<=0 & 0<=p166]]]]] U [~ [[[[[p163<=1 & 1<=p163] | [p19<=0 & 0<=p19]] & [p115<=1 & 1<=p115]] & [p156<=0 & 0<=p156]]] & ~ [EX [[[[[[p130<=1 & 1<=p130] | [p43<=0 & 0<=p43]] & [p121<=0 & 0<=p121]] | ~ [[[p142<=1 & 1<=p142] | [p33<=0 & 0<=p33]]]] & [[p89<=1 & 1<=p89] | [p166<=0 & 0<=p166]]]]]]]]] U EG [~ [[[p74<=0 & 0<=p74] | ~ [EG [~ [[[p15<=0 & 0<=p15] | [p142<=0 & 0<=p142]]]]]]]]]

abstracting: (0<=p142)
states: 274,063,083 (8)
abstracting: (p142<=0)
states: 266,036,161 (8)
abstracting: (0<=p15)
states: 274,063,083 (8)
abstracting: (p15<=0)
states: 269,082,354 (8)
..............
EG iterations: 14
abstracting: (0<=p74)
states: 274,063,083 (8)
abstracting: (p74<=0)
states: 266,893,464 (8)
.......
EG iterations: 7
abstracting: (0<=p166)
states: 274,063,083 (8)
abstracting: (p166<=0)
states: 269,717,451 (8)
abstracting: (1<=p89)
states: 7,184,571 (6)
abstracting: (p89<=1)
states: 274,063,083 (8)
abstracting: (0<=p33)
states: 274,063,083 (8)
abstracting: (p33<=0)
states: 266,698,101 (8)
abstracting: (1<=p142)
states: 8,026,922 (6)
abstracting: (p142<=1)
states: 274,063,083 (8)
abstracting: (0<=p121)
states: 274,063,083 (8)
abstracting: (p121<=0)
states: 268,579,435 (8)
abstracting: (0<=p43)
states: 274,063,083 (8)
abstracting: (p43<=0)
states: 268,919,661 (8)
abstracting: (1<=p130)
states: 6,663,542 (6)
abstracting: (p130<=1)
states: 274,063,083 (8)
.abstracting: (0<=p156)
states: 274,063,083 (8)
abstracting: (p156<=0)
states: 265,711,857 (8)
abstracting: (1<=p115)
states: 7,940,993 (6)
abstracting: (p115<=1)
states: 274,063,083 (8)
abstracting: (0<=p19)
states: 274,063,083 (8)
abstracting: (p19<=0)
states: 267,776,209 (8)
abstracting: (1<=p163)
states: 5,949,447 (6)
abstracting: (p163<=1)
states: 274,063,083 (8)
abstracting: (0<=p166)
states: 274,063,083 (8)
abstracting: (p166<=0)
states: 269,717,451 (8)
abstracting: (1<=p89)
states: 7,184,571 (6)
abstracting: (p89<=1)
states: 274,063,083 (8)
abstracting: (0<=p33)
states: 274,063,083 (8)
abstracting: (p33<=0)
states: 266,698,101 (8)
abstracting: (1<=p142)
states: 8,026,922 (6)
abstracting: (p142<=1)
states: 274,063,083 (8)
abstracting: (0<=p121)
states: 274,063,083 (8)
abstracting: (p121<=0)
states: 268,579,435 (8)
abstracting: (0<=p43)
states: 274,063,083 (8)
abstracting: (p43<=0)
states: 268,919,661 (8)
abstracting: (1<=p130)
states: 6,663,542 (6)
abstracting: (p130<=1)
states: 274,063,083 (8)
.abstracting: (0<=p166)
states: 274,063,083 (8)
abstracting: (p166<=0)
states: 269,717,451 (8)
abstracting: (1<=p89)
states: 7,184,571 (6)
abstracting: (p89<=1)
states: 274,063,083 (8)
abstracting: (0<=p33)
states: 274,063,083 (8)
abstracting: (p33<=0)
states: 266,698,101 (8)
abstracting: (1<=p142)
states: 8,026,922 (6)
abstracting: (p142<=1)
states: 274,063,083 (8)
abstracting: (0<=p121)
states: 274,063,083 (8)
abstracting: (p121<=0)
states: 268,579,435 (8)
abstracting: (0<=p43)
states: 274,063,083 (8)
abstracting: (p43<=0)
states: 268,919,661 (8)
abstracting: (1<=p130)
states: 6,663,542 (6)
abstracting: (p130<=1)
states: 274,063,083 (8)
...............
EG iterations: 14

before gc: list nodes free: 1505411

after gc: idd nodes used:1147731, unused:62852269; list nodes free:288423057
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m43.442sec

checking: [EG [[[[~ [E [[p127<=1 & 1<=p127] U [[1<=p125 & p125<=1] | [p162<=0 & 0<=p162]]]] & [p180<=0 & 0<=p180]] & [[p140<=0 & 0<=p140] & [[p35<=1 & 1<=p35] & [p136<=1 & 1<=p136]]]] | [[p37<=0 & 0<=p37] & [p107<=1 & 1<=p107]]]] | [AX [[[p23<=0 & 0<=p23] & [p1<=1 & 1<=p1]]] & A [[[p113<=0 & 0<=p113] | [[p164<=1 & 1<=p164] | AX [[p143<=1 & 1<=p143]]]] U ~ [EF [[p194<=1 & 1<=p194]]]]]]
normalized: [EG [[[[[p140<=0 & 0<=p140] & [[p136<=1 & 1<=p136] & [p35<=1 & 1<=p35]]] & [[p180<=0 & 0<=p180] & ~ [E [[p127<=1 & 1<=p127] U [[p162<=0 & 0<=p162] | [1<=p125 & p125<=1]]]]]] | [[p107<=1 & 1<=p107] & [p37<=0 & 0<=p37]]]] | [~ [EX [~ [[[p23<=0 & 0<=p23] & [p1<=1 & 1<=p1]]]]] & [~ [EG [E [true U [p194<=1 & 1<=p194]]]] & ~ [E [E [true U [p194<=1 & 1<=p194]] U [~ [[[~ [EX [~ [[p143<=1 & 1<=p143]]]] | [p164<=1 & 1<=p164]] | [p113<=0 & 0<=p113]]] & E [true U [p194<=1 & 1<=p194]]]]]]]]

abstracting: (1<=p194)
states: 5,302,622 (6)
abstracting: (p194<=1)
states: 274,063,083 (8)
abstracting: (0<=p113)
states: 274,063,083 (8)
abstracting: (p113<=0)
states: 265,867,707 (8)
abstracting: (1<=p164)
states: 68,705 (4)
abstracting: (p164<=1)
states: 274,063,083 (8)
abstracting: (1<=p143)
states: 5,991,360 (6)
abstracting: (p143<=1)
states: 274,063,083 (8)

before gc: list nodes free: 1629758

after gc: idd nodes used:1182977, unused:62817023; list nodes free:288233894
.abstracting: (1<=p194)
states: 5,302,622 (6)
abstracting: (p194<=1)
states: 274,063,083 (8)

before gc: list nodes free: 3662839

after gc: idd nodes used:1293654, unused:62706346; list nodes free:287790609
MC time: 8m 2.002sec

checking: E [[[~ [[p184<=0 & 0<=p184]] | [EF [[[[p43<=0 & 0<=p43] | [p7<=1 & 1<=p7]] & [[p133<=0 & 0<=p133] | [p87<=1 & 1<=p87]]]] | EF [~ [[p121<=1 & 1<=p121]]]]] & [[[p104<=0 & 0<=p104] | [p163<=1 & 1<=p163]] | [~ [AG [[[p48<=1 & 1<=p48] | [p187<=0 & 0<=p187]]]] | [EX [0<=0] & [[[p15<=0 & 0<=p15] | [p160<=1 & 1<=p160]] | [[p128<=0 & 0<=p128] | [[p39<=1 & 1<=p39] | EF [[p179<=1 & 1<=p179]]]]]]]]] U ~ [[A [[[p18<=0 & 0<=p18] | [p154<=1 & 1<=p154]] U [p173<=1 & 1<=p173]] & [EX [[p12<=0 & 0<=p12]] & ~ [[[p63<=1 & 1<=p63] | [p26<=1 & 1<=p26]]]]]]]
normalized: E [[[[[[[[E [true U [p179<=1 & 1<=p179]] | [p39<=1 & 1<=p39]] | [p128<=0 & 0<=p128]] | [[p160<=1 & 1<=p160] | [p15<=0 & 0<=p15]]] & EX [0<=0]] | E [true U ~ [[[p187<=0 & 0<=p187] | [p48<=1 & 1<=p48]]]]] | [[p163<=1 & 1<=p163] | [p104<=0 & 0<=p104]]] & [[E [true U ~ [[p121<=1 & 1<=p121]]] | E [true U [[[p87<=1 & 1<=p87] | [p133<=0 & 0<=p133]] & [[p7<=1 & 1<=p7] | [p43<=0 & 0<=p43]]]]] | ~ [[p184<=0 & 0<=p184]]]] U ~ [[[~ [[[p26<=1 & 1<=p26] | [p63<=1 & 1<=p63]]] & EX [[p12<=0 & 0<=p12]]] & [~ [EG [~ [[p173<=1 & 1<=p173]]]] & ~ [E [~ [[p173<=1 & 1<=p173]] U [~ [[[p154<=1 & 1<=p154] | [p18<=0 & 0<=p18]]] & ~ [[p173<=1 & 1<=p173]]]]]]]]]

abstracting: (1<=p173)
states: 4,345,632 (6)
abstracting: (p173<=1)
states: 274,063,083 (8)
abstracting: (0<=p18)
states: 274,063,083 (8)
abstracting: (p18<=0)
states: 266,363,763 (8)
abstracting: (1<=p154)
states: 8,351,226 (6)
abstracting: (p154<=1)
states: 274,063,083 (8)
abstracting: (1<=p173)
states: 4,345,632 (6)
abstracting: (p173<=1)
states: 274,063,083 (8)
abstracting: (1<=p173)
states: 4,345,632 (6)
abstracting: (p173<=1)
states: 274,063,083 (8)
..................
EG iterations: 18
abstracting: (0<=p12)
states: 274,063,083 (8)
abstracting: (p12<=0)
states: 266,363,763 (8)
.abstracting: (1<=p63)
states: 5,931,561 (6)
abstracting: (p63<=1)
states: 274,063,083 (8)
abstracting: (1<=p26)
states: 6,286,874 (6)
abstracting: (p26<=1)
states: 274,063,083 (8)
abstracting: (0<=p184)
states: 274,063,083 (8)
abstracting: (p184<=0)
states: 269,441,351 (8)
abstracting: (0<=p43)
states: 274,063,083 (8)
abstracting: (p43<=0)
states: 268,919,661 (8)
abstracting: (1<=p7)
states: 4,901,252 (6)
abstracting: (p7<=1)
states: 274,063,083 (8)
abstracting: (0<=p133)
states: 274,063,083 (8)
abstracting: (p133<=0)
states: 265,711,857 (8)
abstracting: (1<=p87)
states: 7,184,571 (6)
abstracting: (p87<=1)
states: 274,063,083 (8)
abstracting: (1<=p121)
states: 5,483,648 (6)
abstracting: (p121<=1)
states: 274,063,083 (8)
abstracting: (0<=p104)
states: 274,063,083 (8)
abstracting: (p104<=0)
states: 267,300,498 (8)
abstracting: (1<=p163)
states: 5,949,447 (6)
abstracting: (p163<=1)
states: 274,063,083 (8)
abstracting: (1<=p48)
states: 5,027,840 (6)
abstracting: (p48<=1)
states: 274,063,083 (8)
abstracting: (0<=p187)
states: 274,063,083 (8)
abstracting: (p187<=0)
states: 262,870,342 (8)

before gc: list nodes free: 2853822

after gc: idd nodes used:1377803, unused:62622197; list nodes free:287331382
abstracting: (0<=0)
states: 274,063,083 (8)
.abstracting: (0<=p15)
states: 274,063,083 (8)
abstracting: (p15<=0)
states: 269,082,354 (8)
abstracting: (1<=p160)
states: 8,351,226 (6)
abstracting: (p160<=1)
states: 274,063,083 (8)
abstracting: (0<=p128)
states: 274,063,083 (8)
abstracting: (p128<=0)
states: 268,113,636 (8)
abstracting: (1<=p39)
states: 4,943,435 (6)
abstracting: (p39<=1)
states: 274,063,083 (8)
abstracting: (1<=p179)
states: 4,689,992 (6)
abstracting: (p179<=1)
states: 274,063,083 (8)
MC time: 5m22.001sec

checking: EF [EG [A [~ [[p98<=1 & 1<=p98]] U [p41<=1 & 1<=p41]]]]
normalized: E [true U EG [[~ [EG [~ [[p41<=1 & 1<=p41]]]] & ~ [E [~ [[p41<=1 & 1<=p41]] U [[p98<=1 & 1<=p98] & ~ [[p41<=1 & 1<=p41]]]]]]]]

abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)
abstracting: (1<=p98)
states: 5,488,332 (6)
abstracting: (p98<=1)
states: 274,063,083 (8)
abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)
abstracting: (1<=p41)
states: 7,699,320 (6)
abstracting: (p41<=1)
states: 274,063,083 (8)

before gc: list nodes free: 3141494

after gc: idd nodes used:1544183, unused:62455817; list nodes free:286539976
.....................
EG iterations: 21
......................
EG iterations: 22
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m50.259sec

checking: [EG [[[[~ [E [[p127<=1 & 1<=p127] U [[1<=p125 & p125<=1] | [p162<=0 & 0<=p162]]]] & [p180<=0 & 0<=p180]] & [[p140<=0 & 0<=p140] & [[p35<=1 & 1<=p35] & [p136<=1 & 1<=p136]]]] | [[p37<=0 & 0<=p37] & [p107<=1 & 1<=p107]]]] | [AX [[[p23<=0 & 0<=p23] & [p1<=1 & 1<=p1]]] & A [[[p113<=0 & 0<=p113] | [[p164<=1 & 1<=p164] | AX [[p143<=1 & 1<=p143]]]] U ~ [EF [[p194<=1 & 1<=p194]]]]]]
normalized: [[[~ [EG [E [true U [p194<=1 & 1<=p194]]]] & ~ [E [E [true U [p194<=1 & 1<=p194]] U [~ [[[~ [EX [~ [[p143<=1 & 1<=p143]]]] | [p164<=1 & 1<=p164]] | [p113<=0 & 0<=p113]]] & E [true U [p194<=1 & 1<=p194]]]]]] & ~ [EX [~ [[[p1<=1 & 1<=p1] & [p23<=0 & 0<=p23]]]]]] | EG [[[[p107<=1 & 1<=p107] & [p37<=0 & 0<=p37]] | [[[[p136<=1 & 1<=p136] & [p35<=1 & 1<=p35]] & [p140<=0 & 0<=p140]] & [[p180<=0 & 0<=p180] & ~ [E [[p127<=1 & 1<=p127] U [[p162<=0 & 0<=p162] | [1<=p125 & p125<=1]]]]]]]]]

abstracting: (p125<=1)
states: 274,063,083 (8)
abstracting: (1<=p125)
states: 8,272,686 (6)
abstracting: (0<=p162)
states: 274,063,083 (8)
abstracting: (p162<=0)
states: 265,711,857 (8)
abstracting: (1<=p127)
states: 8,272,686 (6)
abstracting: (p127<=1)
states: 274,063,083 (8)
abstracting: (0<=p180)
states: 274,063,083 (8)
abstracting: (p180<=0)
states: 269,022,911 (8)
abstracting: (0<=p140)
states: 274,063,083 (8)
abstracting: (p140<=0)
states: 267,230,838 (8)
abstracting: (1<=p35)
states: 7,699,320 (6)
abstracting: (p35<=1)
states: 274,063,083 (8)
abstracting: (1<=p136)
states: 8,351,226 (6)
abstracting: (p136<=1)
states: 274,063,083 (8)
abstracting: (0<=p37)
states: 274,063,083 (8)
abstracting: (p37<=0)
states: 266,363,763 (8)
abstracting: (1<=p107)
states: 6,762,585 (6)
abstracting: (p107<=1)
states: 274,063,083 (8)
..................
EG iterations: 18
abstracting: (0<=p23)
states: 274,063,083 (8)
abstracting: (p23<=0)
states: 266,698,101 (8)
abstracting: (1<=p1)
states: 66
abstracting: (p1<=1)
states: 274,063,083 (8)
.abstracting: (1<=p194)
states: 5,302,622 (6)
abstracting: (p194<=1)
states: 274,063,083 (8)

before gc: list nodes free: 2149498

after gc: idd nodes used:1556666, unused:62443334; list nodes free:286515817
abstracting: (0<=p113)
states: 274,063,083 (8)
abstracting: (p113<=0)
states: 265,867,707 (8)
abstracting: (1<=p164)
states: 68,705 (4)
abstracting: (p164<=1)
states: 274,063,083 (8)
abstracting: (1<=p143)
states: 5,991,360 (6)
abstracting: (p143<=1)
states: 274,063,083 (8)
.abstracting: (1<=p194)
states: 5,302,622 (6)
abstracting: (p194<=1)
states: 274,063,083 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6089832 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099728 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

85073 114477
iterations count:289111 (1156), effective:14881 (59)

initing FirstDep: 0m 0.000sec


iterations count:84179 (336), effective:4597 (18)

iterations count:67542 (270), effective:3533 (14)

sat_reach.icc:155: Timeout: after 307 sec


iterations count:257 (1), effective:1 (0)

iterations count:82872 (331), effective:4385 (17)

iterations count:257 (1), effective:1 (0)

iterations count:250 (1), effective:0 (0)

iterations count:257 (1), effective:1 (0)

iterations count:90926 (363), effective:4783 (19)
319269
iterations count:118011 (472), effective:6277 (25)

iterations count:90652 (362), effective:4733 (18)

iterations count:253 (1), effective:1 (0)

iterations count:250 (1), effective:0 (0)

iterations count:254 (1), effective:2 (0)

iterations count:44772 (179), effective:2370 (9)

iterations count:46794 (187), effective:2432 (9)

iterations count:250 (1), effective:0 (0)

iterations count:17196 (68), effective:885 (3)
272724
iterations count:108963 (435), effective:5743 (22)

iterations count:72210 (288), effective:3717 (14)

iterations count:19995 (79), effective:808 (3)

iterations count:250 (1), effective:0 (0)
379665
iterations count:138298 (553), effective:7042 (28)
265399
iterations count:111823 (447), effective:6089 (24)
265399
iterations count:111823 (447), effective:6089 (24)

sat_reach.icc:155: Timeout: after 481 sec


iterations count:46786 (187), effective:2336 (9)

iterations count:18809 (75), effective:900 (3)

iterations count:252 (1), effective:1 (0)

iterations count:15485 (61), effective:827 (3)

sat_reach.icc:155: Timeout: after 321 sec


iterations count:67542 (270), effective:3533 (14)

iterations count:49979 (199), effective:2599 (10)

iterations count:254 (1), effective:1 (0)
265399
iterations count:111823 (447), effective:6089 (24)
265399

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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is FlexibleBarrier-PT-04b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-tall-167838857200449"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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