About the Execution of Marcie+red for DiscoveryGPU-PT-08b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10424.796 | 3600000.00 | 3624931.00 | 10359.40 | TT?FT??T??????F? | normal |
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.r138-smll-167819420300321.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 DiscoveryGPU-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819420300321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 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 61K 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 DiscoveryGPU-PT-08b-CTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678744682364
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=DiscoveryGPU-PT-08b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 21:58:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 21:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 21:58:06] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-13 21:58:06] [INFO ] Transformed 240 places.
[2023-03-13 21:58:06] [INFO ] Transformed 254 transitions.
[2023-03-13 21:58:06] [INFO ] Found NUPN structural information;
[2023-03-13 21:58:06] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 105 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 228 transition count 254
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 27 place count 213 transition count 239
Iterating global reduction 1 with 15 rules applied. Total rules applied 42 place count 213 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 212 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 212 transition count 238
Applied a total of 44 rules in 90 ms. Remains 212 /240 variables (removed 28) and now considering 238/254 (removed 16) transitions.
// Phase 1: matrix 238 rows 212 cols
[2023-03-13 21:58:06] [INFO ] Computed 2 place invariants in 46 ms
[2023-03-13 21:58:07] [INFO ] Implicit Places using invariants in 490 ms returned []
[2023-03-13 21:58:07] [INFO ] Invariant cache hit.
[2023-03-13 21:58:07] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-13 21:58:07] [INFO ] Invariant cache hit.
[2023-03-13 21:58:07] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/240 places, 238/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1431 ms. Remains : 212/240 places, 238/254 transitions.
Support contains 105 out of 212 places after structural reductions.
[2023-03-13 21:58:08] [INFO ] Flatten gal took : 96 ms
[2023-03-13 21:58:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 21:58:08] [INFO ] Flatten gal took : 41 ms
[2023-03-13 21:58:08] [INFO ] Input system was already deterministic with 238 transitions.
Support contains 92 out of 212 places (down from 105) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 37 resets, run finished after 757 ms. (steps per millisecond=13 ) properties (out of 59) seen :55
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-13 21:58:09] [INFO ] Invariant cache hit.
[2023-03-13 21:58:09] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 21:58:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 21:58:10] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-13 21:58:10] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 13 ms to minimize.
[2023-03-13 21:58:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-03-13 21:58:10] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2023-03-13 21:58:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 171 ms
[2023-03-13 21:58:10] [INFO ] After 601ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 21:58:10] [INFO ] After 761ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=46 )
Parikh walk visited 1 properties in 4 ms.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 26 ms
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 29 ms
[2023-03-13 21:58:10] [INFO ] Input system was already deterministic with 238 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 199 transition count 182
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 152 transition count 182
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 95 place count 152 transition count 170
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 119 place count 140 transition count 170
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 130 place count 129 transition count 159
Iterating global reduction 2 with 11 rules applied. Total rules applied 141 place count 129 transition count 159
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 141 place count 129 transition count 158
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 128 transition count 158
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 149 place count 122 transition count 152
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 122 transition count 152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 117 transition count 147
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 117 transition count 147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 112 transition count 137
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 112 transition count 137
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 107 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 107 transition count 132
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 227 place count 86 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 84 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 84 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 82 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 82 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 81 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 81 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 239 place count 79 transition count 102
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 93 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 79 edges and 73 vertex of which 32 / 73 are part of one of the 16 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 2 with 28 rules applied. Total rules applied 267 place count 57 transition count 73
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 307 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 314 place count 26 transition count 43
Iterating global reduction 4 with 7 rules applied. Total rules applied 321 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 328 place count 19 transition count 29
Iterating global reduction 4 with 7 rules applied. Total rules applied 335 place count 19 transition count 29
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 342 place count 12 transition count 15
Iterating global reduction 4 with 7 rules applied. Total rules applied 349 place count 12 transition count 15
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 355 place count 6 transition count 9
Iterating global reduction 4 with 6 rules applied. Total rules applied 361 place count 6 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 6 transition count 8
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 363 place count 6 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 364 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 4 transition count 6
Applied a total of 365 rules in 131 ms. Remains 4 /212 variables (removed 208) and now considering 6/238 (removed 232) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 131 ms. Remains : 4/212 places, 6/238 transitions.
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 1 ms
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 0 ms
[2023-03-13 21:58:10] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 199 transition count 189
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 159 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 157 transition count 187
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 85 place count 157 transition count 175
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 109 place count 145 transition count 175
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 120 place count 134 transition count 164
Iterating global reduction 3 with 11 rules applied. Total rules applied 131 place count 134 transition count 164
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 131 place count 134 transition count 163
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 133 place count 133 transition count 163
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 137 place count 129 transition count 159
Iterating global reduction 3 with 4 rules applied. Total rules applied 141 place count 129 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 144 place count 126 transition count 156
Iterating global reduction 3 with 3 rules applied. Total rules applied 147 place count 126 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 149 place count 124 transition count 152
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 124 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 153 place count 122 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 122 transition count 150
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 193 place count 103 transition count 131
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 102 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 102 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 196 place count 101 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 197 place count 101 transition count 128
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 101 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 99 transition count 126
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 117 edges and 97 vertex of which 93 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 78 edges and 93 vertex of which 24 / 93 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 23 rules applied. Total rules applied 228 place count 81 transition count 102
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 33 rules applied. Total rules applied 261 place count 62 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 61 transition count 88
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 264 place count 59 transition count 84
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 59 transition count 84
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 267 place count 58 transition count 82
Iterating global reduction 6 with 1 rules applied. Total rules applied 268 place count 58 transition count 82
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 269 place count 57 transition count 80
Iterating global reduction 6 with 1 rules applied. Total rules applied 270 place count 57 transition count 80
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 56 transition count 79
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 56 transition count 79
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 274 place count 56 transition count 77
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 275 place count 56 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 276 place count 55 transition count 76
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 283 place count 48 transition count 69
Applied a total of 283 rules in 103 ms. Remains 48 /212 variables (removed 164) and now considering 69/238 (removed 169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 48/212 places, 69/238 transitions.
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:58:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:58:10] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 208 transition count 238
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 32 place count 180 transition count 210
Iterating global reduction 1 with 28 rules applied. Total rules applied 60 place count 180 transition count 210
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 172 transition count 202
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 172 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 166 transition count 195
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 166 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 161 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 161 transition count 189
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 156 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 156 transition count 181
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 152 transition count 177
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 152 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 149 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 149 transition count 174
Applied a total of 122 rules in 43 ms. Remains 149 /212 variables (removed 63) and now considering 174/238 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 149/212 places, 174/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 15 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 16 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 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 199 transition count 184
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 154 transition count 184
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 154 transition count 172
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 115 place count 142 transition count 172
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 126 place count 131 transition count 161
Iterating global reduction 2 with 11 rules applied. Total rules applied 137 place count 131 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 131 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 130 transition count 160
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 124 transition count 154
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 124 transition count 154
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 119 transition count 149
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 119 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 114 transition count 139
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 114 transition count 139
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 109 transition count 134
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 109 transition count 134
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 221 place count 89 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 223 place count 87 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 87 transition count 111
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 227 place count 85 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 230 place count 84 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 231 place count 84 transition count 107
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 232 place count 84 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 82 transition count 105
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 96 edges and 80 vertex of which 76 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 75 edges and 76 vertex of which 30 / 76 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 2 with 25 rules applied. Total rules applied 259 place count 61 transition count 79
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 38 rules applied. Total rules applied 297 place count 40 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 299 place count 38 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 299 place count 38 transition count 61
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 301 place count 37 transition count 61
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 308 place count 30 transition count 47
Iterating global reduction 5 with 7 rules applied. Total rules applied 315 place count 30 transition count 47
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 322 place count 23 transition count 33
Iterating global reduction 5 with 7 rules applied. Total rules applied 329 place count 23 transition count 33
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 334 place count 18 transition count 23
Iterating global reduction 5 with 5 rules applied. Total rules applied 339 place count 18 transition count 23
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 343 place count 14 transition count 19
Iterating global reduction 5 with 4 rules applied. Total rules applied 347 place count 14 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 348 place count 14 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 350 place count 13 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 352 place count 11 transition count 15
Applied a total of 352 rules in 72 ms. Remains 11 /212 variables (removed 201) and now considering 15/238 (removed 223) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 11/212 places, 15/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 208 transition count 238
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 34 place count 178 transition count 208
Iterating global reduction 1 with 30 rules applied. Total rules applied 64 place count 178 transition count 208
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 73 place count 169 transition count 199
Iterating global reduction 1 with 9 rules applied. Total rules applied 82 place count 169 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 162 transition count 191
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 162 transition count 191
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 155 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 155 transition count 182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 117 place count 148 transition count 171
Iterating global reduction 1 with 7 rules applied. Total rules applied 124 place count 148 transition count 171
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 142 transition count 165
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 142 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 140 place count 138 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 138 transition count 161
Applied a total of 144 rules in 31 ms. Remains 138 /212 variables (removed 74) and now considering 161/238 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 138/212 places, 161/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 14 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 203 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 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 202 transition count 189
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 160 transition count 189
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 85 place count 160 transition count 176
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 111 place count 147 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 124 place count 134 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 137 place count 134 transition count 163
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 134 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 133 transition count 162
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 127 transition count 156
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 127 transition count 156
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 122 transition count 151
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 122 transition count 151
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 117 transition count 141
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 117 transition count 141
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 176 place count 112 transition count 136
Iterating global reduction 2 with 5 rules applied. Total rules applied 181 place count 112 transition count 136
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 219 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 221 place count 91 transition count 114
Iterating global reduction 2 with 2 rules applied. Total rules applied 223 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 225 place count 89 transition count 111
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 228 place count 88 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 229 place count 88 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 88 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 233 place count 86 transition count 108
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 100 edges and 84 vertex of which 80 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 76 edges and 80 vertex of which 28 / 80 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 2 with 21 rules applied. Total rules applied 254 place count 66 transition count 86
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 34 rules applied. Total rules applied 288 place count 49 transition count 69
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 291 place count 46 transition count 69
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 298 place count 39 transition count 55
Iterating global reduction 5 with 7 rules applied. Total rules applied 305 place count 39 transition count 55
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 309 place count 35 transition count 47
Iterating global reduction 5 with 4 rules applied. Total rules applied 313 place count 35 transition count 47
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 314 place count 34 transition count 45
Iterating global reduction 5 with 1 rules applied. Total rules applied 315 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 316 place count 33 transition count 44
Iterating global reduction 5 with 1 rules applied. Total rules applied 317 place count 33 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 33 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 32 transition count 42
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 5 with 7 rules applied. Total rules applied 327 place count 25 transition count 35
Applied a total of 327 rules in 54 ms. Remains 25 /212 variables (removed 187) and now considering 35/238 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 25/212 places, 35/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 35 transitions.
Finished random walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 209 transition count 238
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 180 transition count 209
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 180 transition count 209
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 68 place count 173 transition count 202
Iterating global reduction 1 with 7 rules applied. Total rules applied 75 place count 173 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 169 transition count 198
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 169 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 166 transition count 193
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 166 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 163 transition count 189
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 163 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 161 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 161 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 160 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 160 transition count 186
Applied a total of 101 rules in 23 ms. Remains 160 /212 variables (removed 52) and now considering 186/238 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 160/212 places, 186/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 11 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 11 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 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 199 transition count 184
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 154 transition count 184
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 154 transition count 171
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 117 place count 141 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 127 place count 131 transition count 161
Iterating global reduction 2 with 10 rules applied. Total rules applied 137 place count 131 transition count 161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 125 transition count 155
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 125 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 120 transition count 150
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 120 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 115 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 115 transition count 140
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 110 transition count 135
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 110 transition count 135
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 2 with 44 rules applied. Total rules applied 223 place count 88 transition count 113
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 225 place count 86 transition count 110
Iterating global reduction 2 with 2 rules applied. Total rules applied 227 place count 86 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 229 place count 84 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 231 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 83 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 83 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 83 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 81 transition count 104
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 10 rules applied. Total rules applied 246 place count 80 transition count 95
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 11 rules applied. Total rules applied 257 place count 71 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 258 place count 70 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 258 place count 70 transition count 92
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 260 place count 69 transition count 92
Applied a total of 260 rules in 34 ms. Remains 69 /212 variables (removed 143) and now considering 92/238 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 69/212 places, 92/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 5 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 208 transition count 238
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 37 place count 175 transition count 205
Iterating global reduction 1 with 33 rules applied. Total rules applied 70 place count 175 transition count 205
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 167 transition count 197
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 167 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 160 transition count 189
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 160 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 153 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 153 transition count 180
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 146 transition count 169
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 146 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 140 transition count 163
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 140 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 136 transition count 159
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 136 transition count 159
Applied a total of 148 rules in 22 ms. Remains 136 /212 variables (removed 76) and now considering 159/238 (removed 79) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 136/212 places, 159/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 200 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 199 transition count 185
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 155 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 154 transition count 184
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 91 place count 154 transition count 173
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 113 place count 143 transition count 173
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 124 place count 132 transition count 162
Iterating global reduction 3 with 11 rules applied. Total rules applied 135 place count 132 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 135 place count 132 transition count 161
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 137 place count 131 transition count 161
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 142 place count 126 transition count 156
Iterating global reduction 3 with 5 rules applied. Total rules applied 147 place count 126 transition count 156
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 152 place count 121 transition count 151
Iterating global reduction 3 with 5 rules applied. Total rules applied 157 place count 121 transition count 151
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 161 place count 117 transition count 143
Iterating global reduction 3 with 4 rules applied. Total rules applied 165 place count 117 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 169 place count 113 transition count 139
Iterating global reduction 3 with 4 rules applied. Total rules applied 173 place count 113 transition count 139
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 213 place count 93 transition count 119
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 215 place count 91 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 217 place count 91 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 219 place count 89 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 221 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 222 place count 88 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 223 place count 88 transition count 112
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 88 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 227 place count 86 transition count 110
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 102 edges and 84 vertex of which 80 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 76 edges and 80 vertex of which 26 / 80 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 26 rules applied. Total rules applied 253 place count 67 transition count 83
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 37 rules applied. Total rules applied 290 place count 45 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 292 place count 43 transition count 68
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 298 place count 37 transition count 56
Iterating global reduction 6 with 6 rules applied. Total rules applied 304 place count 37 transition count 56
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 310 place count 31 transition count 44
Iterating global reduction 6 with 6 rules applied. Total rules applied 316 place count 31 transition count 44
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 320 place count 27 transition count 36
Iterating global reduction 6 with 4 rules applied. Total rules applied 324 place count 27 transition count 36
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 327 place count 24 transition count 33
Iterating global reduction 6 with 3 rules applied. Total rules applied 330 place count 24 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 332 place count 23 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 333 place count 23 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 335 place count 22 transition count 30
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 338 place count 19 transition count 27
Applied a total of 338 rules in 41 ms. Remains 19 /212 variables (removed 193) and now considering 27/238 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 19/212 places, 27/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 1 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 208 transition count 238
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 31 place count 181 transition count 211
Iterating global reduction 1 with 27 rules applied. Total rules applied 58 place count 181 transition count 211
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 174 transition count 204
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 174 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 169 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 169 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 164 transition count 193
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 164 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 160 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 160 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 157 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 157 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 154 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 154 transition count 179
Applied a total of 112 rules in 24 ms. Remains 154 /212 variables (removed 58) and now considering 179/238 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 154/212 places, 179/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Graph (complete) has 388 edges and 212 vertex of which 203 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 202 transition count 198
Reduce places removed 33 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 169 transition count 194
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 165 transition count 194
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 75 place count 165 transition count 183
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 97 place count 154 transition count 183
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 105 place count 146 transition count 175
Iterating global reduction 3 with 8 rules applied. Total rules applied 113 place count 146 transition count 175
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 141 transition count 170
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 141 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 137 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 137 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 134 transition count 160
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 134 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 140 place count 131 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 143 place count 131 transition count 157
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 179 place count 113 transition count 139
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 113 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 185 place count 111 transition count 137
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 193 place count 110 transition count 130
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 204 place count 103 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 209 place count 101 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 212 place count 98 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 212 place count 98 transition count 122
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 214 place count 97 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 216 place count 96 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 218 place count 96 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 220 place count 95 transition count 118
Applied a total of 220 rules in 38 ms. Remains 95 /212 variables (removed 117) and now considering 118/238 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 95/212 places, 118/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 6 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 7 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 238/238 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 208 transition count 238
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 35 place count 177 transition count 207
Iterating global reduction 1 with 31 rules applied. Total rules applied 66 place count 177 transition count 207
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 169 transition count 199
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 169 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 163 transition count 192
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 163 transition count 192
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 100 place count 157 transition count 184
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 157 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 152 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 152 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 148 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 148 transition count 173
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 146 transition count 171
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 146 transition count 171
Applied a total of 128 rules in 22 ms. Remains 146 /212 variables (removed 66) and now considering 171/238 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 146/212 places, 171/238 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 9 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 10 ms
[2023-03-13 21:58:11] [INFO ] Input system was already deterministic with 171 transitions.
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 13 ms
[2023-03-13 21:58:11] [INFO ] Flatten gal took : 12 ms
[2023-03-13 21:58:11] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-13 21:58:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 212 places, 238 transitions and 623 arcs took 2 ms.
Total runtime 5824 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: 212 NrTr: 238 NrArc: 623)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.008sec
net check time: 0m 0.000sec
init dd package: 0m 3.602sec
RS generation: 6m30.807sec
-> reachability set: #nodes 566483 (5.7e+05) #states 2,504,676,581,734 (12)
starting MCC model checker
--------------------------
checking: EF [EG [[p197<=0 & 0<=p197]]]
normalized: E [true U EG [[p197<=0 & 0<=p197]]]
abstracting: (0<=p197)
states: 2,504,676,581,734 (12)
abstracting: (p197<=0)
states: 2,412,899,158,430 (12)
.
before gc: list nodes free: 1821317
after gc: idd nodes used:1906856, unused:62093144; list nodes free:294941222
......................MC time: 4m28.020sec
checking: EF [[[p10<=0 & 0<=p10] & AG [~ [[p203<=1 & 1<=p203]]]]]
normalized: E [true U [~ [E [true U [p203<=1 & 1<=p203]]] & [p10<=0 & 0<=p10]]]
abstracting: (0<=p10)
states: 2,504,676,581,734 (12)
abstracting: (p10<=0)
states: 2,413,226,118,454 (12)
abstracting: (1<=p203)
states: 352,822,289,962 (11)
abstracting: (p203<=1)
states: 2,504,676,581,734 (12)
before gc: list nodes free: 1865916
after gc: idd nodes used:1532901, unused:62467099; list nodes free:305543080
MC time: 4m 5.014sec
checking: EF [EX [[[p44<=0 & 0<=p44] & [p201<=1 & 1<=p201]]]]
normalized: E [true U EX [[[p201<=1 & 1<=p201] & [p44<=0 & 0<=p44]]]]
abstracting: (0<=p44)
states: 2,504,676,581,734 (12)
abstracting: (p44<=0)
states: 2,412,542,459,158 (12)
abstracting: (1<=p201)
states: 424,318,994,696 (11)
abstracting: (p201<=1)
states: 2,504,676,581,734 (12)
.MC time: 3m45.108sec
checking: EF [EG [[AF [EG [[p197<=1 & 1<=p197]]] | [AF [[p55<=0 & 0<=p55]] & [[p34<=1 & 1<=p34] & [p142<=1 & 1<=p142]]]]]]
normalized: E [true U EG [[[[[p142<=1 & 1<=p142] & [p34<=1 & 1<=p34]] & ~ [EG [~ [[p55<=0 & 0<=p55]]]]] | ~ [EG [~ [EG [[p197<=1 & 1<=p197]]]]]]]]
abstracting: (1<=p197)
states: 91,777,423,304 (10)
abstracting: (p197<=1)
states: 2,504,676,581,734 (12)
before gc: list nodes free: 16998366
after gc: idd nodes used:2750408, unused:61249592; list nodes free:298842850
........................................................................................
EG iterations: 88
MC time: 3m26.199sec
checking: ~ [E [EX [~ [[[p11<=0 & 0<=p11] | [p178<=1 & 1<=p178]]]] U AX [E [[p143<=0 & 0<=p143] U [p177<=1 & 1<=p177]]]]]
normalized: ~ [E [EX [~ [[[p178<=1 & 1<=p178] | [p11<=0 & 0<=p11]]]] U ~ [EX [~ [E [[p143<=0 & 0<=p143] U [p177<=1 & 1<=p177]]]]]]]
abstracting: (1<=p177)
states: 108,162,896,763 (11)
abstracting: (p177<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p143)
states: 2,504,676,581,734 (12)
abstracting: (p143<=0)
states: 2,412,434,410,998 (12)
before gc: list nodes free: 13026684
after gc: idd nodes used:1776406, unused:62223594; list nodes free:304396656
MC time: 3m 9.034sec
checking: EF [[AG [[EF [[p8<=1 & 1<=p8]] & [[[p92<=0 & 0<=p92] & [p87<=1 & 1<=p87]] | EF [[[p125<=0 & 0<=p125] & [p194<=1 & 1<=p194]]]]]] | AF [[p192<=1 & 1<=p192]]]]
normalized: E [true U [~ [EG [~ [[p192<=1 & 1<=p192]]]] | ~ [E [true U ~ [[[E [true U [[p194<=1 & 1<=p194] & [p125<=0 & 0<=p125]]] | [[p87<=1 & 1<=p87] & [p92<=0 & 0<=p92]]] & E [true U [p8<=1 & 1<=p8]]]]]]]]
abstracting: (1<=p8)
states: 91,397,418,697 (10)
abstracting: (p8<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p92)
states: 2,504,676,581,734 (12)
abstracting: (p92<=0)
states: 2,391,979,184,722 (12)
abstracting: (1<=p87)
states: 100,385,826,750 (11)
abstracting: (p87<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p125)
states: 2,504,676,581,734 (12)
abstracting: (p125<=0)
states: 2,412,434,410,998 (12)
abstracting: (1<=p194)
states: 91,838,674,990 (10)
abstracting: (p194<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p192)
states: 91,838,674,990 (10)
abstracting: (p192<=1)
states: 2,504,676,581,734 (12)
MC time: 2m53.228sec
checking: AF [AG [[[EX [[p39<=0 & 0<=p39]] | [p159<=0 & 0<=p159]] | [[p104<=1 & 1<=p104] | [[[p102<=0 & 0<=p102] & [p155<=1 & 1<=p155]] | [[p196<=0 & 0<=p196] & [p38<=1 & 1<=p38]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[[p38<=1 & 1<=p38] & [p196<=0 & 0<=p196]] | [[p155<=1 & 1<=p155] & [p102<=0 & 0<=p102]]] | [p104<=1 & 1<=p104]] | [[p159<=0 & 0<=p159] | EX [[p39<=0 & 0<=p39]]]]]]]]
abstracting: (0<=p39)
states: 2,504,676,581,734 (12)
abstracting: (p39<=0)
states: 2,402,159,532,838 (12)
.abstracting: (0<=p159)
states: 2,504,676,581,734 (12)
abstracting: (p159<=0)
states: 2,415,672,062,518 (12)
abstracting: (1<=p104)
states: 100,449,466,416 (11)
abstracting: (p104<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p102)
states: 2,504,676,581,734 (12)
abstracting: (p102<=0)
states: 2,404,301,943,022 (12)
abstracting: (1<=p155)
states: 98,996,490,912 (10)
abstracting: (p155<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p196)
states: 2,504,676,581,734 (12)
abstracting: (p196<=0)
states: 2,401,910,552,864 (12)
abstracting: (1<=p38)
states: 102,517,048,896 (11)
abstracting: (p38<=1)
states: 2,504,676,581,734 (12)
.
EG iterations: 1
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m12.366sec
checking: AF [[EG [EX [[[p25<=0 & 0<=p25] | [p170<=1 & 1<=p170]]]] | [[AF [[p174<=0 & 0<=p174]] & EX [[p117<=0 & 0<=p117]]] & [EG [[~ [[p141<=0 & 0<=p141]] & ~ [[p51<=1 & 1<=p51]]]] & [[p25<=1 & 1<=p25] & EF [[p137<=1 & 1<=p137]]]]]]]
normalized: ~ [EG [~ [[[[[E [true U [p137<=1 & 1<=p137]] & [p25<=1 & 1<=p25]] & EG [[~ [[p51<=1 & 1<=p51]] & ~ [[p141<=0 & 0<=p141]]]]] & [EX [[p117<=0 & 0<=p117]] & ~ [EG [~ [[p174<=0 & 0<=p174]]]]]] | EG [EX [[[p170<=1 & 1<=p170] | [p25<=0 & 0<=p25]]]]]]]]
abstracting: (0<=p25)
states: 2,504,676,581,734 (12)
abstracting: (p25<=0)
states: 2,408,005,771,810 (12)
abstracting: (1<=p170)
states: 99,628,148,688 (10)
abstracting: (p170<=1)
states: 2,504,676,581,734 (12)
before gc: list nodes free: 11022082
after gc: idd nodes used:3967528, unused:60032472; list nodes free:293845176
.MC time: 2m47.130sec
checking: [EF [[[~ [E [[p74<=0 & 0<=p74] U [[p67<=0 & 0<=p67] | [p168<=1 & 1<=p168]]]] | [p198<=1 & 1<=p198]] & [[[p84<=0 & 0<=p84] & [p14<=1 & 1<=p14]] | EF [[[p125<=0 & 0<=p125] & [p192<=1 & 1<=p192]]]]]] | A [[AG [[p47<=0 & 0<=p47]] & [[[p98<=0 & 0<=p98] | [p152<=1 & 1<=p152]] & [p130<=0 & 0<=p130]]] U [[p54<=1 & 1<=p54] & AX [[p100<=1 & 1<=p100]]]]]
normalized: [[~ [EG [~ [[~ [EX [~ [[p100<=1 & 1<=p100]]]] & [p54<=1 & 1<=p54]]]]] & ~ [E [~ [[~ [EX [~ [[p100<=1 & 1<=p100]]]] & [p54<=1 & 1<=p54]]] U [~ [[[[p130<=0 & 0<=p130] & [[p152<=1 & 1<=p152] | [p98<=0 & 0<=p98]]] & ~ [E [true U ~ [[p47<=0 & 0<=p47]]]]]] & ~ [[~ [EX [~ [[p100<=1 & 1<=p100]]]] & [p54<=1 & 1<=p54]]]]]]] | E [true U [[E [true U [[p192<=1 & 1<=p192] & [p125<=0 & 0<=p125]]] | [[p14<=1 & 1<=p14] & [p84<=0 & 0<=p84]]] & [[p198<=1 & 1<=p198] | ~ [E [[p74<=0 & 0<=p74] U [[p168<=1 & 1<=p168] | [p67<=0 & 0<=p67]]]]]]]]
abstracting: (0<=p67)
states: 2,504,676,581,734 (12)
abstracting: (p67<=0)
states: 2,408,407,951,654 (12)
abstracting: (1<=p168)
states: 89,011,523,820 (10)
abstracting: (p168<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p74)
states: 2,504,676,581,734 (12)
abstracting: (p74<=0)
states: 2,408,460,346,632 (12)
abstracting: (1<=p198)
states: 383
abstracting: (p198<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p84)
states: 2,504,676,581,734 (12)
abstracting: (p84<=0)
states: 2,404,290,754,984 (12)
abstracting: (1<=p14)
states: 101,833,389,600 (11)
abstracting: (p14<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p125)
states: 2,504,676,581,734 (12)
abstracting: (p125<=0)
states: 2,412,434,410,998 (12)
abstracting: (1<=p192)
states: 91,838,674,990 (10)
abstracting: (p192<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p54)
states: 92,140,996,048 (10)
abstracting: (p54<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p100)
states: 112,704,884,500 (11)
abstracting: (p100<=1)
states: 2,504,676,581,734 (12)
MC time: 2m31.020sec
checking: EG [[EG [[[[[[[0<=p16 & p16<=0] | [p22<=1 & 1<=p22]] | [p162<=1 & 1<=p162]] & [[[p10<=0 & 0<=p10] | [p164<=1 & 1<=p164]] & [[p59<=0 & 0<=p59] | [p73<=1 & 1<=p73]]]] | [[p155<=0 & 0<=p155] & [p179<=1 & 1<=p179]]] | EF [[p59<=0 & 0<=p59]]]] | [AG [[p131<=1 & 1<=p131]] & [~ [A [[p180<=0 & 0<=p180] U [p31<=1 & 1<=p31]]] | [[p60<=0 & 0<=p60] | [p113<=1 & 1<=p113]]]]]]
normalized: EG [[[[[[p113<=1 & 1<=p113] | [p60<=0 & 0<=p60]] | ~ [[~ [EG [~ [[p31<=1 & 1<=p31]]]] & ~ [E [~ [[p31<=1 & 1<=p31]] U [~ [[p180<=0 & 0<=p180]] & ~ [[p31<=1 & 1<=p31]]]]]]]] & ~ [E [true U ~ [[p131<=1 & 1<=p131]]]]] | EG [[E [true U [p59<=0 & 0<=p59]] | [[[p179<=1 & 1<=p179] & [p155<=0 & 0<=p155]] | [[[[p73<=1 & 1<=p73] | [p59<=0 & 0<=p59]] & [[p164<=1 & 1<=p164] | [p10<=0 & 0<=p10]]] & [[p162<=1 & 1<=p162] | [[p22<=1 & 1<=p22] | [0<=p16 & p16<=0]]]]]]]]]
abstracting: (p16<=0)
states: 2,413,273,250,066 (12)
abstracting: (0<=p16)
states: 2,504,676,581,734 (12)
abstracting: (1<=p22)
states: 96,670,809,924 (10)
abstracting: (p22<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p162)
states: 99,561,924,070 (10)
abstracting: (p162<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p10)
states: 2,504,676,581,734 (12)
abstracting: (p10<=0)
states: 2,413,226,118,454 (12)
abstracting: (1<=p164)
states: 93,982,313,542 (10)
abstracting: (p164<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p59)
states: 2,504,676,581,734 (12)
abstracting: (p59<=0)
states: 2,408,400,962,662 (12)
abstracting: (1<=p73)
states: 101,236,002,942 (11)
abstracting: (p73<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p155)
states: 2,504,676,581,734 (12)
abstracting: (p155<=0)
states: 2,405,680,090,822 (12)
abstracting: (1<=p179)
states: 102,288,920,250 (11)
abstracting: (p179<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p59)
states: 2,504,676,581,734 (12)
abstracting: (p59<=0)
states: 2,408,400,962,662 (12)
EG iterations: 0
abstracting: (1<=p131)
states: 92,186,439,202 (10)
abstracting: (p131<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p31)
states: 102,424,006,352 (11)
abstracting: (p31<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p180)
states: 2,504,676,581,734 (12)
abstracting: (p180<=0)
states: 2,412,892,260,780 (12)
abstracting: (1<=p31)
states: 102,424,006,352 (11)
abstracting: (p31<=1)
states: 2,504,676,581,734 (12)
MC time: 2m18.171sec
checking: A [~ [[[p20<=0 & 0<=p20] | [p162<=1 & 1<=p162]]] U [EF [[~ [[[[p59<=0 & 0<=p59] | [p144<=1 & 1<=p144]] | [[p192<=0 & 0<=p192] | [p47<=1 & 1<=p47]]]] & [p38<=1 & 1<=p38]]] | [~ [[EF [EX [[p86<=1 & 1<=p86]]] & E [EF [[[p105<=0 & 0<=p105] | [p175<=1 & 1<=p175]]] U EG [[[p109<=0 & 0<=p109] | [p17<=1 & 1<=p17]]]]]] & EX [EF [[[p77<=0 & 0<=p77] | [[p74<=1 & 1<=p74] | [p173<=0 & 0<=p173]]]]]]]]
normalized: [~ [EG [~ [[[EX [E [true U [[[p173<=0 & 0<=p173] | [p74<=1 & 1<=p74]] | [p77<=0 & 0<=p77]]]] & ~ [[E [E [true U [[p175<=1 & 1<=p175] | [p105<=0 & 0<=p105]]] U EG [[[p17<=1 & 1<=p17] | [p109<=0 & 0<=p109]]]] & E [true U EX [[p86<=1 & 1<=p86]]]]]] | E [true U [[p38<=1 & 1<=p38] & ~ [[[[p47<=1 & 1<=p47] | [p192<=0 & 0<=p192]] | [[p144<=1 & 1<=p144] | [p59<=0 & 0<=p59]]]]]]]]]] & ~ [E [~ [[[EX [E [true U [[[p173<=0 & 0<=p173] | [p74<=1 & 1<=p74]] | [p77<=0 & 0<=p77]]]] & ~ [[E [E [true U [[p175<=1 & 1<=p175] | [p105<=0 & 0<=p105]]] U EG [[[p17<=1 & 1<=p17] | [p109<=0 & 0<=p109]]]] & E [true U EX [[p86<=1 & 1<=p86]]]]]] | E [true U [[p38<=1 & 1<=p38] & ~ [[[[p47<=1 & 1<=p47] | [p192<=0 & 0<=p192]] | [[p144<=1 & 1<=p144] | [p59<=0 & 0<=p59]]]]]]]] U [[[p162<=1 & 1<=p162] | [p20<=0 & 0<=p20]] & ~ [[[EX [E [true U [[[p173<=0 & 0<=p173] | [p74<=1 & 1<=p74]] | [p77<=0 & 0<=p77]]]] & ~ [[E [E [true U [[p175<=1 & 1<=p175] | [p105<=0 & 0<=p105]]] U EG [[[p17<=1 & 1<=p17] | [p109<=0 & 0<=p109]]]] & E [true U EX [[p86<=1 & 1<=p86]]]]]] | E [true U [[p38<=1 & 1<=p38] & ~ [[[[p47<=1 & 1<=p47] | [p192<=0 & 0<=p192]] | [[p144<=1 & 1<=p144] | [p59<=0 & 0<=p59]]]]]]]]]]]]
abstracting: (0<=p59)
states: 2,504,676,581,734 (12)
abstracting: (p59<=0)
states: 2,408,400,962,662 (12)
abstracting: (1<=p144)
states: 92,242,170,736 (10)
abstracting: (p144<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p192)
states: 2,504,676,581,734 (12)
abstracting: (p192<=0)
states: 2,412,837,906,744 (12)
abstracting: (1<=p47)
states: 97,352,408,184 (10)
abstracting: (p47<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p38)
states: 102,517,048,896 (11)
abstracting: (p38<=1)
states: 2,504,676,581,734 (12)
before gc: list nodes free: 10343766
after gc: idd nodes used:4506315, unused:59493685; list nodes free:291621947
abstracting: (1<=p86)
states: 111,959,122,848 (11)
abstracting: (p86<=1)
states: 2,504,676,581,734 (12)
MC time: 2m 5.002sec
checking: [A [E [[p58<=1 & 1<=p58] U [p104<=1 & 1<=p104]] U [[A [[p134<=1 & 1<=p134] U [[p3<=0 & 0<=p3] | [p120<=1 & 1<=p120]]] | [p28<=1 & 1<=p28]] | [[p30<=0 & 0<=p30] | [p108<=1 & 1<=p108]]]] & [AF [[~ [A [[p192<=1 & 1<=p192] U [p25<=0 & 0<=p25]]] & [[p204<=1 & 1<=p204] & [[[p33<=0 & 0<=p33] | [p128<=1 & 1<=p128]] | [[p36<=0 & 0<=p36] | [p73<=1 & 1<=p73]]]]]] & [EF [[p168<=0 & 0<=p168]] | ~ [E [[p62<=1 & 1<=p62] U ~ [[~ [[p207<=0 & 0<=p207]] | [[p159<=1 & 1<=p159] | [p126<=1 & 1<=p126]]]]]]]]]
normalized: [[[~ [E [[p62<=1 & 1<=p62] U ~ [[[[p126<=1 & 1<=p126] | [p159<=1 & 1<=p159]] | ~ [[p207<=0 & 0<=p207]]]]]] | E [true U [p168<=0 & 0<=p168]]] & ~ [EG [~ [[[[[[p73<=1 & 1<=p73] | [p36<=0 & 0<=p36]] | [[p128<=1 & 1<=p128] | [p33<=0 & 0<=p33]]] & [p204<=1 & 1<=p204]] & ~ [[~ [EG [~ [[p25<=0 & 0<=p25]]]] & ~ [E [~ [[p25<=0 & 0<=p25]] U [~ [[p192<=1 & 1<=p192]] & ~ [[p25<=0 & 0<=p25]]]]]]]]]]]] & [~ [EG [~ [[[[p108<=1 & 1<=p108] | [p30<=0 & 0<=p30]] | [[p28<=1 & 1<=p28] | [~ [EG [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]] & ~ [E [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]] U [~ [[p134<=1 & 1<=p134]] & ~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]]]]]]]]] & ~ [E [~ [[[[p108<=1 & 1<=p108] | [p30<=0 & 0<=p30]] | [[p28<=1 & 1<=p28] | [~ [EG [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]] & ~ [E [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]] U [~ [[p134<=1 & 1<=p134]] & ~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]]]]]]] U [~ [E [[p58<=1 & 1<=p58] U [p104<=1 & 1<=p104]]] & ~ [[[[p108<=1 & 1<=p108] | [p30<=0 & 0<=p30]] | [[p28<=1 & 1<=p28] | [~ [EG [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]] & ~ [E [~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]] U [~ [[p134<=1 & 1<=p134]] & ~ [[[p120<=1 & 1<=p120] | [p3<=0 & 0<=p3]]]]]]]]]]]]]]]
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p134)
states: 92,235,166,152 (10)
abstracting: (p134<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
............................
EG iterations: 28
abstracting: (1<=p28)
states: 91,458,292,016 (10)
abstracting: (p28<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p30)
states: 2,504,676,581,734 (12)
abstracting: (p30<=0)
states: 2,413,218,289,718 (12)
abstracting: (1<=p108)
states: 100,385,998,124 (11)
abstracting: (p108<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p104)
states: 100,449,466,416 (11)
abstracting: (p104<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p58)
states: 96,207,143,593 (10)
abstracting: (p58<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p134)
states: 92,235,166,152 (10)
abstracting: (p134<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
............................
EG iterations: 28
abstracting: (1<=p28)
states: 91,458,292,016 (10)
abstracting: (p28<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p30)
states: 2,504,676,581,734 (12)
abstracting: (p30<=0)
states: 2,413,218,289,718 (12)
abstracting: (1<=p108)
states: 100,385,998,124 (11)
abstracting: (p108<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (1<=p134)
states: 92,235,166,152 (10)
abstracting: (p134<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p3)
states: 2,504,676,581,734 (12)
abstracting: (p3<=0)
states: 2,504,676,576,297 (12)
abstracting: (1<=p120)
states: 100,449,466,416 (11)
abstracting: (p120<=1)
states: 2,504,676,581,734 (12)
............................
EG iterations: 28
abstracting: (1<=p28)
states: 91,458,292,016 (10)
abstracting: (p28<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p30)
states: 2,504,676,581,734 (12)
abstracting: (p30<=0)
states: 2,413,218,289,718 (12)
abstracting: (1<=p108)
states: 100,385,998,124 (11)
abstracting: (p108<=1)
states: 2,504,676,581,734 (12)
.
EG iterations: 1
abstracting: (0<=p25)
states: 2,504,676,581,734 (12)
abstracting: (p25<=0)
states: 2,408,005,771,810 (12)
abstracting: (1<=p192)
states: 91,838,674,990 (10)
abstracting: (p192<=1)
states: 2,504,676,581,734 (12)
abstracting: (0<=p25)
states: 2,504,676,581,734 (12)
abstracting: (p25<=0)
states: 2,408,005,771,810 (12)
abstracting: (0<=p25)
states: 2,504,676,581,734 (12)
abstracting: (p25<=0)
states: 2,408,005,771,810 (12)
...........MC time: 1m54.000sec
checking: EF [EG [[p197<=0 & 0<=p197]]]
normalized: E [true U EG [[p197<=0 & 0<=p197]]]
abstracting: (0<=p197)
states: 2,504,676,581,734 (12)
abstracting: (p197<=0)
states: 2,412,899,158,430 (12)
...................
before gc: list nodes free: 5788056
after gc: idd nodes used:9604435, unused:54395565; list nodes free:263269308
..............................
before gc: list nodes free: 2244021
after gc: idd nodes used:9045573, unused:54954427; list nodes free:266977638
.......................................
EG iterations: 88
-> the formula is TRUE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5724360 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103068 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
550002
iterations count:113868 (478), effective:4550 (19)
initing FirstDep: 0m 0.000sec
net_ddint.h:600: Timeout: after 267 sec
sat_reach.icc:155: Timeout: after 244 sec
sat_reach.icc:155: Timeout: after 224 sec
net_ddint.h:600: Timeout: after 205 sec
sat_reach.icc:155: Timeout: after 188 sec
iterations count:253 (1), effective:8 (0)
iterations count:1001 (4), effective:22 (0)
iterations count:258 (1), effective:9 (0)
net_ddint.h:600: Timeout: after 172 sec
net_ddint.h:600: Timeout: after 166 sec
iterations count:240 (1), effective:1 (0)
iterations count:1023 (4), effective:24 (0)
iterations count:239 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 150 sec
iterations count:242 (1), effective:1 (0)
iterations count:268 (1), effective:3 (0)
sat_reach.icc:155: Timeout: after 137 sec
iterations count:3605 (15), effective:98 (0)
net_ddint.h:600: Timeout: after 124 sec
iterations count:238 (1), effective:0 (0)
iterations count:978 (4), effective:19 (0)
iterations count:238 (1), effective:0 (0)
iterations count:238 (1), effective:0 (0)
iterations count:338 (1), effective:3 (0)
net_ddint.h:600: Timeout: after 113 sec
iterations count:466 (1), effective:11 (0)
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="DiscoveryGPU-PT-08b"
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 DiscoveryGPU-PT-08b, 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 r138-smll-167819420300321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b 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 '
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 ;