About the Execution of Marcie for ShieldRVt-PT-003A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5446.983 | 5653.00 | 5080.00 | 0.00 | TFFFTFTFTTTFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r417-tajo-167905972000209.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is ShieldRVt-PT-003A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905972000209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Feb 25 23:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 23:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 23:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 23:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 23:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.8K Mar 5 18:23 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 ShieldRVt-PT-003A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679069006326
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=ShieldRVt-PT-003A
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: ShieldRVt_PT_003A
(NrP: 27 NrTr: 27 NrArc: 108)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.316sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 65 (6.5e+01) #states 8,193 (3)
starting MCC model checker
--------------------------
checking: EG [~ [AF [~ [AF [1<=p20]]]]]
normalized: EG [EG [~ [EG [~ [1<=p20]]]]]
abstracting: (1<=p20)
states: 4,096 (3)
..
EG iterations: 2
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [E [p22<=1 U A [AF [p15<=1] U EX [AX [p9<=p24]]]]]
normalized: ~ [E [true U ~ [E [p22<=1 U [~ [EG [~ [EX [~ [EX [~ [p9<=p24]]]]]]] & ~ [E [~ [EX [~ [EX [~ [p9<=p24]]]]] U [~ [EX [~ [EX [~ [p9<=p24]]]]] & EG [~ [p15<=1]]]]]]]]]]
abstracting: (p15<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (p9<=p24)
states: 6,145 (3)
..abstracting: (p9<=p24)
states: 6,145 (3)
..abstracting: (p9<=p24)
states: 6,145 (3)
..................
EG iterations: 16
abstracting: (p22<=1)
states: 8,193 (3)
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [~ [E [AX [E [1<=p16 U 1<=p17]] U p19<=0]] U AG [~ [AF [~ [AG [p5<=1]]]]]]
normalized: [~ [EG [E [true U ~ [EG [~ [E [true U ~ [p5<=1]]]]]]]] & ~ [E [E [true U ~ [EG [~ [E [true U ~ [p5<=1]]]]]] U [E [true U ~ [EG [~ [E [true U ~ [p5<=1]]]]]] & E [~ [EX [~ [E [1<=p16 U 1<=p17]]]] U p19<=0]]]]]
abstracting: (p19<=0)
states: 4,097 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (1<=p16)
states: 4,096 (3)
.abstracting: (p5<=1)
states: 8,193 (3)
EG iterations: 0
abstracting: (p5<=1)
states: 8,193 (3)
EG iterations: 0
abstracting: (p5<=1)
states: 8,193 (3)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [E [1<=p10 U ~ [EX [[EF [1<=p23] | [[p17<=0 | 1<=p20] | p23<=0]]]]]]
normalized: ~ [E [1<=p10 U ~ [EX [[[[p17<=0 | 1<=p20] | p23<=0] | E [true U 1<=p23]]]]]]
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (p23<=0)
states: 4,097 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p17<=0)
states: 4,097 (3)
.abstracting: (1<=p10)
states: 4,096 (3)
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [[A [EF [p7<=0] U AG [p7<=0]] & ~ [[AF [1<=p5] & [[1<=p7 & p4<=1] | [p1<=1 | 1<=p11]]]]]]]
normalized: ~ [E [true U [~ [[~ [EG [~ [1<=p5]]] & [[p1<=1 | 1<=p11] | [1<=p7 & p4<=1]]]] & [~ [EG [E [true U ~ [p7<=0]]]] & ~ [E [E [true U ~ [p7<=0]] U [~ [E [true U p7<=0]] & E [true U ~ [p7<=0]]]]]]]]]
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (p7<=0)
states: 4,097 (3)
EG iterations: 0
abstracting: (p4<=1)
states: 8,193 (3)
abstracting: (1<=p7)
states: 4,096 (3)
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
abstracting: (1<=p5)
states: 4,096 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: E [~ [[AF [~ [EF [1<=p2]]] & E [~ [A [1<=p5 U 1<=p13]] U 1<=p3]]] U AX [~ [[p6<=0 | EG [[p15<=p10 | p11<=1]]]]]]
normalized: E [~ [[E [~ [[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [1<=p5] & ~ [1<=p13]]]]]] U 1<=p3] & ~ [EG [E [true U 1<=p2]]]]] U ~ [EX [[EG [[p15<=p10 | p11<=1]] | p6<=0]]]]
abstracting: (p6<=0)
states: 4,097 (3)
abstracting: (p11<=1)
states: 8,193 (3)
abstracting: (p15<=p10)
states: 6,145 (3)
EG iterations: 0
.abstracting: (1<=p2)
states: 4,096 (3)
EG iterations: 0
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (1<=p5)
states: 4,096 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (1<=p13)
states: 4,096 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [A [E [p22<=p19 U A [[p12<=0 | p15<=1] U [1<=p6 & p25<=p4]]] U ~ [EG [EF [p4<=p9]]]]]
normalized: E [true U [~ [EG [EG [E [true U p4<=p9]]]] & ~ [E [EG [E [true U p4<=p9]] U [~ [E [p22<=p19 U [~ [EG [~ [[1<=p6 & p25<=p4]]]] & ~ [E [~ [[1<=p6 & p25<=p4]] U [~ [[p12<=0 | p15<=1]] & ~ [[1<=p6 & p25<=p4]]]]]]]] & EG [E [true U p4<=p9]]]]]]]
abstracting: (p4<=p9)
states: 6,145 (3)
EG iterations: 0
abstracting: (p25<=p4)
states: 6,145 (3)
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (p15<=1)
states: 8,193 (3)
abstracting: (p12<=0)
states: 4,097 (3)
abstracting: (p25<=p4)
states: 6,145 (3)
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (p25<=p4)
states: 6,145 (3)
abstracting: (1<=p6)
states: 4,096 (3)
.....
EG iterations: 5
abstracting: (p22<=p19)
states: 6,145 (3)
abstracting: (p4<=p9)
states: 6,145 (3)
EG iterations: 0
abstracting: (p4<=p9)
states: 6,145 (3)
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AG [[EF [A [[p11<=0 & 1<=p3] U [p20<=1 | p10<=p6]]] | AX [~ [[~ [p19<=p10] | AG [1<=p18]]]]]] & A [~ [1<=p0] U p14<=p21]]
normalized: [[~ [EG [~ [p14<=p21]]] & ~ [E [~ [p14<=p21] U [~ [p14<=p21] & 1<=p0]]]] & ~ [E [true U ~ [[E [true U [~ [EG [~ [[p20<=1 | p10<=p6]]]] & ~ [E [~ [[p20<=1 | p10<=p6]] U [~ [[p11<=0 & 1<=p3]] & ~ [[p20<=1 | p10<=p6]]]]]]] | ~ [EX [[~ [E [true U ~ [1<=p18]]] | ~ [p19<=p10]]]]]]]]]
abstracting: (p19<=p10)
states: 6,145 (3)
abstracting: (1<=p18)
states: 4,096 (3)
.abstracting: (p10<=p6)
states: 6,145 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p11<=0)
states: 4,097 (3)
abstracting: (p10<=p6)
states: 6,145 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (p10<=p6)
states: 6,145 (3)
abstracting: (p20<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p14<=p21)
states: 6,145 (3)
abstracting: (p14<=p21)
states: 6,145 (3)
abstracting: (p14<=p21)
states: 6,145 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EX [A [[E [[[p9<=p0 | p2<=p0] | ~ [p16<=p5]] U [EF [p2<=0] & EG [p16<=p24]]] & 1<=p17] U EG [1<=p11]]]
normalized: EX [[~ [EG [~ [EG [1<=p11]]]] & ~ [E [~ [EG [1<=p11]] U [~ [[E [[~ [p16<=p5] | [p9<=p0 | p2<=p0]] U [EG [p16<=p24] & E [true U p2<=0]]] & 1<=p17]] & ~ [EG [1<=p11]]]]]]]
abstracting: (1<=p11)
states: 4,096 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (p2<=0)
states: 4,097 (3)
abstracting: (p16<=p24)
states: 6,145 (3)
..........
EG iterations: 10
abstracting: (p2<=p0)
states: 4,097 (3)
abstracting: (p9<=p0)
states: 4,097 (3)
abstracting: (p16<=p5)
states: 6,145 (3)
abstracting: (1<=p11)
states: 4,096 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 4,096 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EX [[E [~ [[[[1<=p10 | p3<=1] | E [p1<=p26 U p11<=p14]] & ~ [1<=p18]]] U A [p25<=0 U EG [p4<=p3]]] & ~ [p6<=p11]]]
normalized: EX [[~ [p6<=p11] & E [~ [[~ [1<=p18] & [E [p1<=p26 U p11<=p14] | [1<=p10 | p3<=1]]]] U [~ [EG [~ [EG [p4<=p3]]]] & ~ [E [~ [EG [p4<=p3]] U [~ [p25<=0] & ~ [EG [p4<=p3]]]]]]]]]
abstracting: (p4<=p3)
states: 4,097 (3)
..
EG iterations: 2
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (p4<=p3)
states: 4,097 (3)
..
EG iterations: 2
abstracting: (p4<=p3)
states: 4,097 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p3<=1)
states: 8,193 (3)
abstracting: (1<=p10)
states: 4,096 (3)
abstracting: (p11<=p14)
states: 6,145 (3)
abstracting: (p1<=p26)
states: 6,145 (3)
abstracting: (1<=p18)
states: 4,096 (3)
abstracting: (p6<=p11)
states: 6,145 (3)
.-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [~ [E [[p23<=p22 & AF [~ [[p3<=p7 | p21<=p2]]]] U A [[[p22<=0 | ~ [1<=p9]] & EG [p25<=0]] U p16<=1]]] | AG [AG [EG [[[p2<=p9 & p20<=p22] & EG [1<=p26]]]]]]
normalized: [~ [E [true U E [true U ~ [EG [[EG [1<=p26] & [p2<=p9 & p20<=p22]]]]]]] | ~ [E [[~ [EG [[p3<=p7 | p21<=p2]]] & p23<=p22] U [~ [EG [~ [p16<=1]]] & ~ [E [~ [p16<=1] U [~ [[EG [p25<=0] & [~ [1<=p9] | p22<=0]]] & ~ [p16<=1]]]]]]]]
abstracting: (p16<=1)
states: 8,193 (3)
abstracting: (p22<=0)
states: 4,097 (3)
abstracting: (1<=p9)
states: 4,096 (3)
abstracting: (p25<=0)
states: 4,097 (3)
....
EG iterations: 4
abstracting: (p16<=1)
states: 8,193 (3)
abstracting: (p16<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (p23<=p22)
states: 6,145 (3)
abstracting: (p21<=p2)
states: 6,145 (3)
abstracting: (p3<=p7)
states: 6,145 (3)
.
EG iterations: 1
abstracting: (p20<=p22)
states: 6,145 (3)
abstracting: (p2<=p9)
states: 6,145 (3)
abstracting: (1<=p26)
states: 4,096 (3)
....
EG iterations: 4
..................................
EG iterations: 34
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EX [A [[~ [[[[p8<=p3 & p8<=p14] & [1<=p1 | p4<=0]] | [[p5<=1 | 1<=p4] & 1<=p23]]] & EG [[1<=p25 | EG [1<=p1]]]] U [AX [EF [p20<=0]] & E [p19<=p1 U A [1<=p26 U 1<=p26]]]]]
normalized: EX [[~ [EG [~ [[E [p19<=p1 U [~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p26] & ~ [1<=p26]]]]]] & ~ [EX [~ [E [true U p20<=0]]]]]]]] & ~ [E [~ [[E [p19<=p1 U [~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p26] & ~ [1<=p26]]]]]] & ~ [EX [~ [E [true U p20<=0]]]]]] U [~ [[EG [[EG [1<=p1] | 1<=p25]] & ~ [[[[p5<=1 | 1<=p4] & 1<=p23] | [[1<=p1 | p4<=0] & [p8<=p3 & p8<=p14]]]]]] & ~ [[E [p19<=p1 U [~ [EG [~ [1<=p26]]] & ~ [E [~ [1<=p26] U [~ [1<=p26] & ~ [1<=p26]]]]]] & ~ [EX [~ [E [true U p20<=0]]]]]]]]]]]
abstracting: (p20<=0)
states: 4,097 (3)
.abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
....
EG iterations: 4
abstracting: (p19<=p1)
states: 6,145 (3)
abstracting: (p8<=p14)
states: 6,145 (3)
abstracting: (p8<=p3)
states: 6,145 (3)
abstracting: (p4<=0)
states: 4,097 (3)
abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (1<=p4)
states: 4,096 (3)
abstracting: (p5<=1)
states: 8,193 (3)
abstracting: (1<=p25)
states: 4,096 (3)
abstracting: (1<=p1)
states: 4,096 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p20<=0)
states: 4,097 (3)
.abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
....
EG iterations: 4
abstracting: (p19<=p1)
states: 6,145 (3)
abstracting: (p20<=0)
states: 4,097 (3)
.abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (1<=p26)
states: 4,096 (3)
....
EG iterations: 4
abstracting: (p19<=p1)
states: 6,145 (3)
.....
EG iterations: 5
.-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: [AF [AX [[[[[p7<=1 & 1<=p24] | EF [p26<=0]] | 1<=p0] | ~ [[1<=p20 | [p15<=p14 | 1<=p7]]]]]] | [E [E [~ [1<=p6] U [~ [A [1<=p11 U p3<=p12]] | ~ [[1<=p9 | 1<=p24]]]] U ~ [EF [EF [1<=p20]]]] | AX [EG [AG [EG [1<=p2]]]]]]
normalized: [[~ [EX [~ [EG [~ [E [true U ~ [EG [1<=p2]]]]]]]] | E [E [~ [1<=p6] U [~ [[1<=p9 | 1<=p24]] | ~ [[~ [EG [~ [p3<=p12]]] & ~ [E [~ [p3<=p12] U [~ [1<=p11] & ~ [p3<=p12]]]]]]]] U ~ [E [true U E [true U 1<=p20]]]]] | ~ [EG [EX [~ [[~ [[[p15<=p14 | 1<=p7] | 1<=p20]] | [[E [true U p26<=0] | [p7<=1 & 1<=p24]] | 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 1
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (p7<=1)
states: 8,193 (3)
abstracting: (p26<=0)
states: 4,097 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (1<=p7)
states: 4,096 (3)
abstracting: (p15<=p14)
states: 6,145 (3)
..
EG iterations: 1
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p3<=p12)
states: 6,145 (3)
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p3<=p12)
states: 6,145 (3)
abstracting: (p3<=p12)
states: 6,145 (3)
.
EG iterations: 1
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (1<=p9)
states: 4,096 (3)
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (1<=p2)
states: 4,096 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [[[1<=p24 | 1<=p17] & [AX [[[A [p12<=p9 U 1<=p23] & [1<=p6 | p11<=p17]] & [[1<=p13 | 1<=p0] & [1<=p6 & p19<=0]]]] | AX [p17<=p2]]] U AF [E [[~ [p17<=1] & ~ [EF [p20<=p17]]] U AF [AX [p11<=1]]]]]
normalized: E [[[~ [EX [~ [p17<=p2]]] | ~ [EX [~ [[[[1<=p6 & p19<=0] & [1<=p13 | 1<=p0]] & [[1<=p6 | p11<=p17] & [~ [EG [~ [1<=p23]]] & ~ [E [~ [1<=p23] U [~ [p12<=p9] & ~ [1<=p23]]]]]]]]]]] & [1<=p24 | 1<=p17]] U ~ [EG [~ [E [[~ [E [true U p20<=p17]] & ~ [p17<=1]] U ~ [EG [EX [~ [p11<=1]]]]]]]]]
abstracting: (p11<=1)
states: 8,193 (3)
..
EG iterations: 1
abstracting: (p17<=1)
states: 8,193 (3)
abstracting: (p20<=p17)
states: 6,145 (3)
.
EG iterations: 1
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (p12<=p9)
states: 6,145 (3)
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (1<=p23)
states: 4,096 (3)
..........
EG iterations: 10
abstracting: (p11<=p17)
states: 6,145 (3)
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (p19<=0)
states: 4,097 (3)
abstracting: (1<=p6)
states: 4,096 (3)
.abstracting: (p17<=p2)
states: 6,145 (3)
.-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: A [E [AF [1<=p9] U 1<=p25] U [AX [AF [[[p22<=0 | p25<=0] & p20<=1]]] | [p6<=p14 & [[E [[p4<=p4 & 1<=p15] U 1<=p17] & EF [~ [p1<=p14]]] | E [[~ [1<=p20] & [1<=p22 | p1<=0]] U [EX [p9<=0] & AX [p15<=0]]]]]]]
normalized: [~ [EG [~ [[[[E [[[1<=p22 | p1<=0] & ~ [1<=p20]] U [~ [EX [~ [p15<=0]]] & EX [p9<=0]]] | [E [true U ~ [p1<=p14]] & E [[p4<=p4 & 1<=p15] U 1<=p17]]] & p6<=p14] | ~ [EX [EG [~ [[[p22<=0 | p25<=0] & p20<=1]]]]]]]]] & ~ [E [~ [[[[E [[[1<=p22 | p1<=0] & ~ [1<=p20]] U [~ [EX [~ [p15<=0]]] & EX [p9<=0]]] | [E [true U ~ [p1<=p14]] & E [[p4<=p4 & 1<=p15] U 1<=p17]]] & p6<=p14] | ~ [EX [EG [~ [[[p22<=0 | p25<=0] & p20<=1]]]]]]] U [~ [E [~ [EG [~ [1<=p9]]] U 1<=p25]] & ~ [[[[E [[[1<=p22 | p1<=0] & ~ [1<=p20]] U [~ [EX [~ [p15<=0]]] & EX [p9<=0]]] | [E [true U ~ [p1<=p14]] & E [[p4<=p4 & 1<=p15] U 1<=p17]]] & p6<=p14] | ~ [EX [EG [~ [[[p22<=0 | p25<=0] & p20<=1]]]]]]]]]]]
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (p6<=p14)
states: 6,145 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p4<=p4)
states: 8,193 (3)
abstracting: (p1<=p14)
states: 6,145 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
abstracting: (1<=p25)
states: 4,096 (3)
abstracting: (1<=p9)
states: 4,096 (3)
.
EG iterations: 1
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (p6<=p14)
states: 6,145 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p4<=p4)
states: 8,193 (3)
abstracting: (p1<=p14)
states: 6,145 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (p6<=p14)
states: 6,145 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p4<=p4)
states: 8,193 (3)
abstracting: (p1<=p14)
states: 6,145 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
......
EG iterations: 6
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: ~ [AG [[[[E [AG [1<=p24] U [p24<=1 | p9<=p1]] | [1<=p11 & 1<=p13]] | [AX [p4<=0] & [~ [AX [p5<=p3]] & [E [1<=p14 U p15<=p8] & [1<=p21 | p26<=0]]]]] | A [~ [[AX [p19<=p3] | [1<=p10 | p10<=p18]]] U [p9<=p20 & AX [1<=p10]]]]]]
normalized: E [true U ~ [[[~ [EG [~ [[~ [EX [~ [1<=p10]]] & p9<=p20]]]] & ~ [E [~ [[~ [EX [~ [1<=p10]]] & p9<=p20]] U [[[1<=p10 | p10<=p18] | ~ [EX [~ [p19<=p3]]]] & ~ [[~ [EX [~ [1<=p10]]] & p9<=p20]]]]]] | [[[[[1<=p21 | p26<=0] & E [1<=p14 U p15<=p8]] & EX [~ [p5<=p3]]] & ~ [EX [~ [p4<=0]]]] | [[1<=p11 & 1<=p13] | E [~ [E [true U ~ [1<=p24]]] U [p24<=1 | p9<=p1]]]]]]]
abstracting: (p9<=p1)
states: 6,145 (3)
abstracting: (p24<=1)
states: 8,193 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p4<=0)
states: 4,097 (3)
.abstracting: (p5<=p3)
states: 6,145 (3)
.abstracting: (p15<=p8)
states: 6,145 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p26<=0)
states: 4,097 (3)
abstracting: (1<=p21)
states: 4,096 (3)
abstracting: (p9<=p20)
states: 6,145 (3)
abstracting: (1<=p10)
states: 4,096 (3)
.abstracting: (p19<=p3)
states: 6,145 (3)
.abstracting: (p10<=p18)
states: 6,145 (3)
abstracting: (1<=p10)
states: 4,096 (3)
abstracting: (p9<=p20)
states: 6,145 (3)
abstracting: (1<=p10)
states: 4,096 (3)
.abstracting: (p9<=p20)
states: 6,145 (3)
abstracting: (1<=p10)
states: 4,096 (3)
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
totally nodes used: 38593 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 32006 87838 119844
used/not used/entry size/cache size: 122490 66986374 16 1024MB
basic ops cache: hits/miss/sum: 13518 28894 42412
used/not used/entry size/cache size: 54579 16722637 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: 621 1070 1691
used/not used/entry size/cache size: 1070 8387538 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 67070719
1 37704
2 434
3 7
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.592sec
BK_STOP 1679069011979
--------------------
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:439 (16), effective:97 (3)
initing FirstDep: 0m 0.000sec
iterations count:27 (1), effective:0 (0)
iterations count:70 (2), effective:10 (0)
iterations count:31 (1), effective:1 (0)
iterations count:55 (2), effective:3 (0)
iterations count:118 (4), effective:15 (0)
iterations count:30 (1), effective:2 (0)
iterations count:118 (4), effective:15 (0)
iterations count:118 (4), effective:15 (0)
iterations count:110 (4), effective:14 (0)
iterations count:29 (1), effective:1 (0)
iterations count:92 (3), effective:11 (0)
iterations count:76 (2), effective:10 (0)
iterations count:33 (1), effective:3 (0)
iterations count:76 (2), effective:10 (0)
iterations count:115 (4), effective:16 (0)
iterations count:76 (2), effective:10 (0)
iterations count:89 (3), effective:13 (0)
iterations count:27 (1), effective:0 (0)
iterations count:37 (1), effective:3 (0)
iterations count:105 (3), effective:14 (0)
iterations count:57 (2), effective:11 (0)
iterations count:78 (2), effective:9 (0)
iterations count:28 (1), effective:1 (0)
iterations count:63 (2), effective:8 (0)
iterations count:27 (1), effective:0 (0)
iterations count:89 (3), effective:16 (0)
iterations count:27 (1), effective:0 (0)
iterations count:101 (3), effective:16 (0)
iterations count:27 (1), effective:0 (0)
iterations count:52 (1), effective:2 (0)
iterations count:101 (3), effective:16 (0)
iterations count:27 (1), effective:0 (0)
iterations count:52 (1), effective:2 (0)
iterations count:65 (2), effective:10 (0)
iterations count:101 (3), effective:16 (0)
iterations count:27 (1), effective:0 (0)
iterations count:52 (1), effective:2 (0)
iterations count:55 (2), effective:8 (0)
iterations count:54 (2), effective:2 (0)
iterations count:27 (1), effective:0 (0)
iterations count:87 (3), effective:17 (0)
iterations count:37 (1), effective:3 (0)
iterations count:89 (3), effective:13 (0)
iterations count:27 (1), effective:0 (0)
iterations count:54 (2), effective:3 (0)
iterations count:27 (1), effective:0 (0)
iterations count:56 (2), effective:7 (0)
iterations count:114 (4), effective:16 (0)
iterations count:102 (3), effective:18 (0)
iterations count:44 (1), effective:5 (0)
iterations count:56 (2), effective:7 (0)
iterations count:114 (4), effective:16 (0)
iterations count:102 (3), effective:18 (0)
iterations count:36 (1), effective:4 (0)
iterations count:56 (2), effective:7 (0)
iterations count:114 (4), effective:16 (0)
iterations count:102 (3), effective:18 (0)
iterations count:32 (1), effective:2 (0)
iterations count:27 (1), effective:0 (0)
iterations count:30 (1), effective:2 (0)
iterations count:27 (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="ShieldRVt-PT-003A"
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 ShieldRVt-PT-003A, 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 r417-tajo-167905972000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-003A.tgz
mv ShieldRVt-PT-003A 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 ;