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.r106-tall-167814483000666.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 DLCround-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 18:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 19:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 19:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 18:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 325K 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 DLCround-PT-06a-CTLFireability-00
FORMULA_NAME DLCround-PT-06a-CTLFireability-01
FORMULA_NAME DLCround-PT-06a-CTLFireability-02
FORMULA_NAME DLCround-PT-06a-CTLFireability-03
FORMULA_NAME DLCround-PT-06a-CTLFireability-04
FORMULA_NAME DLCround-PT-06a-CTLFireability-05
FORMULA_NAME DLCround-PT-06a-CTLFireability-06
FORMULA_NAME DLCround-PT-06a-CTLFireability-07
FORMULA_NAME DLCround-PT-06a-CTLFireability-08
FORMULA_NAME DLCround-PT-06a-CTLFireability-09
FORMULA_NAME DLCround-PT-06a-CTLFireability-10
FORMULA_NAME DLCround-PT-06a-CTLFireability-11
FORMULA_NAME DLCround-PT-06a-CTLFireability-12
FORMULA_NAME DLCround-PT-06a-CTLFireability-13
FORMULA_NAME DLCround-PT-06a-CTLFireability-14
FORMULA_NAME DLCround-PT-06a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678452773055

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=DLCround-PT-06a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 12:52:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 12:52:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 12:52:54] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-10 12:52:54] [INFO ] Transformed 197 places.
[2023-03-10 12:52:54] [INFO ] Transformed 1313 transitions.
[2023-03-10 12:52:54] [INFO ] Found NUPN structural information;
[2023-03-10 12:52:54] [INFO ] Parsed PT model containing 197 places and 1313 transitions and 5002 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
Support contains 122 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 1178/1178 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 193 transition count 1142
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 193 transition count 1142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 193 transition count 1141
Drop transitions removed 396 transitions
Redundant transition composition rules discarded 396 transitions
Iterating global reduction 1 with 396 rules applied. Total rules applied 405 place count 193 transition count 745
Applied a total of 405 rules in 47 ms. Remains 193 /197 variables (removed 4) and now considering 745/1178 (removed 433) transitions.
[2023-03-10 12:52:55] [INFO ] Flow matrix only has 149 transitions (discarded 596 similar events)
// Phase 1: matrix 149 rows 193 cols
[2023-03-10 12:52:55] [INFO ] Computed 109 place invariants in 6 ms
[2023-03-10 12:52:55] [INFO ] Implicit Places using invariants in 312 ms returned [95, 100, 101, 105, 107, 109, 111, 115, 117, 119, 121, 122, 123, 128, 130, 131, 133, 137, 139, 140, 141, 143, 145, 147, 151, 156, 166, 168, 173, 177, 183, 184, 185, 191]
Discarding 34 places :
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Implicit Place search using SMT only with invariants took 576 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/197 places, 619/1178 transitions.
Drop transitions removed 360 transitions
Redundant transition composition rules discarded 360 transitions
Iterating global reduction 0 with 360 rules applied. Total rules applied 360 place count 159 transition count 259
Applied a total of 360 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 259/619 (removed 360) transitions.
[2023-03-10 12:52:55] [INFO ] Flow matrix only has 149 transitions (discarded 110 similar events)
// Phase 1: matrix 149 rows 159 cols
[2023-03-10 12:52:55] [INFO ] Computed 75 place invariants in 2 ms
[2023-03-10 12:52:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-10 12:52:55] [INFO ] Flow matrix only has 149 transitions (discarded 110 similar events)
[2023-03-10 12:52:55] [INFO ] Invariant cache hit.
[2023-03-10 12:52:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 12:52:55] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/197 places, 259/1178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 802 ms. Remains : 159/197 places, 259/1178 transitions.
Support contains 122 out of 159 places after structural reductions.
[2023-03-10 12:52:55] [INFO ] Flatten gal took : 37 ms
[2023-03-10 12:52:55] [INFO ] Flatten gal took : 16 ms
[2023-03-10 12:52:55] [INFO ] Input system was already deterministic with 259 transitions.
Finished random walk after 700 steps, including 0 resets, run visited all 100 properties in 74 ms. (steps per millisecond=9 )
[2023-03-10 12:52:55] [INFO ] Flatten gal took : 12 ms
[2023-03-10 12:52:55] [INFO ] Flatten gal took : 12 ms
[2023-03-10 12:52:55] [INFO ] Input system was already deterministic with 259 transitions.
Computed a total of 65 stabilizing places and 1 stable transitions
Graph (complete) has 403 edges and 159 vertex of which 111 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 118 transition count 259
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 62 place count 97 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 83 place count 97 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 97 transition count 197
Applied a total of 85 rules in 5 ms. Remains 97 /159 variables (removed 62) and now considering 197/259 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 97/159 places, 197/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 6 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 7 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 116 transition count 259
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 71 place count 88 transition count 182
Iterating global reduction 1 with 28 rules applied. Total rules applied 99 place count 88 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 102 place count 88 transition count 179
Applied a total of 102 rules in 5 ms. Remains 88 /159 variables (removed 71) and now considering 179/259 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 88/159 places, 179/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 6 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 115 transition count 259
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 72 place count 87 transition count 185
Iterating global reduction 1 with 28 rules applied. Total rules applied 100 place count 87 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 103 place count 87 transition count 182
Applied a total of 103 rules in 4 ms. Remains 87 /159 variables (removed 72) and now considering 182/259 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 87/159 places, 182/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 6 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Graph (trivial) has 182 edges and 159 vertex of which 76 / 159 are part of one of the 10 SCC in 3 ms
Free SCC test removed 66 places
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (complete) has 249 edges and 93 vertex of which 47 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.1 ms
Discarding 46 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 104
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 25 place count 25 transition count 44
Iterating global reduction 2 with 21 rules applied. Total rules applied 46 place count 25 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 23 transition count 42
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 23 transition count 38
Applied a total of 54 rules in 14 ms. Remains 23 /159 variables (removed 136) and now considering 38/259 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 23/159 places, 38/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 1 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 117 transition count 259
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 65 place count 94 transition count 198
Iterating global reduction 1 with 23 rules applied. Total rules applied 88 place count 94 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 94 transition count 196
Applied a total of 90 rules in 4 ms. Remains 94 /159 variables (removed 65) and now considering 196/259 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 94/159 places, 196/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 7 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 6 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 114 transition count 259
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 76 place count 83 transition count 173
Iterating global reduction 1 with 31 rules applied. Total rules applied 107 place count 83 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 83 transition count 170
Applied a total of 110 rules in 4 ms. Remains 83 /159 variables (removed 76) and now considering 170/259 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/159 places, 170/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 116 transition count 259
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 73 place count 86 transition count 175
Iterating global reduction 1 with 30 rules applied. Total rules applied 103 place count 86 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 86 transition count 172
Applied a total of 106 rules in 4 ms. Remains 86 /159 variables (removed 73) and now considering 172/259 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 86/159 places, 172/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 122 transition count 259
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 55 place count 104 transition count 211
Iterating global reduction 1 with 18 rules applied. Total rules applied 73 place count 104 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 104 transition count 208
Applied a total of 76 rules in 4 ms. Remains 104 /159 variables (removed 55) and now considering 208/259 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 104/159 places, 208/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 121 transition count 259
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 61 place count 98 transition count 189
Iterating global reduction 1 with 23 rules applied. Total rules applied 84 place count 98 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 98 transition count 187
Applied a total of 86 rules in 3 ms. Remains 98 /159 variables (removed 61) and now considering 187/259 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 98/159 places, 187/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 119 transition count 259
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 67 place count 92 transition count 184
Iterating global reduction 1 with 27 rules applied. Total rules applied 94 place count 92 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 92 transition count 182
Applied a total of 96 rules in 3 ms. Remains 92 /159 variables (removed 67) and now considering 182/259 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 92/159 places, 182/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Graph (trivial) has 177 edges and 159 vertex of which 73 / 159 are part of one of the 11 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Graph (complete) has 240 edges and 97 vertex of which 52 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 50 transition count 115
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 26 place count 30 transition count 55
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 30 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 30 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 52 place count 28 transition count 51
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 28 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 28 transition count 46
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 27 transition count 45
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 27 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 27 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 27 transition count 43
Applied a total of 62 rules in 10 ms. Remains 27 /159 variables (removed 132) and now considering 43/259 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 27/159 places, 43/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 1 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Graph (trivial) has 179 edges and 159 vertex of which 74 / 159 are part of one of the 10 SCC in 0 ms
Free SCC test removed 64 places
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Graph (complete) has 255 edges and 95 vertex of which 48 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 46 transition count 109
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 28 place count 24 transition count 47
Iterating global reduction 2 with 22 rules applied. Total rules applied 50 place count 24 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 22 transition count 45
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 22 transition count 40
Applied a total of 59 rules in 6 ms. Remains 22 /159 variables (removed 137) and now considering 40/259 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 22/159 places, 40/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 1 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 113 transition count 259
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 74 place count 85 transition count 179
Iterating global reduction 1 with 28 rules applied. Total rules applied 102 place count 85 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 85 transition count 176
Applied a total of 105 rules in 2 ms. Remains 85 /159 variables (removed 74) and now considering 176/259 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 85/159 places, 176/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Graph (trivial) has 165 edges and 159 vertex of which 65 / 159 are part of one of the 11 SCC in 0 ms
Free SCC test removed 54 places
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Graph (complete) has 258 edges and 105 vertex of which 62 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 0 output 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 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 133
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 60 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 59 transition count 132
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 26 place count 41 transition count 79
Iterating global reduction 3 with 18 rules applied. Total rules applied 44 place count 41 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 41 transition count 77
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 48 place count 40 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 52 place count 38 transition count 74
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 61 place count 38 transition count 65
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 38 transition count 65
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 63 place count 37 transition count 64
Iterating global reduction 5 with 1 rules applied. Total rules applied 64 place count 37 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 37 transition count 63
Applied a total of 65 rules in 10 ms. Remains 37 /159 variables (removed 122) and now considering 63/259 (removed 196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 37/159 places, 63/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 1 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 120 transition count 259
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 65 place count 94 transition count 183
Iterating global reduction 1 with 26 rules applied. Total rules applied 91 place count 94 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 94 transition count 182
Applied a total of 92 rules in 2 ms. Remains 94 /159 variables (removed 65) and now considering 182/259 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 94/159 places, 182/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 259/259 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 112 transition count 259
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 75 place count 84 transition count 182
Iterating global reduction 1 with 28 rules applied. Total rules applied 103 place count 84 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 84 transition count 179
Applied a total of 106 rules in 3 ms. Remains 84 /159 variables (removed 75) and now considering 179/259 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/159 places, 179/259 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:52:56] [INFO ] Input system was already deterministic with 179 transitions.
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 8 ms
[2023-03-10 12:52:56] [INFO ] Flatten gal took : 8 ms
[2023-03-10 12:52:56] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-10 12:52:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 159 places, 259 transitions and 720 arcs took 1 ms.
Total runtime 1951 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: 159 NrTr: 259 NrArc: 720)

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

