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.r385-oct2-167903709800177.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldIIPt-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903709800177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 17:04 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.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 25 17:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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.1K 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 ShieldIIPt-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-001A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679042218730

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=ShieldIIPt-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: ShieldIIPt_PT_001A
(NrP: 22 NrTr: 17 NrArc: 66)

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

net check time: 0m 0.000sec

init dd package: 0m 2.913sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 55 (5.5e+01) #states 1,281 (3)



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

checking: EG [EX [p8<=0]]
normalized: EG [EX [p8<=0]]

abstracting: (p8<=0)
states: 769
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [~ [p20<=1] U AG [EF [EX [AX [1<=p0]]]]]
normalized: E [~ [p20<=1] U ~ [E [true U ~ [E [true U EX [~ [EX [~ [1<=p0]]]]]]]]]

abstracting: (1<=p0)
states: 1
..abstracting: (p20<=1)
states: 1,281 (3)
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [~ [p20<=p8]]
normalized: EX [~ [p20<=p8]]

abstracting: (p20<=p8)
states: 897
.-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [~ [EG [AG [AG [p5<=p19]]]]]
normalized: EX [~ [EG [~ [E [true U E [true U ~ [p5<=p19]]]]]]]

abstracting: (p5<=p19)
states: 1,153 (3)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: ~ [EX [[AG [1<=p9] & p5<=p0]]]
normalized: ~ [EX [[~ [E [true U ~ [1<=p9]]] & p5<=p0]]]

abstracting: (p5<=p0)
states: 1,025 (3)
abstracting: (1<=p9)
states: 512
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[p8<=p7 & EX [EG [1<=p12]]]]]
normalized: E [true U ~ [[EX [EG [1<=p12]] & p8<=p7]]]

abstracting: (p8<=p7)
states: 1,025 (3)
abstracting: (1<=p12)
states: 640
......
EG iterations: 6
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: A [~ [[A [EF [~ [p1<=0]] U 1<=p5] | p2<=p19]] U ~ [EX [~ [EX [[1<=p6 | p15<=p11]]]]]]
normalized: [~ [E [EX [~ [EX [[1<=p6 | p15<=p11]]]] U [EX [~ [EX [[1<=p6 | p15<=p11]]]] & [[~ [EG [~ [1<=p5]]] & ~ [E [~ [1<=p5] U [~ [E [true U ~ [p1<=0]]] & ~ [1<=p5]]]]] | p2<=p19]]]] & ~ [EG [EX [~ [EX [[1<=p6 | p15<=p11]]]]]]]

