fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r417-tajo-167905971700009
Last Updated
May 14, 2023

About the Execution of Marcie for ShieldRVs-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5481.176 7749.00 7092.00 0.00 FTTTFFTFFFFTTFTT 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-167905971700009.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-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905971700009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:22 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.7K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Feb 26 18:23 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 13K 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-001B-CTLCardinality-00
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-01
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-02
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-03
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-04
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-05
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-06
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-07
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-08
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-09
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-10
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-11
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-12
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-13
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-14
FORMULA_NAME ShieldRVs-PT-001B-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679068785266

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-001B
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_001B
(NrP: 43 NrTr: 48 NrArc: 144)

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

net check time: 0m 0.000sec

init dd package: 0m 3.879sec


RS generation: 0m 0.021sec


-> reachability set: #nodes 907 (9.1e+02) #states 3,596 (3)



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

checking: AG [AX [p41<=1]]
normalized: ~ [E [true U EX [~ [p41<=1]]]]

abstracting: (p41<=1)
states: 3,596 (3)
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AF [~ [AX [~ [AG [p26<=p26]]]]]
normalized: ~ [EG [~ [EX [~ [E [true U ~ [p26<=p26]]]]]]]

abstracting: (p26<=p26)
states: 3,596 (3)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EX [~ [EF [[EG [1<=p0] | [1<=p6 & 1<=p27]]]]]
normalized: EX [~ [E [true U [[1<=p6 & 1<=p27] | EG [1<=p0]]]]]

abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (1<=p27)
states: 434
abstracting: (1<=p6)
states: 4
.-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [[EF [~ [AF [AG [p8<=p41]]]] | ~ [A [~ [AG [1<=p7]] U 1<=p4]]]]
normalized: ~ [[~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [E [true U ~ [1<=p7]]] & ~ [1<=p4]]]]]] | E [true U EG [E [true U ~ [p8<=p41]]]]]]

abstracting: (p8<=p41)
states: 3,526 (3)
............................
EG iterations: 28
abstracting: (1<=p4)
states: 1
abstracting: (1<=p7)
states: 31
abstracting: (1<=p4)
states: 1
abstracting: (1<=p4)
states: 1
..
EG iterations: 2
-> the formula is TRUE

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

MC time: 0m 0.032sec

checking: AX [[E [~ [1<=p12] U ~ [AF [~ [1<=p17]]]] & p27<=p2]]
normalized: ~ [EX [~ [[E [~ [1<=p12] U EG [1<=p17]] & p27<=p2]]]]

abstracting: (p27<=p2)
states: 3,328 (3)
abstracting: (1<=p17)
states: 83
.......................
EG iterations: 23
abstracting: (1<=p12)
states: 314
.-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AX [EF [E [~ [p34<=p13] U AG [[p11<=p2 | 1<=p39]]]]]
normalized: ~ [EX [~ [E [true U E [~ [p34<=p13] U ~ [E [true U ~ [[p11<=p2 | 1<=p39]]]]]]]]]

abstracting: (1<=p39)
states: 299
abstracting: (p11<=p2)
states: 3,387 (3)
abstracting: (p34<=p13)
states: 3,079 (3)
.-> the formula is TRUE

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

MC time: 0m 0.053sec

checking: EG [A [[EF [[~ [p21<=0] | p14<=p41]] & EF [AG [p37<=p22]]] U ~ [p29<=0]]]
normalized: EG [[~ [EG [p29<=0]] & ~ [E [p29<=0 U [~ [[E [true U ~ [E [true U ~ [p37<=p22]]]] & E [true U [~ [p21<=0] | p14<=p41]]]] & p29<=0]]]]]

abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (p14<=p41)
states: 3,264 (3)
abstracting: (p21<=0)
states: 2,482 (3)
abstracting: (p37<=p22)
states: 3,242 (3)
abstracting: (p29<=0)
states: 3,129 (3)
abstracting: (p29<=0)
states: 3,129 (3)
........................................
EG iterations: 40
........................
EG iterations: 24
-> the formula is TRUE

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

MC time: 0m 0.170sec

