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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 6.1K Feb 25 19:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 19:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 19:11 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.7K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 20:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 20:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 566K 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-09a-CTLFireability-00
FORMULA_NAME DLCround-PT-09a-CTLFireability-01
FORMULA_NAME DLCround-PT-09a-CTLFireability-02
FORMULA_NAME DLCround-PT-09a-CTLFireability-03
FORMULA_NAME DLCround-PT-09a-CTLFireability-04
FORMULA_NAME DLCround-PT-09a-CTLFireability-05
FORMULA_NAME DLCround-PT-09a-CTLFireability-06
FORMULA_NAME DLCround-PT-09a-CTLFireability-07
FORMULA_NAME DLCround-PT-09a-CTLFireability-08
FORMULA_NAME DLCround-PT-09a-CTLFireability-09
FORMULA_NAME DLCround-PT-09a-CTLFireability-10
FORMULA_NAME DLCround-PT-09a-CTLFireability-11
FORMULA_NAME DLCround-PT-09a-CTLFireability-12
FORMULA_NAME DLCround-PT-09a-CTLFireability-13
FORMULA_NAME DLCround-PT-09a-CTLFireability-14
FORMULA_NAME DLCround-PT-09a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678460233980

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-09a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 14:57:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 14:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 14:57:15] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-10 14:57:15] [INFO ] Transformed 299 places.
[2023-03-10 14:57:15] [INFO ] Transformed 2243 transitions.
[2023-03-10 14:57:15] [INFO ] Found NUPN structural information;
[2023-03-10 14:57:15] [INFO ] Parsed PT model containing 299 places and 2243 transitions and 8689 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 216 transitions
Reduce redundant transitions removed 216 transitions.
FORMULA DLCround-PT-09a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 133 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 2027/2027 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 290 transition count 1916
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 290 transition count 1916
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 290 transition count 1914
Drop transitions removed 691 transitions
Redundant transition composition rules discarded 691 transitions
Iterating global reduction 1 with 691 rules applied. Total rules applied 711 place count 290 transition count 1223
Applied a total of 711 rules in 76 ms. Remains 290 /299 variables (removed 9) and now considering 1223/2027 (removed 804) transitions.
[2023-03-10 14:57:15] [INFO ] Flow matrix only has 191 transitions (discarded 1032 similar events)
// Phase 1: matrix 191 rows 290 cols
[2023-03-10 14:57:15] [INFO ] Computed 184 place invariants in 16 ms
[2023-03-10 14:57:16] [INFO ] Implicit Places using invariants in 793 ms returned [120, 126, 127, 129, 130, 131, 132, 133, 134, 136, 140, 142, 143, 144, 145, 146, 148, 149, 150, 151, 152, 153, 156, 159, 160, 162, 163, 164, 165, 166, 167, 172, 174, 178, 180, 181, 182, 184, 186, 188, 189, 190, 191, 192, 193, 194, 196, 198, 200, 203, 209, 212, 215, 220, 221, 222, 224, 225, 227, 228, 229, 230, 232, 233, 234, 235, 239, 240, 241, 243, 244, 245, 247, 248, 250, 253, 254, 255, 259, 260, 261, 263, 264, 265, 266, 267, 268, 269, 273, 276, 282]
Discarding 91 places :
Ensure Unique test removed 442 transitions
Reduce isomorphic transitions removed 442 transitions.
Implicit Place search using SMT only with invariants took 825 ms to find 91 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/299 places, 781/2027 transitions.
Drop transitions removed 524 transitions
Redundant transition composition rules discarded 524 transitions
Iterating global reduction 0 with 524 rules applied. Total rules applied 524 place count 199 transition count 257
Applied a total of 524 rules in 8 ms. Remains 199 /199 variables (removed 0) and now considering 257/781 (removed 524) transitions.
[2023-03-10 14:57:16] [INFO ] Flow matrix only has 191 transitions (discarded 66 similar events)
// Phase 1: matrix 191 rows 199 cols
[2023-03-10 14:57:16] [INFO ] Computed 93 place invariants in 2 ms
[2023-03-10 14:57:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-10 14:57:16] [INFO ] Flow matrix only has 191 transitions (discarded 66 similar events)
[2023-03-10 14:57:16] [INFO ] Invariant cache hit.
[2023-03-10 14:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 14:57:16] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 199/299 places, 257/2027 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1082 ms. Remains : 199/299 places, 257/2027 transitions.
Support contains 133 out of 199 places after structural reductions.
[2023-03-10 14:57:16] [INFO ] Flatten gal took : 36 ms
[2023-03-10 14:57:16] [INFO ] Flatten gal took : 17 ms
[2023-03-10 14:57:16] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 131 out of 199 places (down from 133) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 76) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 14:57:17] [INFO ] Flow matrix only has 191 transitions (discarded 66 similar events)
[2023-03-10 14:57:17] [INFO ] Invariant cache hit.
[2023-03-10 14:57:17] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 14:57:17] [INFO ] [Nat]Absence check using 93 positive place invariants in 17 ms returned sat
[2023-03-10 14:57:17] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-10 14:57:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 12 ms
FORMULA DLCround-PT-09a-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 11 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 128 out of 199 places (down from 129) after GAL structural reductions.
Computed a total of 80 stabilizing places and 1 stable transitions
Graph (complete) has 349 edges and 199 vertex of which 120 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Graph (trivial) has 245 edges and 199 vertex of which 108 / 199 are part of one of the 13 SCC in 2 ms
Free SCC test removed 95 places
Ensure Unique test removed 220 transitions
Reduce isomorphic transitions removed 220 transitions.
Graph (complete) has 129 edges and 104 vertex of which 28 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 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 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 25 transition count 33
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 21 place count 13 transition count 20
Iterating global reduction 3 with 12 rules applied. Total rules applied 33 place count 13 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 13 transition count 18
Applied a total of 35 rules in 12 ms. Remains 13 /199 variables (removed 186) and now considering 18/257 (removed 239) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 13/199 places, 18/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Graph (trivial) has 253 edges and 199 vertex of which 116 / 199 are part of one of the 14 SCC in 1 ms
Free SCC test removed 102 places
Ensure Unique test removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Graph (complete) has 113 edges and 97 vertex of which 19 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.0 ms
Discarding 78 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 18 transition count 20
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 6 transition count 8
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 6 transition count 7
Applied a total of 29 rules in 4 ms. Remains 6 /199 variables (removed 193) and now considering 7/257 (removed 250) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 6/199 places, 7/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 137 transition count 257
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 78 place count 121 transition count 225
Iterating global reduction 1 with 16 rules applied. Total rules applied 94 place count 121 transition count 225
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 121 transition count 223
Applied a total of 96 rules in 4 ms. Remains 121 /199 variables (removed 78) and now considering 223/257 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 121/199 places, 223/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 125 transition count 257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 108 transition count 223
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 108 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 110 place count 108 transition count 221
Applied a total of 110 rules in 3 ms. Remains 108 /199 variables (removed 91) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 108/199 places, 221/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 125 transition count 257
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 90 place count 109 transition count 225
Iterating global reduction 1 with 16 rules applied. Total rules applied 106 place count 109 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 109 transition count 223
Applied a total of 108 rules in 3 ms. Remains 109 /199 variables (removed 90) and now considering 223/257 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 109/199 places, 223/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 135 transition count 257
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 120 transition count 227
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 120 transition count 227
Applied a total of 94 rules in 4 ms. Remains 120 /199 variables (removed 79) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/199 places, 227/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 129 transition count 257
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 86 place count 113 transition count 225
Iterating global reduction 1 with 16 rules applied. Total rules applied 102 place count 113 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 104 place count 113 transition count 223
Applied a total of 104 rules in 4 ms. Remains 113 /199 variables (removed 86) and now considering 223/257 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/199 places, 223/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 128 transition count 257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 88 place count 111 transition count 223
Iterating global reduction 1 with 17 rules applied. Total rules applied 105 place count 111 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 111 transition count 221
Applied a total of 107 rules in 4 ms. Remains 111 /199 variables (removed 88) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 111/199 places, 221/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 121 transition count 257
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 103 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 103 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 116 place count 103 transition count 219
Applied a total of 116 rules in 2 ms. Remains 103 /199 variables (removed 96) and now considering 219/257 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 103/199 places, 219/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 124 transition count 257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 107 transition count 223
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 107 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 107 transition count 221
Applied a total of 111 rules in 3 ms. Remains 107 /199 variables (removed 92) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/199 places, 221/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 124 transition count 257
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 92 place count 107 transition count 223
Iterating global reduction 1 with 17 rules applied. Total rules applied 109 place count 107 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 107 transition count 221
Applied a total of 111 rules in 3 ms. Remains 107 /199 variables (removed 92) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 107/199 places, 221/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 5 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Graph (trivial) has 243 edges and 199 vertex of which 111 / 199 are part of one of the 14 SCC in 0 ms
Free SCC test removed 97 places
Ensure Unique test removed 222 transitions
Reduce isomorphic transitions removed 222 transitions.
Graph (complete) has 127 edges and 102 vertex of which 25 are kept as prefixes of interest. Removing 77 places using SCC suffix rule.0 ms
Discarding 77 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 25 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 34
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 12 transition count 21
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 12 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 12 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 11 transition count 18
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 11 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 11 transition count 17
Applied a total of 34 rules in 4 ms. Remains 11 /199 variables (removed 188) and now considering 17/257 (removed 240) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 11/199 places, 17/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 135 transition count 257
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 78 place count 121 transition count 229
Iterating global reduction 1 with 14 rules applied. Total rules applied 92 place count 121 transition count 229
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 121 transition count 227
Applied a total of 94 rules in 3 ms. Remains 121 /199 variables (removed 78) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 121/199 places, 227/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 257/257 transitions.
Graph (trivial) has 252 edges and 199 vertex of which 116 / 199 are part of one of the 15 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Graph (complete) has 117 edges and 98 vertex of which 20 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.0 ms
Discarding 78 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 20 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 19 transition count 23
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 17 place count 7 transition count 11
Iterating global reduction 2 with 12 rules applied. Total rules applied 29 place count 7 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 7 transition count 10
Applied a total of 30 rules in 3 ms. Remains 7 /199 variables (removed 192) and now considering 10/257 (removed 247) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 7/199 places, 10/257 transitions.
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 14:57:17] [INFO ] Input system was already deterministic with 10 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA DLCround-PT-09a-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 10 ms
[2023-03-10 14:57:17] [INFO ] Flatten gal took : 9 ms
[2023-03-10 14:57:17] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-10 14:57:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 257 transitions and 606 arcs took 1 ms.
Total runtime 2453 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: 199 NrTr: 257 NrArc: 606)

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.147sec


