About the Execution of Marcie for EisenbergMcGuire-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5813.075 | 21866.00 | 20295.00 | 2744.20 | TFTFFTTTTTFTFTFT | 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.r513-tall-167987240800217.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 marcie
Input is EisenbergMcGuire-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r513-tall-167987240800217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.7K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Mar 23 15:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 109K Mar 26 22:42 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 EisenbergMcGuire-PT-03-CTLCardinality-00
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-01
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-02
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-03
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-04
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-05
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-06
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-07
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-08
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-09
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-10
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-11
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-12
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-13
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-14
FORMULA_NAME EisenbergMcGuire-PT-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679888160673
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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: the_net
(NrP: 117 NrTr: 216 NrArc: 900)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.864sec
RS generation: 0m 1.546sec
-> reachability set: #nodes 12359 (1.2e+04) #states 31,265 (4)
starting MCC model checker
--------------------------
checking: EX [EG [AG [AG [p08_2_1<=1]]]]
normalized: EX [EG [~ [E [true U E [true U ~ [p08_2_1<=1]]]]]]
abstracting: (p08_2_1<=1)
states: 31,265 (4)
EG iterations: 0
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.414sec
checking: AG [AX [~ [EG [AG [critical_section_2<=p07_1]]]]]
normalized: ~ [E [true U EX [EG [~ [E [true U ~ [critical_section_2<=p07_1]]]]]]]
abstracting: (critical_section_2<=p07_1)
states: 30,885 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.416sec
checking: ~ [E [~ [EX [AG [EG [p04_1<=0]]]] U AX [1<=p07_0]]]
normalized: ~ [E [~ [EX [~ [E [true U ~ [EG [p04_1<=0]]]]]] U ~ [EX [~ [1<=p07_0]]]]]
abstracting: (1<=p07_0)
states: 1,986 (3)
.abstracting: (p04_1<=0)
states: 28,037 (4)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.119sec
checking: AF [AF [AG [EF [EG [flag_0_idle<=p19_1_1]]]]]
normalized: ~ [EG [EG [E [true U ~ [E [true U EG [flag_0_idle<=p19_1_1]]]]]]]
abstracting: (flag_0_idle<=p19_1_1)
states: 29,549 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.125sec
checking: AG [AX [[1<=p15_2 | E [AX [p25_0_3<=1] U AG [1<=p19_2_1]]]]]
normalized: ~ [E [true U EX [~ [[1<=p15_2 | E [~ [EX [~ [p25_0_3<=1]]] U ~ [E [true U ~ [1<=p19_2_1]]]]]]]]]
abstracting: (1<=p19_2_1)
states: 880
abstracting: (p25_0_3<=1)
states: 31,265 (4)
.abstracting: (1<=p15_2)
states: 1,341 (3)
.-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.124sec
checking: [AF [p12_0_2<=1] & ~ [EF [A [~ [p34_1_2<=0] U 1<=p10_1_2]]]]
normalized: [~ [E [true U [~ [EG [~ [1<=p10_1_2]]] & ~ [E [~ [1<=p10_1_2] U [p34_1_2<=0 & ~ [1<=p10_1_2]]]]]]] & ~ [EG [~ [p12_0_2<=1]]]]
abstracting: (p12_0_2<=1)
states: 31,265 (4)
.
EG iterations: 1
abstracting: (1<=p10_1_2)
states: 1,090 (3)
abstracting: (p34_1_2<=0)
states: 31,175 (4)
abstracting: (1<=p10_1_2)
states: 1,090 (3)
abstracting: (1<=p10_1_2)
states: 1,090 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.397sec
checking: AG [EF [[EG [AX [p33_0_2<=0]] | ~ [AG [p19_0_1<=p08_0_0]]]]]
normalized: ~ [E [true U ~ [E [true U [E [true U ~ [p19_0_1<=p08_0_0]] | EG [~ [EX [~ [p33_0_2<=0]]]]]]]]]
abstracting: (p33_0_2<=0)
states: 31,185 (4)
..
EG iterations: 1
abstracting: (p19_0_1<=p08_0_0)
states: 30,355 (4)
-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.146sec
checking: EF [[~ [EX [[EX [flag_1_active<=0] | [critical_section_1<=p08_2_1 & 1<=turn_0]]]] & 1<=flag_1_waiting]]
normalized: E [true U [1<=flag_1_waiting & ~ [EX [[[critical_section_1<=p08_2_1 & 1<=turn_0] | EX [flag_1_active<=0]]]]]]
abstracting: (flag_1_active<=0)
states: 15,654 (4)
.abstracting: (1<=turn_0)
states: 10,073 (4)
abstracting: (critical_section_1<=p08_2_1)
states: 30,964 (4)
.abstracting: (1<=flag_1_waiting)
states: 13,886 (4)
-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.160sec
checking: AX [AG [E [[[p19_1_1<=0 | [p25_2_0<=1 & p33_0_2<=1]] | AG [p18_2_2<=1]] U 1<=p19_2_2]]]
normalized: ~ [EX [E [true U ~ [E [[~ [E [true U ~ [p18_2_2<=1]]] | [p19_1_1<=0 | [p25_2_0<=1 & p33_0_2<=1]]] U 1<=p19_2_2]]]]]
abstracting: (1<=p19_2_2)
states: 880
abstracting: (p33_0_2<=1)
states: 31,265 (4)
abstracting: (p25_2_0<=1)
states: 31,265 (4)
abstracting: (p19_1_1<=0)
states: 30,196 (4)
abstracting: (p18_2_2<=1)
states: 31,265 (4)
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.958sec
checking: [AG [EG [~ [[[p17_0<=p18_1_2 & 1<=p27_0] | [critical_section_0<=p37_0_1 | p25_2_0<=1]]]]] | EF [EF [~ [A [1<=p10_2_1 U [p27_2<=turn_0 | p34_2_1<=p32_2]]]]]]
normalized: [~ [E [true U ~ [EG [~ [[[p17_0<=p18_1_2 & 1<=p27_0] | [critical_section_0<=p37_0_1 | p25_2_0<=1]]]]]]] | E [true U E [true U ~ [[~ [E [~ [[p27_2<=turn_0 | p34_2_1<=p32_2]] U [~ [[p27_2<=turn_0 | p34_2_1<=p32_2]] & ~ [1<=p10_2_1]]]] & ~ [EG [~ [[p27_2<=turn_0 | p34_2_1<=p32_2]]]]]]]]]
abstracting: (p34_2_1<=p32_2)
states: 31,240 (4)
abstracting: (p27_2<=turn_0)
states: 30,665 (4)
.
EG iterations: 1
abstracting: (1<=p10_2_1)
states: 1,281 (3)
abstracting: (p34_2_1<=p32_2)
states: 31,240 (4)
abstracting: (p27_2<=turn_0)
states: 30,665 (4)
abstracting: (p34_2_1<=p32_2)
states: 31,240 (4)
abstracting: (p27_2<=turn_0)
states: 30,665 (4)
abstracting: (p25_2_0<=1)
states: 31,265 (4)
abstracting: (critical_section_0<=p37_0_1)
states: 31,029 (4)
abstracting: (1<=p27_0)
states: 435
abstracting: (p17_0<=p18_1_2)
states: 29,794 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: AX [[[~ [A [[EF [p08_0_1<=0] | p18_2_1<=critical_section_2] U ~ [AG [p18_2_1<=1]]]] | EX [~ [AF [p34_1_2<=1]]]] | [AX [[AF [p09_2_0<=0] & [1<=p18_1_0 & [1<=p17_1 | p08_2_2<=p19_2_0]]]] & EX [~ [AG [1<=flag_2_waiting]]]]]]
normalized: ~ [EX [~ [[[EX [E [true U ~ [1<=flag_2_waiting]]] & ~ [EX [~ [[[1<=p18_1_0 & [1<=p17_1 | p08_2_2<=p19_2_0]] & ~ [EG [~ [p09_2_0<=0]]]]]]]] | [EX [EG [~ [p34_1_2<=1]]] | ~ [[~ [EG [~ [E [true U ~ [p18_2_1<=1]]]]] & ~ [E [~ [E [true U ~ [p18_2_1<=1]]] U [~ [[p18_2_1<=critical_section_2 | E [true U p08_0_1<=0]]] & ~ [E [true U ~ [p18_2_1<=1]]]]]]]]]]]]]
abstracting: (p18_2_1<=1)
states: 31,265 (4)
abstracting: (p08_0_1<=0)
states: 30,143 (4)
abstracting: (p18_2_1<=critical_section_2)
states: 30,123 (4)
abstracting: (p18_2_1<=1)
states: 31,265 (4)
abstracting: (p18_2_1<=1)
states: 31,265 (4)
EG iterations: 0
abstracting: (p34_1_2<=1)
states: 31,265 (4)
.
EG iterations: 1
.abstracting: (p09_2_0<=0)
states: 30,211 (4)
.
EG iterations: 1
abstracting: (p08_2_2<=p19_2_0)
states: 29,924 (4)
abstracting: (1<=p17_1)
states: 1,488 (3)
abstracting: (1<=p18_1_0)
states: 1,488 (3)
.abstracting: (1<=flag_2_waiting)
states: 13,306 (4)
..-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.310sec
checking: EX [[EF [[[EG [p10_2_1<=p09_0_2] & [p32_2<=0 | [1<=p17_2 & 1<=flag_1_active]]] | [EG [p25_0_3<=p25_0_2] & p15_1<=p09_1_2]]] & AF [AF [~ [A [1<=p19_1_0 U p33_2_1<=p33_1_0]]]]]]
normalized: EX [[~ [EG [EG [[~ [EG [~ [p33_2_1<=p33_1_0]]] & ~ [E [~ [p33_2_1<=p33_1_0] U [~ [1<=p19_1_0] & ~ [p33_2_1<=p33_1_0]]]]]]]] & E [true U [[p15_1<=p09_1_2 & EG [p25_0_3<=p25_0_2]] | [[p32_2<=0 | [1<=p17_2 & 1<=flag_1_active]] & EG [p10_2_1<=p09_0_2]]]]]]
abstracting: (p10_2_1<=p09_0_2)
states: 30,043 (4)
.
EG iterations: 1
abstracting: (1<=flag_1_active)
states: 15,611 (4)
abstracting: (1<=p17_2)
states: 1,392 (3)
abstracting: (p32_2<=0)
states: 30,864 (4)
abstracting: (p25_0_3<=p25_0_2)
states: 30,750 (4)
.
EG iterations: 1
abstracting: (p15_1<=p09_1_2)
states: 29,841 (4)
abstracting: (p33_2_1<=p33_1_0)
states: 31,165 (4)
abstracting: (1<=p19_1_0)
states: 1,069 (3)
abstracting: (p33_2_1<=p33_1_0)
states: 31,165 (4)
abstracting: (p33_2_1<=p33_1_0)
states: 31,165 (4)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.311sec
checking: [[[AX [~ [AX [~ [flag_2_idle<=0]]]] & ~ [[EG [[EF [1<=p19_2_0] | EX [p10_0_1<=p10_1_2]]] & EF [[AF [1<=p34_1_2] & ~ [1<=p08_0_1]]]]]] & [~ [EG [EX [1<=critical_section_2]]] | AF [~ [EX [E [p33_0_2<=1 U p08_0_1<=0]]]]]] & [EG [AF [[EG [p18_0_0<=0] | EX [flag_1_waiting<=p19_0_1]]]] | AF [~ [AG [AG [flag_0_active<=0]]]]]]
normalized: [[EG [~ [EG [~ [[EX [flag_1_waiting<=p19_0_1] | EG [p18_0_0<=0]]]]]] | ~ [EG [~ [E [true U E [true U ~ [flag_0_active<=0]]]]]]] & [[~ [[E [true U [~ [1<=p08_0_1] & ~ [EG [~ [1<=p34_1_2]]]]] & EG [[EX [p10_0_1<=p10_1_2] | E [true U 1<=p19_2_0]]]]] & ~ [EX [~ [EX [flag_2_idle<=0]]]]] & [~ [EG [EX [E [p33_0_2<=1 U p08_0_1<=0]]]] | ~ [EG [EX [1<=critical_section_2]]]]]]
abstracting: (1<=critical_section_2)
states: 401
..
EG iterations: 1
abstracting: (p08_0_1<=0)
states: 30,143 (4)
abstracting: (p33_0_2<=1)
states: 31,265 (4)
.
EG iterations: 0
abstracting: (flag_2_idle<=0)
states: 29,558 (4)
..abstracting: (1<=p19_2_0)
states: 1,142 (3)
abstracting: (p10_0_1<=p10_1_2)
states: 30,202 (4)
.
EG iterations: 0
abstracting: (1<=p34_1_2)
states: 90
.
EG iterations: 1
abstracting: (1<=p08_0_1)
states: 1,122 (3)
abstracting: (flag_0_active<=0)
states: 16,147 (4)
.
EG iterations: 1
abstracting: (p18_0_0<=0)
states: 29,726 (4)
.
EG iterations: 1
abstracting: (flag_1_waiting<=p19_0_1)
states: 17,944 (4)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.209sec
checking: [A [AX [EX [EG [p09_0_1<=p08_1_2]]] U EF [critical_section_0<=p12_2_1]] | [EG [A [EG [~ [p17_1<=flag_1_active]] U EX [~ [p33_2_0<=p34_0_1]]]] | EX [EG [[AF [p37_1_1<=p09_0_2] | [[1<=p07_0 | flag_2_active<=p17_1] | EG [1<=p18_2_0]]]]]]]
normalized: [[EX [EG [[[EG [1<=p18_2_0] | [1<=p07_0 | flag_2_active<=p17_1]] | ~ [EG [~ [p37_1_1<=p09_0_2]]]]]] | EG [[~ [EG [~ [EX [~ [p33_2_0<=p34_0_1]]]]] & ~ [E [~ [EX [~ [p33_2_0<=p34_0_1]]] U [~ [EG [~ [p17_1<=flag_1_active]]] & ~ [EX [~ [p33_2_0<=p34_0_1]]]]]]]]] | [~ [EG [~ [E [true U critical_section_0<=p12_2_1]]]] & ~ [E [~ [E [true U critical_section_0<=p12_2_1]] U [EX [~ [EX [EG [p09_0_1<=p08_1_2]]]] & ~ [E [true U critical_section_0<=p12_2_1]]]]]]]
abstracting: (critical_section_0<=p12_2_1)
states: 31,041 (4)
abstracting: (p09_0_1<=p08_1_2)
states: 30,200 (4)
.
EG iterations: 1
..abstracting: (critical_section_0<=p12_2_1)
states: 31,041 (4)
abstracting: (critical_section_0<=p12_2_1)
states: 31,041 (4)
.
EG iterations: 1
abstracting: (p33_2_0<=p34_0_1)
states: 30,864 (4)
.abstracting: (p17_1<=flag_1_active)
states: 31,265 (4)
.
EG iterations: 1
abstracting: (p33_2_0<=p34_0_1)
states: 30,864 (4)
.abstracting: (p33_2_0<=p34_0_1)
states: 30,864 (4)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (p37_1_1<=p09_0_2)
states: 31,240 (4)
.
EG iterations: 1
abstracting: (flag_2_active<=p17_1)
states: 15,863 (4)
abstracting: (1<=p07_0)
states: 1,986 (3)
abstracting: (1<=p18_2_0)
states: 1,392 (3)
.
EG iterations: 1
EG iterations: 0
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.285sec
checking: [[AX [p33_2_1<=0] | ~ [EG [EG [E [1<=p34_2_0 U p10_1_2<=p18_2_0]]]]] & [[~ [EX [A [E [p08_0_2<=0 U 1<=critical_section_1] U p18_1_1<=1]]] | AG [EF [A [p18_1_3<=0 U 1<=p12_0_2]]]] | ~ [EX [E [[A [p09_1_2<=p10_0_1 U p09_2_0<=p08_1_0] | [p08_0_1<=0 & p18_0_1<=1]] U ~ [1<=p08_2_2]]]]]]
normalized: [[~ [EX [E [[[p08_0_1<=0 & p18_0_1<=1] | [~ [EG [~ [p09_2_0<=p08_1_0]]] & ~ [E [~ [p09_2_0<=p08_1_0] U [~ [p09_1_2<=p10_0_1] & ~ [p09_2_0<=p08_1_0]]]]]] U ~ [1<=p08_2_2]]]] | [~ [E [true U ~ [E [true U [~ [EG [~ [1<=p12_0_2]]] & ~ [E [~ [1<=p12_0_2] U [~ [p18_1_3<=0] & ~ [1<=p12_0_2]]]]]]]]] | ~ [EX [[~ [EG [~ [p18_1_1<=1]]] & ~ [E [~ [p18_1_1<=1] U [~ [E [p08_0_2<=0 U 1<=critical_section_1]] & ~ [p18_1_1<=1]]]]]]]]] & [~ [EG [EG [E [1<=p34_2_0 U p10_1_2<=p18_2_0]]]] | ~ [EX [~ [p33_2_1<=0]]]]]
abstracting: (p33_2_1<=0)
states: 31,165 (4)
.abstracting: (p10_1_2<=p18_2_0)
states: 30,211 (4)
abstracting: (1<=p34_2_0)
states: 100
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p18_1_1<=1)
states: 31,265 (4)
abstracting: (1<=critical_section_1)
states: 319
abstracting: (p08_0_2<=0)
states: 29,860 (4)
abstracting: (p18_1_1<=1)
states: 31,265 (4)
abstracting: (p18_1_1<=1)
states: 31,265 (4)
.
EG iterations: 1
.abstracting: (1<=p12_0_2)
states: 1,093 (3)
abstracting: (p18_1_3<=0)
states: 30,565 (4)
abstracting: (1<=p12_0_2)
states: 1,093 (3)
abstracting: (1<=p12_0_2)
states: 1,093 (3)
.
EG iterations: 1
abstracting: (1<=p08_2_2)
states: 1,341 (3)
abstracting: (p09_2_0<=p08_1_0)
states: 30,259 (4)
abstracting: (p09_1_2<=p10_0_1)
states: 30,230 (4)
abstracting: (p09_2_0<=p08_1_0)
states: 30,259 (4)
abstracting: (p09_2_0<=p08_1_0)
states: 30,259 (4)
.
EG iterations: 1
abstracting: (p18_0_1<=1)
states: 31,265 (4)
abstracting: (p08_0_1<=0)
states: 30,143 (4)
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.523sec
checking: ~ [EX [[~ [[1<=p19_1_0 | [[[p18_1_0<=0 & p18_0_0<=flag_0_waiting] & [1<=p33_0_1 & p34_1_0<=flag_0_active]] & AG [1<=p25_0_2]]]] & [[[AX [1<=p15_2] & ~ [[flag_0_idle<=p39_2 | p33_0_1<=p18_2_3]]] | [~ [EF [1<=p37_0_0]] & p37_2_0<=p34_1_0]] | ~ [[A [p32_2<=1 U p27_0<=0] | [~ [p08_1_0<=1] & ~ [p18_1_3<=critical_section_0]]]]]]]]
normalized: ~ [EX [[[[[~ [[flag_0_idle<=p39_2 | p33_0_1<=p18_2_3]] & ~ [EX [~ [1<=p15_2]]]] | [p37_2_0<=p34_1_0 & ~ [E [true U 1<=p37_0_0]]]] | ~ [[[~ [p08_1_0<=1] & ~ [p18_1_3<=critical_section_0]] | [~ [EG [~ [p27_0<=0]]] & ~ [E [~ [p27_0<=0] U [~ [p32_2<=1] & ~ [p27_0<=0]]]]]]]] & ~ [[1<=p19_1_0 | [~ [E [true U ~ [1<=p25_0_2]]] & [[1<=p33_0_1 & p34_1_0<=flag_0_active] & [p18_1_0<=0 & p18_0_0<=flag_0_waiting]]]]]]]]
abstracting: (p18_0_0<=flag_0_waiting)
states: 29,726 (4)
abstracting: (p18_1_0<=0)
states: 29,777 (4)
abstracting: (p34_1_0<=flag_0_active)
states: 31,240 (4)
abstracting: (1<=p33_0_1)
states: 236
abstracting: (1<=p25_0_2)
states: 722
abstracting: (1<=p19_1_0)
states: 1,069 (3)
abstracting: (p27_0<=0)
states: 30,830 (4)
abstracting: (p32_2<=1)
states: 31,265 (4)
abstracting: (p27_0<=0)
states: 30,830 (4)
abstracting: (p27_0<=0)
states: 30,830 (4)
.
EG iterations: 1
abstracting: (p18_1_3<=critical_section_0)
states: 30,565 (4)
abstracting: (p08_1_0<=1)
states: 31,265 (4)
abstracting: (1<=p37_0_0)
states: 25
abstracting: (p37_2_0<=p34_1_0)
states: 30,884 (4)
abstracting: (1<=p15_2)
states: 1,341 (3)
.abstracting: (p33_0_1<=p18_2_3)
states: 31,029 (4)
abstracting: (flag_0_idle<=p39_2)
states: 29,492 (4)
.-> the formula is TRUE
FORMULA EisenbergMcGuire-PT-03-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.718sec
totally nodes used: 5221617 (5.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12229134 40843799 53072933
used/not used/entry size/cache size: 33084896 34023968 16 1024MB
basic ops cache: hits/miss/sum: 2106012 5200497 7306509
used/not used/entry size/cache size: 7068926 9708290 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: 20007 100019 120026
used/not used/entry size/cache size: 99406 8289202 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 62588379
1 3933330
2 488736
3 84610
4 12238
5 1410
6 145
7 15
8 1
9 0
>= 10 0
Total processing time: 0m21.804sec
BK_STOP 1679888182539
--------------------
content from stderr:
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:62718 (290), effective:1320 (6)
initing FirstDep: 0m 0.000sec
iterations count:30149 (139), effective:639 (2)
iterations count:22728 (105), effective:471 (2)
iterations count:390 (1), effective:9 (0)
iterations count:222 (1), effective:1 (0)
iterations count:216 (1), effective:0 (0)
iterations count:258 (1), effective:1 (0)
iterations count:27360 (126), effective:598 (2)
iterations count:24564 (113), effective:483 (2)
iterations count:216 (1), effective:0 (0)
iterations count:31679 (146), effective:675 (3)
iterations count:216 (1), effective:0 (0)
iterations count:217 (1), effective:1 (0)
iterations count:9683 (44), effective:223 (1)
iterations count:443 (2), effective:6 (0)
iterations count:238 (1), effective:1 (0)
iterations count:217 (1), effective:1 (0)
iterations count:29485 (136), effective:653 (3)
iterations count:32368 (149), effective:692 (3)
iterations count:12328 (57), effective:242 (1)
iterations count:216 (1), effective:0 (0)
iterations count:220 (1), effective:2 (0)
iterations count:220 (1), effective:2 (0)
iterations count:220 (1), effective:2 (0)
iterations count:216 (1), effective:0 (0)
iterations count:233 (1), effective:1 (0)
iterations count:32187 (149), effective:676 (3)
iterations count:33121 (153), effective:698 (3)
iterations count:33336 (154), effective:709 (3)
iterations count:8153 (37), effective:166 (0)
iterations count:218 (1), effective:1 (0)
iterations count:972 (4), effective:13 (0)
iterations count:37818 (175), effective:786 (3)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is EisenbergMcGuire-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r513-tall-167987240800217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-03.tgz
mv EisenbergMcGuire-PT-03 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;