net check time: 0m 0.000sec

init dd package: 0m 2.723sec


RS generation: 0m 0.033sec


-> reachability set: #nodes 1487 (1.5e+03) #states 13,608,000,001 (10)



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

checking: ~ [E [~ [AF [EG [[[p1<=1 & 1<=p1] & [p44<=1 & 1<=p44]]]]] U [[p69<=1 & 1<=p69] & [p148<=1 & 1<=p148]]]]
normalized: ~ [E [EG [~ [EG [[[p44<=1 & 1<=p44] & [p1<=1 & 1<=p1]]]]] U [[p69<=1 & 1<=p69] & [p148<=1 & 1<=p148]]]]

abstracting: (1<=p148)
states: 13,608,000,000 (10)
abstracting: (p148<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p69)
states: 1,512,000,000 (9)
abstracting: (p69<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p1)
states: 2,268,000,000 (9)
abstracting: (p1<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p44)
states: 1,360,800,000 (9)
abstracting: (p44<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.043sec

checking: AG [AX [AX [~ [E [[[p51<=1 & 1<=p51] & [p140<=1 & 1<=p140]] U [[p41<=1 & 1<=p41] & [p101<=1 & 1<=p101]]]]]]]
normalized: ~ [E [true U EX [EX [E [[[p140<=1 & 1<=p140] & [p51<=1 & 1<=p51]] U [[p101<=1 & 1<=p101] & [p41<=1 & 1<=p41]]]]]]]

abstracting: (1<=p41)
states: 1,360,800,000 (9)
abstracting: (p41<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p101)
states: 13,608,000,000 (10)
abstracting: (p101<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p51)
states: 1,360,800,000 (9)
abstracting: (p51<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p140)
states: 13,608,000,000 (10)
abstracting: (p140<=1)
states: 13,608,000,001 (10)
..-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: AG [[AG [[[p70<=0 & 0<=p70] | [p116<=0 & 0<=p116]]] & EF [[[p44<=0 & 0<=p44] & [[p52<=0 & 0<=p52] | [p137<=0 & 0<=p137]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[[p137<=0 & 0<=p137] | [p52<=0 & 0<=p52]] & [p44<=0 & 0<=p44]]] & ~ [E [true U ~ [[[p116<=0 & 0<=p116] | [p70<=0 & 0<=p70]]]]]]]]]

abstracting: (0<=p70)
states: 13,608,000,001 (10)
abstracting: (p70<=0)
states: 12,096,000,001 (10)
abstracting: (0<=p116)
states: 13,608,000,001 (10)
abstracting: (p116<=0)
states: 1
abstracting: (0<=p44)
states: 13,608,000,001 (10)
abstracting: (p44<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p52)
states: 13,608,000,001 (10)
abstracting: (p52<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p137)
states: 13,608,000,001 (10)
abstracting: (p137<=0)
states: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AG [[[[p34<=0 & 0<=p34] | [p137<=0 & 0<=p137]] | [AX [[[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]]] | AF [[[p89<=1 & 1<=p89] & [[p155<=1 & 1<=p155] & [p12<=1 & 1<=p12]]]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[[[p12<=1 & 1<=p12] & [p155<=1 & 1<=p155]] & [p89<=1 & 1<=p89]]]]] | ~ [EX [~ [[[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]]]]]] | [[p137<=0 & 0<=p137] | [p34<=0 & 0<=p34]]]]]]