-> reachability set: #nodes 10260 (1.0e+04) #states 6,561,000,000,001 (12)



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

checking: EF [EG [[[p30<=1 & 1<=p30] & [p152<=1 & 1<=p152]]]]
normalized: E [true U EG [[[p152<=1 & 1<=p152] & [p30<=1 & 1<=p30]]]]

abstracting: (1<=p30)
states: 656,100,000,000 (11)
abstracting: (p30<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p152)
states: 6,561,000,000,000 (12)
abstracting: (p152<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.509sec

checking: EX [[[p23<=0 & 0<=p23] | [p157<=0 & 0<=p157]]]
normalized: EX [[[p157<=0 & 0<=p157] | [p23<=0 & 0<=p23]]]

abstracting: (0<=p23)
states: 6,561,000,000,001 (12)
abstracting: (p23<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p157)
states: 6,561,000,000,001 (12)
abstracting: (p157<=0)
states: 1
.-> the formula is TRUE

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

MC time: 0m 0.083sec

checking: EG [~ [E [~ [[[p78<=1 & 1<=p78] & [p174<=1 & 1<=p174]]] U ~ [AF [[[p113<=1 & 1<=p113] & [1<=p149 & p149<=1]]]]]]]
normalized: EG [~ [E [~ [[[p174<=1 & 1<=p174] & [p78<=1 & 1<=p78]]] U EG [~ [[[1<=p149 & p149<=1] & [p113<=1 & 1<=p113]]]]]]]

abstracting: (1<=p113)
states: 656,100,000,000 (11)
abstracting: (p113<=1)
states: 6,561,000,000,001 (12)
abstracting: (p149<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p149)
states: 6,561,000,000,000 (12)
.
EG iterations: 1
abstracting: (1<=p78)
states: 729,000,000,000 (11)
abstracting: (p78<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p174)
states: 6,561,000,000,000 (12)
abstracting: (p174<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.162sec

checking: AG [[EG [EF [[[[p22<=0 & 0<=p22] | [p146<=0 & 0<=p146]] & [[p22<=0 & 0<=p22] | [p135<=0 & 0<=p135]]]]] | [[p27<=1 & 1<=p27] & [p154<=1 & 1<=p154]]]]
normalized: ~ [E [true U ~ [[[[p154<=1 & 1<=p154] & [p27<=1 & 1<=p27]] | EG [E [true U [[[p135<=0 & 0<=p135] | [p22<=0 & 0<=p22]] & [[p146<=0 & 0<=p146] | [p22<=0 & 0<=p22]]]]]]]]]

abstracting: (0<=p22)
states: 6,561,000,000,001 (12)
abstracting: (p22<=0)
states: 5,248,800,000,001 (12)
abstracting: (0<=p146)
states: 6,561,000,000,001 (12)
abstracting: (p146<=0)
states: 1
abstracting: (0<=p22)
states: 6,561,000,000,001 (12)
abstracting: (p22<=0)
states: 5,248,800,000,001 (12)
abstracting: (0<=p135)
states: 6,561,000,000,001 (12)
abstracting: (p135<=0)
states: 1

EG iterations: 0
abstracting: (1<=p27)
states: 656,100,000,000 (11)
abstracting: (p27<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p154)
states: 6,561,000,000,000 (12)
abstracting: (p154<=1)
states: 6,561,000,000,001 (12)
-> the formula is TRUE

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

MC time: 0m 0.117sec

checking: EF [EX [[[EX [[[p22<=1 & 1<=p22] & [p142<=1 & 1<=p142]]] | [[p57<=1 & 1<=p57] & [p169<=1 & 1<=p169]]] & [AG [[[p104<=1 & 1<=p104] & [p184<=1 & 1<=p184]]] | [[p45<=1 & 1<=p45] & [p130<=1 & 1<=p130]]]]]]
normalized: E [true U EX [[[[[p130<=1 & 1<=p130] & [p45<=1 & 1<=p45]] | ~ [E [true U ~ [[[p184<=1 & 1<=p184] & [p104<=1 & 1<=p104]]]]]] & [[[p169<=1 & 1<=p169] & [p57<=1 & 1<=p57]] | EX [[[p142<=1 & 1<=p142] & [p22<=1 & 1<=p22]]]]]]]

abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p142)
states: 6,561,000,000,000 (12)
abstracting: (p142<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p57)
states: 729,000,000,000 (11)
abstracting: (p57<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p169)
states: 6,561,000,000,000 (12)
abstracting: (p169<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p104)
states: 656,100,000,000 (11)
abstracting: (p104<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p184)
states: 6,561,000,000,000 (12)
abstracting: (p184<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p45)
states: 656,100,000,000 (11)
abstracting: (p45<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p130)
states: 6,561,000,000,000 (12)
abstracting: (p130<=1)
states: 6,561,000,000,001 (12)
.-> the formula is TRUE

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

MC time: 0m 0.372sec

checking: [AF [[EF [[[p17<=1 & 1<=p17] & [p150<=1 & 1<=p150]]] & AF [[[p88<=1 & 1<=p88] & [p196<=1 & 1<=p196]]]]] | EX [[EF [[[p112<=0 & 0<=p112] | [p193<=0 & 0<=p193]]] & EF [[[p82<=1 & 1<=p82] & [p178<=1 & 1<=p178]]]]]]
normalized: [EX [[E [true U [[p178<=1 & 1<=p178] & [p82<=1 & 1<=p82]]] & E [true U [[p193<=0 & 0<=p193] | [p112<=0 & 0<=p112]]]]] | ~ [EG [~ [[~ [EG [~ [[[p196<=1 & 1<=p196] & [p88<=1 & 1<=p88]]]]] & E [true U [[p150<=1 & 1<=p150] & [p17<=1 & 1<=p17]]]]]]]]

abstracting: (1<=p17)
states: 1,312,200,000,000 (12)
abstracting: (p17<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p150)
states: 6,561,000,000,000 (12)
abstracting: (p150<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p88)
states: 656,100,000,000 (11)
abstracting: (p88<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p196)
states: 6,561,000,000,000 (12)
abstracting: (p196<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p112)
states: 6,561,000,000,001 (12)
abstracting: (p112<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p193)
states: 6,561,000,000,001 (12)
abstracting: (p193<=0)
states: 1
abstracting: (1<=p82)
states: 656,100,000,000 (11)
abstracting: (p82<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p178)
states: 6,561,000,000,000 (12)
abstracting: (p178<=1)
states: 6,561,000,000,001 (12)
.-> the formula is TRUE

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

MC time: 0m 0.218sec

checking: AX [EX [[EF [AX [[[p75<=1 & 1<=p75] & [p136<=1 & 1<=p136]]]] & AF [[[[[p23<=1 & 1<=p23] & [p158<=1 & 1<=p158]] & [[p31<=1 & 1<=p31] & [p121<=1 & 1<=p121]]] | [[[p69<=1 & 1<=p69] & [p171<=1 & 1<=p171]] & [[p93<=1 & 1<=p93] & [p144<=1 & 1<=p144]]]]]]]]
normalized: ~ [EX [~ [EX [[~ [EG [~ [[[[[p144<=1 & 1<=p144] & [p93<=1 & 1<=p93]] & [[p171<=1 & 1<=p171] & [p69<=1 & 1<=p69]]] | [[[p121<=1 & 1<=p121] & [p31<=1 & 1<=p31]] & [[p158<=1 & 1<=p158] & [p23<=1 & 1<=p23]]]]]]] & E [true U ~ [EX [~ [[[p136<=1 & 1<=p136] & [p75<=1 & 1<=p75]]]]]]]]]]]

abstracting: (1<=p75)
states: 729,000,000,000 (11)
abstracting: (p75<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p136)
states: 6,561,000,000,000 (12)
abstracting: (p136<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p23)
states: 656,100,000,000 (11)
abstracting: (p23<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p158)
states: 6,561,000,000,000 (12)
abstracting: (p158<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p31)
states: 656,100,000,000 (11)
abstracting: (p31<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p121)
states: 6,561,000,000,000 (12)
abstracting: (p121<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p69)
states: 729,000,000,000 (11)
abstracting: (p69<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p171)
states: 6,561,000,000,000 (12)
abstracting: (p171<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p93)
states: 656,100,000,000 (11)
abstracting: (p93<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p144)
states: 6,561,000,000,000 (12)
abstracting: (p144<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
..-> the formula is FALSE

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

MC time: 0m 0.462sec

checking: AF [[E [EX [EX [[[p103<=1 & 1<=p103] & [p190<=1 & 1<=p190]]]] U [~ [AX [[[p116<=1 & 1<=p116] & [p192<=1 & 1<=p192]]]] & [AG [[[p28<=1 & 1<=p28] & [p153<=1 & 1<=p153]]] | EG [[[p86<=1 & 1<=p86] & [p141<=1 & 1<=p141]]]]]] | [[p110<=1 & 1<=p110] & [p198<=1 & 1<=p198]]]]
normalized: ~ [EG [~ [[[[p198<=1 & 1<=p198] & [p110<=1 & 1<=p110]] | E [EX [EX [[[p190<=1 & 1<=p190] & [p103<=1 & 1<=p103]]]] U [[EG [[[p141<=1 & 1<=p141] & [p86<=1 & 1<=p86]]] | ~ [E [true U ~ [[[p153<=1 & 1<=p153] & [p28<=1 & 1<=p28]]]]]] & EX [~ [[[p192<=1 & 1<=p192] & [p116<=1 & 1<=p116]]]]]]]]]]

abstracting: (1<=p116)
states: 656,100,000,000 (11)
abstracting: (p116<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p192)
states: 6,561,000,000,000 (12)
abstracting: (p192<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p28)
states: 656,100,000,000 (11)
abstracting: (p28<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p153)
states: 6,561,000,000,000 (12)
abstracting: (p153<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p86)
states: 656,100,000,000 (11)
abstracting: (p86<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p141)
states: 6,561,000,000,000 (12)
abstracting: (p141<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p103)
states: 656,100,000,000 (11)
abstracting: (p103<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p190)
states: 6,561,000,000,000 (12)
abstracting: (p190<=1)
states: 6,561,000,000,001 (12)
..abstracting: (1<=p110)
states: 656,100,000,000 (11)
abstracting: (p110<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p198)
states: 6,561,000,000,000 (12)
abstracting: (p198<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: A [[p117<=1 & 1<=p117] U ~ [[E [~ [EX [[[p87<=1 & 1<=p87] & [p180<=1 & 1<=p180]]]] U [EG [[[p73<=1 & 1<=p73] & [p176<=1 & 1<=p176]]] & [[p6<=1 & 1<=p6] & [p127<=1 & 1<=p127]]]] | [EX [[EG [[[p33<=1 & 1<=p33] & [p161<=1 & 1<=p161]]] & EX [[[p98<=1 & 1<=p98] & [p183<=1 & 1<=p183]]]]] & [~ [AG [[[p107<=1 & 1<=p107] & [p147<=1 & 1<=p147]]]] | EF [[[[p39<=1 & 1<=p39] & [p164<=1 & 1<=p164]] | [[p94<=1 & 1<=p94] & [p182<=1 & 1<=p182]]]]]]]]]
normalized: [~ [EG [[[[E [true U [[[p182<=1 & 1<=p182] & [p94<=1 & 1<=p94]] | [[p164<=1 & 1<=p164] & [p39<=1 & 1<=p39]]]] | E [true U ~ [[[p147<=1 & 1<=p147] & [p107<=1 & 1<=p107]]]]] & EX [[EX [[[p183<=1 & 1<=p183] & [p98<=1 & 1<=p98]]] & EG [[[p161<=1 & 1<=p161] & [p33<=1 & 1<=p33]]]]]] | E [~ [EX [[[p180<=1 & 1<=p180] & [p87<=1 & 1<=p87]]]] U [[[p127<=1 & 1<=p127] & [p6<=1 & 1<=p6]] & EG [[[p176<=1 & 1<=p176] & [p73<=1 & 1<=p73]]]]]]]] & ~ [E [[[[E [true U [[[p182<=1 & 1<=p182] & [p94<=1 & 1<=p94]] | [[p164<=1 & 1<=p164] & [p39<=1 & 1<=p39]]]] | E [true U ~ [[[p147<=1 & 1<=p147] & [p107<=1 & 1<=p107]]]]] & EX [[EX [[[p183<=1 & 1<=p183] & [p98<=1 & 1<=p98]]] & EG [[[p161<=1 & 1<=p161] & [p33<=1 & 1<=p33]]]]]] | E [~ [EX [[[p180<=1 & 1<=p180] & [p87<=1 & 1<=p87]]]] U [[[p127<=1 & 1<=p127] & [p6<=1 & 1<=p6]] & EG [[[p176<=1 & 1<=p176] & [p73<=1 & 1<=p73]]]]]] U [~ [[p117<=1 & 1<=p117]] & [[[E [true U [[[p182<=1 & 1<=p182] & [p94<=1 & 1<=p94]] | [[p164<=1 & 1<=p164] & [p39<=1 & 1<=p39]]]] | E [true U ~ [[[p147<=1 & 1<=p147] & [p107<=1 & 1<=p107]]]]] & EX [[EX [[[p183<=1 & 1<=p183] & [p98<=1 & 1<=p98]]] & EG [[[p161<=1 & 1<=p161] & [p33<=1 & 1<=p33]]]]]] | E [~ [EX [[[p180<=1 & 1<=p180] & [p87<=1 & 1<=p87]]]] U [[[p127<=1 & 1<=p127] & [p6<=1 & 1<=p6]] & EG [[[p176<=1 & 1<=p176] & [p73<=1 & 1<=p73]]]]]]]]]]

abstracting: (1<=p73)
states: 729,000,000,000 (11)
abstracting: (p73<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p176)
states: 6,561,000,000,000 (12)
abstracting: (p176<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p127)
states: 6,561,000,000,000 (12)
abstracting: (p127<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p87)
states: 656,100,000,000 (11)
abstracting: (p87<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p180)
states: 6,561,000,000,000 (12)
abstracting: (p180<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p33)
states: 656,100,000,000 (11)
abstracting: (p33<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p161)
states: 6,561,000,000,000 (12)
abstracting: (p161<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p98)
states: 656,100,000,000 (11)
abstracting: (p98<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p183)
states: 6,561,000,000,000 (12)
abstracting: (p183<=1)
states: 6,561,000,000,001 (12)
..abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p147)
states: 6,561,000,000,000 (12)
abstracting: (p147<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p39)
states: 656,100,000,000 (11)
abstracting: (p39<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p164)
states: 6,561,000,000,000 (12)
abstracting: (p164<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p94)
states: 656,100,000,000 (11)
abstracting: (p94<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p182)
states: 6,561,000,000,000 (12)
abstracting: (p182<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p117)
states: 656,100,000,000 (11)
abstracting: (p117<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p73)
states: 729,000,000,000 (11)
abstracting: (p73<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p176)
states: 6,561,000,000,000 (12)
abstracting: (p176<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p127)
states: 6,561,000,000,000 (12)
abstracting: (p127<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p87)
states: 656,100,000,000 (11)
abstracting: (p87<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p180)
states: 6,561,000,000,000 (12)
abstracting: (p180<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p33)
states: 656,100,000,000 (11)
abstracting: (p33<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p161)
states: 6,561,000,000,000 (12)
abstracting: (p161<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p98)
states: 656,100,000,000 (11)
abstracting: (p98<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p183)
states: 6,561,000,000,000 (12)
abstracting: (p183<=1)
states: 6,561,000,000,001 (12)
..abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p147)
states: 6,561,000,000,000 (12)
abstracting: (p147<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p39)
states: 656,100,000,000 (11)
abstracting: (p39<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p164)
states: 6,561,000,000,000 (12)
abstracting: (p164<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p94)
states: 656,100,000,000 (11)
abstracting: (p94<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p182)
states: 6,561,000,000,000 (12)
abstracting: (p182<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p73)
states: 729,000,000,000 (11)
abstracting: (p73<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p176)
states: 6,561,000,000,000 (12)
abstracting: (p176<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p127)
states: 6,561,000,000,000 (12)
abstracting: (p127<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p87)
states: 656,100,000,000 (11)
abstracting: (p87<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p180)
states: 6,561,000,000,000 (12)
abstracting: (p180<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p33)
states: 656,100,000,000 (11)
abstracting: (p33<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p161)
states: 6,561,000,000,000 (12)
abstracting: (p161<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p98)
states: 656,100,000,000 (11)
abstracting: (p98<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p183)
states: 6,561,000,000,000 (12)
abstracting: (p183<=1)
states: 6,561,000,000,001 (12)
..abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p147)
states: 6,561,000,000,000 (12)
abstracting: (p147<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p39)
states: 656,100,000,000 (11)
abstracting: (p39<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p164)
states: 6,561,000,000,000 (12)
abstracting: (p164<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p94)
states: 656,100,000,000 (11)
abstracting: (p94<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p182)
states: 6,561,000,000,000 (12)
abstracting: (p182<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.893sec

checking: [EX [[[[p31<=0 & 0<=p31] | [p123<=0 & 0<=p123]] & [[~ [E [[[p40<=1 & 1<=p40] & [p126<=1 & 1<=p126]] U [[p88<=1 & 1<=p88] & [p188<=1 & 1<=p188]]]] | [[p23<=0 & 0<=p23] | [p152<=0 & 0<=p152]]] & EF [AG [[[p52<=0 & 0<=p52] | [p129<=0 & 0<=p129]]]]]]] & [EX [[[p17<=1 & 1<=p17] & [[[p40<=0 & 0<=p40] | [p159<=0 & 0<=p159]] & [[p83<=0 & 0<=p83] | [p180<=0 & 0<=p180]]]]] | EX [[EX [[[p112<=1 & 1<=p112] & [p195<=1 & 1<=p195]]] & AG [[[p87<=1 & 1<=p87] & [p138<=1 & 1<=p138]]]]]]]
normalized: [[EX [[~ [E [true U ~ [[[p138<=1 & 1<=p138] & [p87<=1 & 1<=p87]]]]] & EX [[[p195<=1 & 1<=p195] & [p112<=1 & 1<=p112]]]]] | EX [[[[[p180<=0 & 0<=p180] | [p83<=0 & 0<=p83]] & [[p159<=0 & 0<=p159] | [p40<=0 & 0<=p40]]] & [p17<=1 & 1<=p17]]]] & EX [[[E [true U ~ [E [true U ~ [[[p129<=0 & 0<=p129] | [p52<=0 & 0<=p52]]]]]] & [[[p152<=0 & 0<=p152] | [p23<=0 & 0<=p23]] | ~ [E [[[p126<=1 & 1<=p126] & [p40<=1 & 1<=p40]] U [[p188<=1 & 1<=p188] & [p88<=1 & 1<=p88]]]]]] & [[p123<=0 & 0<=p123] | [p31<=0 & 0<=p31]]]]]

abstracting: (0<=p31)
states: 6,561,000,000,001 (12)
abstracting: (p31<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p123)
states: 6,561,000,000,001 (12)
abstracting: (p123<=0)
states: 1
abstracting: (1<=p88)
states: 656,100,000,000 (11)
abstracting: (p88<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p188)
states: 6,561,000,000,000 (12)
abstracting: (p188<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p40)
states: 656,100,000,000 (11)
abstracting: (p40<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p126)
states: 6,561,000,000,000 (12)
abstracting: (p126<=1)
states: 6,561,000,000,001 (12)
abstracting: (0<=p23)
states: 6,561,000,000,001 (12)
abstracting: (p23<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p152)
states: 6,561,000,000,001 (12)
abstracting: (p152<=0)
states: 1
abstracting: (0<=p52)
states: 6,561,000,000,001 (12)
abstracting: (p52<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p129)
states: 6,561,000,000,001 (12)
abstracting: (p129<=0)
states: 1
.abstracting: (1<=p17)
states: 1,312,200,000,000 (12)
abstracting: (p17<=1)
states: 6,561,000,000,001 (12)
abstracting: (0<=p40)
states: 6,561,000,000,001 (12)
abstracting: (p40<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p159)
states: 6,561,000,000,001 (12)
abstracting: (p159<=0)
states: 1
abstracting: (0<=p83)
states: 6,561,000,000,001 (12)
abstracting: (p83<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p180)
states: 6,561,000,000,001 (12)
abstracting: (p180<=0)
states: 1
.abstracting: (1<=p112)
states: 656,100,000,000 (11)
abstracting: (p112<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p195)
states: 6,561,000,000,000 (12)
abstracting: (p195<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p87)
states: 656,100,000,000 (11)
abstracting: (p87<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p138)
states: 6,561,000,000,000 (12)
abstracting: (p138<=1)
states: 6,561,000,000,001 (12)
.-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.302sec

checking: [EX [AG [[[p71<=1 & 1<=p71] & [p177<=1 & 1<=p177]]]] | [E [[EX [~ [[[[[p118<=1 & 1<=p118] & [p194<=1 & 1<=p194]] | [[p103<=1 & 1<=p103] & [p187<=1 & 1<=p187]]] & [[p88<=1 & 1<=p88] & [p139<=1 & 1<=p139]]]]] & [[p12<=1 & 1<=p12] & [p131<=1 & 1<=p131]]] U [~ [[~ [[E [[[p102<=1 & 1<=p102] & [p184<=1 & 1<=p184]] U [[p90<=1 & 1<=p90] & [p182<=1 & 1<=p182]]] & [[p39<=1 & 1<=p39] & [p164<=1 & 1<=p164]]]] | [[p31<=1 & 1<=p31] & [p191<=1 & 1<=p191]]]] & [[p47<=1 & 1<=p47] & [p167<=1 & 1<=p167]]]] | [EG [~ [E [AF [[[p94<=1 & 1<=p94] & [p183<=1 & 1<=p183]]] U [[p107<=1 & 1<=p107] & [p185<=1 & 1<=p185]]]]] & EX [[[AX [[[p67<=0 & 0<=p67] | [p172<=0 & 0<=p172]]] & [p67<=1 & 1<=p67]] & [[p172<=1 & 1<=p172] & [[[p62<=0 & 0<=p62] | [p173<=0 & 0<=p173]] & [[p118<=0 & 0<=p118] | [p168<=0 & 0<=p168]]]]]]]]]
normalized: [[[EX [[[[[[p168<=0 & 0<=p168] | [p118<=0 & 0<=p118]] & [[p173<=0 & 0<=p173] | [p62<=0 & 0<=p62]]] & [p172<=1 & 1<=p172]] & [[p67<=1 & 1<=p67] & ~ [EX [~ [[[p172<=0 & 0<=p172] | [p67<=0 & 0<=p67]]]]]]]] & EG [~ [E [~ [EG [~ [[[p183<=1 & 1<=p183] & [p94<=1 & 1<=p94]]]]] U [[p185<=1 & 1<=p185] & [p107<=1 & 1<=p107]]]]]] | E [[[[p131<=1 & 1<=p131] & [p12<=1 & 1<=p12]] & EX [~ [[[[p139<=1 & 1<=p139] & [p88<=1 & 1<=p88]] & [[[p187<=1 & 1<=p187] & [p103<=1 & 1<=p103]] | [[p194<=1 & 1<=p194] & [p118<=1 & 1<=p118]]]]]]] U [[[p167<=1 & 1<=p167] & [p47<=1 & 1<=p47]] & ~ [[[[p191<=1 & 1<=p191] & [p31<=1 & 1<=p31]] | ~ [[[[p164<=1 & 1<=p164] & [p39<=1 & 1<=p39]] & E [[[p184<=1 & 1<=p184] & [p102<=1 & 1<=p102]] U [[p182<=1 & 1<=p182] & [p90<=1 & 1<=p90]]]]]]]]]] | EX [~ [E [true U ~ [[[p177<=1 & 1<=p177] & [p71<=1 & 1<=p71]]]]]]]

abstracting: (1<=p71)
states: 729,000,000,000 (11)
abstracting: (p71<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p177)
states: 6,561,000,000,000 (12)
abstracting: (p177<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p90)
states: 656,100,000,000 (11)
abstracting: (p90<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p182)
states: 6,561,000,000,000 (12)
abstracting: (p182<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p102)
states: 656,100,000,000 (11)
abstracting: (p102<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p184)
states: 6,561,000,000,000 (12)
abstracting: (p184<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p39)
states: 656,100,000,000 (11)
abstracting: (p39<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p164)
states: 6,561,000,000,000 (12)
abstracting: (p164<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p31)
states: 656,100,000,000 (11)
abstracting: (p31<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p191)
states: 6,561,000,000,000 (12)
abstracting: (p191<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p47)
states: 656,100,000,000 (11)
abstracting: (p47<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p167)
states: 6,561,000,000,000 (12)
abstracting: (p167<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p118)
states: 656,100,000,000 (11)
abstracting: (p118<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p194)
states: 6,561,000,000,000 (12)
abstracting: (p194<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p103)
states: 656,100,000,000 (11)
abstracting: (p103<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p187)
states: 6,561,000,000,000 (12)
abstracting: (p187<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p88)
states: 656,100,000,000 (11)
abstracting: (p88<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p139)
states: 6,561,000,000,000 (12)
abstracting: (p139<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p131)
states: 6,561,000,000,000 (12)
abstracting: (p131<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p185)
states: 6,561,000,000,000 (12)
abstracting: (p185<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p94)
states: 656,100,000,000 (11)
abstracting: (p94<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p183)
states: 6,561,000,000,000 (12)
abstracting: (p183<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p67)
states: 6,561,000,000,001 (12)
abstracting: (p67<=0)
states: 5,832,000,000,001 (12)
abstracting: (0<=p172)
states: 6,561,000,000,001 (12)
abstracting: (p172<=0)
states: 1
.abstracting: (1<=p67)
states: 729,000,000,000 (11)
abstracting: (p67<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p172)
states: 6,561,000,000,000 (12)
abstracting: (p172<=1)
states: 6,561,000,000,001 (12)
abstracting: (0<=p62)
states: 6,561,000,000,001 (12)
abstracting: (p62<=0)
states: 5,832,000,000,001 (12)
abstracting: (0<=p173)
states: 6,561,000,000,001 (12)
abstracting: (p173<=0)
states: 1
abstracting: (0<=p118)
states: 6,561,000,000,001 (12)
abstracting: (p118<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p168)
states: 6,561,000,000,001 (12)
abstracting: (p168<=0)
states: 1
.-> the formula is FALSE

FORMULA DLCround-PT-09a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.609sec

checking: EF [[AF [[EF [[[p31<=0 & 0<=p31] | [p122<=0 & 0<=p122]]] | [[[p1<=1 & 1<=p1] & [p125<=1 & 1<=p125]] & [[[p6<=0 & 0<=p6] | [p137<=0 & 0<=p137]] & [[p98<=0 & 0<=p98] | [p143<=0 & 0<=p143]]]]]] & [[[EF [[[p17<=0 & 0<=p17] | [p134<=0 & 0<=p134]]] & [[p105<=0 & 0<=p105] & [p30<=1 & 1<=p30]]] & [[p124<=1 & 1<=p124] & [[A [[[[p87<=1 & 1<=p87] & [p181<=1 & 1<=p181]] & [[p6<=1 & 1<=p6] & [p120<=1 & 1<=p120]]] U [[[p67<=1 & 1<=p67] & [p133<=1 & 1<=p133]] | [p22<=1 & 1<=p22]]] | [~ [A [[[p7<=1 & 1<=p7] & [p128<=1 & 1<=p128]] U [p22<=1 & 1<=p22]]] & [[p116<=1 & 1<=p116] & [p193<=1 & 1<=p193]]]] & [[p27<=0 & 0<=p27] | [p155<=0 & 0<=p155]]]]] | [AX [AX [[[p38<=1 & 1<=p38] & [p162<=1 & 1<=p162]]]] & [EF [[[p31<=1 & 1<=p31] & [p191<=1 & 1<=p191]]] | [[p12<=1 & 1<=p12] & [p140<=1 & 1<=p140]]]]]]]
normalized: E [true U [[[[[[p140<=1 & 1<=p140] & [p12<=1 & 1<=p12]] | E [true U [[p191<=1 & 1<=p191] & [p31<=1 & 1<=p31]]]] & ~ [EX [EX [~ [[[p162<=1 & 1<=p162] & [p38<=1 & 1<=p38]]]]]]] | [[[[[p155<=0 & 0<=p155] | [p27<=0 & 0<=p27]] & [[[[p193<=1 & 1<=p193] & [p116<=1 & 1<=p116]] & ~ [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & ~ [E [~ [[p22<=1 & 1<=p22]] U [~ [[[p128<=1 & 1<=p128] & [p7<=1 & 1<=p7]]] & ~ [[p22<=1 & 1<=p22]]]]]]]] | [~ [EG [~ [[[p22<=1 & 1<=p22] | [[p133<=1 & 1<=p133] & [p67<=1 & 1<=p67]]]]]] & ~ [E [~ [[[p22<=1 & 1<=p22] | [[p133<=1 & 1<=p133] & [p67<=1 & 1<=p67]]]] U [~ [[[[p120<=1 & 1<=p120] & [p6<=1 & 1<=p6]] & [[p181<=1 & 1<=p181] & [p87<=1 & 1<=p87]]]] & ~ [[[p22<=1 & 1<=p22] | [[p133<=1 & 1<=p133] & [p67<=1 & 1<=p67]]]]]]]]]] & [p124<=1 & 1<=p124]] & [[[p30<=1 & 1<=p30] & [p105<=0 & 0<=p105]] & E [true U [[p134<=0 & 0<=p134] | [p17<=0 & 0<=p17]]]]]] & ~ [EG [~ [[[[[[p143<=0 & 0<=p143] | [p98<=0 & 0<=p98]] & [[p137<=0 & 0<=p137] | [p6<=0 & 0<=p6]]] & [[p125<=1 & 1<=p125] & [p1<=1 & 1<=p1]]] | E [true U [[p122<=0 & 0<=p122] | [p31<=0 & 0<=p31]]]]]]]]]

