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.r481-tall-167912692400777.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is TwoPhaseLocking-PT-nC00004vN, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692400777
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 17:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 25 17:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00004vN-CTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vN-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679868133590

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=TwoPhaseLocking-PT-nC00004vN
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: TwoPhaseLocking_PT_nC00004vN
(NrP: 8 NrTr: 6 NrArc: 18)

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

net check time: 0m 0.000sec

init dd package: 0m 2.868sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 66 (6.6e+01) #states 45



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

checking: ~ [AG [4<=haveA]]
normalized: E [true U ~ [4<=haveA]]

abstracting: (4<=haveA)
states: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EX [2<=haveAandB]
normalized: EX [2<=haveAandB]

abstracting: (2<=haveAandB)
states: 2
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EX [AF [~ [haveA2<=0]]]]
normalized: ~ [EG [~ [EX [~ [EG [haveA2<=0]]]]]]

abstracting: (haveA2<=0)
states: 29
.............
EG iterations: 13
..
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EX [haveAandB<=Clients]]
normalized: ~ [EX [haveAandB<=Clients]]

abstracting: (haveAandB<=Clients)
states: 42
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [Clients<=Clients]
normalized: EX [Clients<=Clients]

abstracting: (Clients<=Clients)
states: 45
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [~ [[EX [EF [~ [haveAandB<=4]]] & haveAandB<=0]]]
normalized: EG [~ [[EX [E [true U ~ [haveAandB<=4]]] & haveAandB<=0]]]

abstracting: (haveAandB<=0)
states: 32
abstracting: (haveAandB<=4)
states: 45
.
EG iterations: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [haveAandB<=haveA2andB] & ~ [AX [4<=haveAandB]]]
normalized: [EX [~ [4<=haveAandB]] & ~ [EX [~ [haveAandB<=haveA2andB]]]]

abstracting: (haveAandB<=haveA2andB)
states: 34
.abstracting: (4<=haveAandB)
states: 0
.-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [A [~ [EG [haveA<=1]] U E [[~ [resA<=0] & haveB<=1] U EF [2<=Clients]]]]
normalized: ~ [[~ [EG [~ [E [[~ [resA<=0] & haveB<=1] U E [true U 2<=Clients]]]]] & ~ [E [~ [E [[~ [resA<=0] & haveB<=1] U E [true U 2<=Clients]]] U [~ [E [[~ [resA<=0] & haveB<=1] U E [true U 2<=Clients]]] & EG [haveA<=1]]]]]]

abstracting: (haveA<=1)
states: 42
.
EG iterations: 1
abstracting: (2<=Clients)
states: 21
abstracting: (haveB<=1)
states: 30
abstracting: (resA<=0)
states: 27
abstracting: (2<=Clients)
states: 21
abstracting: (haveB<=1)
states: 30
abstracting: (resA<=0)
states: 27
abstracting: (2<=Clients)
states: 21
abstracting: (haveB<=1)
states: 30
abstracting: (resA<=0)
states: 27
.
EG iterations: 1
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EX [~ [[AX [[haveAandB<=haveA2 & haveB<=4]] & AG [[haveAandB<=3 | resB<=3]]]]]]
normalized: ~ [E [true U ~ [EX [~ [[~ [E [true U ~ [[haveAandB<=3 | resB<=3]]]] & ~ [EX [~ [[haveAandB<=haveA2 & haveB<=4]]]]]]]]]]

abstracting: (haveB<=4)
states: 45
abstracting: (haveAandB<=haveA2)
states: 35
.abstracting: (resB<=3)
states: 45
abstracting: (haveAandB<=3)
states: 45
.-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [E [haveB<=haveAandB U [haveB<=resA | ~ [2<=resB]]]]
normalized: ~ [E [haveB<=haveAandB U [~ [2<=resB] | haveB<=resA]]]

abstracting: (haveB<=resA)
states: 21
abstracting: (2<=resB)
states: 18
abstracting: (haveB<=haveAandB)
states: 20
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AG [~ [EF [haveAandB<=3]]] & EG [[EX [haveA2andB<=haveAandB] & AF [EG [[haveA2andB<=haveA | haveA<=haveA]]]]]]
normalized: [~ [E [true U E [true U haveAandB<=3]]] & EG [[~ [EG [~ [EG [[haveA2andB<=haveA | haveA<=haveA]]]]] & EX [haveA2andB<=haveAandB]]]]

abstracting: (haveA2andB<=haveAandB)
states: 34
.abstracting: (haveA<=haveA)
states: 45
abstracting: (haveA2andB<=haveA)
states: 35

EG iterations: 0
.
EG iterations: 1
...
EG iterations: 3
abstracting: (haveAandB<=3)
states: 45
-> the formula is FALSE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AF [EF [[[2<=haveB | [haveA2<=haveAandB | haveA2andB<=1]] & [AG [Clients<=Clients] | AX [resB<=resA]]]]]]
normalized: EG [~ [EG [~ [E [true U [[[haveA2<=haveAandB | haveA2andB<=1] | 2<=haveB] & [~ [EX [~ [resB<=resA]]] | ~ [E [true U ~ [Clients<=Clients]]]]]]]]]]