checking: EF [[[EG [~ [1<=p37]] & A [EF [EG [p12<=1]] U A [EF [p40<=0] U E [p20<=0 U p21<=p40]]]] | EG [EX [EG [1<=p29]]]]]
normalized: E [true U [EG [EX [EG [1<=p29]]] | [[~ [EG [~ [[~ [EG [~ [E [p20<=0 U p21<=p40]]]] & ~ [E [~ [E [p20<=0 U p21<=p40]] U [~ [E [true U p40<=0]] & ~ [E [p20<=0 U p21<=p40]]]]]]]]] & ~ [E [~ [[~ [EG [~ [E [p20<=0 U p21<=p40]]]] & ~ [E [~ [E [p20<=0 U p21<=p40]] U [~ [E [true U p40<=0]] & ~ [E [p20<=0 U p21<=p40]]]]]]] U [~ [E [true U EG [p12<=1]]] & ~ [[~ [EG [~ [E [p20<=0 U p21<=p40]]]] & ~ [E [~ [E [p20<=0 U p21<=p40]] U [~ [E [true U p40<=0]] & ~ [E [p20<=0 U p21<=p40]]]]]]]]]]] & EG [~ [1<=p37]]]]]

abstracting: (1<=p37)
states: 354
...................
EG iterations: 19
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p40<=0)
states: 3,235 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
.
EG iterations: 1
abstracting: (p12<=1)
states: 3,596 (3)

EG iterations: 0
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p40<=0)
states: 3,235 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
.
EG iterations: 1
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p40<=0)
states: 3,235 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p21<=p40)
states: 2,570 (3)
abstracting: (p20<=0)
states: 2,384 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p29)
states: 467
....................
EG iterations: 20
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVs-PT-001B-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.073sec

checking: AG [[AF [[AX [p20<=1] | [E [1<=p32 U 1<=p6] & p12<=0]]] | EF [~ [[A [p31<=0 U p16<=p4] & EF [p0<=1]]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [[E [true U p0<=1] & [~ [EG [~ [p16<=p4]]] & ~ [E [~ [p16<=p4] U [~ [p31<=0] & ~ [p16<=p4]]]]]]]] | ~ [EG [~ [[[E [1<=p32 U 1<=p6] & p12<=0] | ~ [EX [~ [p20<=1]]]]]]]]]]]

abstracting: (p20<=1)
states: 3,596 (3)
.abstracting: (p12<=0)
states: 3,282 (3)
abstracting: (1<=p6)
states: 4
abstracting: (1<=p32)
states: 37
.
EG iterations: 1
abstracting: (p16<=p4)
states: 3,053 (3)
abstracting: (p31<=0)
states: 3,560 (3)
abstracting: (p16<=p4)
states: 3,053 (3)
abstracting: (p16<=p4)
states: 3,053 (3)
.......................
EG iterations: 23
abstracting: (p0<=1)
states: 3,596 (3)
-> the formula is TRUE

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

MC time: 0m 0.048sec

checking: E [~ [EF [p5<=p23]] U [E [AG [p27<=1] U [EX [~ [p29<=p36]] & EG [[1<=p0 & p5<=p33]]]] & EX [E [~ [[p25<=1 & 1<=p12]] U [p13<=p9 | AX [1<=p42]]]]]]
normalized: E [~ [E [true U p5<=p23]] U [EX [E [~ [[p25<=1 & 1<=p12]] U [p13<=p9 | ~ [EX [~ [1<=p42]]]]]] & E [~ [E [true U ~ [p27<=1]]] U [EG [[1<=p0 & p5<=p33]] & EX [~ [p29<=p36]]]]]]