abstracting: (0<=p31)
states: 6,561,000,000,001 (12)
abstracting: (p31<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p122)
states: 6,561,000,000,001 (12)
abstracting: (p122<=0)
states: 1
abstracting: (1<=p1)
states: 1,093,500,000,000 (12)
abstracting: (p1<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p125)
states: 6,561,000,000,000 (12)
abstracting: (p125<=1)
states: 6,561,000,000,001 (12)
abstracting: (0<=p6)
states: 6,561,000,000,001 (12)
abstracting: (p6<=0)
states: 5,467,500,000,001 (12)
abstracting: (0<=p137)
states: 6,561,000,000,001 (12)
abstracting: (p137<=0)
states: 1
abstracting: (0<=p98)
states: 6,561,000,000,001 (12)
abstracting: (p98<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p143)
states: 6,561,000,000,001 (12)
abstracting: (p143<=0)
states: 1
.
EG iterations: 1
abstracting: (0<=p17)
states: 6,561,000,000,001 (12)
abstracting: (p17<=0)
states: 5,248,800,000,001 (12)
abstracting: (0<=p134)
states: 6,561,000,000,001 (12)
abstracting: (p134<=0)
states: 1
abstracting: (0<=p105)
states: 6,561,000,000,001 (12)
abstracting: (p105<=0)
states: 5,904,900,000,001 (12)
abstracting: (1<=p30)
states: 656,100,000,000 (11)
abstracting: (p30<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p124)
states: 6,561,000,000,000 (12)
abstracting: (p124<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p67)
states: 729,000,000,000 (11)
abstracting: (p67<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p87)
states: 656,100,000,000 (11)
abstracting: (p87<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p181)
states: 6,561,000,000,000 (12)
abstracting: (p181<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p120)
states: 6,561,000,000,000 (12)
abstracting: (p120<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p67)
states: 729,000,000,000 (11)
abstracting: (p67<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p67)
states: 729,000,000,000 (11)
abstracting: (p67<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p7)
states: 1,093,500,000,000 (12)
abstracting: (p7<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p128)
states: 6,561,000,000,000 (12)
abstracting: (p128<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
abstracting: (1<=p116)
states: 656,100,000,000 (11)
abstracting: (p116<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p193)
states: 6,561,000,000,000 (12)
abstracting: (p193<=1)
states: 6,561,000,000,001 (12)
abstracting: (0<=p27)
states: 6,561,000,000,001 (12)
abstracting: (p27<=0)
states: 5,904,900,000,001 (12)
abstracting: (0<=p155)
states: 6,561,000,000,001 (12)
abstracting: (p155<=0)
states: 1
abstracting: (1<=p38)
states: 656,100,000,000 (11)
abstracting: (p38<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p162)
states: 6,561,000,000,000 (12)
abstracting: (p162<=1)
states: 6,561,000,000,001 (12)
..abstracting: (1<=p31)
states: 656,100,000,000 (11)
abstracting: (p31<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p191)
states: 6,561,000,000,000 (12)
abstracting: (p191<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p140)
states: 6,561,000,000,000 (12)
abstracting: (p140<=1)
states: 6,561,000,000,001 (12)
-> the formula is TRUE

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

MC time: 0m 1.257sec

checking: A [[[EF [[EF [[[p12<=1 & 1<=p12] & [p148<=1 & 1<=p148]]] & [[[p98<=1 & 1<=p98] & [p189<=1 & 1<=p189]] | [[p6<=1 & 1<=p6] & [p120<=1 & 1<=p120]]]]] & ~ [[[A [[[[p98<=1 & 1<=p98] & [p143<=1 & 1<=p143]] & [[p114<=1 & 1<=p114] & [p197<=1 & 1<=p197]]] U [[p48<=1 & 1<=p48] & [p166<=1 & 1<=p166]]] & [EX [~ [[[p94<=1 & 1<=p94] & [p145<=1 & 1<=p145]]]] & ~ [EF [[[p6<=1 & 1<=p6] & [p127<=1 & 1<=p127]]]]]] & [[[p118<=1 & 1<=p118] & ~ [[[p36<=1 & 1<=p36] & [p163<=1 & 1<=p163]]]] & [[p69<=1 & 1<=p69] & [p132<=1 & 1<=p132]]]]]] & [[p114<=1 & 1<=p114] & [p195<=1 & 1<=p195]]] U [~ [EF [[[AF [[[p12<=1 & 1<=p12] & [p133<=1 & 1<=p133]]] & [p49<=1 & 1<=p49]] & [[p165<=1 & 1<=p165] & [[p60<=1 & 1<=p60] & [p179<=1 & 1<=p179]]]]]] | [[p6<=1 & 1<=p6] | [EG [~ [[[[p62<=1 & 1<=p62] & [p170<=1 & 1<=p170]] & [[p107<=1 & 1<=p107] & [p187<=1 & 1<=p187]]]]] & [[p22<=1 & 1<=p22] & [p151<=1 & 1<=p151]]]]]]
normalized: [~ [EG [~ [[[[[[p151<=1 & 1<=p151] & [p22<=1 & 1<=p22]] & EG [~ [[[[p187<=1 & 1<=p187] & [p107<=1 & 1<=p107]] & [[p170<=1 & 1<=p170] & [p62<=1 & 1<=p62]]]]]] | [p6<=1 & 1<=p6]] | ~ [E [true U [[[[p179<=1 & 1<=p179] & [p60<=1 & 1<=p60]] & [p165<=1 & 1<=p165]] & [[p49<=1 & 1<=p49] & ~ [EG [~ [[[p133<=1 & 1<=p133] & [p12<=1 & 1<=p12]]]]]]]]]]]]] & ~ [E [~ [[[[[[p151<=1 & 1<=p151] & [p22<=1 & 1<=p22]] & EG [~ [[[[p187<=1 & 1<=p187] & [p107<=1 & 1<=p107]] & [[p170<=1 & 1<=p170] & [p62<=1 & 1<=p62]]]]]] | [p6<=1 & 1<=p6]] | ~ [E [true U [[[[p179<=1 & 1<=p179] & [p60<=1 & 1<=p60]] & [p165<=1 & 1<=p165]] & [[p49<=1 & 1<=p49] & ~ [EG [~ [[[p133<=1 & 1<=p133] & [p12<=1 & 1<=p12]]]]]]]]]]] U [~ [[[[p195<=1 & 1<=p195] & [p114<=1 & 1<=p114]] & [~ [[[[[p132<=1 & 1<=p132] & [p69<=1 & 1<=p69]] & [~ [[[p163<=1 & 1<=p163] & [p36<=1 & 1<=p36]]] & [p118<=1 & 1<=p118]]] & [[~ [E [true U [[p127<=1 & 1<=p127] & [p6<=1 & 1<=p6]]]] & EX [~ [[[p145<=1 & 1<=p145] & [p94<=1 & 1<=p94]]]]] & [~ [EG [~ [[[p166<=1 & 1<=p166] & [p48<=1 & 1<=p48]]]]] & ~ [E [~ [[[p166<=1 & 1<=p166] & [p48<=1 & 1<=p48]]] U [~ [[[[p197<=1 & 1<=p197] & [p114<=1 & 1<=p114]] & [[p143<=1 & 1<=p143] & [p98<=1 & 1<=p98]]]] & ~ [[[p166<=1 & 1<=p166] & [p48<=1 & 1<=p48]]]]]]]]]] & E [true U [[[[p120<=1 & 1<=p120] & [p6<=1 & 1<=p6]] | [[p189<=1 & 1<=p189] & [p98<=1 & 1<=p98]]] & E [true U [[p148<=1 & 1<=p148] & [p12<=1 & 1<=p12]]]]]]]] & ~ [[[[[[p151<=1 & 1<=p151] & [p22<=1 & 1<=p22]] & EG [~ [[[[p187<=1 & 1<=p187] & [p107<=1 & 1<=p107]] & [[p170<=1 & 1<=p170] & [p62<=1 & 1<=p62]]]]]] | [p6<=1 & 1<=p6]] | ~ [E [true U [[[[p179<=1 & 1<=p179] & [p60<=1 & 1<=p60]] & [p165<=1 & 1<=p165]] & [[p49<=1 & 1<=p49] & ~ [EG [~ [[[p133<=1 & 1<=p133] & [p12<=1 & 1<=p12]]]]]]]]]]]]]]]

abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
abstracting: (1<=p49)
states: 656,100,000,000 (11)
abstracting: (p49<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p165)
states: 6,561,000,000,000 (12)
abstracting: (p165<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p60)
states: 729,000,000,000 (11)
abstracting: (p60<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p179)
states: 6,561,000,000,000 (12)
abstracting: (p179<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p62)
states: 729,000,000,000 (11)
abstracting: (p62<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p170)
states: 6,561,000,000,000 (12)
abstracting: (p170<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p187)
states: 6,561,000,000,000 (12)
abstracting: (p187<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p151)
states: 6,561,000,000,000 (12)
abstracting: (p151<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p148)
states: 6,561,000,000,000 (12)
abstracting: (p148<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p98)
states: 656,100,000,000 (11)
abstracting: (p98<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p189)
states: 6,561,000,000,000 (12)
abstracting: (p189<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p120)
states: 6,561,000,000,000 (12)
abstracting: (p120<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p48)
states: 656,100,000,000 (11)
abstracting: (p48<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p166)
states: 6,561,000,000,000 (12)
abstracting: (p166<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p98)
states: 656,100,000,000 (11)
abstracting: (p98<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p143)
states: 6,561,000,000,000 (12)
abstracting: (p143<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p114)
states: 656,100,000,000 (11)
abstracting: (p114<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p197)
states: 6,561,000,000,000 (12)
abstracting: (p197<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p48)
states: 656,100,000,000 (11)
abstracting: (p48<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p166)
states: 6,561,000,000,000 (12)
abstracting: (p166<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p48)
states: 656,100,000,000 (11)
abstracting: (p48<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p166)
states: 6,561,000,000,000 (12)
abstracting: (p166<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p94)
states: 656,100,000,000 (11)
abstracting: (p94<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p145)
states: 6,561,000,000,000 (12)
abstracting: (p145<=1)
states: 6,561,000,000,001 (12)
.abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p127)
states: 6,561,000,000,000 (12)
abstracting: (p127<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p118)
states: 656,100,000,000 (11)
abstracting: (p118<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p36)
states: 656,100,000,000 (11)
abstracting: (p36<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p163)
states: 6,561,000,000,000 (12)
abstracting: (p163<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p69)
states: 729,000,000,000 (11)
abstracting: (p69<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p132)
states: 6,561,000,000,000 (12)
abstracting: (p132<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p114)
states: 656,100,000,000 (11)
abstracting: (p114<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p195)
states: 6,561,000,000,000 (12)
abstracting: (p195<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
abstracting: (1<=p49)
states: 656,100,000,000 (11)
abstracting: (p49<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p165)
states: 6,561,000,000,000 (12)
abstracting: (p165<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p60)
states: 729,000,000,000 (11)
abstracting: (p60<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p179)
states: 6,561,000,000,000 (12)
abstracting: (p179<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p62)
states: 729,000,000,000 (11)
abstracting: (p62<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p170)
states: 6,561,000,000,000 (12)
abstracting: (p170<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p187)
states: 6,561,000,000,000 (12)
abstracting: (p187<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p151)
states: 6,561,000,000,000 (12)
abstracting: (p151<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p12)
states: 1,093,500,000,000 (12)
abstracting: (p12<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p133)
states: 6,561,000,000,000 (12)
abstracting: (p133<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
abstracting: (1<=p49)
states: 656,100,000,000 (11)
abstracting: (p49<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p165)
states: 6,561,000,000,000 (12)
abstracting: (p165<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p60)
states: 729,000,000,000 (11)
abstracting: (p60<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p179)
states: 6,561,000,000,000 (12)
abstracting: (p179<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p6)
states: 1,093,500,000,000 (12)
abstracting: (p6<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p62)
states: 729,000,000,000 (11)
abstracting: (p62<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p170)
states: 6,561,000,000,000 (12)
abstracting: (p170<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p107)
states: 656,100,000,000 (11)
abstracting: (p107<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p187)
states: 6,561,000,000,000 (12)
abstracting: (p187<=1)
states: 6,561,000,000,001 (12)
.
EG iterations: 1
abstracting: (1<=p22)
states: 1,312,200,000,000 (12)
abstracting: (p22<=1)
states: 6,561,000,000,001 (12)
abstracting: (1<=p151)
states: 6,561,000,000,000 (12)
abstracting: (p151<=1)
states: 6,561,000,000,001 (12)
..
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m 0.617sec

totally nodes used: 842155 (8.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8041161 18289810 26330971
used/not used/entry size/cache size: 16326691 50782173 16 1024MB
basic ops cache: hits/miss/sum: 1178385 2451453 3629838
used/not used/entry size/cache size: 2875969 13901247 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: 74640 160212 234852
used/not used/entry size/cache size: 158684 8229924 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 66326921
1 727872
2 48436
3 5155
4 455
5 24
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m10.462sec


BK_STOP 1678460249268

--------------------
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:3067 (11), effective:106 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

iterations count:517 (2), effective:5 (0)

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

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

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

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

iterations count:572 (2), effective:14 (0)

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

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

iterations count:572 (2), effective:14 (0)

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

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

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

iterations count:572 (2), effective:14 (0)

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

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

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

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

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

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

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

iterations count:955 (3), effective:28 (0)

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

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

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

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

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

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

iterations count:733 (2), effective:19 (0)

iterations count:1080 (4), effective:23 (0)

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

iterations count:798 (3), effective:10 (0)

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

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

iterations count:1080 (4), effective:23 (0)

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

iterations count:1080 (4), effective:23 (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-09a"
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-09a, 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-167814483100714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-09a.tgz
mv DLCround-PT-09a 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 ;