abstracting: (Clients<=Clients)
states: 45
abstracting: (resB<=resA)
states: 18
.abstracting: (2<=haveB)
states: 15
abstracting: (haveA2andB<=1)
states: 43
abstracting: (haveA2<=haveAandB)
states: 32
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[AX [3<=resB] | ~ [A [~ [[2<=haveA & 1<=Clients]] U EX [resA<=4]]]] & ~ [E [[[Clients<=resB | AG [haveA2<=4]] & 2<=haveA] U ~ [[AF [Clients<=Clients] | EG [haveA2<=4]]]]]]
normalized: [~ [E [[[~ [E [true U ~ [haveA2<=4]]] | Clients<=resB] & 2<=haveA] U ~ [[EG [haveA2<=4] | ~ [EG [~ [Clients<=Clients]]]]]]] & [~ [[~ [EG [~ [EX [resA<=4]]]] & ~ [E [~ [EX [resA<=4]] U [[2<=haveA & 1<=Clients] & ~ [EX [resA<=4]]]]]]] | ~ [EX [~ [3<=resB]]]]]

abstracting: (3<=resB)
states: 6
.abstracting: (resA<=4)
states: 45
.abstracting: (1<=Clients)
states: 36
abstracting: (2<=haveA)
states: 3
abstracting: (resA<=4)
states: 45
.abstracting: (resA<=4)
states: 45
..
EG iterations: 1
abstracting: (Clients<=Clients)
states: 45
.
EG iterations: 1
abstracting: (haveA2<=4)
states: 45

EG iterations: 0
abstracting: (2<=haveA)
states: 3
abstracting: (Clients<=resB)
states: 29
abstracting: (haveA2<=4)
states: 45
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EG [[[A [~ [haveA<=haveAandB] U ~ [4<=Clients]] & 1<=resA] | [[[AG [Clients<=0] | [4<=haveA2 | haveAandB<=2]] | E [haveA2<=haveA2 U haveA<=resB]] & EF [~ [haveB<=haveAandB]]]]]]
normalized: E [true U EG [[[E [true U ~ [haveB<=haveAandB]] & [E [haveA2<=haveA2 U haveA<=resB] | [[4<=haveA2 | haveAandB<=2] | ~ [E [true U ~ [Clients<=0]]]]]] | [[~ [EG [4<=Clients]] & ~ [E [4<=Clients U [haveA<=haveAandB & 4<=Clients]]]] & 1<=resA]]]]

abstracting: (1<=resA)
states: 18
abstracting: (4<=Clients)
states: 1
abstracting: (haveA<=haveAandB)
states: 32
abstracting: (4<=Clients)
states: 1
abstracting: (4<=Clients)
states: 1
..
EG iterations: 2
abstracting: (Clients<=0)
states: 9
abstracting: (haveAandB<=2)
states: 45
abstracting: (4<=haveA2)
states: 0
abstracting: (haveA<=resB)
states: 41
abstracting: (haveA2<=haveA2)
states: 45
abstracting: (haveB<=haveAandB)
states: 20

EG iterations: 0
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[[EX [EX [[1<=haveB & haveA<=resB]]] & AG [3<=haveA]] | [AG [AF [[Clients<=resA & 4<=haveA2]]] | AG [AG [[resA<=haveB & haveA2<=haveB]]]]] U EF [[EG [[[3<=resB & resB<=Clients] & E [haveA2andB<=resB U haveA2<=haveAandB]]] | ~ [AX [~ [4<=Clients]]]]]]
normalized: [~ [EG [~ [E [true U [EX [4<=Clients] | EG [[E [haveA2andB<=resB U haveA2<=haveAandB] & [3<=resB & resB<=Clients]]]]]]]] & ~ [E [~ [E [true U [EX [4<=Clients] | EG [[E [haveA2andB<=resB U haveA2<=haveAandB] & [3<=resB & resB<=Clients]]]]]] U [~ [E [true U [EX [4<=Clients] | EG [[E [haveA2andB<=resB U haveA2<=haveAandB] & [3<=resB & resB<=Clients]]]]]] & ~ [[[~ [E [true U EG [~ [[Clients<=resA & 4<=haveA2]]]]] | ~ [E [true U E [true U ~ [[resA<=haveB & haveA2<=haveB]]]]]] | [~ [E [true U ~ [3<=haveA]]] & EX [EX [[1<=haveB & haveA<=resB]]]]]]]]]]

abstracting: (haveA<=resB)
states: 41
abstracting: (1<=haveB)
states: 30
..abstracting: (3<=haveA)
states: 0
abstracting: (haveA2<=haveB)
states: 39
abstracting: (resA<=haveB)
states: 39
abstracting: (4<=haveA2)
states: 0
abstracting: (Clients<=resA)
states: 15