abstracting: (p29<=p36)
states: 3,151 (3)
.abstracting: (p5<=p33)
states: 3,595 (3)
abstracting: (1<=p0)
states: 1
..
EG iterations: 2
abstracting: (p27<=1)
states: 3,596 (3)
abstracting: (1<=p42)
states: 37
.abstracting: (p13<=p9)
states: 3,282 (3)
abstracting: (1<=p12)
states: 314
abstracting: (p25<=1)
states: 3,596 (3)
.abstracting: (p5<=p23)
states: 3,595 (3)
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: ~ [E [[~ [[~ [1<=p18] & AG [1<=p27]]] | [AG [EF [p1<=1]] & [EX [[p22<=p26 | p31<=1]] & EX [AX [p26<=0]]]]] U A [A [p25<=0 U [EG [p30<=1] | [p29<=p38 | p12<=1]]] U AG [p29<=p0]]]]
normalized: ~ [E [[[[EX [~ [EX [~ [p26<=0]]]] & EX [[p22<=p26 | p31<=1]]] & ~ [E [true U ~ [E [true U p1<=1]]]]] | ~ [[~ [E [true U ~ [1<=p27]]] & ~ [1<=p18]]]] U [~ [EG [E [true U ~ [p29<=p0]]]] & ~ [E [E [true U ~ [p29<=p0]] U [~ [[~ [EG [~ [[[p29<=p38 | p12<=1] | EG [p30<=1]]]]] & ~ [E [~ [[[p29<=p38 | p12<=1] | EG [p30<=1]]] U [~ [p25<=0] & ~ [[[p29<=p38 | p12<=1] | EG [p30<=1]]]]]]]] & E [true U ~ [p29<=p0]]]]]]]]

abstracting: (p29<=p0)
states: 3,129 (3)
abstracting: (p30<=1)
states: 3,596 (3)

EG iterations: 0
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (p29<=p38)
states: 3,197 (3)
abstracting: (p25<=0)
states: 3,236 (3)
abstracting: (p30<=1)
states: 3,596 (3)

EG iterations: 0
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (p29<=p38)
states: 3,197 (3)
abstracting: (p30<=1)
states: 3,596 (3)

EG iterations: 0
abstracting: (p12<=1)
states: 3,596 (3)
abstracting: (p29<=p38)
states: 3,197 (3)
.
EG iterations: 1
abstracting: (p29<=p0)
states: 3,129 (3)
abstracting: (p29<=p0)
states: 3,129 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 214
abstracting: (1<=p27)
states: 434
abstracting: (p1<=1)
states: 3,596 (3)
abstracting: (p31<=1)
states: 3,596 (3)
abstracting: (p22<=p26)
states: 3,560 (3)
.abstracting: (p26<=0)
states: 3,186 (3)
..-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: [E [~ [[[[A [1<=p20 U p37<=p26] & ~ [1<=p15]] | EF [E [1<=p15 U 1<=p26]]] | EG [~ [AX [p11<=0]]]]] U [~ [EG [AF [p3<=p2]]] & [~ [[EX [p3<=0] | ~ [EX [p4<=1]]]] | ~ [E [~ [p35<=p14] U ~ [p20<=0]]]]]] & AX [AX [p22<=1]]]
normalized: [~ [EX [EX [~ [p22<=1]]]] & E [~ [[EG [EX [~ [p11<=0]]] | [E [true U E [1<=p15 U 1<=p26]] | [~ [1<=p15] & [~ [EG [~ [p37<=p26]]] & ~ [E [~ [p37<=p26] U [~ [1<=p20] & ~ [p37<=p26]]]]]]]]] U [[~ [E [~ [p35<=p14] U ~ [p20<=0]]] | ~ [[~ [EX [p4<=1]] | EX [p3<=0]]]] & ~ [EG [~ [EG [~ [p3<=p2]]]]]]]]

abstracting: (p3<=p2)
states: 2,321 (3)
........................
EG iterations: 24
..............................
EG iterations: 30
abstracting: (p3<=0)
states: 2,321 (3)
.abstracting: (p4<=1)
states: 3,596 (3)
.abstracting: (p20<=0)
states: 2,384 (3)
abstracting: (p35<=p14)
states: 3,106 (3)
abstracting: (p37<=p26)
states: 3,298 (3)
abstracting: (1<=p20)
states: 1,212 (3)
abstracting: (p37<=p26)
states: 3,298 (3)
abstracting: (p37<=p26)
states: 3,298 (3)
.................
EG iterations: 17
abstracting: (1<=p15)
states: 543
abstracting: (1<=p26)
states: 410
abstracting: (1<=p15)
states: 543
abstracting: (p11<=0)
states: 3,261 (3)
.....................
EG iterations: 20
abstracting: (p22<=1)
states: 3,596 (3)
..-> the formula is FALSE

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