abstracting: (0<=p34)
states: 13,608,000,001 (10)
abstracting: (p34<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p137)
states: 13,608,000,001 (10)
abstracting: (p137<=0)
states: 1
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p111)
states: 13,608,000,000 (10)
abstracting: (p111<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p89)
states: 1,360,800,000 (9)
abstracting: (p89<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p155)
states: 13,608,000,000 (10)
abstracting: (p155<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p12)
states: 1,944,000,000 (9)
abstracting: (p12<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: [~ [A [[[[p32<=1 & 1<=p32] & [p97<=1 & 1<=p97]] | [p57<=1 & 1<=p57]] U [[p83<=1 & 1<=p83] & [p158<=1 & 1<=p158]]]] & EF [[[p49<=1 & 1<=p49] & [p105<=1 & 1<=p105]]]]
normalized: [E [true U [[p105<=1 & 1<=p105] & [p49<=1 & 1<=p49]]] & ~ [[~ [EG [~ [[[p158<=1 & 1<=p158] & [p83<=1 & 1<=p83]]]]] & ~ [E [~ [[[p158<=1 & 1<=p158] & [p83<=1 & 1<=p83]]] U [~ [[[p57<=1 & 1<=p57] | [[p97<=1 & 1<=p97] & [p32<=1 & 1<=p32]]]] & ~ [[[p158<=1 & 1<=p158] & [p83<=1 & 1<=p83]]]]]]]]]

abstracting: (1<=p83)
states: 1,360,800,000 (9)
abstracting: (p83<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p158)
states: 13,608,000,000 (10)
abstracting: (p158<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p32)
states: 1,360,800,000 (9)
abstracting: (p32<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p97)
states: 13,608,000,000 (10)
abstracting: (p97<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p57)
states: 1,360,800,000 (9)
abstracting: (p57<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p83)
states: 1,360,800,000 (9)
abstracting: (p83<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p158)
states: 13,608,000,000 (10)
abstracting: (p158<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p83)
states: 1,360,800,000 (9)
abstracting: (p83<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p158)
states: 13,608,000,000 (10)
abstracting: (p158<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p49)
states: 1,360,800,000 (9)
abstracting: (p49<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p105)
states: 13,608,000,000 (10)
abstracting: (p105<=1)
states: 13,608,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: E [~ [[[p90<=1 & 1<=p90] & [p126<=1 & 1<=p126]]] U [AF [AG [[[p92<=1 & 1<=p92] & [p126<=1 & 1<=p126]]]] & AX [[[[p29<=1 & 1<=p29] & [p129<=1 & 1<=p129]] | ~ [AX [[[p6<=1 & 1<=p6] & [p114<=1 & 1<=p114]]]]]]]]
normalized: E [~ [[[p126<=1 & 1<=p126] & [p90<=1 & 1<=p90]]] U [~ [EX [~ [[EX [~ [[[p114<=1 & 1<=p114] & [p6<=1 & 1<=p6]]]] | [[p129<=1 & 1<=p129] & [p29<=1 & 1<=p29]]]]]] & ~ [EG [E [true U ~ [[[p126<=1 & 1<=p126] & [p92<=1 & 1<=p92]]]]]]]]

abstracting: (1<=p92)
states: 1,360,800,000 (9)
abstracting: (p92<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)

EG iterations: 0
abstracting: (1<=p29)
states: 1,360,800,000 (9)
abstracting: (p29<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p129)
states: 13,608,000,000 (10)
abstracting: (p129<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p6)
states: 2,268,000,000 (9)
abstracting: (p6<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
..abstracting: (1<=p90)
states: 1,360,800,000 (9)
abstracting: (p90<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: E [EX [A [~ [[[p34<=1 & 1<=p34] & [p151<=1 & 1<=p151]]] U [A [[[p25<=1 & 1<=p25] & [p99<=1 & 1<=p99]] U [[p79<=1 & 1<=p79] & [p153<=1 & 1<=p153]]] | ~ [AG [[[p33<=1 & 1<=p33] & [p128<=1 & 1<=p128]]]]]]] U [AG [[[p34<=1 & 1<=p34] & [p141<=1 & 1<=p141]]] & [[p83<=1 & 1<=p83] & [p152<=1 & 1<=p152]]]]
normalized: E [EX [[~ [EG [~ [[E [true U ~ [[[p128<=1 & 1<=p128] & [p33<=1 & 1<=p33]]]] | [~ [EG [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]] & ~ [E [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]] U [~ [[[p99<=1 & 1<=p99] & [p25<=1 & 1<=p25]]] & ~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]]]]]]]] & ~ [E [~ [[E [true U ~ [[[p128<=1 & 1<=p128] & [p33<=1 & 1<=p33]]]] | [~ [EG [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]] & ~ [E [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]] U [~ [[[p99<=1 & 1<=p99] & [p25<=1 & 1<=p25]]] & ~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]]]]]] U [[[p151<=1 & 1<=p151] & [p34<=1 & 1<=p34]] & ~ [[E [true U ~ [[[p128<=1 & 1<=p128] & [p33<=1 & 1<=p33]]]] | [~ [EG [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]] & ~ [E [~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]] U [~ [[[p99<=1 & 1<=p99] & [p25<=1 & 1<=p25]]] & ~ [[[p153<=1 & 1<=p153] & [p79<=1 & 1<=p79]]]]]]]]]]]]]] U [[[p152<=1 & 1<=p152] & [p83<=1 & 1<=p83]] & ~ [E [true U ~ [[[p141<=1 & 1<=p141] & [p34<=1 & 1<=p34]]]]]]]

abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p141)
states: 13,608,000,000 (10)
abstracting: (p141<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p83)
states: 1,360,800,000 (9)
abstracting: (p83<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p152)
states: 13,608,000,000 (10)
abstracting: (p152<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p99)
states: 13,608,000,000 (10)
abstracting: (p99<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p128)
states: 13,608,000,000 (10)
abstracting: (p128<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p151)
states: 13,608,000,000 (10)
abstracting: (p151<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p99)
states: 13,608,000,000 (10)
abstracting: (p99<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p128)
states: 13,608,000,000 (10)
abstracting: (p128<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p99)
states: 13,608,000,000 (10)
abstracting: (p99<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p79)
states: 1,360,800,000 (9)
abstracting: (p79<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p128)
states: 13,608,000,000 (10)
abstracting: (p128<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: ~ [A [AX [[[EG [AG [[[p64<=1 & 1<=p64] & [p157<=1 & 1<=p157]]]] & [AG [[p53<=1 & 1<=p53]] & [p34<=1 & 1<=p34]]] & [[[p130<=1 & 1<=p130] & [p19<=1 & 1<=p19]] & [[p124<=1 & 1<=p124] & EG [[[p30<=1 & 1<=p30] & [p130<=1 & 1<=p130]]]]]]] U [AX [AG [[[[p74<=1 & 1<=p74] & [p149<=1 & 1<=p149]] | [[p29<=1 & 1<=p29] & [p127<=1 & 1<=p127]]]]] | AG [EX [~ [[[p38<=1 & 1<=p38] & [p103<=1 & 1<=p103]]]]]]]]
normalized: ~ [[~ [EG [~ [[~ [E [true U ~ [EX [~ [[[p103<=1 & 1<=p103] & [p38<=1 & 1<=p38]]]]]]] | ~ [EX [E [true U ~ [[[[p127<=1 & 1<=p127] & [p29<=1 & 1<=p29]] | [[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [EX [~ [[[p103<=1 & 1<=p103] & [p38<=1 & 1<=p38]]]]]]] | ~ [EX [E [true U ~ [[[[p127<=1 & 1<=p127] & [p29<=1 & 1<=p29]] | [[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]]]]]]]] U [EX [~ [[[[EG [[[p130<=1 & 1<=p130] & [p30<=1 & 1<=p30]]] & [p124<=1 & 1<=p124]] & [[p19<=1 & 1<=p19] & [p130<=1 & 1<=p130]]] & [[[p34<=1 & 1<=p34] & ~ [E [true U ~ [[p53<=1 & 1<=p53]]]]] & EG [~ [E [true U ~ [[[p157<=1 & 1<=p157] & [p64<=1 & 1<=p64]]]]]]]]]] & ~ [[~ [E [true U ~ [EX [~ [[[p103<=1 & 1<=p103] & [p38<=1 & 1<=p38]]]]]]] | ~ [EX [E [true U ~ [[[[p127<=1 & 1<=p127] & [p29<=1 & 1<=p29]] | [[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]]]]]]]]]]]]]]

abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p29)
states: 1,360,800,000 (9)
abstracting: (p29<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p103)
states: 13,608,000,000 (10)
abstracting: (p103<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p64)
states: 1,360,800,000 (9)
abstracting: (p64<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p157)
states: 13,608,000,000 (10)
abstracting: (p157<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p53)
states: 1,360,800,000 (9)
abstracting: (p53<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p130)
states: 13,608,000,000 (10)
abstracting: (p130<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p124)
states: 13,608,000,000 (10)
abstracting: (p124<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p30)
states: 1,360,800,000 (9)
abstracting: (p30<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p130)
states: 13,608,000,000 (10)
abstracting: (p130<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p29)
states: 1,360,800,000 (9)
abstracting: (p29<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p103)
states: 13,608,000,000 (10)
abstracting: (p103<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p29)
states: 1,360,800,000 (9)
abstracting: (p29<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p103)
states: 13,608,000,000 (10)
abstracting: (p103<=1)
states: 13,608,000,001 (10)
..
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: E [AF [~ [[AF [[[[p91<=1 & 1<=p91] & [p156<=1 & 1<=p156]] & [[p34<=1 & 1<=p34] & [p151<=1 & 1<=p151]]]] & A [AX [[[p34<=1 & 1<=p34] & [p131<=1 & 1<=p131]]] U A [[p35<=1 & 1<=p35] U [[p63<=1 & 1<=p63] & [p143<=1 & 1<=p143]]]]]]] U E [[[p72<=1 & 1<=p72] & [p150<=1 & 1<=p150]] U AX [[EF [[[p36<=1 & 1<=p36] & [p133<=1 & 1<=p133]]] & [[p43<=1 & 1<=p43] & [p133<=1 & 1<=p133]]]]]]
normalized: E [~ [EG [[[~ [EG [~ [[~ [EG [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]] & ~ [E [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]] U [~ [[p35<=1 & 1<=p35]] & ~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]] & ~ [E [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]] U [~ [[p35<=1 & 1<=p35]] & ~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]]]]] U [EX [~ [[[p131<=1 & 1<=p131] & [p34<=1 & 1<=p34]]]] & ~ [[~ [EG [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]] & ~ [E [~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]] U [~ [[p35<=1 & 1<=p35]] & ~ [[[p143<=1 & 1<=p143] & [p63<=1 & 1<=p63]]]]]]]]]]]] & ~ [EG [~ [[[[p151<=1 & 1<=p151] & [p34<=1 & 1<=p34]] & [[p156<=1 & 1<=p156] & [p91<=1 & 1<=p91]]]]]]]]] U E [[[p150<=1 & 1<=p150] & [p72<=1 & 1<=p72]] U ~ [EX [~ [[[[p133<=1 & 1<=p133] & [p43<=1 & 1<=p43]] & E [true U [[p133<=1 & 1<=p133] & [p36<=1 & 1<=p36]]]]]]]]]

abstracting: (1<=p36)
states: 1,360,800,000 (9)
abstracting: (p36<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p133)
states: 13,608,000,000 (10)
abstracting: (p133<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p43)
states: 1,360,800,000 (9)
abstracting: (p43<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p133)
states: 13,608,000,000 (10)
abstracting: (p133<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p72)
states: 1,512,000,000 (9)
abstracting: (p72<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p150)
states: 13,608,000,000 (10)
abstracting: (p150<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p91)
states: 1,360,800,000 (9)
abstracting: (p91<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p156)
states: 13,608,000,000 (10)
abstracting: (p156<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p151)
states: 13,608,000,000 (10)
abstracting: (p151<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p35)
states: 1,360,800,000 (9)
abstracting: (p35<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p131)
states: 13,608,000,000 (10)
abstracting: (p131<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p35)
states: 1,360,800,000 (9)
abstracting: (p35<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p35)
states: 1,360,800,000 (9)
abstracting: (p35<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: EG [[A [~ [[[[p19<=1 & 1<=p19] & [p111<=1 & 1<=p111]] & [[p19<=1 & 1<=p19] & [p108<=1 & 1<=p108]]]] U EG [EF [[[p51<=1 & 1<=p51] & [p107<=1 & 1<=p107]]]]] | EG [[[[[p19<=0 & 0<=p19] | [[p116<=0 & 0<=p116] | [p54<=0 & 0<=p54]]] | [[[p80<=1 & 1<=p80] & [p120<=1 & 1<=p120]] | [[p94<=0 & 0<=p94] | [p126<=0 & 0<=p126]]]] & [[p39<=1 & 1<=p39] & [p133<=1 & 1<=p133]]]]]]
normalized: EG [[EG [[[[p133<=1 & 1<=p133] & [p39<=1 & 1<=p39]] & [[[[p126<=0 & 0<=p126] | [p94<=0 & 0<=p94]] | [[p120<=1 & 1<=p120] & [p80<=1 & 1<=p80]]] | [[[p54<=0 & 0<=p54] | [p116<=0 & 0<=p116]] | [p19<=0 & 0<=p19]]]]] | [~ [EG [~ [EG [E [true U [[p107<=1 & 1<=p107] & [p51<=1 & 1<=p51]]]]]]] & ~ [E [~ [EG [E [true U [[p107<=1 & 1<=p107] & [p51<=1 & 1<=p51]]]]] U [[[[p108<=1 & 1<=p108] & [p19<=1 & 1<=p19]] & [[p111<=1 & 1<=p111] & [p19<=1 & 1<=p19]]] & ~ [EG [E [true U [[p107<=1 & 1<=p107] & [p51<=1 & 1<=p51]]]]]]]]]]]

abstracting: (1<=p51)
states: 1,360,800,000 (9)
abstracting: (p51<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)

EG iterations: 0
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p111)
states: 13,608,000,000 (10)
abstracting: (p111<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p108)
states: 13,608,000,000 (10)
abstracting: (p108<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p51)
states: 1,360,800,000 (9)
abstracting: (p51<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)

EG iterations: 0
abstracting: (1<=p51)
states: 1,360,800,000 (9)
abstracting: (p51<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)

EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p19)
states: 13,608,000,001 (10)
abstracting: (p19<=0)
states: 11,340,000,001 (10)
abstracting: (0<=p116)
states: 13,608,000,001 (10)
abstracting: (p116<=0)
states: 1
abstracting: (0<=p54)
states: 13,608,000,001 (10)
abstracting: (p54<=0)
states: 12,247,200,001 (10)
abstracting: (1<=p80)
states: 1,360,800,000 (9)
abstracting: (p80<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p120)
states: 13,608,000,000 (10)
abstracting: (p120<=1)
states: 13,608,000,001 (10)
abstracting: (0<=p94)
states: 13,608,000,001 (10)
abstracting: (p94<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p126)
states: 13,608,000,001 (10)
abstracting: (p126<=0)
states: 1
abstracting: (1<=p39)
states: 1,360,800,000 (9)
abstracting: (p39<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p133)
states: 13,608,000,000 (10)
abstracting: (p133<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: EF [[[AX [[[p49<=1 & 1<=p49] & [p139<=1 & 1<=p139]]] & [p34<=1 & 1<=p34]] & [[p96<=1 & 1<=p96] & [A [[EF [[[p58<=1 & 1<=p58] & [p111<=1 & 1<=p111]]] | AF [[[p88<=1 & 1<=p88] & [p156<=1 & 1<=p156]]]] U A [E [[[p74<=1 & 1<=p74] & [p149<=1 & 1<=p149]] U [[p33<=1 & 1<=p33] & [p127<=1 & 1<=p127]]] U [[p73<=1 & 1<=p73] & [p114<=1 & 1<=p114]]]] & [EF [[[p1<=0 & 0<=p1] | [p118<=0 & 0<=p118]]] | [[p7<=1 & 1<=p7] & [p106<=1 & 1<=p106]]]]]]]
normalized: E [true U [[[[[[p106<=1 & 1<=p106] & [p7<=1 & 1<=p7]] | E [true U [[p118<=0 & 0<=p118] | [p1<=0 & 0<=p1]]]] & [~ [EG [~ [[~ [EG [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]] & ~ [E [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]] U [~ [E [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]] U [[p127<=1 & 1<=p127] & [p33<=1 & 1<=p33]]]] & ~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]] & ~ [E [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]] U [~ [E [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]] U [[p127<=1 & 1<=p127] & [p33<=1 & 1<=p33]]]] & ~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]]]]] U [~ [[~ [EG [~ [[[p156<=1 & 1<=p156] & [p88<=1 & 1<=p88]]]]] | E [true U [[p111<=1 & 1<=p111] & [p58<=1 & 1<=p58]]]]] & ~ [[~ [EG [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]] & ~ [E [~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]] U [~ [E [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]] U [[p127<=1 & 1<=p127] & [p33<=1 & 1<=p33]]]] & ~ [[[p114<=1 & 1<=p114] & [p73<=1 & 1<=p73]]]]]]]]]]]]] & [p96<=1 & 1<=p96]] & [[p34<=1 & 1<=p34] & ~ [EX [~ [[[p139<=1 & 1<=p139] & [p49<=1 & 1<=p49]]]]]]]]

