About the Execution of Marcie+red for GPUForwardProgress-PT-04b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6174.191 | 31091.00 | 41597.00 | 540.80 | TFTTTFTFFTFFFTTT | 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.r202-smll-167840348100010.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 GPUForwardProgress-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348100010
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 14:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 14:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 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 27K 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 GPUForwardProgress-PT-04b-CTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678517043908
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 06:44:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 06:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:44:07] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-11 06:44:07] [INFO ] Transformed 112 places.
[2023-03-11 06:44:07] [INFO ] Transformed 117 transitions.
[2023-03-11 06:44:07] [INFO ] Found NUPN structural information;
[2023-03-11 06:44:07] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 66 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 109 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 115
Applied a total of 5 rules in 45 ms. Remains 109 /112 variables (removed 3) and now considering 115/117 (removed 2) transitions.
// Phase 1: matrix 115 rows 109 cols
[2023-03-11 06:44:08] [INFO ] Computed 5 place invariants in 15 ms
[2023-03-11 06:44:08] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-11 06:44:08] [INFO ] Invariant cache hit.
[2023-03-11 06:44:08] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2023-03-11 06:44:08] [INFO ] Invariant cache hit.
[2023-03-11 06:44:08] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/112 places, 115/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 922 ms. Remains : 109/112 places, 115/117 transitions.
Support contains 66 out of 109 places after structural reductions.
[2023-03-11 06:44:09] [INFO ] Flatten gal took : 60 ms
[2023-03-11 06:44:09] [INFO ] Flatten gal took : 24 ms
[2023-03-11 06:44:09] [INFO ] Input system was already deterministic with 115 transitions.
Support contains 64 out of 109 places (down from 66) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 65) seen :61
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 06:44:10] [INFO ] Invariant cache hit.
[2023-03-11 06:44:10] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 06:44:10] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 5 ms returned sat
[2023-03-11 06:44:10] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-11 06:44:10] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 06:44:10] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-11 06:44:10] [INFO ] Flatten gal took : 16 ms
[2023-03-11 06:44:10] [INFO ] Flatten gal took : 15 ms
[2023-03-11 06:44:10] [INFO ] Input system was already deterministic with 115 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Graph (complete) has 160 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 89 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 89 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 88 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 88 transition count 90
Applied a total of 46 rules in 41 ms. Remains 88 /109 variables (removed 21) and now considering 90/115 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 88/109 places, 90/115 transitions.
[2023-03-11 06:44:10] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:44:10] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:44:10] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 86 edges and 109 vertex of which 7 / 109 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 153 edges and 103 vertex of which 95 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 46 place count 94 transition count 60
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 97 place count 50 transition count 53
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 45 transition count 51
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 104 place count 45 transition count 42
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 122 place count 36 transition count 42
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 33 transition count 39
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 33 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 144 place count 25 transition count 31
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 25 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 23 transition count 29
Applied a total of 148 rules in 38 ms. Remains 23 /109 variables (removed 86) and now considering 29/115 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 23/109 places, 29/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (trivial) has 89 edges and 109 vertex of which 6 / 109 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 155 edges and 104 vertex of which 96 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 49 place count 95 transition count 59
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 52 rules applied. Total rules applied 101 place count 48 transition count 54
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 47 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 45 transition count 52
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 106 place count 45 transition count 43
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 124 place count 36 transition count 43
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 130 place count 30 transition count 37
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 30 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 137 place count 30 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 137 place count 30 transition count 35
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 139 place count 29 transition count 35
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 151 place count 23 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 153 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 21 transition count 27
Applied a total of 154 rules in 23 ms. Remains 21 /109 variables (removed 88) and now considering 27/115 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 21/109 places, 27/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 93 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 93 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 93 transition count 97
Applied a total of 34 rules in 24 ms. Remains 93 /109 variables (removed 16) and now considering 97/115 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 93/109 places, 97/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 10 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 89 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 89 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 88 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 88 transition count 90
Applied a total of 46 rules in 15 ms. Remains 88 /109 variables (removed 21) and now considering 90/115 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 88/109 places, 90/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 89 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 89 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 91
Applied a total of 44 rules in 14 ms. Remains 89 /109 variables (removed 20) and now considering 91/115 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 89/109 places, 91/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 90 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 90 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 90 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 89 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 89 transition count 92
Applied a total of 43 rules in 13 ms. Remains 89 /109 variables (removed 20) and now considering 92/115 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 89/109 places, 92/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 92 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 92 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 91 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 91 transition count 94
Applied a total of 39 rules in 12 ms. Remains 91 /109 variables (removed 18) and now considering 94/115 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 91/109 places, 94/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 9 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 90 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 89 transition count 91
Applied a total of 44 rules in 10 ms. Remains 89 /109 variables (removed 20) and now considering 91/115 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 89/109 places, 91/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 7 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Graph (complete) has 160 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 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 100 transition count 67
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 49 rules applied. Total rules applied 94 place count 56 transition count 62
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 55 transition count 58
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 51 transition count 58
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 103 place count 51 transition count 48
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 123 place count 41 transition count 48
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 130 place count 34 transition count 41
Iterating global reduction 4 with 7 rules applied. Total rules applied 137 place count 34 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 34 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 138 place count 34 transition count 39
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 140 place count 33 transition count 39
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 154 place count 26 transition count 32
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 156 place count 25 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 25 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 24 transition count 30
Applied a total of 158 rules in 23 ms. Remains 24 /109 variables (removed 85) and now considering 30/115 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 24/109 places, 30/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 2 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 3 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 94 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 94 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 94 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 93 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 93 transition count 98
Applied a total of 33 rules in 9 ms. Remains 93 /109 variables (removed 16) and now considering 98/115 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 93/109 places, 98/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 8 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 96 transition count 102
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 96 transition count 102
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 89 transition count 95
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 89 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 88 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 88 transition count 90
Applied a total of 46 rules in 7 ms. Remains 88 /109 variables (removed 21) and now considering 90/115 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 88/109 places, 90/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 98 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 92 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 92 transition count 94
Applied a total of 38 rules in 5 ms. Remains 92 /109 variables (removed 17) and now considering 94/115 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 92/109 places, 94/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 100 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 100 transition count 106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 95 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 95 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 95 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 94 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 94 transition count 97
Applied a total of 33 rules in 6 ms. Remains 94 /109 variables (removed 15) and now considering 97/115 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 94/109 places, 97/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 97 transition count 103
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 97 transition count 103
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 90 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 89 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 89 transition count 91
Applied a total of 44 rules in 5 ms. Remains 89 /109 variables (removed 20) and now considering 91/115 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 89/109 places, 91/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 115/115 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 99 transition count 105
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 99 transition count 105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 95 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 95 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 95 transition count 99
Applied a total of 30 rules in 5 ms. Remains 95 /109 variables (removed 14) and now considering 99/115 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 95/109 places, 99/115 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 4 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 5 ms
[2023-03-11 06:44:11] [INFO ] Input system was already deterministic with 99 transitions.
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:44:11] [INFO ] Flatten gal took : 6 ms
[2023-03-11 06:44:11] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-11 06:44:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 109 places, 115 transitions and 271 arcs took 1 ms.
Total runtime 4116 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 109 NrTr: 115 NrArc: 271)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 3.689sec
RS generation: 0m 0.280sec
-> reachability set: #nodes 5163 (5.2e+03) #states 7,420,739 (6)
starting MCC model checker
--------------------------
checking: EF [EX [EG [[0<=p29 & p29<=0]]]]
normalized: E [true U EX [EG [[0<=p29 & p29<=0]]]]
abstracting: (p29<=0)
states: 7,021,545 (6)
abstracting: (0<=p29)
states: 7,420,739 (6)
...................................
EG iterations: 35
.-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.106sec
checking: AG [[EX [0<=0] | AF [EX [[p93<=1 & 1<=p93]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [[p93<=1 & 1<=p93]]]]] | EX [0<=0]]]]]
abstracting: (0<=0)
states: 7,420,739 (6)
.abstracting: (1<=p93)
states: 20,846 (4)
abstracting: (p93<=1)
states: 7,420,739 (6)
..
EG iterations: 1
-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.137sec
checking: AX [EX [AX [[EX [[p80<=1 & 1<=p80]] | AF [[p108<=1 & 1<=p108]]]]]]
normalized: ~ [EX [~ [EX [~ [EX [~ [[~ [EG [~ [[p108<=1 & 1<=p108]]]] | EX [[p80<=1 & 1<=p80]]]]]]]]]]
abstracting: (1<=p80)
states: 562,800 (5)
abstracting: (p80<=1)
states: 7,420,739 (6)
.abstracting: (1<=p108)
states: 20,846 (4)
abstracting: (p108<=1)
states: 7,420,739 (6)
.......................................
EG iterations: 39
...-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.678sec
checking: EF [[[EF [~ [A [[p81<=1 & 1<=p81] U [p52<=1 & 1<=p52]]]] & EG [[p40<=0 & 0<=p40]]] & [[p73<=0 & 0<=p73] & [p47<=0 & 0<=p47]]]]
normalized: E [true U [[[p47<=0 & 0<=p47] & [p73<=0 & 0<=p73]] & [EG [[p40<=0 & 0<=p40]] & E [true U ~ [[~ [EG [~ [[p52<=1 & 1<=p52]]]] & ~ [E [~ [[p52<=1 & 1<=p52]] U [~ [[p81<=1 & 1<=p81]] & ~ [[p52<=1 & 1<=p52]]]]]]]]]]]
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
abstracting: (1<=p81)
states: 562,800 (5)
abstracting: (p81<=1)
states: 7,420,739 (6)
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
......................................
EG iterations: 38
abstracting: (0<=p40)
states: 7,420,739 (6)
abstracting: (p40<=0)
states: 6,988,882 (6)
.................
EG iterations: 17
abstracting: (0<=p73)
states: 7,420,739 (6)
abstracting: (p73<=0)
states: 7,011,037 (6)
abstracting: (0<=p47)
states: 7,420,739 (6)
abstracting: (p47<=0)
states: 6,997,202 (6)
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.381sec
checking: A [EX [AX [~ [[~ [[[p33<=1 & 1<=p33] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]] & AX [[p75<=1 & 1<=p75]]]]]] U [p29<=1 & 1<=p29]]
normalized: [~ [EG [~ [[p29<=1 & 1<=p29]]]] & ~ [E [~ [[p29<=1 & 1<=p29]] U [~ [EX [~ [EX [[~ [EX [~ [[p75<=1 & 1<=p75]]]] & ~ [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p33<=1 & 1<=p33]]]]]]]] & ~ [[p29<=1 & 1<=p29]]]]]]
abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p33)
states: 410,970 (5)
abstracting: (p33<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
abstracting: (1<=p75)
states: 20,845 (4)
abstracting: (p75<=1)
states: 7,420,739 (6)
...abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
...................................
EG iterations: 35
-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.446sec
checking: AG [[~ [E [~ [[[p29<=1 & 1<=p29] | [[p47<=1 & 1<=p47] & [p80<=1 & 1<=p80]]]] U [p93<=1 & 1<=p93]]] | AX [AF [[p56<=1 & 1<=p56]]]]]
normalized: ~ [E [true U ~ [[~ [EX [EG [~ [[p56<=1 & 1<=p56]]]]] | ~ [E [~ [[[[p80<=1 & 1<=p80] & [p47<=1 & 1<=p47]] | [p29<=1 & 1<=p29]]] U [p93<=1 & 1<=p93]]]]]]]
abstracting: (1<=p93)
states: 20,846 (4)
abstracting: (p93<=1)
states: 7,420,739 (6)
abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p47)
states: 423,537 (5)
abstracting: (p47<=1)
states: 7,420,739 (6)
abstracting: (1<=p80)
states: 562,800 (5)
abstracting: (p80<=1)
states: 7,420,739 (6)
abstracting: (1<=p56)
states: 431,857 (5)
abstracting: (p56<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
.-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.809sec
checking: E [AF [[[p93<=1 & 1<=p93] & [EX [AG [[p42<=1 & 1<=p42]]] & E [AG [[p73<=1 & 1<=p73]] U EG [[p19<=1 & 1<=p19]]]]]] U EX [[AG [[p84<=1 & 1<=p84]] & EF [[p42<=1 & 1<=p42]]]]]
normalized: E [~ [EG [~ [[[E [~ [E [true U ~ [[p73<=1 & 1<=p73]]]] U EG [[p19<=1 & 1<=p19]]] & EX [~ [E [true U ~ [[p42<=1 & 1<=p42]]]]]] & [p93<=1 & 1<=p93]]]]] U EX [[~ [E [true U ~ [[p84<=1 & 1<=p84]]]] & E [true U [p42<=1 & 1<=p42]]]]]
abstracting: (1<=p42)
states: 423,537 (5)
abstracting: (p42<=1)
states: 7,420,739 (6)
abstracting: (1<=p84)
states: 562,800 (5)
abstracting: (p84<=1)
states: 7,420,739 (6)
.abstracting: (1<=p93)
states: 20,846 (4)
abstracting: (p93<=1)
states: 7,420,739 (6)
abstracting: (1<=p42)
states: 423,537 (5)
abstracting: (p42<=1)
states: 7,420,739 (6)
.abstracting: (1<=p19)
states: 433,988 (5)
abstracting: (p19<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p73)
states: 409,702 (5)
abstracting: (p73<=1)
states: 7,420,739 (6)
EG iterations: 0
-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.693sec
checking: AG [[A [[~ [[[[p67<=1 & 1<=p67] | [p88<=1 & 1<=p88]] & EF [[p94<=1 & 1<=p94]]]] | [[p102<=1 & 1<=p102] & AF [[p50<=1 & 1<=p50]]]] U ~ [[p11<=1 & 1<=p11]]] | [p91<=1 & 1<=p91]]]
normalized: ~ [E [true U ~ [[[p91<=1 & 1<=p91] | [~ [EG [[p11<=1 & 1<=p11]]] & ~ [E [[p11<=1 & 1<=p11] U [~ [[[~ [EG [~ [[p50<=1 & 1<=p50]]]] & [p102<=1 & 1<=p102]] | ~ [[E [true U [p94<=1 & 1<=p94]] & [[p88<=1 & 1<=p88] | [p67<=1 & 1<=p67]]]]]] & [p11<=1 & 1<=p11]]]]]]]]]
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
abstracting: (1<=p67)
states: 400,519 (5)
abstracting: (p67<=1)
states: 7,420,739 (6)
abstracting: (1<=p88)
states: 562,800 (5)
abstracting: (p88<=1)
states: 7,420,739 (6)
abstracting: (1<=p94)
states: 98,435 (4)
abstracting: (p94<=1)
states: 7,420,739 (6)
abstracting: (1<=p102)
states: 1,125,600 (6)
abstracting: (p102<=1)
states: 7,420,739 (6)
abstracting: (1<=p50)
states: 423,537 (5)
abstracting: (p50<=1)
states: 7,420,739 (6)
.
EG iterations: 1
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p91)
states: 20,845 (4)
abstracting: (p91<=1)
states: 7,420,739 (6)
-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.837sec
checking: EG [~ [E [[p70<=1 & 1<=p70] U ~ [[[A [[p81<=1 & 1<=p81] U [p18<=1 & 1<=p18]] | AF [[p87<=1 & 1<=p87]]] | [[[p56<=1 & 1<=p56] & [p29<=1 & 1<=p29]] | ~ [[p25<=1 & 1<=p25]]]]]]]]
normalized: EG [~ [E [[p70<=1 & 1<=p70] U ~ [[[~ [[p25<=1 & 1<=p25]] | [[p29<=1 & 1<=p29] & [p56<=1 & 1<=p56]]] | [~ [EG [~ [[p87<=1 & 1<=p87]]]] | [~ [EG [~ [[p18<=1 & 1<=p18]]]] & ~ [E [~ [[p18<=1 & 1<=p18]] U [~ [[p81<=1 & 1<=p81]] & ~ [[p18<=1 & 1<=p18]]]]]]]]]]]]
abstracting: (1<=p18)
states: 433,988 (5)
abstracting: (p18<=1)
states: 7,420,739 (6)
abstracting: (1<=p81)
states: 562,800 (5)
abstracting: (p81<=1)
states: 7,420,739 (6)
abstracting: (1<=p18)
states: 433,988 (5)
abstracting: (p18<=1)
states: 7,420,739 (6)
abstracting: (1<=p18)
states: 433,988 (5)
abstracting: (p18<=1)
states: 7,420,739 (6)
.....................................
EG iterations: 37
abstracting: (1<=p87)
states: 562,800 (5)
abstracting: (p87<=1)
states: 7,420,739 (6)
..............................................
EG iterations: 46
abstracting: (1<=p56)
states: 431,857 (5)
abstracting: (p56<=1)
states: 7,420,739 (6)
abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p25)
states: 399,194 (5)
abstracting: (p25<=1)
states: 7,420,739 (6)
abstracting: (1<=p70)
states: 412,502 (5)
abstracting: (p70<=1)
states: 7,420,739 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.624sec
checking: EG [[E [AF [~ [[p37<=1 & 1<=p37]]] U [EG [AX [[[p68<=1 & 1<=p68] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]]] | ~ [[[p74<=1 & 1<=p74] & [p14<=1 & 1<=p14]]]]] | [[p32<=1 & 1<=p32] & [p15<=0 & 0<=p15]]]]
normalized: EG [[[[p15<=0 & 0<=p15] & [p32<=1 & 1<=p32]] | E [~ [EG [[p37<=1 & 1<=p37]]] U [~ [[[p14<=1 & 1<=p14] & [p74<=1 & 1<=p74]]] | EG [~ [EX [~ [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p68<=1 & 1<=p68]]]]]]]]]]
abstracting: (1<=p68)
states: 412,502 (5)
abstracting: (p68<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
...
EG iterations: 2
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p14)
states: 422,212 (5)
abstracting: (p14<=1)
states: 7,420,739 (6)
abstracting: (1<=p37)
states: 410,970 (5)
abstracting: (p37<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p32)
states: 399,194 (5)
abstracting: (p32<=1)
states: 7,420,739 (6)
abstracting: (0<=p15)
states: 7,420,739 (6)
abstracting: (p15<=0)
states: 6,998,527 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.562sec
checking: EX [[~ [A [[p19<=1 & 1<=p19] U [[p73<=1 & 1<=p73] | [p77<=1 & 1<=p77]]]] & AX [[AF [[p98<=1 & 1<=p98]] | [[p55<=1 & 1<=p55] | [[p45<=1 & 1<=p45] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]]]]]]
normalized: EX [[~ [EX [~ [[[[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p45<=1 & 1<=p45]] | [p55<=1 & 1<=p55]] | ~ [EG [~ [[p98<=1 & 1<=p98]]]]]]]] & ~ [[~ [EG [~ [[[p77<=1 & 1<=p77] | [p73<=1 & 1<=p73]]]]] & ~ [E [~ [[[p77<=1 & 1<=p77] | [p73<=1 & 1<=p73]]] U [~ [[p19<=1 & 1<=p19]] & ~ [[[p77<=1 & 1<=p77] | [p73<=1 & 1<=p73]]]]]]]]]]
abstracting: (1<=p73)
states: 409,702 (5)
abstracting: (p73<=1)
states: 7,420,739 (6)
abstracting: (1<=p77)
states: 118,122 (5)
abstracting: (p77<=1)
states: 7,420,739 (6)
abstracting: (1<=p19)
states: 433,988 (5)
abstracting: (p19<=1)
states: 7,420,739 (6)
abstracting: (1<=p73)
states: 409,702 (5)
abstracting: (p73<=1)
states: 7,420,739 (6)
abstracting: (1<=p77)
states: 118,122 (5)
abstracting: (p77<=1)
states: 7,420,739 (6)
abstracting: (1<=p73)
states: 409,702 (5)
abstracting: (p73<=1)
states: 7,420,739 (6)
abstracting: (1<=p77)
states: 118,122 (5)
abstracting: (p77<=1)
states: 7,420,739 (6)
..................................
EG iterations: 34
abstracting: (1<=p98)
states: 98,435 (4)
abstracting: (p98<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p55)
states: 435,497 (5)
abstracting: (p55<=1)
states: 7,420,739 (6)
abstracting: (1<=p45)
states: 423,537 (5)
abstracting: (p45<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
..-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.760sec
checking: EF [[[~ [A [[[p33<=1 & 1<=p33] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]] U [p74<=1 & 1<=p74]]] & EF [[[p55<=0 & 0<=p55] | [p93<=0 & 0<=p93]]]] & [[p28<=1 & 1<=p28] & [EX [[p37<=0 & 0<=p37]] | [p32<=0 & 0<=p32]]]]]
normalized: E [true U [[[[p32<=0 & 0<=p32] | EX [[p37<=0 & 0<=p37]]] & [p28<=1 & 1<=p28]] & [E [true U [[p93<=0 & 0<=p93] | [p55<=0 & 0<=p55]]] & ~ [[~ [EG [~ [[p74<=1 & 1<=p74]]]] & ~ [E [~ [[p74<=1 & 1<=p74]] U [~ [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p33<=1 & 1<=p33]]] & ~ [[p74<=1 & 1<=p74]]]]]]]]]]
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p33)
states: 410,970 (5)
abstracting: (p33<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (0<=p55)
states: 7,420,739 (6)
abstracting: (p55<=0)
states: 6,985,242 (6)
abstracting: (0<=p93)
states: 7,420,739 (6)
abstracting: (p93<=0)
states: 7,399,893 (6)
abstracting: (1<=p28)
states: 399,194 (5)
abstracting: (p28<=1)
states: 7,420,739 (6)
abstracting: (0<=p37)
states: 7,420,739 (6)
abstracting: (p37<=0)
states: 7,009,769 (6)
.abstracting: (0<=p32)
states: 7,420,739 (6)
abstracting: (p32<=0)
states: 7,021,545 (6)
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.144sec
checking: AF [[[EX [E [AF [[p23<=1 & 1<=p23]] U [[p21<=1 & 1<=p21] & [p49<=1 & 1<=p49]]]] & EF [[[[p16<=1 & 1<=p16] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]] & [[p68<=1 & 1<=p68] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]]]] & [[p66<=1 & 1<=p66] & [p81<=0 & 0<=p81]]]]
normalized: ~ [EG [~ [[[[p81<=0 & 0<=p81] & [p66<=1 & 1<=p66]] & [E [true U [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p68<=1 & 1<=p68]] & [[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p16<=1 & 1<=p16]]]] & EX [E [~ [EG [~ [[p23<=1 & 1<=p23]]]] U [[p49<=1 & 1<=p49] & [p21<=1 & 1<=p21]]]]]]]]]
abstracting: (1<=p21)
states: 430,628 (5)
abstracting: (p21<=1)
states: 7,420,739 (6)
abstracting: (1<=p49)
states: 423,537 (5)
abstracting: (p49<=1)
states: 7,420,739 (6)
abstracting: (1<=p23)
states: 399,194 (5)
abstracting: (p23<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
.abstracting: (1<=p16)
states: 433,988 (5)
abstracting: (p16<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
abstracting: (1<=p68)
states: 412,502 (5)
abstracting: (p68<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
abstracting: (1<=p66)
states: 400,519 (5)
abstracting: (p66<=1)
states: 7,420,739 (6)
abstracting: (0<=p81)
states: 7,420,739 (6)
abstracting: (p81<=0)
states: 6,857,939 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.899sec
checking: A [A [[~ [AG [~ [[p29<=1 & 1<=p29]]]] & [p32<=1 & 1<=p32]] U ~ [[[AG [[p25<=1 & 1<=p25]] | [A [[p17<=1 & 1<=p17] U [p74<=1 & 1<=p74]] | [[p13<=1 & 1<=p13] & [p52<=1 & 1<=p52]]]] & AX [[[p70<=1 & 1<=p70] | [p85<=1 & 1<=p85]]]]]] U [~ [[[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]] & EF [[p78<=1 & 1<=p78]]]]
normalized: [~ [EG [~ [[E [true U [p78<=1 & 1<=p78]] & ~ [[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]]]]]]] & ~ [E [~ [[E [true U [p78<=1 & 1<=p78]] & ~ [[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]]]]] U [~ [[~ [EG [[~ [EX [~ [[[p85<=1 & 1<=p85] | [p70<=1 & 1<=p70]]]]] & [[[[p52<=1 & 1<=p52] & [p13<=1 & 1<=p13]] | [~ [EG [~ [[p74<=1 & 1<=p74]]]] & ~ [E [~ [[p74<=1 & 1<=p74]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p74<=1 & 1<=p74]]]]]]] | ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]]]]] & ~ [E [[~ [EX [~ [[[p85<=1 & 1<=p85] | [p70<=1 & 1<=p70]]]]] & [[[[p52<=1 & 1<=p52] & [p13<=1 & 1<=p13]] | [~ [EG [~ [[p74<=1 & 1<=p74]]]] & ~ [E [~ [[p74<=1 & 1<=p74]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p74<=1 & 1<=p74]]]]]]] | ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]]] U [~ [[[p32<=1 & 1<=p32] & E [true U [p29<=1 & 1<=p29]]]] & [~ [EX [~ [[[p85<=1 & 1<=p85] | [p70<=1 & 1<=p70]]]]] & [[[[p52<=1 & 1<=p52] & [p13<=1 & 1<=p13]] | [~ [EG [~ [[p74<=1 & 1<=p74]]]] & ~ [E [~ [[p74<=1 & 1<=p74]] U [~ [[p17<=1 & 1<=p17]] & ~ [[p74<=1 & 1<=p74]]]]]]] | ~ [E [true U ~ [[p25<=1 & 1<=p25]]]]]]]]]]] & ~ [[E [true U [p78<=1 & 1<=p78]] & ~ [[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]]]]]]]]]
abstracting: (1<=p22)
states: 408,450 (5)
abstracting: (p22<=1)
states: 7,420,739 (6)
abstracting: (1<=p41)
states: 423,537 (5)
abstracting: (p41<=1)
states: 7,420,739 (6)
abstracting: (1<=p78)
states: 118,122 (5)
abstracting: (p78<=1)
states: 7,420,739 (6)
abstracting: (1<=p25)
states: 399,194 (5)
abstracting: (p25<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p17)
states: 433,988 (5)
abstracting: (p17<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p13)
states: 422,212 (5)
abstracting: (p13<=1)
states: 7,420,739 (6)
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
abstracting: (1<=p70)
states: 412,502 (5)
abstracting: (p70<=1)
states: 7,420,739 (6)
abstracting: (1<=p85)
states: 562,800 (5)
abstracting: (p85<=1)
states: 7,420,739 (6)
.abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p32)
states: 399,194 (5)
abstracting: (p32<=1)
states: 7,420,739 (6)
abstracting: (1<=p25)
states: 399,194 (5)
abstracting: (p25<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p17)
states: 433,988 (5)
abstracting: (p17<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p13)
states: 422,212 (5)
abstracting: (p13<=1)
states: 7,420,739 (6)
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
abstracting: (1<=p70)
states: 412,502 (5)
abstracting: (p70<=1)
states: 7,420,739 (6)
abstracting: (1<=p85)
states: 562,800 (5)
abstracting: (p85<=1)
states: 7,420,739 (6)
.abstracting: (1<=p25)
states: 399,194 (5)
abstracting: (p25<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p17)
states: 433,988 (5)
abstracting: (p17<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
abstracting: (1<=p74)
states: 409,702 (5)
abstracting: (p74<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p13)
states: 422,212 (5)
abstracting: (p13<=1)
states: 7,420,739 (6)
abstracting: (1<=p52)
states: 435,497 (5)
abstracting: (p52<=1)
states: 7,420,739 (6)
abstracting: (1<=p70)
states: 412,502 (5)
abstracting: (p70<=1)
states: 7,420,739 (6)
abstracting: (1<=p85)
states: 562,800 (5)
abstracting: (p85<=1)
states: 7,420,739 (6)
................
EG iterations: 15
abstracting: (1<=p22)
states: 408,450 (5)
abstracting: (p22<=1)
states: 7,420,739 (6)
abstracting: (1<=p41)
states: 423,537 (5)
abstracting: (p41<=1)
states: 7,420,739 (6)
abstracting: (1<=p78)
states: 118,122 (5)
abstracting: (p78<=1)
states: 7,420,739 (6)
abstracting: (1<=p22)
states: 408,450 (5)
abstracting: (p22<=1)
states: 7,420,739 (6)
abstracting: (1<=p41)
states: 423,537 (5)
abstracting: (p41<=1)
states: 7,420,739 (6)
abstracting: (1<=p78)
states: 118,122 (5)
abstracting: (p78<=1)
states: 7,420,739 (6)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.401sec
checking: [E [[[AF [[[p27<=1 & 1<=p27] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]] & AF [AG [[p17<=1 & 1<=p17]]]] | A [EG [[[p91<=1 & 1<=p91] & [p69<=1 & 1<=p69]]] U [EF [[p24<=1 & 1<=p24]] | [AX [[p67<=1 & 1<=p67]] & E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]]]]]] U [p29<=1 & 1<=p29]] | AG [[[p86<=1 & 1<=p86] | [p72<=0 & 0<=p72]]]]
normalized: [~ [E [true U ~ [[[p72<=0 & 0<=p72] | [p86<=1 & 1<=p86]]]]] | E [[[~ [EG [~ [[[E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]] & ~ [EX [~ [[p67<=1 & 1<=p67]]]]] | E [true U [p24<=1 & 1<=p24]]]]]] & ~ [E [~ [[[E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]] & ~ [EX [~ [[p67<=1 & 1<=p67]]]]] | E [true U [p24<=1 & 1<=p24]]]] U [~ [EG [[[p69<=1 & 1<=p69] & [p91<=1 & 1<=p91]]]] & ~ [[[E [[p11<=1 & 1<=p11] U [p7<=1 & 1<=p7]] & ~ [EX [~ [[p67<=1 & 1<=p67]]]]] | E [true U [p24<=1 & 1<=p24]]]]]]]] | [~ [EG [E [true U ~ [[p17<=1 & 1<=p17]]]]] & ~ [EG [~ [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p27<=1 & 1<=p27]]]]]]] U [p29<=1 & 1<=p29]]]
abstracting: (1<=p29)
states: 399,194 (5)
abstracting: (p29<=1)
states: 7,420,739 (6)
abstracting: (1<=p27)
states: 399,194 (5)
abstracting: (p27<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
.............................
EG iterations: 29
abstracting: (1<=p17)
states: 433,988 (5)
abstracting: (p17<=1)
states: 7,420,739 (6)
EG iterations: 0
abstracting: (1<=p24)
states: 399,194 (5)
abstracting: (p24<=1)
states: 7,420,739 (6)
abstracting: (1<=p67)
states: 400,519 (5)
abstracting: (p67<=1)
states: 7,420,739 (6)
.abstracting: (1<=p7)
states: 422,212 (5)
abstracting: (p7<=1)
states: 7,420,739 (6)
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
abstracting: (1<=p91)
states: 20,845 (4)
abstracting: (p91<=1)
states: 7,420,739 (6)
abstracting: (1<=p69)
states: 412,502 (5)
abstracting: (p69<=1)
states: 7,420,739 (6)
.............................
EG iterations: 29
abstracting: (1<=p24)
states: 399,194 (5)
abstracting: (p24<=1)
states: 7,420,739 (6)
abstracting: (1<=p67)
states: 400,519 (5)
abstracting: (p67<=1)
states: 7,420,739 (6)
.abstracting: (1<=p7)
states: 422,212 (5)
abstracting: (p7<=1)
states: 7,420,739 (6)
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
abstracting: (1<=p24)
states: 399,194 (5)
abstracting: (p24<=1)
states: 7,420,739 (6)
abstracting: (1<=p67)
states: 400,519 (5)
abstracting: (p67<=1)
states: 7,420,739 (6)
.abstracting: (1<=p7)
states: 422,212 (5)
abstracting: (p7<=1)
states: 7,420,739 (6)
abstracting: (1<=p11)
states: 422,212 (5)
abstracting: (p11<=1)
states: 7,420,739 (6)
.
EG iterations: 1
abstracting: (1<=p86)
states: 562,800 (5)
abstracting: (p86<=1)
states: 7,420,739 (6)
abstracting: (0<=p72)
states: 7,420,739 (6)
abstracting: (p72<=0)
states: 7,008,237 (6)
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.807sec
checking: EF [[AX [E [[[p62<=1 & 1<=p62] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]] U AX [[p72<=1 & 1<=p72]]]] & [[EF [[p100<=1 & 1<=p100]] | EG [[p94<=1 & 1<=p94]]] | [~ [E [A [[p86<=1 & 1<=p86] U [p64<=1 & 1<=p64]] U EF [[[p62<=1 & 1<=p62] & [[p90<=1 & 1<=p90] & [p105<=1 & 1<=p105]]]]]] | [AG [[p65<=1 & 1<=p65]] & E [[p101<=1 & 1<=p101] U [p55<=1 & 1<=p55]]]]]]]
normalized: E [true U [[[[E [[p101<=1 & 1<=p101] U [p55<=1 & 1<=p55]] & ~ [E [true U ~ [[p65<=1 & 1<=p65]]]]] | ~ [E [[~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [~ [[p86<=1 & 1<=p86]] & ~ [[p64<=1 & 1<=p64]]]]]] U E [true U [[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p62<=1 & 1<=p62]]]]]] | [EG [[p94<=1 & 1<=p94]] | E [true U [p100<=1 & 1<=p100]]]] & ~ [EX [~ [E [[[[p105<=1 & 1<=p105] & [p90<=1 & 1<=p90]] & [p62<=1 & 1<=p62]] U ~ [EX [~ [[p72<=1 & 1<=p72]]]]]]]]]]
abstracting: (1<=p72)
states: 412,502 (5)
abstracting: (p72<=1)
states: 7,420,739 (6)
.abstracting: (1<=p62)
states: 400,519 (5)
abstracting: (p62<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
.abstracting: (1<=p100)
states: 1,125,600 (6)
abstracting: (p100<=1)
states: 7,420,739 (6)
abstracting: (1<=p94)
states: 98,435 (4)
abstracting: (p94<=1)
states: 7,420,739 (6)
.................................
EG iterations: 33
abstracting: (1<=p62)
states: 400,519 (5)
abstracting: (p62<=1)
states: 7,420,739 (6)
abstracting: (1<=p90)
states: 678,072 (5)
abstracting: (p90<=1)
states: 7,420,739 (6)
abstracting: (1<=p105)
states: 1,197,491 (6)
abstracting: (p105<=1)
states: 7,420,739 (6)
abstracting: (1<=p64)
states: 400,519 (5)
abstracting: (p64<=1)
states: 7,420,739 (6)
abstracting: (1<=p86)
states: 562,800 (5)
abstracting: (p86<=1)
states: 7,420,739 (6)
abstracting: (1<=p64)
states: 400,519 (5)
abstracting: (p64<=1)
states: 7,420,739 (6)
abstracting: (1<=p64)
states: 400,519 (5)
abstracting: (p64<=1)
states: 7,420,739 (6)
...................................
EG iterations: 35
abstracting: (1<=p65)
states: 400,519 (5)
abstracting: (p65<=1)
states: 7,420,739 (6)
abstracting: (1<=p55)
states: 435,497 (5)
abstracting: (p55<=1)
states: 7,420,739 (6)
abstracting: (1<=p101)
states: 1,125,600 (6)
abstracting: (p101<=1)
states: 7,420,739 (6)
-> the formula is TRUE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.175sec
totally nodes used: 10085859 (1.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12743036 30569627 43312663
used/not used/entry size/cache size: 30611891 36496973 16 1024MB
basic ops cache: hits/miss/sum: 1085567 2716230 3801797
used/not used/entry size/cache size: 4372994 12404222 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 28091 74283 102374
used/not used/entry size/cache size: 73966 8314642 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 58369473
1 7578326
2 998134
3 143177
4 17706
5 1788
6 167
7 16
8 35
9 22
>= 10 20
Total processing time: 0m22.395sec
BK_STOP 1678517074999
--------------------
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 CTLFireability -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
iterations count:5051 (43), effective:689 (5)
initing FirstDep: 0m 0.000sec
iterations count:129 (1), effective:5 (0)
iterations count:922 (8), effective:99 (0)
iterations count:117 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:207 (1), effective:5 (0)
iterations count:1863 (16), effective:245 (2)
iterations count:116 (1), effective:1 (0)
iterations count:125 (1), effective:3 (0)
iterations count:503 (4), effective:45 (0)
iterations count:120 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:195 (1), effective:1 (0)
iterations count:115 (1), effective:0 (0)
iterations count:1353 (11), effective:152 (1)
iterations count:701 (6), effective:80 (0)
iterations count:526 (4), effective:53 (0)
iterations count:117 (1), effective:1 (0)
iterations count:572 (4), effective:48 (0)
iterations count:117 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:228 (1), effective:15 (0)
iterations count:117 (1), effective:1 (0)
iterations count:514 (4), effective:49 (0)
iterations count:363 (3), effective:35 (0)
iterations count:585 (5), effective:60 (0)
iterations count:1357 (11), effective:155 (1)
iterations count:117 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:504 (4), effective:47 (0)
iterations count:117 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:119 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:117 (1), effective:1 (0)
iterations count:1357 (11), effective:155 (1)
iterations count:1357 (11), effective:155 (1)
iterations count:117 (1), effective:1 (0)
iterations count:504 (4), effective:47 (0)
iterations count:115 (1), effective:0 (0)
iterations count:504 (4), effective:47 (0)
iterations count:115 (1), effective:0 (0)
iterations count:115 (1), effective:0 (0)
iterations count:504 (4), effective:47 (0)
iterations count:115 (1), effective:0 (0)
iterations count:504 (4), effective:47 (0)
iterations count:560 (4), effective:45 (0)
iterations count:385 (3), effective:46 (0)
iterations count:889 (7), effective:105 (0)
iterations count:713 (6), effective:62 (0)
iterations count:118 (1), effective:1 (0)
iterations count:115 (1), effective:0 (0)
iterations count:121 (1), effective:1 (0)
iterations count:183 (1), effective:10 (0)
iterations count:2739 (23), effective:352 (3)
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="GPUForwardProgress-PT-04b"
export BK_EXAMINATION="CTLFireability"
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 GPUForwardProgress-PT-04b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-167840348100010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-04b.tgz
mv GPUForwardProgress-PT-04b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;