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-167905971700001.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 ShieldRVs-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905971700001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 18:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 18:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 6.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 ShieldRVs-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-001A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679068785229

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=ShieldRVs-PT-001A
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: ShieldRVs_PT_001A
(NrP: 17 NrTr: 22 NrArc: 92)

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

net check time: 0m 0.000sec

init dd package: 0m 4.923sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 186 (1.9e+02) #states 171



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

checking: EF [AF [EX [p11<=1]]]
normalized: E [true U ~ [EG [~ [EX [p11<=1]]]]]

abstracting: (p11<=1)
states: 171
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EG [EG [p13<=1]]
normalized: EG [EG [p13<=1]]

abstracting: (p13<=1)
states: 171

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EG [~ [EG [AG [1<=p4]]]]]
normalized: E [true U EG [~ [EG [~ [E [true U ~ [1<=p4]]]]]]]

abstracting: (1<=p4)
states: 35
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EG [[p9<=1 | 1<=p3]]
normalized: EG [[p9<=1 | 1<=p3]]

abstracting: (1<=p3)
states: 49
abstracting: (p9<=1)
states: 171

EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [p8<=p7]
normalized: EX [p8<=p7]

abstracting: (p8<=p7)
states: 89
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[E [~ [EG [EF [p1<=0]]] U EX [~ [[p16<=1 | p2<=1]]]] | [EX [~ [1<=p2]] | AX [[p10<=0 | p15<=p9]]]]]
normalized: ~ [EG [~ [[[~ [EX [~ [[p10<=0 | p15<=p9]]]] | EX [~ [1<=p2]]] | E [~ [EG [E [true U p1<=0]]] U EX [~ [[p16<=1 | p2<=1]]]]]]]]

abstracting: (p2<=1)
states: 171
abstracting: (p16<=1)
states: 171
.abstracting: (p1<=0)
states: 89

EG iterations: 0
abstracting: (1<=p2)
states: 88
.abstracting: (p15<=p9)
states: 150
abstracting: (p10<=0)
states: 135
....
EG iterations: 3
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[~ [[EX [AX [p9<=1]] | AX [[p10<=0 & p8<=0]]]] | [AX [A [p0<=0 U 1<=p10]] & E [AG [p9<=0] U 1<=p2]]] | p9<=0]]
normalized: ~ [E [true U ~ [[[~ [[~ [EX [~ [[p10<=0 & p8<=0]]]] | EX [~ [EX [~ [p9<=1]]]]]] | [~ [EX [~ [[~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [p0<=0] & ~ [1<=p10]]]]]]]] & E [~ [E [true U ~ [p9<=0]]] U 1<=p2]]] | p9<=0]]]]

abstracting: (p9<=0)
states: 117
abstracting: (1<=p2)
states: 88
abstracting: (p9<=0)
states: 117
abstracting: (1<=p10)
states: 36
abstracting: (p0<=0)
states: 170
abstracting: (1<=p10)
states: 36
abstracting: (1<=p10)
states: 36
........
EG iterations: 8
.abstracting: (p9<=1)
states: 171
..abstracting: (p8<=0)
states: 89
abstracting: (p10<=0)
states: 135
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: [AX [AF [[[EG [p11<=p0] | ~ [1<=p4]] & EF [p14<=0]]]] & EF [EF [[[[[p3<=1 | 1<=p13] & EG [p9<=0]] | AX [p5<=1]] | p7<=1]]]]
normalized: [E [true U E [true U [[[EG [p9<=0] & [p3<=1 | 1<=p13]] | ~ [EX [~ [p5<=1]]]] | p7<=1]]] & ~ [EX [EG [~ [[E [true U p14<=0] & [~ [1<=p4] | EG [p11<=p0]]]]]]]]