abstracting: (1<=p49)
states: 1,360,800,000 (9)
abstracting: (p49<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p139)
states: 13,608,000,000 (10)
abstracting: (p139<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p96)
states: 13,608,000,000 (10)
abstracting: (p96<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p58)
states: 1,360,800,000 (9)
abstracting: (p58<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p111)
states: 13,608,000,000 (10)
abstracting: (p111<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p88)
states: 1,360,800,000 (9)
abstracting: (p88<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p156)
states: 13,608,000,000 (10)
abstracting: (p156<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p127)
states: 13,608,000,000 (10)
abstracting: (p127<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p73)
states: 1,512,000,000 (9)
abstracting: (p73<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p114)
states: 13,608,000,000 (10)
abstracting: (p114<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p1)
states: 13,608,000,001 (10)
abstracting: (p1<=0)
states: 11,340,000,001 (10)
abstracting: (0<=p118)
states: 13,608,000,001 (10)
abstracting: (p118<=0)
states: 1
abstracting: (1<=p7)
states: 1,944,000,000 (9)
abstracting: (p7<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p106)
states: 13,608,000,000 (10)
abstracting: (p106<=1)
states: 13,608,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: AG [A [[A [[~ [[[p7<=1 & 1<=p7] & [p115<=1 & 1<=p115]]] | [[[p93<=1 & 1<=p93] & [p153<=1 & 1<=p153]] | [[p91<=1 & 1<=p91] & [p154<=1 & 1<=p154]]]] U EX [[[p87<=1 & 1<=p87] & [p156<=1 & 1<=p156]]]] | [[p6<=1 & 1<=p6] & [p122<=1 & 1<=p122]]] U [[EG [[[p38<=1 & 1<=p38] & [p134<=1 & 1<=p134]]] | EF [[p23<=1 & 1<=p23]]] | [[[p19<=1 & 1<=p19] & [p108<=1 & 1<=p108]] | [~ [EG [[[p94<=1 & 1<=p94] & [p124<=1 & 1<=p124]]]] & EF [~ [[[p60<=1 & 1<=p60] & [p145<=1 & 1<=p145]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[E [true U ~ [[[p145<=1 & 1<=p145] & [p60<=1 & 1<=p60]]]] & ~ [EG [[[p124<=1 & 1<=p124] & [p94<=1 & 1<=p94]]]]] | [[p108<=1 & 1<=p108] & [p19<=1 & 1<=p19]]] | [E [true U [p23<=1 & 1<=p23]] | EG [[[p134<=1 & 1<=p134] & [p38<=1 & 1<=p38]]]]]]]] & ~ [E [~ [[[[E [true U ~ [[[p145<=1 & 1<=p145] & [p60<=1 & 1<=p60]]]] & ~ [EG [[[p124<=1 & 1<=p124] & [p94<=1 & 1<=p94]]]]] | [[p108<=1 & 1<=p108] & [p19<=1 & 1<=p19]]] | [E [true U [p23<=1 & 1<=p23]] | EG [[[p134<=1 & 1<=p134] & [p38<=1 & 1<=p38]]]]]] U [~ [[[[p122<=1 & 1<=p122] & [p6<=1 & 1<=p6]] | [~ [EG [~ [EX [[[p156<=1 & 1<=p156] & [p87<=1 & 1<=p87]]]]]] & ~ [E [~ [EX [[[p156<=1 & 1<=p156] & [p87<=1 & 1<=p87]]]] U [~ [[[[[p154<=1 & 1<=p154] & [p91<=1 & 1<=p91]] | [[p153<=1 & 1<=p153] & [p93<=1 & 1<=p93]]] | ~ [[[p115<=1 & 1<=p115] & [p7<=1 & 1<=p7]]]]] & ~ [EX [[[p156<=1 & 1<=p156] & [p87<=1 & 1<=p87]]]]]]]]]] & ~ [[[[E [true U ~ [[[p145<=1 & 1<=p145] & [p60<=1 & 1<=p60]]]] & ~ [EG [[[p124<=1 & 1<=p124] & [p94<=1 & 1<=p94]]]]] | [[p108<=1 & 1<=p108] & [p19<=1 & 1<=p19]]] | [E [true U [p23<=1 & 1<=p23]] | EG [[[p134<=1 & 1<=p134] & [p38<=1 & 1<=p38]]]]]]]]]]]]]

abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p134)
states: 13,608,000,000 (10)
abstracting: (p134<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p23)
states: 2,268,000,000 (9)
abstracting: (p23<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p108)
states: 13,608,000,000 (10)
abstracting: (p108<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p94)
states: 1,360,800,000 (9)
abstracting: (p94<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p124)
states: 13,608,000,000 (10)
abstracting: (p124<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p60)
states: 1,360,800,000 (9)
abstracting: (p60<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p145)
states: 13,608,000,000 (10)
abstracting: (p145<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p156)
states: 13,608,000,000 (10)
abstracting: (p156<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p7)
states: 1,944,000,000 (9)
abstracting: (p7<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p115)
states: 13,608,000,000 (10)
abstracting: (p115<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p153)
states: 13,608,000,000 (10)
abstracting: (p153<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p91)
states: 1,360,800,000 (9)
abstracting: (p91<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p154)
states: 13,608,000,000 (10)
abstracting: (p154<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p156)
states: 13,608,000,000 (10)
abstracting: (p156<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p156)
states: 13,608,000,000 (10)
abstracting: (p156<=1)
states: 13,608,000,001 (10)
..
EG iterations: 1
abstracting: (1<=p6)
states: 2,268,000,000 (9)
abstracting: (p6<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p122)
states: 13,608,000,000 (10)
abstracting: (p122<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p134)
states: 13,608,000,000 (10)
abstracting: (p134<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p23)
states: 2,268,000,000 (9)
abstracting: (p23<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p108)
states: 13,608,000,000 (10)
abstracting: (p108<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p94)
states: 1,360,800,000 (9)
abstracting: (p94<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p124)
states: 13,608,000,000 (10)
abstracting: (p124<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p60)
states: 1,360,800,000 (9)
abstracting: (p60<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p145)
states: 13,608,000,000 (10)
abstracting: (p145<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p134)
states: 13,608,000,000 (10)
abstracting: (p134<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p23)
states: 2,268,000,000 (9)
abstracting: (p23<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p19)
states: 2,268,000,000 (9)
abstracting: (p19<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p108)
states: 13,608,000,000 (10)
abstracting: (p108<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p94)
states: 1,360,800,000 (9)
abstracting: (p94<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p124)
states: 13,608,000,000 (10)
abstracting: (p124<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p60)
states: 1,360,800,000 (9)
abstracting: (p60<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p145)
states: 13,608,000,000 (10)
abstracting: (p145<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[EG [EX [[p83<=0 & 0<=p83]]] | [EG [AX [[[p4<=1 & 1<=p4] | [[p34<=1 & 1<=p34] & [p137<=1 & 1<=p137]]]]] | [[AF [AG [[[p70<=1 & 1<=p70] & [p148<=1 & 1<=p148]]]] & [[p13<=1 & 1<=p13] & [p102<=1 & 1<=p102]]] & [AX [AF [[[p25<=1 & 1<=p25] & [p113<=1 & 1<=p113]]]] & [E [[[p74<=1 & 1<=p74] & [p149<=1 & 1<=p149]] U [[p44<=1 & 1<=p44] & [p147<=1 & 1<=p147]]] & [[[[p38<=1 & 1<=p38] & [p132<=1 & 1<=p132]] | [[p43<=1 & 1<=p43] & [p101<=1 & 1<=p101]]] | [[[p7<=1 & 1<=p7] & [p96<=1 & 1<=p96]] | [[p80<=1 & 1<=p80] & [p119<=1 & 1<=p119]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[[[p119<=1 & 1<=p119] & [p80<=1 & 1<=p80]] | [[p96<=1 & 1<=p96] & [p7<=1 & 1<=p7]]] | [[[p101<=1 & 1<=p101] & [p43<=1 & 1<=p43]] | [[p132<=1 & 1<=p132] & [p38<=1 & 1<=p38]]]] & E [[[p149<=1 & 1<=p149] & [p74<=1 & 1<=p74]] U [[p147<=1 & 1<=p147] & [p44<=1 & 1<=p44]]]] & ~ [EX [EG [~ [[[p113<=1 & 1<=p113] & [p25<=1 & 1<=p25]]]]]]] & [[[p102<=1 & 1<=p102] & [p13<=1 & 1<=p13]] & ~ [EG [E [true U ~ [[[p148<=1 & 1<=p148] & [p70<=1 & 1<=p70]]]]]]]] | EG [~ [EX [~ [[[[p137<=1 & 1<=p137] & [p34<=1 & 1<=p34]] | [p4<=1 & 1<=p4]]]]]]] | EG [EX [[p83<=0 & 0<=p83]]]]]]]

abstracting: (0<=p83)
states: 13,608,000,001 (10)
abstracting: (p83<=0)
states: 12,247,200,001 (10)
.
EG iterations: 0
abstracting: (1<=p4)
states: 2,268,000,000 (9)
abstracting: (p4<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p137)
states: 13,608,000,000 (10)
abstracting: (p137<=1)
states: 13,608,000,001 (10)
..
EG iterations: 1
abstracting: (1<=p70)
states: 1,512,000,000 (9)
abstracting: (p70<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p148)
states: 13,608,000,000 (10)
abstracting: (p148<=1)
states: 13,608,000,001 (10)

