About the Execution of Marcie+red for DLCround-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.403 | 9212.00 | 13336.00 | 386.60 | TTFFFFFTFFFTTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r106-tall-167814483000650.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-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000650
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.0K Feb 25 18:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 18:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 18:28 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 24K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 14K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:40 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 259K 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-05a-CTLFireability-00
FORMULA_NAME DLCround-PT-05a-CTLFireability-01
FORMULA_NAME DLCround-PT-05a-CTLFireability-02
FORMULA_NAME DLCround-PT-05a-CTLFireability-03
FORMULA_NAME DLCround-PT-05a-CTLFireability-04
FORMULA_NAME DLCround-PT-05a-CTLFireability-05
FORMULA_NAME DLCround-PT-05a-CTLFireability-06
FORMULA_NAME DLCround-PT-05a-CTLFireability-07
FORMULA_NAME DLCround-PT-05a-CTLFireability-08
FORMULA_NAME DLCround-PT-05a-CTLFireability-09
FORMULA_NAME DLCround-PT-05a-CTLFireability-10
FORMULA_NAME DLCround-PT-05a-CTLFireability-11
FORMULA_NAME DLCround-PT-05a-CTLFireability-12
FORMULA_NAME DLCround-PT-05a-CTLFireability-13
FORMULA_NAME DLCround-PT-05a-CTLFireability-14
FORMULA_NAME DLCround-PT-05a-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678449914029
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-05a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 12:05:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 12:05:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 12:05:15] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-10 12:05:15] [INFO ] Transformed 167 places.
[2023-03-10 12:05:15] [INFO ] Transformed 1055 transitions.
[2023-03-10 12:05:15] [INFO ] Found NUPN structural information;
[2023-03-10 12:05:15] [INFO ] Parsed PT model containing 167 places and 1055 transitions and 3985 arcs in 145 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 112 transitions
Reduce redundant transitions removed 112 transitions.
FORMULA DLCround-PT-05a-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 943/943 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 163 transition count 911
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 163 transition count 911
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 163 transition count 909
Drop transitions removed 309 transitions
Redundant transition composition rules discarded 309 transitions
Iterating global reduction 1 with 309 rules applied. Total rules applied 319 place count 163 transition count 600
Applied a total of 319 rules in 44 ms. Remains 163 /167 variables (removed 4) and now considering 600/943 (removed 343) transitions.
[2023-03-10 12:05:15] [INFO ] Flow matrix only has 132 transitions (discarded 468 similar events)
// Phase 1: matrix 132 rows 163 cols
[2023-03-10 12:05:15] [INFO ] Computed 88 place invariants in 15 ms
[2023-03-10 12:05:16] [INFO ] Implicit Places using invariants in 486 ms returned [85, 87, 88, 90, 91, 93, 94, 96, 99, 101, 103, 106, 107, 111, 113, 115, 118, 119, 121, 123, 127, 129, 130, 131, 137, 140, 142, 147, 151, 152, 153, 154, 156, 161]
Discarding 34 places :
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Implicit Place search using SMT only with invariants took 510 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 129/167 places, 467/943 transitions.
Drop transitions removed 278 transitions
Redundant transition composition rules discarded 278 transitions
Iterating global reduction 0 with 278 rules applied. Total rules applied 278 place count 129 transition count 189
Applied a total of 278 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 189/467 (removed 278) transitions.
[2023-03-10 12:05:16] [INFO ] Flow matrix only has 132 transitions (discarded 57 similar events)
// Phase 1: matrix 132 rows 129 cols
[2023-03-10 12:05:16] [INFO ] Computed 54 place invariants in 1 ms
[2023-03-10 12:05:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-10 12:05:16] [INFO ] Flow matrix only has 132 transitions (discarded 57 similar events)
[2023-03-10 12:05:16] [INFO ] Invariant cache hit.
[2023-03-10 12:05:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-10 12:05:16] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 129/167 places, 189/943 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 695 ms. Remains : 129/167 places, 189/943 transitions.
Support contains 94 out of 129 places after structural reductions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 30 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 12 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 189 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 56) seen :55
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 12:05:16] [INFO ] Flow matrix only has 132 transitions (discarded 57 similar events)
[2023-03-10 12:05:16] [INFO ] Invariant cache hit.
[2023-03-10 12:05:16] [INFO ] [Real]Absence check using 54 positive place invariants in 10 ms returned sat
[2023-03-10 12:05:16] [INFO ] After 58ms SMT Verify possible using all constraints in real 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.
FORMULA DLCround-PT-05a-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 8 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 8 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 189 transitions.
Computed a total of 45 stabilizing places and 1 stable transitions
Graph (complete) has 256 edges and 129 vertex of which 91 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Graph (trivial) has 149 edges and 129 vertex of which 62 / 129 are part of one of the 12 SCC in 2 ms
Free SCC test removed 50 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Graph (complete) has 146 edges and 79 vertex of which 46 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.0 ms
Discarding 33 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 46 transition count 75
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 74
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 20 place count 33 transition count 59
Iterating global reduction 2 with 9 rules applied. Total rules applied 29 place count 33 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 32 transition count 58
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 32 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 31 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 31 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 30 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 30 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 30 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 30 transition count 48
Applied a total of 44 rules in 18 ms. Remains 30 /129 variables (removed 99) and now considering 48/189 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 30/129 places, 48/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 2 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Graph (trivial) has 173 edges and 129 vertex of which 78 / 129 are part of one of the 10 SCC in 0 ms
Free SCC test removed 68 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Graph (complete) has 100 edges and 61 vertex of which 24 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 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 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 23 transition count 32
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 16 place count 11 transition count 15
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 11 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 10 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 10 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 9 transition count 11
Applied a total of 34 rules in 4 ms. Remains 9 /129 variables (removed 120) and now considering 11/189 (removed 178) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 9/129 places, 11/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 0 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 0 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
FORMULA DLCround-PT-05a-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 98 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 84 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 84 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 84 transition count 160
Applied a total of 60 rules in 3 ms. Remains 84 /129 variables (removed 45) and now considering 160/189 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/129 places, 160/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 94 transition count 189
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 54 place count 75 transition count 151
Iterating global reduction 1 with 19 rules applied. Total rules applied 73 place count 75 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 75 transition count 150
Applied a total of 74 rules in 4 ms. Remains 75 /129 variables (removed 54) and now considering 150/189 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/129 places, 150/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 5 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 93 transition count 189
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 54 place count 75 transition count 153
Iterating global reduction 1 with 18 rules applied. Total rules applied 72 place count 75 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 75 transition count 152
Applied a total of 73 rules in 4 ms. Remains 75 /129 variables (removed 54) and now considering 152/189 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 75/129 places, 152/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:16] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 95 transition count 189
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 53 place count 76 transition count 151
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 76 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 74 place count 76 transition count 149
Applied a total of 74 rules in 3 ms. Remains 76 /129 variables (removed 53) and now considering 149/189 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 76/129 places, 149/189 transitions.
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:16] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 93 transition count 189
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 77 transition count 157
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 77 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 77 transition count 155
Applied a total of 70 rules in 3 ms. Remains 77 /129 variables (removed 52) and now considering 155/189 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 77/129 places, 155/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 98 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 45 place count 84 transition count 161
Iterating global reduction 1 with 14 rules applied. Total rules applied 59 place count 84 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 84 transition count 159
Applied a total of 61 rules in 3 ms. Remains 84 /129 variables (removed 45) and now considering 159/189 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/129 places, 159/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 94 transition count 189
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 54 place count 75 transition count 151
Iterating global reduction 1 with 19 rules applied. Total rules applied 73 place count 75 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 75 transition count 149
Applied a total of 75 rules in 3 ms. Remains 75 /129 variables (removed 54) and now considering 149/189 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 75/129 places, 149/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Graph (trivial) has 169 edges and 129 vertex of which 76 / 129 are part of one of the 10 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Graph (complete) has 105 edges and 63 vertex of which 28 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 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 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 27 transition count 37
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 17 transition count 22
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 17 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 16 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 28 place count 16 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 15 transition count 18
Applied a total of 30 rules in 5 ms. Remains 15 /129 variables (removed 114) and now considering 18/189 (removed 171) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 15/129 places, 18/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 1 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 0 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 97 transition count 189
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 50 place count 79 transition count 153
Iterating global reduction 1 with 18 rules applied. Total rules applied 68 place count 79 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 79 transition count 151
Applied a total of 70 rules in 4 ms. Remains 79 /129 variables (removed 50) and now considering 151/189 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 79/129 places, 151/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 91 transition count 189
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 58 place count 71 transition count 149
Iterating global reduction 1 with 20 rules applied. Total rules applied 78 place count 71 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 71 transition count 148
Applied a total of 79 rules in 3 ms. Remains 71 /129 variables (removed 58) and now considering 148/189 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 71/129 places, 148/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 4 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 95 transition count 189
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 54 place count 75 transition count 149
Iterating global reduction 1 with 20 rules applied. Total rules applied 74 place count 75 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 75 transition count 147
Applied a total of 76 rules in 2 ms. Remains 75 /129 variables (removed 54) and now considering 147/189 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 75/129 places, 147/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 189/189 transitions.
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 95 transition count 189
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 55 place count 74 transition count 147
Iterating global reduction 1 with 21 rules applied. Total rules applied 76 place count 74 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 74 transition count 145
Applied a total of 78 rules in 2 ms. Remains 74 /129 variables (removed 55) and now considering 145/189 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 74/129 places, 145/189 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 3 ms
[2023-03-10 12:05:17] [INFO ] Input system was already deterministic with 145 transitions.
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 7 ms
[2023-03-10 12:05:17] [INFO ] Flatten gal took : 6 ms
[2023-03-10 12:05:17] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-10 12:05:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 189 transitions and 455 arcs took 1 ms.
Total runtime 1770 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: 129 NrTr: 189 NrArc: 455)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.736sec
RS generation: 0m 0.025sec
-> reachability set: #nodes 1349 (1.3e+03) #states 1,360,800,001 (9)
starting MCC model checker
--------------------------
checking: EX [[p2<=0 & 0<=p2]]
normalized: EX [[p2<=0 & 0<=p2]]
abstracting: (0<=p2)
states: 1,360,800,001 (9)
abstracting: (p2<=0)
states: 1,166,400,001 (9)
.-> the formula is TRUE
FORMULA DLCround-PT-05a-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: EX [AG [EX [[EF [[[p10<=0 & 0<=p10] | [p88<=0 & 0<=p88]]] & [EX [[[p7<=1 & 1<=p7] & [p85<=1 & 1<=p85]]] & [[p26<=0 & 0<=p26] | [p112<=0 & 0<=p112]]]]]]]
normalized: EX [~ [E [true U ~ [EX [[E [true U [[p88<=0 & 0<=p88] | [p10<=0 & 0<=p10]]] & [[[p26<=0 & 0<=p26] | [p112<=0 & 0<=p112]] & EX [[[p7<=1 & 1<=p7] & [p85<=1 & 1<=p85]]]]]]]]]]
abstracting: (1<=p85)
states: 1,360,800,000 (9)
abstracting: (p85<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p7)
states: 194,400,000 (8)
abstracting: (p7<=1)
states: 1,360,800,001 (9)
.abstracting: (0<=p112)
states: 1,360,800,001 (9)
abstracting: (p112<=0)
states: 1
abstracting: (0<=p26)
states: 1,360,800,001 (9)
abstracting: (p26<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p10)
states: 1,360,800,001 (9)
abstracting: (p10<=0)
states: 1,134,000,001 (9)
abstracting: (0<=p88)
states: 1,360,800,001 (9)
abstracting: (p88<=0)
states: 1
..-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: EF [[E [[[p32<=1 & 1<=p32] & [p85<=1 & 1<=p85]] U [[p81<=1 & 1<=p81] & [p125<=1 & 1<=p125]]] & AG [[[p39<=1 & 1<=p39] & [p113<=1 & 1<=p113]]]]]
normalized: E [true U [~ [E [true U ~ [[[p113<=1 & 1<=p113] & [p39<=1 & 1<=p39]]]]] & E [[[p85<=1 & 1<=p85] & [p32<=1 & 1<=p32]] U [[p125<=1 & 1<=p125] & [p81<=1 & 1<=p81]]]]]
abstracting: (1<=p81)
states: 151,200,000 (8)
abstracting: (p81<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p125)
states: 1,360,800,000 (9)
abstracting: (p125<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p32)
states: 136,080,000 (8)
abstracting: (p32<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p85)
states: 1,360,800,000 (9)
abstracting: (p85<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p39)
states: 136,080,000 (8)
abstracting: (p39<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p113)
states: 1,360,800,000 (9)
abstracting: (p113<=1)
states: 1,360,800,001 (9)
-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.026sec
checking: AF [[EF [[AX [[[p62<=1 & 1<=p62] & [p122<=1 & 1<=p122]]] & E [[p2<=1 & 1<=p2] U [[p74<=1 & 1<=p74] & [p101<=1 & 1<=p101]]]]] | AG [[[p68<=0 & 0<=p68] | [p102<=0 & 0<=p102]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[[p102<=0 & 0<=p102] | [p68<=0 & 0<=p68]]]]] | E [true U [E [[p2<=1 & 1<=p2] U [[p101<=1 & 1<=p101] & [p74<=1 & 1<=p74]]] & ~ [EX [~ [[[p122<=1 & 1<=p122] & [p62<=1 & 1<=p62]]]]]]]]]]]
abstracting: (1<=p62)
states: 136,080,000 (8)
abstracting: (p62<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p122)
states: 1,360,800,000 (9)
abstracting: (p122<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p74)
states: 136,080,000 (8)
abstracting: (p74<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p101)
states: 1,360,800,000 (9)
abstracting: (p101<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p2)
states: 194,400,000 (8)
abstracting: (p2<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p68)
states: 1,360,800,001 (9)
abstracting: (p68<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p102)
states: 1,360,800,001 (9)
abstracting: (p102<=0)
states: 1
EG iterations: 0
-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AG [[EX [[p37<=1 & 1<=p37]] | ~ [A [[AX [[p0<=1 & 1<=p0]] & AF [[p1<=1 & 1<=p1]]] U [[~ [[[p46<=1 & 1<=p46] & [p93<=1 & 1<=p93]]] & [p83<=1 & 1<=p83]] & [[p125<=1 & 1<=p125] & [p39<=1 & 1<=p39]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [EG [~ [[[[p39<=1 & 1<=p39] & [p125<=1 & 1<=p125]] & [[p83<=1 & 1<=p83] & ~ [[[p93<=1 & 1<=p93] & [p46<=1 & 1<=p46]]]]]]]] & ~ [E [~ [[[[p39<=1 & 1<=p39] & [p125<=1 & 1<=p125]] & [[p83<=1 & 1<=p83] & ~ [[[p93<=1 & 1<=p93] & [p46<=1 & 1<=p46]]]]]] U [~ [[~ [EG [~ [[p1<=1 & 1<=p1]]]] & ~ [EX [~ [[p0<=1 & 1<=p0]]]]]] & ~ [[[[p39<=1 & 1<=p39] & [p125<=1 & 1<=p125]] & [[p83<=1 & 1<=p83] & ~ [[[p93<=1 & 1<=p93] & [p46<=1 & 1<=p46]]]]]]]]]]] | EX [[p37<=1 & 1<=p37]]]]]]
abstracting: (1<=p37)
states: 136,080,000 (8)
abstracting: (p37<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p46)
states: 136,080,000 (8)
abstracting: (p46<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p83)
states: 151,200,000 (8)
abstracting: (p83<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p125)
states: 1,360,800,000 (9)
abstracting: (p125<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p39)
states: 136,080,000 (8)
abstracting: (p39<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p1)
states: 194,400,000 (8)
abstracting: (p1<=1)
states: 1,360,800,001 (9)
.
EG iterations: 1
abstracting: (1<=p46)
states: 136,080,000 (8)
abstracting: (p46<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p83)
states: 151,200,000 (8)
abstracting: (p83<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p125)
states: 1,360,800,000 (9)
abstracting: (p125<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p39)
states: 136,080,000 (8)
abstracting: (p39<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p46)
states: 136,080,000 (8)
abstracting: (p46<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p83)
states: 151,200,000 (8)
abstracting: (p83<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p125)
states: 1,360,800,000 (9)
abstracting: (p125<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p39)
states: 136,080,000 (8)
abstracting: (p39<=1)
states: 1,360,800,001 (9)
.
EG iterations: 1
-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.044sec
checking: [AG [EX [[[[p56<=1 & 1<=p56] & [p121<=1 & 1<=p121]] | [[p44<=1 & 1<=p44] & [p113<=1 & 1<=p113]]]]] | AG [[[[p34<=0 & 0<=p34] | [p86<=0 & 0<=p86]] & EX [[[p44<=0 & 0<=p44] | [p90<=0 & 0<=p90]]]]]]
normalized: [~ [E [true U ~ [[EX [[[p90<=0 & 0<=p90] | [p44<=0 & 0<=p44]]] & [[p86<=0 & 0<=p86] | [p34<=0 & 0<=p34]]]]]] | ~ [E [true U ~ [EX [[[[p113<=1 & 1<=p113] & [p44<=1 & 1<=p44]] | [[p121<=1 & 1<=p121] & [p56<=1 & 1<=p56]]]]]]]]
abstracting: (1<=p56)
states: 136,080,000 (8)
abstracting: (p56<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p121)
states: 1,360,800,000 (9)
abstracting: (p121<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p44)
states: 136,080,000 (8)
abstracting: (p44<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p113)
states: 1,360,800,000 (9)
abstracting: (p113<=1)
states: 1,360,800,001 (9)
.abstracting: (0<=p34)
states: 1,360,800,001 (9)
abstracting: (p34<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p86)
states: 1,360,800,001 (9)
abstracting: (p86<=0)
states: 1
abstracting: (0<=p44)
states: 1,360,800,001 (9)
abstracting: (p44<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p90)
states: 1,360,800,001 (9)
abstracting: (p90<=0)
states: 1
.-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: EF [AX [[[[p43<=0 & 0<=p43] | [p114<=0 & 0<=p114]] & [[[p83<=1 & 1<=p83] & [p105<=1 & 1<=p105]] | [[[p33<=1 & 1<=p33] & [p85<=1 & 1<=p85]] & [[p64<=1 & 1<=p64] & [p118<=1 & 1<=p118]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[p118<=1 & 1<=p118] & [p64<=1 & 1<=p64]] & [[p85<=1 & 1<=p85] & [p33<=1 & 1<=p33]]] | [[p105<=1 & 1<=p105] & [p83<=1 & 1<=p83]]] & [[p114<=0 & 0<=p114] | [p43<=0 & 0<=p43]]]]]]]
abstracting: (0<=p43)
states: 1,360,800,001 (9)
abstracting: (p43<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p114)
states: 1,360,800,001 (9)
abstracting: (p114<=0)
states: 1
abstracting: (1<=p83)
states: 151,200,000 (8)
abstracting: (p83<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p105)
states: 1,360,800,000 (9)
abstracting: (p105<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p33)
states: 136,080,000 (8)
abstracting: (p33<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p85)
states: 1,360,800,000 (9)
abstracting: (p85<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p64)
states: 136,080,000 (8)
abstracting: (p64<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p118)
states: 1,360,800,000 (9)
abstracting: (p118<=1)
states: 1,360,800,001 (9)
.-> the formula is TRUE
FORMULA DLCround-PT-05a-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: EF [AX [[[EF [[[p35<=1 & 1<=p35] & [p111<=1 & 1<=p111]]] & [[p29<=0 & 0<=p29] & [p69<=1 & 1<=p69]]] & [[[p123<=1 & 1<=p123] & [p19<=1 & 1<=p19]] & [[p99<=1 & 1<=p99] & [[p13<=0 & 0<=p13] | [p107<=0 & 0<=p107]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[p107<=0 & 0<=p107] | [p13<=0 & 0<=p13]] & [p99<=1 & 1<=p99]] & [[p19<=1 & 1<=p19] & [p123<=1 & 1<=p123]]] & [[[p69<=1 & 1<=p69] & [p29<=0 & 0<=p29]] & E [true U [[p111<=1 & 1<=p111] & [p35<=1 & 1<=p35]]]]]]]]]
abstracting: (1<=p35)
states: 136,080,000 (8)
abstracting: (p35<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p111)
states: 1,360,800,000 (9)
abstracting: (p111<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p29)
states: 1,360,800,001 (9)
abstracting: (p29<=0)
states: 1,224,720,001 (9)
abstracting: (1<=p69)
states: 136,080,000 (8)
abstracting: (p69<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p123)
states: 1,360,800,000 (9)
abstracting: (p123<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p19)
states: 226,800,000 (8)
abstracting: (p19<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p99)
states: 1,360,800,000 (9)
abstracting: (p99<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p13)
states: 1,360,800,001 (9)
abstracting: (p13<=0)
states: 1,134,000,001 (9)
abstracting: (0<=p107)
states: 1,360,800,001 (9)
abstracting: (p107<=0)
states: 1
.-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: AG [[EX [[[E [~ [[[p64<=1 & 1<=p64] & [p96<=1 & 1<=p96]]] U [[p54<=1 & 1<=p54] & [[p122<=1 & 1<=p122] & [p30<=1 & 1<=p30]]]] | [p48<=0 & 0<=p48]] | [[p95<=0 & 0<=p95] | [[p25<=0 & 0<=p25] | [p108<=0 & 0<=p108]]]]] & EF [EX [[[p38<=1 & 1<=p38] & [p91<=1 & 1<=p91]]]]]]
normalized: ~ [E [true U ~ [[E [true U EX [[[p91<=1 & 1<=p91] & [p38<=1 & 1<=p38]]]] & EX [[[[[p108<=0 & 0<=p108] | [p25<=0 & 0<=p25]] | [p95<=0 & 0<=p95]] | [[p48<=0 & 0<=p48] | E [~ [[[p96<=1 & 1<=p96] & [p64<=1 & 1<=p64]]] U [[[p30<=1 & 1<=p30] & [p122<=1 & 1<=p122]] & [p54<=1 & 1<=p54]]]]]]]]]]
abstracting: (1<=p54)
states: 136,080,000 (8)
abstracting: (p54<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p122)
states: 1,360,800,000 (9)
abstracting: (p122<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p30)
states: 136,080,000 (8)
abstracting: (p30<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p64)
states: 136,080,000 (8)
abstracting: (p64<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p96)
states: 1,360,800,000 (9)
abstracting: (p96<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p48)
states: 1,360,800,001 (9)
abstracting: (p48<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p95)
states: 1,360,800,001 (9)
abstracting: (p95<=0)
states: 1
abstracting: (0<=p25)
states: 1,360,800,001 (9)
abstracting: (p25<=0)
states: 1,134,000,001 (9)
abstracting: (0<=p108)
states: 1,360,800,001 (9)
abstracting: (p108<=0)
states: 1
.abstracting: (1<=p38)
states: 136,080,000 (8)
abstracting: (p38<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p91)
states: 1,360,800,000 (9)
abstracting: (p91<=1)
states: 1,360,800,001 (9)
.-> the formula is TRUE
FORMULA DLCround-PT-05a-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.042sec
checking: EF [EG [[[p49<=1 & 1<=p49] & [[p93<=1 & 1<=p93] & [[[p16<=0 & 0<=p16] | [[p94<=0 & 0<=p94] | [p74<=0 & 0<=p74]]] | [[[p115<=0 & 0<=p115] | [p84<=0 & 0<=p84]] | [[p127<=0 & 0<=p127] | [[[p45<=0 & 0<=p45] | [p115<=0 & 0<=p115]] & [[p78<=0 & 0<=p78] | [p125<=0 & 0<=p125]]]]]]]]]]
normalized: E [true U EG [[[[[[[[[p125<=0 & 0<=p125] | [p78<=0 & 0<=p78]] & [[p115<=0 & 0<=p115] | [p45<=0 & 0<=p45]]] | [p127<=0 & 0<=p127]] | [[p84<=0 & 0<=p84] | [p115<=0 & 0<=p115]]] | [[[p74<=0 & 0<=p74] | [p94<=0 & 0<=p94]] | [p16<=0 & 0<=p16]]] & [p93<=1 & 1<=p93]] & [p49<=1 & 1<=p49]]]]
abstracting: (1<=p49)
states: 136,080,000 (8)
abstracting: (p49<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p93)
states: 1,360,800,000 (9)
abstracting: (p93<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p16)
states: 1,360,800,001 (9)
abstracting: (p16<=0)
states: 1,134,000,001 (9)
abstracting: (0<=p94)
states: 1,360,800,001 (9)
abstracting: (p94<=0)
states: 1
abstracting: (0<=p74)
states: 1,360,800,001 (9)
abstracting: (p74<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p115)
states: 1,360,800,001 (9)
abstracting: (p115<=0)
states: 1
abstracting: (0<=p84)
states: 1,360,800,001 (9)
abstracting: (p84<=0)
states: 1,209,600,001 (9)
abstracting: (0<=p127)
states: 1,360,800,001 (9)
abstracting: (p127<=0)
states: 1
abstracting: (0<=p45)
states: 1,360,800,001 (9)
abstracting: (p45<=0)
states: 1,224,720,001 (9)
abstracting: (0<=p115)
states: 1,360,800,001 (9)
abstracting: (p115<=0)
states: 1
abstracting: (0<=p78)
states: 1,360,800,001 (9)
abstracting: (p78<=0)
states: 1,209,600,001 (9)
abstracting: (0<=p125)
states: 1,360,800,001 (9)
abstracting: (p125<=0)
states: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA DLCround-PT-05a-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: [EG [AF [[EX [[[p68<=1 & 1<=p68] & [p103<=1 & 1<=p103]]] | EG [[[p84<=1 & 1<=p84] & [p106<=1 & 1<=p106]]]]]] | AF [[[AG [[p77<=0 & 0<=p77]] & [AX [[[[p76<=1 & 1<=p76] & [p128<=1 & 1<=p128]] | [[p33<=1 & 1<=p33] & [p109<=1 & 1<=p109]]]] | [[[p25<=1 & 1<=p25] & [p108<=1 & 1<=p108]] | [[p7<=1 & 1<=p7] & [p85<=1 & 1<=p85]]]]] & [[p54<=1 & 1<=p54] & [p110<=1 & 1<=p110]]]]]
normalized: [~ [EG [~ [[[[p110<=1 & 1<=p110] & [p54<=1 & 1<=p54]] & [[[[[p85<=1 & 1<=p85] & [p7<=1 & 1<=p7]] | [[p108<=1 & 1<=p108] & [p25<=1 & 1<=p25]]] | ~ [EX [~ [[[[p109<=1 & 1<=p109] & [p33<=1 & 1<=p33]] | [[p128<=1 & 1<=p128] & [p76<=1 & 1<=p76]]]]]]] & ~ [E [true U ~ [[p77<=0 & 0<=p77]]]]]]]]] | EG [~ [EG [~ [[EG [[[p106<=1 & 1<=p106] & [p84<=1 & 1<=p84]]] | EX [[[p103<=1 & 1<=p103] & [p68<=1 & 1<=p68]]]]]]]]]
abstracting: (1<=p68)
states: 136,080,000 (8)
abstracting: (p68<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p103)
states: 1,360,800,000 (9)
abstracting: (p103<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p84)
states: 151,200,000 (8)
abstracting: (p84<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p106)
states: 1,360,800,000 (9)
abstracting: (p106<=1)
states: 1,360,800,001 (9)
.
EG iterations: 1
..
EG iterations: 2
.
EG iterations: 1
abstracting: (0<=p77)
states: 1,360,800,001 (9)
abstracting: (p77<=0)
states: 1,209,600,001 (9)
abstracting: (1<=p76)
states: 151,200,000 (8)
abstracting: (p76<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p128)
states: 1,360,800,000 (9)
abstracting: (p128<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p33)
states: 136,080,000 (8)
abstracting: (p33<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p109)
states: 1,360,800,000 (9)
abstracting: (p109<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p25)
states: 226,800,000 (8)
abstracting: (p25<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p108)
states: 1,360,800,000 (9)
abstracting: (p108<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p7)
states: 194,400,000 (8)
abstracting: (p7<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p85)
states: 1,360,800,000 (9)
abstracting: (p85<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p54)
states: 136,080,000 (8)
abstracting: (p54<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p110)
states: 1,360,800,000 (9)
abstracting: (p110<=1)
states: 1,360,800,001 (9)
EG iterations: 0
-> the formula is TRUE
FORMULA DLCround-PT-05a-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.062sec
checking: [EG [[[[p4<=1 & 1<=p4] | [[p69<=1 & 1<=p69] & [p123<=1 & 1<=p123]]] & AF [[[p35<=1 & 1<=p35] & [p87<=1 & 1<=p87]]]]] | [~ [E [~ [[[p82<=1 & 1<=p82] & [p107<=1 & 1<=p107]]] U [[p31<=1 & 1<=p31] & [[p109<=1 & 1<=p109] & ~ [[[[p53<=1 & 1<=p53] & [p95<=1 & 1<=p95]] & [[p56<=1 & 1<=p56] & [p97<=1 & 1<=p97]]]]]]]] | ~ [E [AX [[E [[[p74<=1 & 1<=p74] & [p115<=1 & 1<=p115]] U [[p64<=1 & 1<=p64] & [p99<=1 & 1<=p99]]] | EF [[[p64<=1 & 1<=p64] & [p120<=1 & 1<=p120]]]]] U EF [[[p5<=1 & 1<=p5] & [[p25<=1 & 1<=p25] & [p91<=1 & 1<=p91]]]]]]]]
normalized: [[~ [E [~ [EX [~ [[E [true U [[p120<=1 & 1<=p120] & [p64<=1 & 1<=p64]]] | E [[[p115<=1 & 1<=p115] & [p74<=1 & 1<=p74]] U [[p99<=1 & 1<=p99] & [p64<=1 & 1<=p64]]]]]]] U E [true U [[[p91<=1 & 1<=p91] & [p25<=1 & 1<=p25]] & [p5<=1 & 1<=p5]]]]] | ~ [E [~ [[[p107<=1 & 1<=p107] & [p82<=1 & 1<=p82]]] U [[~ [[[[p97<=1 & 1<=p97] & [p56<=1 & 1<=p56]] & [[p95<=1 & 1<=p95] & [p53<=1 & 1<=p53]]]] & [p109<=1 & 1<=p109]] & [p31<=1 & 1<=p31]]]]] | EG [[~ [EG [~ [[[p87<=1 & 1<=p87] & [p35<=1 & 1<=p35]]]]] & [[[p123<=1 & 1<=p123] & [p69<=1 & 1<=p69]] | [p4<=1 & 1<=p4]]]]]
abstracting: (1<=p4)
states: 194,400,000 (8)
abstracting: (p4<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p69)
states: 136,080,000 (8)
abstracting: (p69<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p123)
states: 1,360,800,000 (9)
abstracting: (p123<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p35)
states: 136,080,000 (8)
abstracting: (p35<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p87)
states: 1,360,800,000 (9)
abstracting: (p87<=1)
states: 1,360,800,001 (9)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p31)
states: 136,080,000 (8)
abstracting: (p31<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p109)
states: 1,360,800,000 (9)
abstracting: (p109<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p53)
states: 136,080,000 (8)
abstracting: (p53<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p95)
states: 1,360,800,000 (9)
abstracting: (p95<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p56)
states: 136,080,000 (8)
abstracting: (p56<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p97)
states: 1,360,800,000 (9)
abstracting: (p97<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p82)
states: 151,200,000 (8)
abstracting: (p82<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p107)
states: 1,360,800,000 (9)
abstracting: (p107<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p5)
states: 194,400,000 (8)
abstracting: (p5<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p25)
states: 226,800,000 (8)
abstracting: (p25<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p91)
states: 1,360,800,000 (9)
abstracting: (p91<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p64)
states: 136,080,000 (8)
abstracting: (p64<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p99)
states: 1,360,800,000 (9)
abstracting: (p99<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p74)
states: 136,080,000 (8)
abstracting: (p74<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p115)
states: 1,360,800,000 (9)
abstracting: (p115<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p64)
states: 136,080,000 (8)
abstracting: (p64<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p120)
states: 1,360,800,000 (9)
abstracting: (p120<=1)
states: 1,360,800,001 (9)
.-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: [EF [[[[p44<=1 & 1<=p44] & [p91<=1 & 1<=p91]] | [[[~ [E [[[p74<=1 & 1<=p74] & [p119<=1 & 1<=p119]] U [[p25<=1 & 1<=p25] & [p100<=1 & 1<=p100]]]] & AG [[p16<=0 & 0<=p16]]] | [~ [A [[[p74<=1 & 1<=p74] & [p124<=1 & 1<=p124]] U [p61<=1 & 1<=p61]]] & [[p13<=0 & 0<=p13] | [p107<=0 & 0<=p107]]]] & [[p70<=1 & 1<=p70] & [p103<=1 & 1<=p103]]]]] & E [EF [~ [AG [[[p5<=1 & 1<=p5] & [[p84<=1 & 1<=p84] & [p126<=1 & 1<=p126]]]]]] U AX [[AF [[[p59<=1 & 1<=p59] & [[p44<=1 & 1<=p44] & [p89<=1 & 1<=p89]]]] & [~ [[[[p69<=1 & 1<=p69] & [p104<=1 & 1<=p104]] | [[p32<=1 & 1<=p32] & [p111<=1 & 1<=p111]]]] & ~ [[p20<=1 & 1<=p20]]]]]]]
normalized: [E [E [true U E [true U ~ [[[[p126<=1 & 1<=p126] & [p84<=1 & 1<=p84]] & [p5<=1 & 1<=p5]]]]] U ~ [EX [~ [[[~ [[p20<=1 & 1<=p20]] & ~ [[[[p111<=1 & 1<=p111] & [p32<=1 & 1<=p32]] | [[p104<=1 & 1<=p104] & [p69<=1 & 1<=p69]]]]] & ~ [EG [~ [[[[p89<=1 & 1<=p89] & [p44<=1 & 1<=p44]] & [p59<=1 & 1<=p59]]]]]]]]]] & E [true U [[[[p103<=1 & 1<=p103] & [p70<=1 & 1<=p70]] & [[[[p107<=0 & 0<=p107] | [p13<=0 & 0<=p13]] & ~ [[~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[[p124<=1 & 1<=p124] & [p74<=1 & 1<=p74]]] & ~ [[p61<=1 & 1<=p61]]]]]]]] | [~ [E [true U ~ [[p16<=0 & 0<=p16]]]] & ~ [E [[[p119<=1 & 1<=p119] & [p74<=1 & 1<=p74]] U [[p100<=1 & 1<=p100] & [p25<=1 & 1<=p25]]]]]]] | [[p91<=1 & 1<=p91] & [p44<=1 & 1<=p44]]]]]
abstracting: (1<=p44)
states: 136,080,000 (8)
abstracting: (p44<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p91)
states: 1,360,800,000 (9)
abstracting: (p91<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p25)
states: 226,800,000 (8)
abstracting: (p25<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p100)
states: 1,360,800,000 (9)
abstracting: (p100<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p74)
states: 136,080,000 (8)
abstracting: (p74<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p119)
states: 1,360,800,000 (9)
abstracting: (p119<=1)
states: 1,360,800,001 (9)
abstracting: (0<=p16)
states: 1,360,800,001 (9)
abstracting: (p16<=0)
states: 1,134,000,001 (9)
abstracting: (1<=p61)
states: 136,080,000 (8)
abstracting: (p61<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p74)
states: 136,080,000 (8)
abstracting: (p74<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p124)
states: 1,360,800,000 (9)
abstracting: (p124<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p61)
states: 136,080,000 (8)
abstracting: (p61<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p61)
states: 136,080,000 (8)
abstracting: (p61<=1)
states: 1,360,800,001 (9)
.
EG iterations: 1
abstracting: (0<=p13)
states: 1,360,800,001 (9)
abstracting: (p13<=0)
states: 1,134,000,001 (9)
abstracting: (0<=p107)
states: 1,360,800,001 (9)
abstracting: (p107<=0)
states: 1
abstracting: (1<=p70)
states: 136,080,000 (8)
abstracting: (p70<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p103)
states: 1,360,800,000 (9)
abstracting: (p103<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p59)
states: 136,080,000 (8)
abstracting: (p59<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p44)
states: 136,080,000 (8)
abstracting: (p44<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p89)
states: 1,360,800,000 (9)
abstracting: (p89<=1)
states: 1,360,800,001 (9)
.
EG iterations: 1
abstracting: (1<=p69)
states: 136,080,000 (8)
abstracting: (p69<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p104)
states: 1,360,800,000 (9)
abstracting: (p104<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p32)
states: 136,080,000 (8)
abstracting: (p32<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p111)
states: 1,360,800,000 (9)
abstracting: (p111<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p20)
states: 226,800,000 (8)
abstracting: (p20<=1)
states: 1,360,800,001 (9)
.abstracting: (1<=p5)
states: 194,400,000 (8)
abstracting: (p5<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p84)
states: 151,200,000 (8)
abstracting: (p84<=1)
states: 1,360,800,001 (9)
abstracting: (1<=p126)
states: 1,360,800,000 (9)
abstracting: (p126<=1)
states: 1,360,800,001 (9)
-> the formula is FALSE
FORMULA DLCround-PT-05a-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.031sec
totally nodes used: 119548 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 640080 1568237 2208317
used/not used/entry size/cache size: 1629427 65479437 16 1024MB
basic ops cache: hits/miss/sum: 91443 209618 301061
used/not used/entry size/cache size: 317329 16459887 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: 6311 13588 19899
used/not used/entry size/cache size: 13583 8375025 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 66991594
1 115045
2 2175
3 47
4 3
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.839sec
BK_STOP 1678449923241
--------------------
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:1529 (8), effective:75 (0)
initing FirstDep: 0m 0.000sec
iterations count:194 (1), effective:1 (0)
iterations count:505 (2), effective:15 (0)
iterations count:233 (1), effective:8 (0)
iterations count:191 (1), effective:1 (0)
iterations count:447 (2), effective:9 (0)
iterations count:623 (3), effective:10 (0)
iterations count:189 (1), effective:0 (0)
iterations count:520 (2), effective:19 (0)
iterations count:384 (2), effective:8 (0)
iterations count:462 (2), effective:10 (0)
iterations count:738 (3), effective:29 (0)
iterations count:438 (2), effective:10 (0)
iterations count:624 (3), effective:19 (0)
iterations count:491 (2), effective:9 (0)
iterations count:495 (2), effective:11 (0)
iterations count:409 (2), effective:9 (0)
iterations count:463 (2), effective:11 (0)
iterations count:456 (2), effective:12 (0)
iterations count:407 (2), effective:9 (0)
iterations count:582 (3), effective:10 (0)
iterations count:189 (1), effective:0 (0)
iterations count:242 (1), effective:5 (0)
iterations count:387 (2), effective:6 (0)
iterations count:199 (1), effective:1 (0)
iterations count:502 (2), effective:10 (0)
iterations count:197 (1), effective:1 (0)
iterations count:189 (1), effective:0 (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-05a"
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-05a, 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-167814483000650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-05a.tgz
mv DLCround-PT-05a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;