abstracting: (p11<=p0)
states: 136
...
EG iterations: 3
abstracting: (1<=p4)
states: 35
abstracting: (p14<=0)
states: 135
....
EG iterations: 4
.abstracting: (p7<=1)
states: 171
abstracting: (p5<=1)
states: 171
.abstracting: (1<=p13)
states: 54
abstracting: (p3<=1)
states: 171
abstracting: (p9<=0)
states: 117
..............
EG iterations: 14
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: A [p8<=0 U E [[p12<=p16 | [E [p4<=1 U p2<=p0] | [AF [1<=p14] | AG [1<=p6]]]] U EX [EX [~ [p10<=p3]]]]]
normalized: [~ [EG [~ [E [[[[~ [EG [~ [1<=p14]]] | ~ [E [true U ~ [1<=p6]]]] | E [p4<=1 U p2<=p0]] | p12<=p16] U EX [EX [~ [p10<=p3]]]]]]] & ~ [E [~ [E [[[[~ [EG [~ [1<=p14]]] | ~ [E [true U ~ [1<=p6]]]] | E [p4<=1 U p2<=p0]] | p12<=p16] U EX [EX [~ [p10<=p3]]]]] U [~ [p8<=0] & ~ [E [[[[~ [EG [~ [1<=p14]]] | ~ [E [true U ~ [1<=p6]]]] | E [p4<=1 U p2<=p0]] | p12<=p16] U EX [EX [~ [p10<=p3]]]]]]]]]

abstracting: (p10<=p3)
states: 146
..abstracting: (p12<=p16)
states: 137
abstracting: (p2<=p0)
states: 83
abstracting: (p4<=1)
states: 171
abstracting: (1<=p6)
states: 51
abstracting: (1<=p14)
states: 36
........
EG iterations: 8
abstracting: (p8<=0)
states: 89
abstracting: (p10<=p3)
states: 146
..abstracting: (p12<=p16)
states: 137
abstracting: (p2<=p0)
states: 83
abstracting: (p4<=1)
states: 171
abstracting: (1<=p6)
states: 51
abstracting: (1<=p14)
states: 36
........
EG iterations: 8
abstracting: (p10<=p3)
states: 146
..abstracting: (p12<=p16)
states: 137
abstracting: (p2<=p0)
states: 83
abstracting: (p4<=1)
states: 171
abstracting: (1<=p6)
states: 51
abstracting: (1<=p14)
states: 36
........
EG iterations: 8
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EX [EF [~ [[EX [[p1<=p6 & 1<=p2]] | [[[p15<=1 & 1<=p7] | [1<=p13 | p12<=1]] & [AG [p16<=p6] & [p4<=1 | p16<=p4]]]]]]]
normalized: EX [E [true U ~ [[[[[1<=p13 | p12<=1] | [p15<=1 & 1<=p7]] & [[p4<=1 | p16<=p4] & ~ [E [true U ~ [p16<=p6]]]]] | EX [[p1<=p6 & 1<=p2]]]]]]

abstracting: (1<=p2)
states: 88
abstracting: (p1<=p6)
states: 115
.abstracting: (p16<=p6)
states: 140
abstracting: (p16<=p4)
states: 137
abstracting: (p4<=1)
states: 171
abstracting: (1<=p7)
states: 88
abstracting: (p15<=1)
states: 171
abstracting: (p12<=1)
states: 171
abstracting: (1<=p13)
states: 54
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [EF [A [~ [[1<=p1 | p16<=1]] U [[EX [p14<=p13] & AX [1<=p1]] & [AF [1<=p7] | [1<=p10 | 1<=p7]]]]] U ~ [EF [[~ [p9<=0] | [[~ [1<=p15] & EX [p6<=1]] | ~ [p8<=p13]]]]]]
normalized: [~ [EG [E [true U [[~ [p8<=p13] | [EX [p6<=1] & ~ [1<=p15]]] | ~ [p9<=0]]]]] & ~ [E [E [true U [[~ [p8<=p13] | [EX [p6<=1] & ~ [1<=p15]]] | ~ [p9<=0]]] U [~ [E [true U [~ [EG [~ [[[~ [EG [~ [1<=p7]]] | [1<=p10 | 1<=p7]] & [~ [EX [~ [1<=p1]]] & EX [p14<=p13]]]]]] & ~ [E [~ [[[~ [EG [~ [1<=p7]]] | [1<=p10 | 1<=p7]] & [~ [EX [~ [1<=p1]]] & EX [p14<=p13]]]] U [~ [[[~ [EG [~ [1<=p7]]] | [1<=p10 | 1<=p7]] & [~ [EX [~ [1<=p1]]] & EX [p14<=p13]]]] & [1<=p1 | p16<=1]]]]]]] & E [true U [[~ [p8<=p13] | [EX [p6<=1] & ~ [1<=p15]]] | ~ [p9<=0]]]]]]]

