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.r193-smll-167840340800521.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 HouseConstruction-PT-00005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r193-smll-167840340800521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 4.9K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 HouseConstruction-PT-00005-CTLCardinality-00
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-01
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-02
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-03
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-04
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-05
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-06
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-07
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-08
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-09
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-00005-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679943837002

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=HouseConstruction-PT-00005
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: HouseConstruction_PT_00005
(NrP: 26 NrTr: 18 NrArc: 51)

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

net check time: 0m 0.000sec

init dd package: 0m 3.779sec


RS generation: 0m 0.030sec


-> reachability set: #nodes 6635 (6.6e+03) #states 1,187,984 (6)



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

checking: EG [p22<=0]
normalized: EG [p22<=0]

abstracting: (p22<=0)
states: 678,524 (5)
........................................................................
EG iterations: 72
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.912sec

checking: ~ [AF [AF [5<=p19]]]
normalized: EG [EG [~ [5<=p19]]]

abstracting: (5<=p19)
states: 756
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [EG [p15<=0]]
normalized: ~ [EG [p15<=0]]

abstracting: (p15<=0)
states: 598,348 (5)
........................................................................
EG iterations: 72
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.773sec

checking: ~ [AF [2<=p25]]
normalized: EG [~ [2<=p25]]

abstracting: (2<=p25)
states: 255,468 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AG [AF [~ [[~ [p23<=0] | p6<=3]]]]]
normalized: EG [~ [E [true U EG [[p6<=3 | ~ [p23<=0]]]]]]

abstracting: (p23<=0)
states: 678,524 (5)
abstracting: (p6<=3)
states: 1,187,678 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EF [EF [AX [[E [5<=p17 U 5<=p20] & ~ [AF [p21<=3]]]]]]
normalized: E [true U E [true U ~ [EX [~ [[EG [~ [p21<=3]] & E [5<=p17 U 5<=p20]]]]]]]

abstracting: (5<=p20)
states: 756
abstracting: (5<=p17)
states: 126
abstracting: (p21<=3)
states: 1,165,052 (6)
............................................
EG iterations: 44
.-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: AG [E [EF [AG [EX [p7<=p8]]] U EG [4<=p10]]]
normalized: ~ [E [true U ~ [E [E [true U ~ [E [true U ~ [EX [p7<=p8]]]]] U EG [4<=p10]]]]]

abstracting: (4<=p10)
states: 1,932 (3)
....................................
EG iterations: 36
abstracting: (p7<=p8)
states: 793,884 (5)
.-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec

checking: ~ [EF [AG [[A [EX [4<=p1] U [p18<=1 | 1<=p23]] | 2<=p20]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[2<=p20 | [~ [EG [~ [[p18<=1 | 1<=p23]]]] & ~ [E [~ [[p18<=1 | 1<=p23]] U [~ [EX [4<=p1]] & ~ [[p18<=1 | 1<=p23]]]]]]]]]]]]

abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (p18<=1)
states: 884,884 (5)
abstracting: (4<=p1)
states: 66
.abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (p18<=1)
states: 884,884 (5)
abstracting: (1<=p23)
states: 509,460 (5)
abstracting: (p18<=1)
states: 884,884 (5)
.........................................................
EG iterations: 57
abstracting: (2<=p20)
states: 174,300 (5)
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.265sec

checking: ~ [EG [[p11<=p11 & [~ [EG [EG [p3<=0]]] & p14<=p13]]]]
normalized: ~ [EG [[p11<=p11 & [p14<=p13 & ~ [EG [EG [p3<=0]]]]]]]

abstracting: (p3<=0)
states: 1,014,533 (6)
...............................................................
EG iterations: 63
.
EG iterations: 1
abstracting: (p14<=p13)
states: 989,617 (5)
abstracting: (p11<=p11)
states: 1,187,984 (6)
....................................................................
EG iterations: 68
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.052sec

checking: EG [[~ [[~ [p13<=p12] & AG [AX [5<=p7]]]] & AX [~ [[AX [2<=p2] | AG [3<=p23]]]]]]
normalized: EG [[~ [EX [[~ [E [true U ~ [3<=p23]]] | ~ [EX [~ [2<=p2]]]]]] & ~ [[~ [E [true U EX [~ [5<=p7]]]] & ~ [p13<=p12]]]]]

abstracting: (p13<=p12)
states: 1,053,633 (6)
abstracting: (5<=p7)
states: 3,432 (3)
.abstracting: (2<=p2)
states: 19,406 (4)
.abstracting: (3<=p23)
states: 45,500 (4)
...........................................................................................
EG iterations: 90
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.629sec