EG iterations: 0
abstracting: (1<=p13)
states: 1,944,000,000 (9)
abstracting: (p13<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p102)
states: 13,608,000,000 (10)
abstracting: (p102<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p113)
states: 13,608,000,000 (10)
abstracting: (p113<=1)
states: 13,608,000,001 (10)
..
EG iterations: 2
.abstracting: (1<=p44)
states: 1,360,800,000 (9)
abstracting: (p44<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p147)
states: 13,608,000,000 (10)
abstracting: (p147<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p74)
states: 1,512,000,000 (9)
abstracting: (p74<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p38)
states: 1,360,800,000 (9)
abstracting: (p38<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p132)
states: 13,608,000,000 (10)
abstracting: (p132<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p43)
states: 1,360,800,000 (9)
abstracting: (p43<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p101)
states: 13,608,000,000 (10)
abstracting: (p101<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p7)
states: 1,944,000,000 (9)
abstracting: (p7<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p96)
states: 13,608,000,000 (10)
abstracting: (p96<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p80)
states: 1,360,800,000 (9)
abstracting: (p80<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p119)
states: 13,608,000,000 (10)
abstracting: (p119<=1)
states: 13,608,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: EF [[AF [[[EG [[[p72<=1 & 1<=p72] & [p116<=1 & 1<=p116]]] & [[[[p88<=1 & 1<=p88] & [p123<=1 & 1<=p123]] | [[[p46<=1 & 1<=p46] & [p105<=1 & 1<=p105]] | [[p52<=1 & 1<=p52] & [p109<=1 & 1<=p109]]]] & [p55<=1 & 1<=p55]]] & [[p137<=1 & 1<=p137] & [[p22<=1 & 1<=p22] & [p125<=1 & 1<=p125]]]]] | [A [~ [[[p64<=1 & 1<=p64] & [[p128<=1 & 1<=p128] & [[p7<=1 & 1<=p7] | [[p49<=1 & 1<=p49] & [p107<=1 & 1<=p107]]]]]] U ~ [EX [[[p34<=1 & 1<=p34] & [p146<=1 & 1<=p146]]]]] & [A [~ [[[p33<=1 & 1<=p33] & [p97<=1 & 1<=p97]]] U [AF [[[p64<=1 & 1<=p64] & [p112<=1 & 1<=p112]]] | [[p87<=1 & 1<=p87] & [p126<=1 & 1<=p126]]]] | [[p25<=1 & 1<=p25] & [p104<=1 & 1<=p104]]]]]]
normalized: E [true U [[[[[p104<=1 & 1<=p104] & [p25<=1 & 1<=p25]] | [~ [EG [~ [[[[p126<=1 & 1<=p126] & [p87<=1 & 1<=p87]] | ~ [EG [~ [[[p112<=1 & 1<=p112] & [p64<=1 & 1<=p64]]]]]]]]] & ~ [E [~ [[[[p126<=1 & 1<=p126] & [p87<=1 & 1<=p87]] | ~ [EG [~ [[[p112<=1 & 1<=p112] & [p64<=1 & 1<=p64]]]]]]] U [[[p97<=1 & 1<=p97] & [p33<=1 & 1<=p33]] & ~ [[[[p126<=1 & 1<=p126] & [p87<=1 & 1<=p87]] | ~ [EG [~ [[[p112<=1 & 1<=p112] & [p64<=1 & 1<=p64]]]]]]]]]]]] & [~ [EG [EX [[[p146<=1 & 1<=p146] & [p34<=1 & 1<=p34]]]]] & ~ [E [EX [[[p146<=1 & 1<=p146] & [p34<=1 & 1<=p34]]] U [[[[[[p107<=1 & 1<=p107] & [p49<=1 & 1<=p49]] | [p7<=1 & 1<=p7]] & [p128<=1 & 1<=p128]] & [p64<=1 & 1<=p64]] & EX [[[p146<=1 & 1<=p146] & [p34<=1 & 1<=p34]]]]]]]] | ~ [EG [~ [[[[[p125<=1 & 1<=p125] & [p22<=1 & 1<=p22]] & [p137<=1 & 1<=p137]] & [[[p55<=1 & 1<=p55] & [[[[p109<=1 & 1<=p109] & [p52<=1 & 1<=p52]] | [[p105<=1 & 1<=p105] & [p46<=1 & 1<=p46]]] | [[p123<=1 & 1<=p123] & [p88<=1 & 1<=p88]]]] & EG [[[p116<=1 & 1<=p116] & [p72<=1 & 1<=p72]]]]]]]]]]

abstracting: (1<=p72)
states: 1,512,000,000 (9)
abstracting: (p72<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p116)
states: 13,608,000,000 (10)
abstracting: (p116<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p88)
states: 1,360,800,000 (9)
abstracting: (p88<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p123)
states: 13,608,000,000 (10)
abstracting: (p123<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p46)
states: 1,360,800,000 (9)
abstracting: (p46<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p105)
states: 13,608,000,000 (10)
abstracting: (p105<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p52)
states: 1,360,800,000 (9)
abstracting: (p52<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p109)
states: 13,608,000,000 (10)
abstracting: (p109<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p55)
states: 1,360,800,000 (9)
abstracting: (p55<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p137)
states: 13,608,000,000 (10)
abstracting: (p137<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p22)
states: 2,268,000,000 (9)
abstracting: (p22<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p125)
states: 13,608,000,000 (10)
abstracting: (p125<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p146)
states: 13,608,000,000 (10)
abstracting: (p146<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p64)
states: 1,360,800,000 (9)
abstracting: (p64<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p128)
states: 13,608,000,000 (10)
abstracting: (p128<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p7)
states: 1,944,000,000 (9)
abstracting: (p7<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p49)
states: 1,360,800,000 (9)
abstracting: (p49<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p146)
states: 13,608,000,000 (10)
abstracting: (p146<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p146)
states: 13,608,000,000 (10)
abstracting: (p146<=1)
states: 13,608,000,001 (10)
..
EG iterations: 1
abstracting: (1<=p64)
states: 1,360,800,000 (9)
abstracting: (p64<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p112)
states: 13,608,000,000 (10)
abstracting: (p112<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p33)
states: 1,360,800,000 (9)
abstracting: (p33<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p97)
states: 13,608,000,000 (10)
abstracting: (p97<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p64)
states: 1,360,800,000 (9)
abstracting: (p64<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p112)
states: 13,608,000,000 (10)
abstracting: (p112<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p64)
states: 1,360,800,000 (9)
abstracting: (p64<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p112)
states: 13,608,000,000 (10)
abstracting: (p112<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p104)
states: 13,608,000,000 (10)
abstracting: (p104<=1)
states: 13,608,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: EF [[EF [[EX [[[p65<=0 & 0<=p65] | [p142<=0 & 0<=p142]]] & [EX [[[p61<=1 & 1<=p61] & [p141<=1 & 1<=p141]]] & EG [[p36<=1 & 1<=p36]]]]] & [[~ [E [[[p13<=1 & 1<=p13] & [p120<=1 & 1<=p120]] U AF [[[p25<=1 & 1<=p25] & [p126<=1 & 1<=p126]]]]] | [A [[[[p93<=1 & 1<=p93] & [p150<=1 & 1<=p150]] | [[p43<=1 & 1<=p43] & [1<=p101 & p101<=1]]] U ~ [[[[p52<=1 & 1<=p52] & [p107<=1 & 1<=p107]] | [[p25<=1 & 1<=p25] & [p113<=1 & 1<=p113]]]]] | AF [[[[p25<=0 & 0<=p25] | [p109<=0 & 0<=p109]] & [p87<=0 & 0<=p87]]]]] & [EX [[E [[p93<=1 & 1<=p93] U [[p43<=1 & 1<=p43] & [p136<=1 & 1<=p136]]] & EX [[[p14<=1 & 1<=p14] & [p98<=1 & 1<=p98]]]]] | [[[p54<=1 & 1<=p54] & [p143<=1 & 1<=p143]] & [A [[[p63<=1 & 1<=p63] & [p142<=1 & 1<=p142]] U [p55<=1 & 1<=p55]] & AX [[p77<=1 & 1<=p77]]]]]]]]
normalized: E [true U [[[[[~ [EX [~ [[p77<=1 & 1<=p77]]]] & [~ [EG [~ [[p55<=1 & 1<=p55]]]] & ~ [E [~ [[p55<=1 & 1<=p55]] U [~ [[[p142<=1 & 1<=p142] & [p63<=1 & 1<=p63]]] & ~ [[p55<=1 & 1<=p55]]]]]]] & [[p143<=1 & 1<=p143] & [p54<=1 & 1<=p54]]] | EX [[EX [[[p98<=1 & 1<=p98] & [p14<=1 & 1<=p14]]] & E [[p93<=1 & 1<=p93] U [[p136<=1 & 1<=p136] & [p43<=1 & 1<=p43]]]]]] & [[~ [EG [~ [[[p87<=0 & 0<=p87] & [[p109<=0 & 0<=p109] | [p25<=0 & 0<=p25]]]]]] | [~ [EG [[[[p113<=1 & 1<=p113] & [p25<=1 & 1<=p25]] | [[p107<=1 & 1<=p107] & [p52<=1 & 1<=p52]]]]] & ~ [E [[[[p113<=1 & 1<=p113] & [p25<=1 & 1<=p25]] | [[p107<=1 & 1<=p107] & [p52<=1 & 1<=p52]]] U [~ [[[[1<=p101 & p101<=1] & [p43<=1 & 1<=p43]] | [[p150<=1 & 1<=p150] & [p93<=1 & 1<=p93]]]] & [[[p113<=1 & 1<=p113] & [p25<=1 & 1<=p25]] | [[p107<=1 & 1<=p107] & [p52<=1 & 1<=p52]]]]]]]] | ~ [E [[[p120<=1 & 1<=p120] & [p13<=1 & 1<=p13]] U ~ [EG [~ [[[p126<=1 & 1<=p126] & [p25<=1 & 1<=p25]]]]]]]]] & E [true U [[EG [[p36<=1 & 1<=p36]] & EX [[[p141<=1 & 1<=p141] & [p61<=1 & 1<=p61]]]] & EX [[[p142<=0 & 0<=p142] | [p65<=0 & 0<=p65]]]]]]]