MC time: 0m 0.189sec

checking: E [[~ [[AX [1<=p26] | ~ [[p14<=1 | [1<=p6 | ~ [p35<=p33]]]]]] | [p8<=1 | [[AX [AX [p11<=p13]] & ~ [p19<=1]] & [EX [~ [1<=p41]] & ~ [[EX [p28<=1] & EF [1<=p37]]]]]]] U [p26<=1 & AG [[[~ [p16<=1] & [1<=p0 | 1<=p22]] & E [~ [1<=p2] U 1<=p34]]]]]
normalized: E [[[p8<=1 | [[~ [[E [true U 1<=p37] & EX [p28<=1]]] & EX [~ [1<=p41]]] & [~ [p19<=1] & ~ [EX [EX [~ [p11<=p13]]]]]]] | ~ [[~ [[p14<=1 | [1<=p6 | ~ [p35<=p33]]]] | ~ [EX [~ [1<=p26]]]]]] U [p26<=1 & ~ [E [true U ~ [[E [~ [1<=p2] U 1<=p34] & [[1<=p0 | 1<=p22] & ~ [p16<=1]]]]]]]]

abstracting: (p16<=1)
states: 3,596 (3)
abstracting: (1<=p22)
states: 36
abstracting: (1<=p0)
states: 1
abstracting: (1<=p34)
states: 559
abstracting: (1<=p2)
states: 1,057 (3)
abstracting: (p26<=1)
states: 3,596 (3)
abstracting: (1<=p26)
states: 410
.abstracting: (p35<=p33)
states: 3,037 (3)
abstracting: (1<=p6)
states: 4
abstracting: (p14<=1)
states: 3,596 (3)
abstracting: (p11<=p13)
states: 3,261 (3)
..abstracting: (p19<=1)
states: 3,596 (3)
abstracting: (1<=p41)
states: 361
.abstracting: (p28<=1)
states: 3,596 (3)
.abstracting: (1<=p37)
states: 354
abstracting: (p8<=1)
states: 3,596 (3)
-> the formula is FALSE

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

MC time: 0m 0.025sec

checking: ~ [[AG [E [[E [p41<=1 U p15<=p37] | [p28<=1 | AF [p17<=p30]]] U [AG [p39<=1] | 1<=p23]]] | A [~ [[[AX [p42<=1] | ~ [[1<=p41 & 1<=p19]]] | [[p29<=p33 | p11<=0] & p28<=p2]]] U ~ [[[A [1<=p17 U p3<=1] & ~ [AG [p30<=p17]]] | AF [AF [p29<=p41]]]]]]]
normalized: ~ [[[~ [EG [[~ [EG [EG [~ [p29<=p41]]]] | [E [true U ~ [p30<=p17]] & [~ [EG [~ [p3<=1]]] & ~ [E [~ [p3<=1] U [~ [1<=p17] & ~ [p3<=1]]]]]]]]] & ~ [E [[~ [EG [EG [~ [p29<=p41]]]] | [E [true U ~ [p30<=p17]] & [~ [EG [~ [p3<=1]]] & ~ [E [~ [p3<=1] U [~ [1<=p17] & ~ [p3<=1]]]]]]] U [[[p28<=p2 & [p29<=p33 | p11<=0]] | [~ [[1<=p41 & 1<=p19]] | ~ [EX [~ [p42<=1]]]]] & [~ [EG [EG [~ [p29<=p41]]]] | [E [true U ~ [p30<=p17]] & [~ [EG [~ [p3<=1]]] & ~ [E [~ [p3<=1] U [~ [1<=p17] & ~ [p3<=1]]]]]]]]]]] | ~ [E [true U ~ [E [[[p28<=1 | ~ [EG [~ [p17<=p30]]]] | E [p41<=1 U p15<=p37]] U [1<=p23 | ~ [E [true U ~ [p39<=1]]]]]]]]]]