checking: E [~ [AF [A [AF [5<=p8] U 5<=p7]]] U EF [[AG [AG [2<=p6]] & ~ [AF [[p19<=p27 & p13<=4]]]]]]
normalized: E [EG [~ [[~ [EG [~ [5<=p7]]] & ~ [E [~ [5<=p7] U [EG [~ [5<=p8]] & ~ [5<=p7]]]]]]] U E [true U [EG [~ [[p19<=p27 & p13<=4]]] & ~ [E [true U E [true U ~ [2<=p6]]]]]]]

abstracting: (2<=p6)
states: 48,426 (4)
abstracting: (p13<=4)
states: 1,186,682 (6)
abstracting: (p19<=p27)
states: 887,901 (5)
............................................................................
EG iterations: 76
abstracting: (5<=p7)
states: 3,432 (3)
abstracting: (5<=p8)
states: 756
.
EG iterations: 1
abstracting: (5<=p7)
states: 3,432 (3)
abstracting: (5<=p7)
states: 3,432 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.271sec

checking: AX [EG [[EX [A [p3<=p3 U p27<=p12]] | ~ [AX [[p16<=0 | p8<=p26]]]]]]
normalized: ~ [EX [~ [EG [[EX [~ [[p16<=0 | p8<=p26]]] | EX [[~ [EG [~ [p27<=p12]]] & ~ [E [~ [p27<=p12] U [~ [p3<=p3] & ~ [p27<=p12]]]]]]]]]]]

abstracting: (p27<=p12)
states: 775,404 (5)
abstracting: (p3<=p3)
states: 1,187,984 (6)
abstracting: (p27<=p12)
states: 775,404 (5)
abstracting: (p27<=p12)
states: 775,404 (5)
.........................................................................
EG iterations: 73
.abstracting: (p8<=p26)
states: 720,993 (5)
abstracting: (p16<=0)
states: 598,348 (5)
............................................................................................
EG iterations: 91
.-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.696sec

checking: EF [[[EG [AX [AF [p27<=p3]]] & AX [[~ [EF [2<=p20]] | [3<=p22 | [p9<=5 | p15<=3]]]]] & [p19<=p1 | ~ [AG [2<=p16]]]]]
normalized: E [true U [[p19<=p1 | E [true U ~ [2<=p16]]] & [~ [EX [~ [[[3<=p22 | [p9<=5 | p15<=3]] | ~ [E [true U 2<=p20]]]]]] & EG [~ [EX [EG [~ [p27<=p3]]]]]]]]

abstracting: (p27<=p3)
states: 526,509 (5)
.............................................................................
EG iterations: 77
.
EG iterations: 0
abstracting: (2<=p20)
states: 174,300 (5)
abstracting: (p15<=3)
states: 1,164,224 (6)
abstracting: (p9<=5)
states: 1,187,984 (6)
abstracting: (3<=p22)
states: 45,500 (4)
.abstracting: (2<=p16)
states: 255,468 (5)
abstracting: (p19<=p1)
states: 727,124 (5)
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.751sec

checking: ~ [AF [[[[[p2<=p23 | 3<=p21] & [p23<=0 | [p18<=0 | p17<=p21]]] | AF [A [p13<=0 U p15<=p22]]] & 5<=p25]]]
normalized: EG [~ [[5<=p25 & [~ [EG [~ [[~ [EG [~ [p15<=p22]]] & ~ [E [~ [p15<=p22] U [~ [p13<=0] & ~ [p15<=p22]]]]]]]] | [[p23<=0 | [p18<=0 | p17<=p21]] & [p2<=p23 | 3<=p21]]]]]]

abstracting: (3<=p21)
states: 101,528 (5)
abstracting: (p2<=p23)
states: 1,075,648 (6)
abstracting: (p17<=p21)
states: 993,839 (5)
abstracting: (p18<=0)
states: 510,944 (5)
abstracting: (p23<=0)
states: 678,524 (5)
abstracting: (p15<=p22)
states: 770,574 (5)
abstracting: (p13<=0)
states: 514,178 (5)
abstracting: (p15<=p22)
states: 770,574 (5)
abstracting: (p15<=p22)
states: 770,574 (5)
...................................................................................
EG iterations: 83
............................................................................
EG iterations: 76
abstracting: (5<=p25)
states: 3,432 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.412sec

checking: [EX [E [p8<=2 U E [1<=p2 U ~ [[1<=p9 | p19<=4]]]]] & EG [[4<=p23 | [[AF [[p25<=p6 | p13<=p22]] | [~ [[1<=p18 & p8<=5]] | p22<=3]] | A [~ [AF [p2<=p14]] U EX [p11<=2]]]]]]
normalized: [EG [[4<=p23 | [[~ [EG [~ [EX [p11<=2]]]] & ~ [E [~ [EX [p11<=2]] U [~ [EG [~ [p2<=p14]]] & ~ [EX [p11<=2]]]]]] | [[p22<=3 | ~ [[1<=p18 & p8<=5]]] | ~ [EG [~ [[p25<=p6 | p13<=p22]]]]]]]] & EX [E [p8<=2 U E [1<=p2 U ~ [[1<=p9 | p19<=4]]]]]]