abstracting: (0<=p65)
states: 13,608,000,001 (10)
abstracting: (p65<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p142)
states: 13,608,000,001 (10)
abstracting: (p142<=0)
states: 1
.abstracting: (1<=p61)
states: 1,360,800,000 (9)
abstracting: (p61<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p141)
states: 13,608,000,000 (10)
abstracting: (p141<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p36)
states: 1,360,800,000 (9)
abstracting: (p36<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p126)
states: 13,608,000,000 (10)
abstracting: (p126<=1)
states: 13,608,000,001 (10)
..
EG iterations: 2
abstracting: (1<=p13)
states: 1,944,000,000 (9)
abstracting: (p13<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p120)
states: 13,608,000,000 (10)
abstracting: (p120<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p52)
states: 1,360,800,000 (9)
abstracting: (p52<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p113)
states: 13,608,000,000 (10)
abstracting: (p113<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p150)
states: 13,608,000,000 (10)
abstracting: (p150<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p43)
states: 1,360,800,000 (9)
abstracting: (p43<=1)
states: 13,608,000,001 (10)
abstracting: (p101<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p101)
states: 13,608,000,000 (10)
abstracting: (1<=p52)
states: 1,360,800,000 (9)
abstracting: (p52<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p113)
states: 13,608,000,000 (10)
abstracting: (p113<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p52)
states: 1,360,800,000 (9)
abstracting: (p52<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p113)
states: 13,608,000,000 (10)
abstracting: (p113<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (0<=p25)
states: 13,608,000,001 (10)
abstracting: (p25<=0)
states: 11,340,000,001 (10)
abstracting: (0<=p109)
states: 13,608,000,001 (10)
abstracting: (p109<=0)
states: 1
abstracting: (0<=p87)
states: 13,608,000,001 (10)
abstracting: (p87<=0)
states: 12,247,200,001 (10)
.
EG iterations: 1
abstracting: (1<=p43)
states: 1,360,800,000 (9)
abstracting: (p43<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p136)
states: 13,608,000,000 (10)
abstracting: (p136<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p14)
states: 2,268,000,000 (9)
abstracting: (p14<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p98)
states: 13,608,000,000 (10)
abstracting: (p98<=1)
states: 13,608,000,001 (10)
..abstracting: (1<=p54)
states: 1,360,800,000 (9)
abstracting: (p54<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p143)
states: 13,608,000,000 (10)
abstracting: (p143<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p55)
states: 1,360,800,000 (9)
abstracting: (p55<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p63)
states: 1,360,800,000 (9)
abstracting: (p63<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p142)
states: 13,608,000,000 (10)
abstracting: (p142<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p55)
states: 1,360,800,000 (9)
abstracting: (p55<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p55)
states: 1,360,800,000 (9)
abstracting: (p55<=1)
states: 13,608,000,001 (10)
..
EG iterations: 2
abstracting: (1<=p77)
states: 1,360,800,000 (9)
abstracting: (p77<=1)
states: 13,608,000,001 (10)
.-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.122sec

checking: AG [[[[AG [AX [[[p36<=0 & 0<=p36] | [p101<=0 & 0<=p101]]]] | EX [[[p74<=0 & 0<=p74] | [p146<=0 & 0<=p146]]]] | [EF [[[p58<=0 & 0<=p58] | [p110<=0 & 0<=p110]]] | [~ [A [[[p78<=1 & 1<=p78] & [p121<=1 & 1<=p121]] U [p10<=1 & 1<=p10]]] | [~ [A [[[p78<=1 & 1<=p78] & [p151<=1 & 1<=p151]] U AX [[p28<=1 & 1<=p28]]]] & [AX [[[p89<=0 & 0<=p89] | [p124<=0 & 0<=p124]]] | [[[p51<=1 & 1<=p51] & [p107<=1 & 1<=p107]] | [EX [[[p83<=0 & 0<=p83] | [p130<=0 & 0<=p130]]] & [[p63<=0 & 0<=p63] | [p144<=0 & 0<=p144]]]]]]]]] & [EX [~ [A [[[p72<=1 & 1<=p72] & [p149<=1 & 1<=p149]] U [[p34<=1 & 1<=p34] & [p95<=1 & 1<=p95]]]]] | [~ [A [[[[p25<=1 & 1<=p25] & [p117<=1 & 1<=p117]] & [[p44<=1 & 1<=p44] & [p138<=1 & 1<=p138]]] U [[[p34<=1 & 1<=p34] & [p131<=1 & 1<=p131]] | [[p6<=1 & 1<=p6] & [p100<=1 & 1<=p100]]]]] | AX [~ [A [[[p41<=1 & 1<=p41] & [p135<=1 & 1<=p135]] U [[p45<=1 & 1<=p45] & [p132<=1 & 1<=p132]]]]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EX [[~ [EG [~ [[[p132<=1 & 1<=p132] & [p45<=1 & 1<=p45]]]]] & ~ [E [~ [[[p132<=1 & 1<=p132] & [p45<=1 & 1<=p45]]] U [~ [[[p135<=1 & 1<=p135] & [p41<=1 & 1<=p41]]] & ~ [[[p132<=1 & 1<=p132] & [p45<=1 & 1<=p45]]]]]]]]] | ~ [[~ [EG [~ [[[[p100<=1 & 1<=p100] & [p6<=1 & 1<=p6]] | [[p131<=1 & 1<=p131] & [p34<=1 & 1<=p34]]]]]] & ~ [E [~ [[[[p100<=1 & 1<=p100] & [p6<=1 & 1<=p6]] | [[p131<=1 & 1<=p131] & [p34<=1 & 1<=p34]]]] U [~ [[[[p138<=1 & 1<=p138] & [p44<=1 & 1<=p44]] & [[p117<=1 & 1<=p117] & [p25<=1 & 1<=p25]]]] & ~ [[[[p100<=1 & 1<=p100] & [p6<=1 & 1<=p6]] | [[p131<=1 & 1<=p131] & [p34<=1 & 1<=p34]]]]]]]]]] | EX [~ [[~ [EG [~ [[[p95<=1 & 1<=p95] & [p34<=1 & 1<=p34]]]]] & ~ [E [~ [[[p95<=1 & 1<=p95] & [p34<=1 & 1<=p34]]] U [~ [[[p149<=1 & 1<=p149] & [p72<=1 & 1<=p72]]] & ~ [[[p95<=1 & 1<=p95] & [p34<=1 & 1<=p34]]]]]]]]]] & [[[[[[[[[p144<=0 & 0<=p144] | [p63<=0 & 0<=p63]] & EX [[[p130<=0 & 0<=p130] | [p83<=0 & 0<=p83]]]] | [[p107<=1 & 1<=p107] & [p51<=1 & 1<=p51]]] | ~ [EX [~ [[[p124<=0 & 0<=p124] | [p89<=0 & 0<=p89]]]]]] & ~ [[~ [EG [EX [~ [[p28<=1 & 1<=p28]]]]] & ~ [E [EX [~ [[p28<=1 & 1<=p28]]] U [~ [[[p151<=1 & 1<=p151] & [p78<=1 & 1<=p78]]] & EX [~ [[p28<=1 & 1<=p28]]]]]]]]] | ~ [[~ [EG [~ [[p10<=1 & 1<=p10]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [~ [[[p121<=1 & 1<=p121] & [p78<=1 & 1<=p78]]] & ~ [[p10<=1 & 1<=p10]]]]]]]] | E [true U [[p110<=0 & 0<=p110] | [p58<=0 & 0<=p58]]]] | [EX [[[p146<=0 & 0<=p146] | [p74<=0 & 0<=p74]]] | ~ [E [true U EX [~ [[[p101<=0 & 0<=p101] | [p36<=0 & 0<=p36]]]]]]]]]]]]