EG iterations: 0
abstracting: (resB<=Clients)
states: 36
abstracting: (3<=resB)
states: 6
abstracting: (haveA2<=haveAandB)
states: 32
abstracting: (haveA2andB<=resB)
states: 39
....
EG iterations: 4
abstracting: (4<=Clients)
states: 1
.abstracting: (resB<=Clients)
states: 36
abstracting: (3<=resB)
states: 6
abstracting: (haveA2<=haveAandB)
states: 32
abstracting: (haveA2andB<=resB)
states: 39
....
EG iterations: 4
abstracting: (4<=Clients)
states: 1
.abstracting: (resB<=Clients)
states: 36
abstracting: (3<=resB)
states: 6
abstracting: (haveA2<=haveAandB)
states: 32
abstracting: (haveA2andB<=resB)
states: 39
....
EG iterations: 4
abstracting: (4<=Clients)
states: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: E [~ [[[EF [~ [A [haveB<=2 U resA<=3]]] | haveA2<=Clients] | [~ [[[E [Clients<=Clients U haveAandB<=0] | [resB<=3 | 2<=haveA]] & [[1<=resA & haveA<=1] & [3<=resB & haveB<=1]]]] & E [~ [A [haveA2andB<=resB U 1<=Clients]] U [[3<=Clients | 4<=resB] & ~ [1<=Clients]]]]]] U AF [[4<=haveAandB | [~ [[2<=haveA2 | haveA2andB<=4]] | [haveA2andB<=resB | 1<=haveB]]]]]
normalized: E [~ [[[E [true U ~ [[~ [EG [~ [resA<=3]]] & ~ [E [~ [resA<=3] U [~ [haveB<=2] & ~ [resA<=3]]]]]]] | haveA2<=Clients] | [E [~ [[~ [EG [~ [1<=Clients]]] & ~ [E [~ [1<=Clients] U [~ [haveA2andB<=resB] & ~ [1<=Clients]]]]]] U [~ [1<=Clients] & [3<=Clients | 4<=resB]]] & ~ [[[[3<=resB & haveB<=1] & [1<=resA & haveA<=1]] & [[resB<=3 | 2<=haveA] | E [Clients<=Clients U haveAandB<=0]]]]]]] U ~ [EG [~ [[[[haveA2andB<=resB | 1<=haveB] | ~ [[2<=haveA2 | haveA2andB<=4]]] | 4<=haveAandB]]]]]

abstracting: (4<=haveAandB)
states: 0
abstracting: (haveA2andB<=4)
states: 45
abstracting: (2<=haveA2)
states: 3
abstracting: (1<=haveB)
states: 30
abstracting: (haveA2andB<=resB)
states: 39
..
EG iterations: 2
abstracting: (haveAandB<=0)
states: 32
abstracting: (Clients<=Clients)
states: 45
abstracting: (2<=haveA)
states: 3
abstracting: (resB<=3)
states: 45
abstracting: (haveA<=1)
states: 42
abstracting: (1<=resA)
states: 18
abstracting: (haveB<=1)
states: 30
abstracting: (3<=resB)
states: 6
abstracting: (4<=resB)
states: 0
abstracting: (3<=Clients)
states: 6
abstracting: (1<=Clients)
states: 36
abstracting: (1<=Clients)
states: 36
abstracting: (haveA2andB<=resB)
states: 39
abstracting: (1<=Clients)
states: 36
abstracting: (1<=Clients)
states: 36
..........
EG iterations: 10
abstracting: (haveA2<=Clients)
states: 39
abstracting: (resA<=3)
states: 45
abstracting: (haveB<=2)
states: 42
abstracting: (resA<=3)
states: 45
abstracting: (resA<=3)
states: 45
.
EG iterations: 1
-> the formula is TRUE

FORMULA TwoPhaseLocking-PT-nC00004vN-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 1236 (1.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2778 3143 5921
used/not used/entry size/cache size: 3831 67105033 16 1024MB
basic ops cache: hits/miss/sum: 1760 3299 5059
used/not used/entry size/cache size: 4992 16772224 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: 404 331 735
used/not used/entry size/cache size: 331 8388277 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 67107753
1 1054
2 28
3 13
4 5
5 7
6 2
7 1
8 0
9 0
>= 10 1

Total processing time: 0m 4.642sec


BK_STOP 1679868138279

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


iterations count:56 (9), effective:16 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:42 (7), effective:11 (1)

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

iterations count:42 (7), effective:11 (1)

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

iterations count:42 (7), effective:11 (1)

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

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

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

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

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

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

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

iterations count:23 (3), effective:5 (0)

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

iterations count:25 (4), effective:6 (1)

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

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

iterations count:61 (10), effective:16 (2)

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

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

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

iterations count:80 (13), effective:22 (3)

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

iterations count:80 (13), effective:22 (3)

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

iterations count:80 (13), effective:22 (3)

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

iterations count:17 (2), effective:3 (0)

iterations count:6 (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="TwoPhaseLocking-PT-nC00004vN"
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 TwoPhaseLocking-PT-nC00004vN, 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 r481-tall-167912692400777"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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