abstracting: (p19<=4)
states: 1,187,228 (6)
abstracting: (1<=p9)
states: 441,406 (5)
abstracting: (1<=p2)
states: 173,451 (5)
abstracting: (p8<=2)
states: 1,135,890 (6)
.abstracting: (p13<=p22)
states: 705,322 (5)
abstracting: (p25<=p6)
states: 685,004 (5)
...................................................................
EG iterations: 67
abstracting: (p8<=5)
states: 1,187,984 (6)
abstracting: (1<=p18)
states: 677,040 (5)
abstracting: (p22<=3)
states: 1,179,836 (6)
abstracting: (p11<=2)
states: 1,097,024 (6)
.abstracting: (p2<=p14)
states: 1,053,633 (6)
..................................................................
EG iterations: 66
abstracting: (p11<=2)
states: 1,097,024 (6)
.abstracting: (p11<=2)
states: 1,097,024 (6)
.........................................................
EG iterations: 56
abstracting: (4<=p23)
states: 8,148 (3)

EG iterations: 0
-> the formula is TRUE

FORMULA HouseConstruction-PT-00005-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.328sec

checking: AF [[[EG [3<=p5] & [[A [p12<=3 U [p3<=p26 & p10<=1]] | AX [~ [2<=p14]]] & AF [EG [p3<=p21]]]] & [p27<=3 & E [[p4<=p1 & AF [2<=p14]] U [~ [[p25<=1 | 3<=p25]] & 2<=p12]]]]]
normalized: ~ [EG [~ [[[p27<=3 & E [[p4<=p1 & ~ [EG [~ [2<=p14]]]] U [2<=p12 & ~ [[p25<=1 | 3<=p25]]]]] & [[~ [EG [~ [EG [p3<=p21]]]] & [~ [EX [2<=p14]] | [~ [EG [~ [[p3<=p26 & p10<=1]]]] & ~ [E [~ [[p3<=p26 & p10<=1]] U [~ [p12<=3] & ~ [[p3<=p26 & p10<=1]]]]]]]] & EG [3<=p5]]]]]]

abstracting: (3<=p5)
states: 25,136 (4)
.....................................................
EG iterations: 53
abstracting: (p10<=1)
states: 1,106,294 (6)
abstracting: (p3<=p26)
states: 1,053,633 (6)
abstracting: (p12<=3)
states: 1,162,728 (6)
abstracting: (p10<=1)
states: 1,106,294 (6)
abstracting: (p3<=p26)
states: 1,053,633 (6)
abstracting: (p10<=1)
states: 1,106,294 (6)
abstracting: (p3<=p26)
states: 1,053,633 (6)
..........................................................................
EG iterations: 74
abstracting: (2<=p14)
states: 81,690 (4)
.abstracting: (p3<=p21)
states: 1,098,018 (6)
.......................
EG iterations: 23
.........................................................................
EG iterations: 73
abstracting: (3<=p25)
states: 90,960 (4)
abstracting: (p25<=1)
states: 932,516 (5)
abstracting: (2<=p12)
states: 359,261 (5)
abstracting: (2<=p14)
states: 81,690 (4)
.
EG iterations: 1
abstracting: (p4<=p1)
states: 104,688 (5)
abstracting: (p27<=3)
states: 1,164,548 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-00005-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.257sec

totally nodes used: 4233641 (4.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 8746301 8381001 17127302
used/not used/entry size/cache size: 11092298 56016566 16 1024MB
basic ops cache: hits/miss/sum: 3303017 3171583 6474600
used/not used/entry size/cache size: 5072323 11704893 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: 78816 64955 143771
used/not used/entry size/cache size: 64688 8323920 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 63268270
1 3522373
2 267730
3 37833
4 8011
5 2533
6 811
7 533
8 205
9 161
>= 10 404

Total processing time: 0m15.858sec


BK_STOP 1679943852934

--------------------
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:343 (19), effective:90 (5)

initing FirstDep: 0m 0.000sec


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

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

iterations count:343 (19), effective:90 (5)

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

iterations count:381 (21), effective:88 (4)

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

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

iterations count:104 (5), effective:28 (1)

iterations count:150 (8), effective:40 (2)

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

iterations count:36 (2), effective:6 (0)

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

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

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

iterations count:78 (4), effective:18 (1)

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

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

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

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

iterations count:168 (9), effective:45 (2)

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

iterations count:84 (4), effective:28 (1)

iterations count:119 (6), effective:29 (1)

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="HouseConstruction-PT-00005"
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 HouseConstruction-PT-00005, 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 r193-smll-167840340800521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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