abstracting: (p9<=0)
states: 117
abstracting: (1<=p15)
states: 35
abstracting: (p6<=1)
states: 171
.abstracting: (p8<=p13)
states: 118
abstracting: (p16<=1)
states: 171
abstracting: (1<=p1)
states: 82
abstracting: (p14<=p13)
states: 135
.abstracting: (1<=p1)
states: 82
.abstracting: (1<=p7)
states: 88
abstracting: (1<=p10)
states: 36
abstracting: (1<=p7)
states: 88
............
EG iterations: 12
abstracting: (p14<=p13)
states: 135
.abstracting: (1<=p1)
states: 82
.abstracting: (1<=p7)
states: 88
abstracting: (1<=p10)
states: 36
abstracting: (1<=p7)
states: 88
............
EG iterations: 12
abstracting: (p14<=p13)
states: 135
.abstracting: (1<=p1)
states: 82
.abstracting: (1<=p7)
states: 88
abstracting: (1<=p10)
states: 36
abstracting: (1<=p7)
states: 88
............
EG iterations: 12
.
EG iterations: 1
abstracting: (p9<=0)
states: 117
abstracting: (1<=p15)
states: 35
abstracting: (p6<=1)
states: 171
.abstracting: (p8<=p13)
states: 118
abstracting: (p9<=0)
states: 117
abstracting: (1<=p15)
states: 35
abstracting: (p6<=1)
states: 171
.abstracting: (p8<=p13)
states: 118

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: E [E [EG [[A [p12<=p11 U 1<=p0] & p8<=1]] U A [[[~ [p12<=0] | [p12<=0 | 1<=p0]] | A [1<=p6 U p15<=0]] U 1<=p5]] U ~ [AF [~ [[~ [p11<=p10] & [p15<=1 & p13<=1]]]]]]
normalized: E [E [EG [[[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [p12<=p11] & ~ [1<=p0]]]]] & p8<=1]] U [~ [E [~ [1<=p5] U [~ [[[~ [EG [~ [p15<=0]]] & ~ [E [~ [p15<=0] U [~ [1<=p6] & ~ [p15<=0]]]]] | [[p12<=0 | 1<=p0] | ~ [p12<=0]]]] & ~ [1<=p5]]]] & ~ [EG [~ [1<=p5]]]]] U EG [[[p15<=1 & p13<=1] & ~ [p11<=p10]]]]

abstracting: (p11<=p10)
states: 136
abstracting: (p13<=1)
states: 171
abstracting: (p15<=1)
states: 171
..........
EG iterations: 10
abstracting: (1<=p5)
states: 35
......
EG iterations: 6
abstracting: (1<=p5)
states: 35
abstracting: (p12<=0)
states: 126
abstracting: (1<=p0)
states: 1
abstracting: (p12<=0)
states: 126
abstracting: (p15<=0)
states: 136
abstracting: (1<=p6)
states: 51
abstracting: (p15<=0)
states: 136
abstracting: (p15<=0)
states: 136
..........
EG iterations: 10
abstracting: (1<=p5)
states: 35
abstracting: (p8<=1)
states: 171
abstracting: (1<=p0)
states: 1
abstracting: (p12<=p11)
states: 126
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [EG [~ [[[[[AF [p10<=p7] & EX [p7<=1]] | ~ [[p2<=p15 | p7<=p12]]] & E [[p8<=0 & p2<=0] U p1<=p11]] | AF [[[p7<=1 & 1<=p10] | ~ [p11<=0]]]]]] | AF [AX [AF [~ [AF [1<=p0]]]]]]
normalized: [~ [EG [EX [EG [~ [EG [~ [1<=p0]]]]]]] | EG [~ [[~ [EG [~ [[~ [p11<=0] | [p7<=1 & 1<=p10]]]]] | [E [[p8<=0 & p2<=0] U p1<=p11] & [~ [[p2<=p15 | p7<=p12]] | [EX [p7<=1] & ~ [EG [~ [p10<=p7]]]]]]]]]]