abstracting: (p15<=p11)
states: 961
abstracting: (1<=p6)
states: 512
...
EG iterations: 1
abstracting: (p2<=p19)
states: 961
abstracting: (1<=p5)
states: 256
abstracting: (p1<=0)
states: 641
abstracting: (1<=p5)
states: 256
abstracting: (1<=p5)
states: 256
..
EG iterations: 2
abstracting: (p15<=p11)
states: 961
abstracting: (1<=p6)
states: 512
..abstracting: (p15<=p11)
states: 961
abstracting: (1<=p6)
states: 512
..-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [EF [[EF [[1<=p8 & ~ [p10<=p1]]] | [E [AX [1<=p13] U p14<=0] | EX [AX [p17<=p19]]]]]]
normalized: ~ [EX [~ [E [true U [[EX [~ [EX [~ [p17<=p19]]]] | E [~ [EX [~ [1<=p13]]] U p14<=0]] | E [true U [~ [p10<=p1] & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 512
abstracting: (p10<=p1)
states: 961
abstracting: (p14<=0)
states: 641
abstracting: (1<=p13)
states: 640
.abstracting: (p17<=p19)
states: 961
...-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: ~ [[~ [AG [EG [AF [p3<=p21]]]] | AX [[~ [[p19<=0 & [A [p13<=p10 U p17<=p10] | 1<=p11]]] & ~ [A [[p13<=1 & p20<=1] U AF [p16<=p21]]]]]]]
normalized: ~ [[~ [EX [~ [[~ [[~ [EG [EG [~ [p16<=p21]]]] & ~ [E [EG [~ [p16<=p21]] U [~ [[p13<=1 & p20<=1]] & EG [~ [p16<=p21]]]]]]] & ~ [[[[~ [EG [~ [p17<=p10]]] & ~ [E [~ [p17<=p10] U [~ [p13<=p10] & ~ [p17<=p10]]]]] | 1<=p11] & p19<=0]]]]]] | E [true U ~ [EG [~ [EG [~ [p3<=p21]]]]]]]]

abstracting: (p3<=p21)
states: 961
.................
EG iterations: 17

EG iterations: 0
abstracting: (p19<=0)
states: 641
abstracting: (1<=p11)
states: 640
abstracting: (p17<=p10)
states: 961
abstracting: (p13<=p10)
states: 961
abstracting: (p17<=p10)
states: 961
abstracting: (p17<=p10)
states: 961
.
EG iterations: 1
abstracting: (p16<=p21)
states: 961
...........
EG iterations: 11
abstracting: (p20<=1)
states: 1,281 (3)
abstracting: (p13<=1)
states: 1,281 (3)
abstracting: (p16<=p21)
states: 961
...........
EG iterations: 11
abstracting: (p16<=p21)
states: 961
...........
EG iterations: 11
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: ~ [A [[[AX [[[p0<=p4 & p12<=p19] | AX [p6<=p12]]] | E [AX [1<=p1] U [EF [1<=p6] & ~ [1<=p13]]]] | p1<=p7] U p1<=p11]]
normalized: ~ [[~ [EG [~ [p1<=p11]]] & ~ [E [~ [p1<=p11] U [~ [[[~ [EX [~ [[~ [EX [~ [p6<=p12]]] | [p0<=p4 & p12<=p19]]]]] | E [~ [EX [~ [1<=p1]]] U [~ [1<=p13] & E [true U 1<=p6]]]] | p1<=p7]] & ~ [p1<=p11]]]]]]

abstracting: (p1<=p11)
states: 961
abstracting: (p1<=p7)
states: 897
abstracting: (1<=p6)
states: 512
abstracting: (1<=p13)
states: 640
abstracting: (1<=p1)
states: 640
.abstracting: (p12<=p19)
states: 961
abstracting: (p0<=p4)
states: 1,280 (3)
abstracting: (p6<=p12)
states: 1,025 (3)
..abstracting: (p1<=p11)
states: 961
abstracting: (p1<=p11)
states: 961
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [[~ [EX [[[[p0<=p21 | p7<=p18] | [1<=p16 | 1<=p16]] | [AG [1<=p10] | EG [p5<=p12]]]]] | ~ [[AF [[EG [1<=p2] & ~ [1<=p14]]] & p5<=p6]]]]
normalized: ~ [EX [~ [[~ [[~ [EG [~ [[~ [1<=p14] & EG [1<=p2]]]]] & p5<=p6]] | ~ [EX [[[EG [p5<=p12] | ~ [E [true U ~ [1<=p10]]]] | [[1<=p16 | 1<=p16] | [p0<=p21 | p7<=p18]]]]]]]]]

abstracting: (p7<=p18)
states: 1,025 (3)
abstracting: (p0<=p21)
states: 1,280 (3)
abstracting: (1<=p16)
states: 640
abstracting: (1<=p16)
states: 640
abstracting: (1<=p10)
states: 640
abstracting: (p5<=p12)
states: 1,153 (3)
...
EG iterations: 3
.abstracting: (p5<=p6)
states: 1,025 (3)
abstracting: (1<=p2)
states: 640
.
EG iterations: 1
abstracting: (1<=p14)
states: 640
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[~ [[[[~ [p9<=0] | A [p4<=p14 U p1<=1]] & [EG [p1<=1] | [1<=p8 & 1<=p12]]] & ~ [E [1<=p11 U 1<=p0]]]] & 1<=p16] U [p3<=1 & ~ [p17<=p1]]]
normalized: [~ [EG [~ [[~ [p17<=p1] & p3<=1]]]] & ~ [E [~ [[~ [p17<=p1] & p3<=1]] U [~ [[~ [[~ [E [1<=p11 U 1<=p0]] & [[[1<=p8 & 1<=p12] | EG [p1<=1]] & [[~ [EG [~ [p1<=1]]] & ~ [E [~ [p1<=1] U [~ [p4<=p14] & ~ [p1<=1]]]]] | ~ [p9<=0]]]]] & 1<=p16]] & ~ [[~ [p17<=p1] & p3<=1]]]]]]

abstracting: (p3<=1)
states: 1,281 (3)
abstracting: (p17<=p1)
states: 961
abstracting: (1<=p16)
states: 640
abstracting: (p9<=0)
states: 769
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (p4<=p14)
states: 961
abstracting: (p1<=1)
states: 1,281 (3)
abstracting: (p1<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (p1<=1)
states: 1,281 (3)

EG iterations: 0
abstracting: (1<=p12)
states: 640
abstracting: (1<=p8)
states: 512
abstracting: (1<=p0)
states: 1
abstracting: (1<=p11)
states: 640
abstracting: (p3<=1)
states: 1,281 (3)
abstracting: (p17<=p1)
states: 961
abstracting: (p3<=1)
states: 1,281 (3)
abstracting: (p17<=p1)
states: 961
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: A [A [[~ [[p14<=0 | 1<=p15]] | E [[A [1<=p13 U p14<=p4] | E [1<=p12 U p15<=p21]] U EF [p7<=0]]] U E [~ [p17<=p16] U AF [~ [p4<=p5]]]] U 1<=p20]
normalized: [~ [EG [~ [1<=p20]]] & ~ [E [~ [1<=p20] U [~ [[~ [EG [~ [E [~ [p17<=p16] U ~ [EG [p4<=p5]]]]]] & ~ [E [~ [E [~ [p17<=p16] U ~ [EG [p4<=p5]]]] U [~ [[E [[E [1<=p12 U p15<=p21] | [~ [EG [~ [p14<=p4]]] & ~ [E [~ [p14<=p4] U [~ [1<=p13] & ~ [p14<=p4]]]]]] U E [true U p7<=0]] | ~ [[p14<=0 | 1<=p15]]]] & ~ [E [~ [p17<=p16] U ~ [EG [p4<=p5]]]]]]]]] & ~ [1<=p20]]]]]

abstracting: (1<=p20)
states: 640
abstracting: (p4<=p5)
states: 769
.
EG iterations: 1
abstracting: (p17<=p16)
states: 641
abstracting: (1<=p15)
states: 640
abstracting: (p14<=0)
states: 641
abstracting: (p7<=0)
states: 769
abstracting: (p14<=p4)
states: 961
abstracting: (1<=p13)
states: 640
abstracting: (p14<=p4)
states: 961
abstracting: (p14<=p4)
states: 961
.
EG iterations: 1
abstracting: (p15<=p21)
states: 961
abstracting: (1<=p12)
states: 640
abstracting: (p4<=p5)
states: 769
.
EG iterations: 1
abstracting: (p17<=p16)
states: 641
abstracting: (p4<=p5)
states: 769
.
EG iterations: 1
abstracting: (p17<=p16)
states: 641
.
EG iterations: 1
abstracting: (1<=p20)
states: 640
abstracting: (1<=p20)
states: 640
........................
EG iterations: 24
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [[[~ [[[p14<=p18 | [~ [p4<=p16] & [p8<=p3 & 1<=p1]]] & ~ [[EX [p16<=1] | A [p16<=p0 U p9<=1]]]]] | EX [AG [~ [p17<=0]]]] | A [~ [p11<=p2] U p18<=1]]]
normalized: E [true U [[~ [EG [~ [p18<=1]]] & ~ [E [~ [p18<=1] U [~ [p18<=1] & p11<=p2]]]] | [EX [~ [E [true U p17<=0]]] | ~ [[~ [[[~ [EG [~ [p9<=1]]] & ~ [E [~ [p9<=1] U [~ [p16<=p0] & ~ [p9<=1]]]]] | EX [p16<=1]]] & [p14<=p18 | [[p8<=p3 & 1<=p1] & ~ [p4<=p16]]]]]]]]

abstracting: (p4<=p16)
states: 961
abstracting: (1<=p1)
states: 640
abstracting: (p8<=p3)
states: 1,025 (3)
abstracting: (p14<=p18)
states: 961
abstracting: (p16<=1)
states: 1,281 (3)
.abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (p16<=p0)
states: 641
abstracting: (p9<=1)
states: 1,281 (3)
abstracting: (p9<=1)
states: 1,281 (3)
.
EG iterations: 1
abstracting: (p17<=0)
states: 641
.abstracting: (p11<=p2)
states: 961
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (p18<=1)
states: 1,281 (3)
abstracting: (p18<=1)
states: 1,281 (3)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: [~ [A [p18<=0 U [AF [~ [[p8<=1 | 1<=p11]]] | [[AX [p4<=p20] | 1<=p19] | [~ [p2<=p4] & p9<=p1]]]]] & [EF [[[~ [[~ [1<=p16] | [p18<=p9 | p17<=1]]] & [p11<=1 & AX [1<=p16]]] | 1<=p15]] & AG [EG [~ [AF [1<=p9]]]]]]
normalized: [[~ [E [true U ~ [EG [EG [~ [1<=p9]]]]]] & E [true U [[[~ [EX [~ [1<=p16]]] & p11<=1] & ~ [[[p18<=p9 | p17<=1] | ~ [1<=p16]]]] | 1<=p15]]] & ~ [[~ [EG [~ [[[[~ [p2<=p4] & p9<=p1] | [~ [EX [~ [p4<=p20]]] | 1<=p19]] | ~ [EG [[p8<=1 | 1<=p11]]]]]]] & ~ [E [~ [[[[~ [p2<=p4] & p9<=p1] | [~ [EX [~ [p4<=p20]]] | 1<=p19]] | ~ [EG [[p8<=1 | 1<=p11]]]]] U [~ [p18<=0] & ~ [[[[~ [p2<=p4] & p9<=p1] | [~ [EX [~ [p4<=p20]]] | 1<=p19]] | ~ [EG [[p8<=1 | 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 640
abstracting: (p8<=1)
states: 1,281 (3)

EG iterations: 0
abstracting: (1<=p19)
states: 640
abstracting: (p4<=p20)
states: 961
.abstracting: (p9<=p1)
states: 1,025 (3)
abstracting: (p2<=p4)
states: 961
abstracting: (p18<=0)
states: 641
abstracting: (1<=p11)
states: 640
abstracting: (p8<=1)
states: 1,281 (3)

EG iterations: 0
abstracting: (1<=p19)
states: 640
abstracting: (p4<=p20)
states: 961
.abstracting: (p9<=p1)
states: 1,025 (3)
abstracting: (p2<=p4)
states: 961
abstracting: (1<=p11)
states: 640
abstracting: (p8<=1)
states: 1,281 (3)

EG iterations: 0
abstracting: (1<=p19)
states: 640
abstracting: (p4<=p20)
states: 961
.abstracting: (p9<=p1)
states: 1,025 (3)
abstracting: (p2<=p4)
states: 961
........................
EG iterations: 24
abstracting: (1<=p15)
states: 640
abstracting: (1<=p16)
states: 640
abstracting: (p17<=1)
states: 1,281 (3)
abstracting: (p18<=p9)
states: 897
abstracting: (p11<=1)
states: 1,281 (3)
abstracting: (1<=p16)
states: 640
.abstracting: (1<=p9)
states: 512
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[EF [[~ [[A [1<=p4 U p5<=p6] | ~ [p8<=p4]]] | 1<=p6]] | E [~ [AF [[p19<=p7 & p2<=1]]] U [E [[p0<=p17 | 1<=p16] U [1<=p12 | p14<=p17]] & EG [[p14<=0 & p17<=p17]]]]]]
normalized: E [true U [E [EG [~ [[p19<=p7 & p2<=1]]] U [EG [[p14<=0 & p17<=p17]] & E [[p0<=p17 | 1<=p16] U [1<=p12 | p14<=p17]]]] | E [true U [~ [[~ [p8<=p4] | [~ [EG [~ [p5<=p6]]] & ~ [E [~ [p5<=p6] U [~ [1<=p4] & ~ [p5<=p6]]]]]]] | 1<=p6]]]]

abstracting: (1<=p6)
states: 512
abstracting: (p5<=p6)
states: 1,025 (3)
abstracting: (1<=p4)
states: 640
abstracting: (p5<=p6)
states: 1,025 (3)
abstracting: (p5<=p6)
states: 1,025 (3)
.
EG iterations: 1
abstracting: (p8<=p4)
states: 1,025 (3)
abstracting: (p14<=p17)
states: 961
abstracting: (1<=p12)
states: 640
abstracting: (1<=p16)
states: 640
abstracting: (p0<=p17)
states: 1,280 (3)
abstracting: (p17<=p17)
states: 1,281 (3)
abstracting: (p14<=0)
states: 641
.
EG iterations: 1
abstracting: (p2<=1)
states: 1,281 (3)
abstracting: (p19<=p7)
states: 897
.....................
EG iterations: 21
-> the formula is TRUE

FORMULA ShieldIIPt-PT-001A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 16650 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11377 33980 45357
used/not used/entry size/cache size: 46375 67062489 16 1024MB
basic ops cache: hits/miss/sum: 5761 14812 20573
used/not used/entry size/cache size: 29154 16748062 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: 450 774 1224
used/not used/entry size/cache size: 774 8387834 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 67092371
1 16338
2 153
3 2
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.650sec


BK_STOP 1679042223432

--------------------
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:144 (8), effective:41 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:60 (3), effective:9 (0)

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

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

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

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

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

iterations count:98 (5), effective:19 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:43 (2), effective:7 (0)

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

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

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

iterations count:34 (2), effective:2 (0)

iterations count:56 (3), effective:9 (0)

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

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

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

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

iterations count:17 (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="ShieldIIPt-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 ShieldIIPt-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 r385-oct2-167903709800177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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