abstracting: (p39<=1)
states: 3,596 (3)
abstracting: (1<=p23)
states: 431
abstracting: (p15<=p37)
states: 3,106 (3)
abstracting: (p41<=1)
states: 3,596 (3)
abstracting: (p17<=p30)
states: 3,530 (3)
..............
EG iterations: 14
abstracting: (p28<=1)
states: 3,596 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (p3<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (p30<=p17)
states: 3,146 (3)
abstracting: (p29<=p41)
states: 3,172 (3)
................
EG iterations: 16
.
EG iterations: 1
abstracting: (p42<=1)
states: 3,596 (3)
.abstracting: (1<=p19)
states: 1,018 (3)
abstracting: (1<=p41)
states: 361
abstracting: (p11<=0)
states: 3,261 (3)
abstracting: (p29<=p33)
states: 3,163 (3)
abstracting: (p28<=p2)
states: 3,345 (3)
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (p3<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (p30<=p17)
states: 3,146 (3)
abstracting: (p29<=p41)
states: 3,172 (3)
................
EG iterations: 16
.
EG iterations: 1
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (1<=p17)
states: 83
abstracting: (p3<=1)
states: 3,596 (3)
abstracting: (p3<=1)
states: 3,596 (3)
.
EG iterations: 1
abstracting: (p30<=p17)
states: 3,146 (3)
abstracting: (p29<=p41)
states: 3,172 (3)
................
EG iterations: 16
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.061sec

checking: AG [[[[[AG [AF [p19<=0]] | AX [1<=p13]] | ~ [[[~ [p27<=1] & [p24<=1 | 1<=p30]] & [[p0<=1 & p32<=p28] & [p12<=p37 & p24<=p37]]]]] & AG [AG [EF [1<=p6]]]] & [[EF [EF [p33<=p29]] | [AG [AF [1<=p14]] | [~ [E [1<=p15 U p23<=0]] | ~ [EF [1<=p6]]]]] | [AX [[p33<=p22 | A [p27<=0 U p12<=p0]]] & E [EF [p39<=p4] U [AX [p38<=p7] | AG [p9<=1]]]]]]]
normalized: ~ [E [true U ~ [[[[E [E [true U p39<=p4] U [~ [E [true U ~ [p9<=1]]] | ~ [EX [~ [p38<=p7]]]]] & ~ [EX [~ [[p33<=p22 | [~ [EG [~ [p12<=p0]]] & ~ [E [~ [p12<=p0] U [~ [p27<=0] & ~ [p12<=p0]]]]]]]]]] | [[[~ [E [true U 1<=p6]] | ~ [E [1<=p15 U p23<=0]]] | ~ [E [true U EG [~ [1<=p14]]]]] | E [true U E [true U p33<=p29]]]] & [~ [E [true U E [true U ~ [E [true U 1<=p6]]]]] & [~ [[[[p12<=p37 & p24<=p37] & [p0<=1 & p32<=p28]] & [[p24<=1 | 1<=p30] & ~ [p27<=1]]]] | [~ [EX [~ [1<=p13]]] | ~ [E [true U EG [~ [p19<=0]]]]]]]]]]]

abstracting: (p19<=0)
states: 2,578 (3)
..........................
EG iterations: 26
abstracting: (1<=p13)
states: 314
.abstracting: (p27<=1)
states: 3,596 (3)
abstracting: (1<=p30)
states: 467
abstracting: (p24<=1)
states: 3,596 (3)
abstracting: (p32<=p28)
states: 3,559 (3)
abstracting: (p0<=1)
states: 3,596 (3)
abstracting: (p24<=p37)
states: 3,057 (3)
abstracting: (p12<=p37)
states: 3,304 (3)
abstracting: (1<=p6)
states: 4
abstracting: (p33<=p29)
states: 3,306 (3)
abstracting: (1<=p14)
states: 353
................
EG iterations: 16
abstracting: (p23<=0)
states: 3,165 (3)
abstracting: (1<=p15)
states: 543
abstracting: (1<=p6)
states: 4
abstracting: (p12<=p0)
states: 3,282 (3)
abstracting: (p27<=0)
states: 3,162 (3)
abstracting: (p12<=p0)
states: 3,282 (3)
abstracting: (p12<=p0)
states: 3,282 (3)
....................
EG iterations: 20
abstracting: (p33<=p22)
states: 3,272 (3)
.abstracting: (p38<=p7)
states: 3,188 (3)
.abstracting: (p9<=1)
states: 3,596 (3)
abstracting: (p39<=p4)
states: 3,297 (3)
-> the formula is FALSE

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

MC time: 0m 0.160sec

checking: [E [EX [EF [AF [p2<=0]]] U [~ [EX [[p4<=p36 | 1<=p28]]] & [~ [E [[p9<=0 & p6<=p22] U ~ [p13<=p24]]] & ~ [EG [A [1<=p32 U p38<=1]]]]]] & [E [[~ [[[EF [1<=p29] & AF [1<=p40]] | [AF [1<=p1] | AF [p9<=0]]]] | AF [[[p21<=p25 | p39<=p5] & [1<=p17 | 1<=p34]]]] U ~ [[~ [p4<=1] & A [E [1<=p22 U 1<=p25] U p35<=0]]]] | A [E [[EF [p3<=0] & [p14<=p25 & AF [p18<=p8]]] U [[~ [p4<=0] & [p27<=p8 | 1<=p1]] | 1<=p9]] U EX [1<=p31]]]]
normalized: [[E [[~ [EG [~ [[[1<=p17 | 1<=p34] & [p21<=p25 | p39<=p5]]]]] | ~ [[[~ [EG [~ [p9<=0]]] | ~ [EG [~ [1<=p1]]]] | [~ [EG [~ [1<=p40]]] & E [true U 1<=p29]]]]] U ~ [[[~ [EG [~ [p35<=0]]] & ~ [E [~ [p35<=0] U [~ [p35<=0] & ~ [E [1<=p22 U 1<=p25]]]]]] & ~ [p4<=1]]]] | [~ [EG [~ [EX [1<=p31]]]] & ~ [E [~ [EX [1<=p31]] U [~ [E [[[~ [EG [~ [p18<=p8]]] & p14<=p25] & E [true U p3<=0]] U [1<=p9 | [[p27<=p8 | 1<=p1] & ~ [p4<=0]]]]] & ~ [EX [1<=p31]]]]]]] & E [EX [E [true U ~ [EG [~ [p2<=0]]]]] U [[~ [EG [[~ [EG [~ [p38<=1]]] & ~ [E [~ [p38<=1] U [~ [1<=p32] & ~ [p38<=1]]]]]]] & ~ [E [[p9<=0 & p6<=p22] U ~ [p13<=p24]]]] & ~ [EX [[p4<=p36 | 1<=p28]]]]]]

abstracting: (1<=p28)
states: 353
abstracting: (p4<=p36)
states: 3,595 (3)
.abstracting: (p13<=p24)
states: 3,354 (3)
abstracting: (p6<=p22)
states: 3,592 (3)
abstracting: (p9<=0)
states: 3,101 (3)
abstracting: (p38<=1)
states: 3,596 (3)
abstracting: (1<=p32)
states: 37
abstracting: (p38<=1)
states: 3,596 (3)
abstracting: (p38<=1)
states: 3,596 (3)
.
EG iterations: 1

EG iterations: 0
abstracting: (p2<=0)
states: 2,539 (3)
...........................
EG iterations: 27
.abstracting: (1<=p31)
states: 36
.abstracting: (p4<=0)
states: 3,595 (3)
abstracting: (1<=p1)
states: 1,263 (3)
abstracting: (p27<=p8)
states: 3,162 (3)
abstracting: (1<=p9)
states: 495
abstracting: (p3<=0)
states: 2,321 (3)
abstracting: (p14<=p25)
states: 3,277 (3)
abstracting: (p18<=p8)
states: 3,413 (3)
.......................
EG iterations: 23
abstracting: (1<=p31)
states: 36
.abstracting: (1<=p31)
states: 36
.........
EG iterations: 8
abstracting: (p4<=1)
states: 3,596 (3)
abstracting: (1<=p25)
states: 360
abstracting: (1<=p22)
states: 36
abstracting: (p35<=0)
states: 3,037 (3)
abstracting: (p35<=0)
states: 3,037 (3)
abstracting: (p35<=0)
states: 3,037 (3)
...................
EG iterations: 19
abstracting: (1<=p29)
states: 467
abstracting: (1<=p40)
states: 361
......................................
EG iterations: 38
abstracting: (1<=p1)
states: 1,263 (3)
..................................
EG iterations: 34
abstracting: (p9<=0)
states: 3,101 (3)
....................
EG iterations: 20
abstracting: (p39<=p5)
states: 3,297 (3)
abstracting: (p21<=p25)
states: 2,578 (3)
abstracting: (1<=p34)
states: 559
abstracting: (1<=p17)
states: 83
.................................
EG iterations: 33
-> the formula is FALSE

FORMULA ShieldRVs-PT-001B-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.421sec

totally nodes used: 692559 (6.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 732433 1980821 2713254
used/not used/entry size/cache size: 2587427 64521437 16 1024MB
basic ops cache: hits/miss/sum: 196474 452156 648630
used/not used/entry size/cache size: 866485 15910731 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: 4705 12104 16809
used/not used/entry size/cache size: 12091 8376517 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 66462807
1 604376
2 37232
3 4100
4 326
5 23
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.679sec


BK_STOP 1679068793015

--------------------
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:2207 (45), effective:255 (5)

initing FirstDep: 0m 0.000sec


iterations count:67 (1), effective:6 (0)

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

iterations count:1024 (21), effective:127 (2)

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

iterations count:1164 (24), effective:128 (2)

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

iterations count:874 (18), effective:111 (2)

iterations count:1159 (24), effective:126 (2)

iterations count:271 (5), effective:22 (0)

iterations count:282 (5), effective:29 (0)

iterations count:271 (5), effective:22 (0)

iterations count:271 (5), effective:22 (0)

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

iterations count:271 (5), effective:22 (0)

iterations count:282 (5), effective:29 (0)

iterations count:271 (5), effective:22 (0)

iterations count:271 (5), effective:22 (0)

iterations count:271 (5), effective:22 (0)

iterations count:282 (5), effective:29 (0)

iterations count:271 (5), effective:22 (0)

iterations count:271 (5), effective:22 (0)

iterations count:381 (7), effective:38 (0)

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

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

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

iterations count:70 (1), effective:7 (0)

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

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

iterations count:538 (11), effective:76 (1)

iterations count:538 (11), effective:76 (1)

iterations count:538 (11), effective:76 (1)

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

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

iterations count:1159 (24), effective:126 (2)

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

iterations count:95 (1), effective:6 (0)

iterations count:360 (7), effective:23 (0)

iterations count:400 (8), effective:55 (1)

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

iterations count:377 (7), effective:32 (0)

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

iterations count:874 (18), effective:111 (2)

iterations count:433 (9), effective:38 (0)

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

iterations count:783 (16), effective:114 (2)

iterations count:783 (16), effective:114 (2)

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

iterations count:783 (16), effective:114 (2)

iterations count:59 (1), effective:3 (0)

iterations count:62 (1), effective:4 (0)

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

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

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

iterations count:207 (4), effective:21 (0)

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

iterations count:59 (1), effective:3 (0)

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

iterations count:214 (4), effective:22 (0)

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

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

iterations count:730 (15), effective:83 (1)

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

iterations count:406 (8), effective:55 (1)

iterations count:642 (13), effective:67 (1)

iterations count:837 (17), effective:106 (2)

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

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

iterations count:538 (11), effective:76 (1)

iterations count:48 (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="ShieldRVs-PT-001B"
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-001B, 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-167905971700009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001B.tgz
mv ShieldRVs-PT-001B 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 ;