abstracting: (p10<=p7)
states: 148
........
EG iterations: 8
abstracting: (p7<=1)
states: 171
.abstracting: (p7<=p12)
states: 107
abstracting: (p2<=p15)
states: 107
abstracting: (p1<=p11)
states: 105
abstracting: (p2<=0)
states: 83
abstracting: (p8<=0)
states: 89
abstracting: (1<=p10)
states: 36
abstracting: (p7<=1)
states: 171
abstracting: (p11<=0)
states: 136
..............
EG iterations: 14
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
..
EG iterations: 2
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AF [~ [[[AG [p6<=1] & EF [[[p1<=0 | p16<=0] | EF [p16<=p13]]]] | [[1<=p7 & [[AG [p11<=p8] & AF [p15<=1]] | ~ [[p8<=p0 | 1<=p10]]]] | [E [p15<=0 U [1<=p9 | 1<=p15]] | [~ [1<=p12] | p14<=0]]]]]]
normalized: ~ [EG [[[[[~ [1<=p12] | p14<=0] | E [p15<=0 U [1<=p9 | 1<=p15]]] | [[~ [[p8<=p0 | 1<=p10]] | [~ [EG [~ [p15<=1]]] & ~ [E [true U ~ [p11<=p8]]]]] & 1<=p7]] | [E [true U [E [true U p16<=p13] | [p1<=0 | p16<=0]]] & ~ [E [true U ~ [p6<=1]]]]]]]

abstracting: (p6<=1)
states: 171
abstracting: (p16<=0)
states: 126
abstracting: (p1<=0)
states: 89
abstracting: (p16<=p13)
states: 126
abstracting: (1<=p7)
states: 88
abstracting: (p11<=p8)
states: 147
abstracting: (p15<=1)
states: 171
.
EG iterations: 1
abstracting: (1<=p10)
states: 36
abstracting: (p8<=p0)
states: 89
abstracting: (1<=p15)
states: 35
abstracting: (1<=p9)
states: 54
abstracting: (p15<=0)
states: 136
abstracting: (p14<=0)
states: 135
abstracting: (1<=p12)
states: 45

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [[E [[[~ [AX [p1<=p16]] & 1<=p3] | AX [EG [1<=p1]]] U [[[1<=p4 & p15<=1] | ~ [p5<=p7]] & 1<=p5]] & E [1<=p13 U [E [AF [p14<=p5] U [p9<=p11 & p9<=1]] | [AF [p5<=0] | A [1<=p12 U 1<=p16]]]]]]
normalized: ~ [[E [1<=p13 U [E [~ [EG [~ [p14<=p5]]] U [p9<=p11 & p9<=1]] | [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p12] & ~ [1<=p16]]]]] | ~ [EG [~ [p5<=0]]]]]] & E [[~ [EX [~ [EG [1<=p1]]]] | [1<=p3 & EX [~ [p1<=p16]]]] U [[~ [p5<=p7] | [1<=p4 & p15<=1]] & 1<=p5]]]]

abstracting: (1<=p5)
states: 35
abstracting: (p15<=1)
states: 171
abstracting: (1<=p4)
states: 35
abstracting: (p5<=p7)
states: 160
abstracting: (p1<=p16)
states: 110
.abstracting: (1<=p3)
states: 49
abstracting: (1<=p1)
states: 82
............
EG iterations: 12
.abstracting: (p5<=0)
states: 136
.........
EG iterations: 9
abstracting: (1<=p16)
states: 45
abstracting: (1<=p12)
states: 45
abstracting: (1<=p16)
states: 45
abstracting: (1<=p16)
states: 45
..............
EG iterations: 14
abstracting: (p9<=1)
states: 171
abstracting: (p9<=p11)
states: 117
abstracting: (p14<=p5)
states: 144
.........
EG iterations: 9
abstracting: (1<=p13)
states: 54
-> the formula is TRUE