abstracting: (0<=p36)
states: 13,608,000,001 (10)
abstracting: (p36<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p101)
states: 13,608,000,001 (10)
abstracting: (p101<=0)
states: 1
.abstracting: (0<=p74)
states: 13,608,000,001 (10)
abstracting: (p74<=0)
states: 12,096,000,001 (10)
abstracting: (0<=p146)
states: 13,608,000,001 (10)
abstracting: (p146<=0)
states: 1
.abstracting: (0<=p58)
states: 13,608,000,001 (10)
abstracting: (p58<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p110)
states: 13,608,000,001 (10)
abstracting: (p110<=0)
states: 1
abstracting: (1<=p10)
states: 1,944,000,000 (9)
abstracting: (p10<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p78)
states: 1,360,800,000 (9)
abstracting: (p78<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p121)
states: 13,608,000,000 (10)
abstracting: (p121<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p10)
states: 1,944,000,000 (9)
abstracting: (p10<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p10)
states: 1,944,000,000 (9)
abstracting: (p10<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
abstracting: (1<=p28)
states: 1,360,800,000 (9)
abstracting: (p28<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p78)
states: 1,360,800,000 (9)
abstracting: (p78<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p151)
states: 13,608,000,000 (10)
abstracting: (p151<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p28)
states: 1,360,800,000 (9)
abstracting: (p28<=1)
states: 13,608,000,001 (10)
.abstracting: (1<=p28)
states: 1,360,800,000 (9)
abstracting: (p28<=1)
states: 13,608,000,001 (10)
.
EG iterations: 0
abstracting: (0<=p89)
states: 13,608,000,001 (10)
abstracting: (p89<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p124)
states: 13,608,000,001 (10)
abstracting: (p124<=0)
states: 1
.abstracting: (1<=p51)
states: 1,360,800,000 (9)
abstracting: (p51<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p107)
states: 13,608,000,000 (10)
abstracting: (p107<=1)
states: 13,608,000,001 (10)
abstracting: (0<=p83)
states: 13,608,000,001 (10)
abstracting: (p83<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p130)
states: 13,608,000,001 (10)
abstracting: (p130<=0)
states: 1
.abstracting: (0<=p63)
states: 13,608,000,001 (10)
abstracting: (p63<=0)
states: 12,247,200,001 (10)
abstracting: (0<=p144)
states: 13,608,000,001 (10)
abstracting: (p144<=0)
states: 1
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p95)
states: 13,608,000,000 (10)
abstracting: (p95<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p72)
states: 1,512,000,000 (9)
abstracting: (p72<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p149)
states: 13,608,000,000 (10)
abstracting: (p149<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p95)
states: 13,608,000,000 (10)
abstracting: (p95<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p95)
states: 13,608,000,000 (10)
abstracting: (p95<=1)
states: 13,608,000,001 (10)
.
EG iterations: 1
.abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p131)
states: 13,608,000,000 (10)
abstracting: (p131<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p6)
states: 2,268,000,000 (9)
abstracting: (p6<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p100)
states: 13,608,000,000 (10)
abstracting: (p100<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p25)
states: 2,268,000,000 (9)
abstracting: (p25<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p117)
states: 13,608,000,000 (10)
abstracting: (p117<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p44)
states: 1,360,800,000 (9)
abstracting: (p44<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p138)
states: 13,608,000,000 (10)
abstracting: (p138<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p131)
states: 13,608,000,000 (10)
abstracting: (p131<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p6)
states: 2,268,000,000 (9)
abstracting: (p6<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p100)
states: 13,608,000,000 (10)
abstracting: (p100<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p34)
states: 1,360,800,000 (9)
abstracting: (p34<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p131)
states: 13,608,000,000 (10)
abstracting: (p131<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p6)
states: 2,268,000,000 (9)
abstracting: (p6<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p100)
states: 13,608,000,000 (10)
abstracting: (p100<=1)
states: 13,608,000,001 (10)
..
EG iterations: 2
abstracting: (1<=p45)
states: 1,360,800,000 (9)
abstracting: (p45<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p132)
states: 13,608,000,000 (10)
abstracting: (p132<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p41)
states: 1,360,800,000 (9)
abstracting: (p41<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p135)
states: 13,608,000,000 (10)
abstracting: (p135<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p45)
states: 1,360,800,000 (9)
abstracting: (p45<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p132)
states: 13,608,000,000 (10)
abstracting: (p132<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p45)
states: 1,360,800,000 (9)
abstracting: (p45<=1)
states: 13,608,000,001 (10)
abstracting: (1<=p132)
states: 13,608,000,000 (10)
abstracting: (p132<=1)
states: 13,608,000,001 (10)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA DLCround-PT-06a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

totally nodes used: 174965 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 988419 2661979 3650398
used/not used/entry size/cache size: 2723289 64385575 16 1024MB
basic ops cache: hits/miss/sum: 136971 313918 450889
used/not used/entry size/cache size: 442752 16334464 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: 7727 17919 25646
used/not used/entry size/cache size: 17915 8370693 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 66937211
1 168416
2 3163
3 73
4 1
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.198sec


BK_STOP 1678452782887

--------------------
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:2009 (7), effective:84 (0)

initing FirstDep: 0m 0.000sec


iterations count:613 (2), effective:9 (0)

iterations count:509 (1), effective:9 (0)

iterations count:595 (2), effective:8 (0)

iterations count:669 (2), effective:9 (0)

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

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

iterations count:666 (2), effective:11 (0)

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

iterations count:585 (2), effective:10 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:765 (2), effective:10 (0)

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

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

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

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

iterations count:600 (2), effective:10 (0)

iterations count:600 (2), effective:10 (0)

iterations count:600 (2), effective:10 (0)

iterations count:321 (1), effective:9 (0)

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

iterations count:642 (2), effective:10 (0)

iterations count:321 (1), effective:9 (0)

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

iterations count:321 (1), effective:9 (0)

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

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

iterations count:553 (2), effective:6 (0)

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

iterations count:540 (2), effective:8 (0)

iterations count:553 (2), effective:6 (0)

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

iterations count:553 (2), effective:6 (0)

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

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

iterations count:573 (2), effective:9 (0)

iterations count:483 (1), effective:18 (0)

iterations count:563 (2), effective:10 (0)

iterations count:769 (2), effective:25 (0)

iterations count:901 (3), effective:18 (0)

iterations count:310 (1), effective:5 (0)

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

iterations count:527 (2), effective:9 (0)

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

iterations count:888 (3), effective:19 (0)

iterations count:763 (2), effective:9 (0)

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

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

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

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

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

iterations count:314 (1), effective:1 (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="DLCround-PT-06a"
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 DLCround-PT-06a, 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 r106-tall-167814483000666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-06a.tgz
mv DLCround-PT-06a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;