FORMULA ShieldRVs-PT-001A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: ~ [[AX [E [[[~ [1<=p3] | [1<=p5 & p16<=1]] | E [1<=p11 U p8<=p1]] U 1<=p11]] & [[[[AX [1<=p16] | AF [[p5<=0 & p9<=1]]] & A [AX [p13<=p8] U A [p12<=1 U 1<=p13]]] | AF [[AF [p4<=p7] & E [1<=p2 U 1<=p14]]]] | EX [AX [[~ [p3<=p9] & ~ [1<=p14]]]]]]]
normalized: ~ [[[EX [~ [EX [~ [[~ [1<=p14] & ~ [p3<=p9]]]]]] | [~ [EG [~ [[E [1<=p2 U 1<=p14] & ~ [EG [~ [p4<=p7]]]]]]] | [[~ [EG [~ [[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [p12<=1] & ~ [1<=p13]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [p12<=1] & ~ [1<=p13]]]]]] U [EX [~ [p13<=p8]] & ~ [[~ [EG [~ [1<=p13]]] & ~ [E [~ [1<=p13] U [~ [p12<=1] & ~ [1<=p13]]]]]]]]]] & [~ [EG [~ [[p5<=0 & p9<=1]]]] | ~ [EX [~ [1<=p16]]]]]]] & ~ [EX [~ [E [[E [1<=p11 U p8<=p1] | [[1<=p5 & p16<=1] | ~ [1<=p3]]] U 1<=p11]]]]]]

abstracting: (1<=p11)
states: 35
abstracting: (1<=p3)
states: 49
abstracting: (p16<=1)
states: 171
abstracting: (1<=p5)
states: 35
abstracting: (p8<=p1)
states: 125
abstracting: (1<=p11)
states: 35
.abstracting: (1<=p16)
states: 45
.abstracting: (p9<=1)
states: 171
abstracting: (p5<=0)
states: 136
.........
EG iterations: 9
abstracting: (1<=p13)
states: 54
abstracting: (p12<=1)
states: 171
abstracting: (1<=p13)
states: 54
abstracting: (1<=p13)
states: 54
..............
EG iterations: 14
abstracting: (p13<=p8)
states: 146
.abstracting: (1<=p13)
states: 54
abstracting: (p12<=1)
states: 171
abstracting: (1<=p13)
states: 54
abstracting: (1<=p13)
states: 54
..............
EG iterations: 14
abstracting: (1<=p13)
states: 54
abstracting: (p12<=1)
states: 171
abstracting: (1<=p13)
states: 54
abstracting: (1<=p13)
states: 54
..............
EG iterations: 14
.
EG iterations: 1
abstracting: (p4<=p7)
states: 150
.......
EG iterations: 7
abstracting: (1<=p14)
states: 36
abstracting: (1<=p2)
states: 88
...........
EG iterations: 11
abstracting: (p3<=p9)
states: 137
abstracting: (1<=p14)
states: 36
..-> the formula is FALSE

FORMULA ShieldRVs-PT-001A-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

totally nodes used: 26265 (2.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 33952 74322 108274
used/not used/entry size/cache size: 92883 67015981 16 1024MB
basic ops cache: hits/miss/sum: 17283 28092 45375
used/not used/entry size/cache size: 52155 16725061 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: 792 1231 2023
used/not used/entry size/cache size: 1231 8387377 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 67082884
1 25699
2 277
3 4
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.868sec


BK_STOP 1679068795170

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


iterations count:446 (20), effective:62 (2)

initing FirstDep: 0m 0.001sec


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

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

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

iterations count:176 (8), effective:17 (0)

iterations count:236 (10), effective:33 (1)

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

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

iterations count:236 (10), effective:33 (1)

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

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

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

iterations count:115 (5), effective:18 (0)

iterations count:191 (8), effective:17 (0)

iterations count:242 (11), effective:36 (1)

iterations count:115 (5), effective:18 (0)

iterations count:191 (8), effective:17 (0)

iterations count:242 (11), effective:36 (1)

iterations count:115 (5), effective:18 (0)

iterations count:191 (8), effective:17 (0)

iterations count:242 (11), effective:36 (1)

iterations count:260 (11), effective:34 (1)

iterations count:156 (7), effective:25 (1)

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

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

iterations count:172 (7), effective:29 (1)

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

iterations count:394 (17), effective:55 (2)

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

iterations count:68 (3), effective:3 (0)

iterations count:206 (9), effective:29 (1)

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

iterations count:110 (5), effective:6 (0)

iterations count:122 (5), effective:13 (0)

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

iterations count:288 (13), effective:41 (1)

iterations count:186 (8), effective:23 (1)

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

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

iterations count:79 (3), effective:11 (0)

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

iterations count:44 (2), effective:4 (0)

iterations count:265 (12), effective:35 (1)

iterations count:94 (4), effective:14 (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="ShieldRVs-PT-001A"
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 ShieldRVs-PT-001A, 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-167905971700001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001A.tgz
mv ShieldRVs-PT-001A 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;