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.r129-smll-167819404200441.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 DoubleExponent-PT-001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819404200441
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680000509193

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=DoubleExponent-PT-001
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: DoubleExponent_PT_001
(NrP: 57 NrTr: 48 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 3.523sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 952 (9.5e+02) #states 149



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

checking: AX [EX [AF [1<=p37]]]
normalized: ~ [EX [~ [EX [~ [EG [~ [1<=p37]]]]]]]

abstracting: (1<=p37)
states: 2
......
EG iterations: 6
..-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (p40<=1)
states: 149

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EF [EF [p22<=1]]]
normalized: EX [E [true U E [true U p22<=1]]]

abstracting: (p22<=1)
states: 149
.-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [~ [EX [AG [p8<=0]]]]
normalized: ~ [EX [EX [~ [E [true U ~ [p8<=0]]]]]]

abstracting: (p8<=0)
states: 58
..-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EG [[p35<=1 & p23<=0]]
normalized: EG [[p35<=1 & p23<=0]]

abstracting: (p23<=0)
states: 147
abstracting: (p35<=1)
states: 149
.......
EG iterations: 7
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: A [p27<=1 U ~ [EF [~ [[~ [p41<=p1] | ~ [1<=p48]]]]]]
normalized: [~ [EG [E [true U ~ [[~ [1<=p48] | ~ [p41<=p1]]]]]] & ~ [E [E [true U ~ [[~ [1<=p48] | ~ [p41<=p1]]]] U [~ [p27<=1] & E [true U ~ [[~ [1<=p48] | ~ [p41<=p1]]]]]]]]

abstracting: (p41<=p1)
states: 148
abstracting: (1<=p48)
states: 11
abstracting: (p27<=1)
states: 149
abstracting: (p41<=p1)
states: 148
abstracting: (1<=p48)
states: 11
abstracting: (p41<=p1)
states: 148
abstracting: (1<=p48)
states: 11
...........
EG iterations: 11
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [AF [[EF [p42<=p18] | EX [EG [p35<=p36]]]]]
normalized: E [true U ~ [EG [~ [[EX [EG [p35<=p36]] | E [true U p42<=p18]]]]]]

abstracting: (p42<=p18)
states: 148
abstracting: (p35<=p36)
states: 143
.....
EG iterations: 5
..
EG iterations: 1
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EG [AF [~ [[EX [AG [p47<=0]] & A [EX [p34<=p17] U p51<=p19]]]]]
normalized: EG [~ [EG [[[~ [EG [~ [p51<=p19]]] & ~ [E [~ [p51<=p19] U [~ [EX [p34<=p17]] & ~ [p51<=p19]]]]] & EX [~ [E [true U ~ [p47<=0]]]]]]]]

abstracting: (p47<=0)
states: 146
.abstracting: (p51<=p19)
states: 140
abstracting: (p34<=p17)
states: 143
.abstracting: (p51<=p19)
states: 140
abstracting: (p51<=p19)
states: 140
..
EG iterations: 2
.........
EG iterations: 9

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [[AX [p35<=1] | A [[AX [~ [[p9<=1 & p43<=0]]] & 1<=p11] U ~ [1<=p43]]]]
normalized: ~ [[[~ [EG [1<=p43]] & ~ [E [1<=p43 U [~ [[~ [EX [[p9<=1 & p43<=0]]] & 1<=p11]] & 1<=p43]]]] | ~ [EX [~ [p35<=1]]]]]

abstracting: (p35<=1)
states: 149
.abstracting: (1<=p43)
states: 5
abstracting: (1<=p11)
states: 56
abstracting: (p43<=0)
states: 144
abstracting: (p9<=1)
states: 95
.abstracting: (1<=p43)
states: 5
abstracting: (1<=p43)
states: 5
..
EG iterations: 2
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [AG [[~ [[[A [1<=p18 U 1<=p20] | ~ [1<=p24]] | ~ [[p30<=1 | 1<=p31]]]] | AG [EF [p55<=0]]]]]
normalized: ~ [EG [E [true U ~ [[~ [E [true U ~ [E [true U p55<=0]]]] | ~ [[~ [[p30<=1 | 1<=p31]] | [~ [1<=p24] | [~ [EG [~ [1<=p20]]] & ~ [E [~ [1<=p20] U [~ [1<=p18] & ~ [1<=p20]]]]]]]]]]]]]

abstracting: (1<=p20)
states: 4
abstracting: (1<=p18)
states: 4
abstracting: (1<=p20)
states: 4
abstracting: (1<=p20)
states: 4
..............
EG iterations: 14
abstracting: (1<=p24)
states: 37
abstracting: (1<=p31)
states: 10
abstracting: (p30<=1)
states: 149
abstracting: (p55<=0)
states: 12
.
EG iterations: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: EG [[EF [E [[p49<=1 | p55<=p31] U 1<=p56]] | ~ [p25<=p53]]]
normalized: EG [[~ [p25<=p53] | E [true U E [[p49<=1 | p55<=p31] U 1<=p56]]]]

abstracting: (1<=p56)
states: 136
abstracting: (p55<=p31)
states: 14
abstracting: (p49<=1)
states: 149
abstracting: (p25<=p53)
states: 148

EG iterations: 0
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EG [[AX [~ [AG [1<=p53]]] & [1<=p47 & EX [A [1<=p45 U 1<=p24]]]]] & EX [~ [A [~ [[p21<=0 & 1<=p49]] U E [p51<=0 U ~ [1<=p44]]]]]]
normalized: [EX [~ [[~ [EG [~ [E [p51<=0 U ~ [1<=p44]]]]] & ~ [E [~ [E [p51<=0 U ~ [1<=p44]]] U [[p21<=0 & 1<=p49] & ~ [E [p51<=0 U ~ [1<=p44]]]]]]]]] & EG [[[1<=p47 & EX [[~ [EG [~ [1<=p24]]] & ~ [E [~ [1<=p24] U [~ [1<=p45] & ~ [1<=p24]]]]]]] & ~ [EX [~ [E [true U ~ [1<=p53]]]]]]]]

abstracting: (1<=p53)
states: 3
.abstracting: (1<=p24)
states: 37
abstracting: (1<=p45)
states: 3
abstracting: (1<=p24)
states: 37
abstracting: (1<=p24)
states: 37
........
EG iterations: 8
.abstracting: (1<=p47)
states: 3
..
EG iterations: 2
abstracting: (1<=p44)
states: 3
abstracting: (p51<=0)
states: 140
abstracting: (1<=p49)
states: 1
abstracting: (p21<=0)
states: 145
abstracting: (1<=p44)
states: 3
abstracting: (p51<=0)
states: 140
abstracting: (1<=p44)
states: 3
abstracting: (p51<=0)
states: 140
.
EG iterations: 1
.-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: A [AF [[[[EF [1<=p6] & p46<=1] & [EX [p35<=1] | AX [p9<=p28]]] | [E [AX [p14<=p47] U ~ [p53<=1]] & ~ [EF [p43<=p13]]]]] U 1<=p34]
normalized: [~ [EG [~ [1<=p34]]] & ~ [E [~ [1<=p34] U [EG [~ [[[~ [E [true U p43<=p13]] & E [~ [EX [~ [p14<=p47]]] U ~ [p53<=1]]] | [[~ [EX [~ [p9<=p28]]] | EX [p35<=1]] & [p46<=1 & E [true U 1<=p6]]]]]] & ~ [1<=p34]]]]]

abstracting: (1<=p34)
states: 6
abstracting: (1<=p6)
states: 1
abstracting: (p46<=1)
states: 149
abstracting: (p35<=1)
states: 149
.abstracting: (p9<=p28)
states: 31
.abstracting: (p53<=1)
states: 149
abstracting: (p14<=p47)
states: 147
.abstracting: (p43<=p13)
states: 148
.
EG iterations: 1
abstracting: (1<=p34)
states: 6
abstracting: (1<=p34)
states: 6
....
EG iterations: 4
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AF [E [A [[1<=p33 | [[p43<=1 | p24<=1] & [1<=p25 & 1<=p47]]] U [p19<=1 & AG [1<=p14]]] U ~ [[[[[1<=p8 | 1<=p49] | p44<=1] & 1<=p16] | p46<=1]]]]
normalized: ~ [EG [~ [E [[~ [EG [~ [[p19<=1 & ~ [E [true U ~ [1<=p14]]]]]]] & ~ [E [~ [[p19<=1 & ~ [E [true U ~ [1<=p14]]]]] U [~ [[1<=p33 | [[1<=p25 & 1<=p47] & [p43<=1 | p24<=1]]]] & ~ [[p19<=1 & ~ [E [true U ~ [1<=p14]]]]]]]]] U ~ [[p46<=1 | [1<=p16 & [p44<=1 | [1<=p8 | 1<=p49]]]]]]]]]

abstracting: (1<=p49)
states: 1
abstracting: (1<=p8)
states: 91
abstracting: (p44<=1)
states: 149
abstracting: (1<=p16)
states: 4
abstracting: (p46<=1)
states: 149
abstracting: (1<=p14)
states: 2
abstracting: (p19<=1)
states: 149
abstracting: (p24<=1)
states: 149
abstracting: (p43<=1)
states: 149
abstracting: (1<=p47)
states: 3
abstracting: (1<=p25)
states: 1
abstracting: (1<=p33)
states: 6
abstracting: (1<=p14)
states: 2
abstracting: (p19<=1)
states: 149
abstracting: (1<=p14)
states: 2
abstracting: (p19<=1)
states: 149

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: [~ [AF [[[~ [[p23<=p22 & p31<=0]] & AG [1<=p29]] & [AF [p43<=0] & [~ [p10<=p2] & [p40<=p4 | p18<=p47]]]]]] | ~ [A [p8<=p40 U ~ [AX [E [p27<=p52 U 1<=p50]]]]]]
normalized: [~ [[~ [EG [~ [EX [~ [E [p27<=p52 U 1<=p50]]]]]] & ~ [E [~ [EX [~ [E [p27<=p52 U 1<=p50]]]] U [~ [p8<=p40] & ~ [EX [~ [E [p27<=p52 U 1<=p50]]]]]]]]] | EG [~ [[[[[p40<=p4 | p18<=p47] & ~ [p10<=p2]] & ~ [EG [~ [p43<=0]]]] & [~ [E [true U ~ [1<=p29]]] & ~ [[p23<=p22 & p31<=0]]]]]]]

abstracting: (p31<=0)
states: 139
abstracting: (p23<=p22)
states: 147
abstracting: (1<=p29)
states: 2
abstracting: (p43<=0)
states: 144
..
EG iterations: 2
abstracting: (p10<=p2)
states: 24
abstracting: (p18<=p47)
states: 145
abstracting: (p40<=p4)
states: 147

EG iterations: 0
abstracting: (1<=p50)
states: 9
abstracting: (p27<=p52)
states: 145
.abstracting: (p8<=p40)
states: 59
abstracting: (1<=p50)
states: 9
abstracting: (p27<=p52)
states: 145
.abstracting: (1<=p50)
states: 9
abstracting: (p27<=p52)
states: 145
...........
EG iterations: 10
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AX [A [[[EF [p54<=p44] | p56<=p11] | ~ [[[~ [p31<=p3] & ~ [1<=p29]] & [E [p17<=0 U p52<=p50] | E [p4<=p9 U p6<=p13]]]]] U [p39<=1 & EX [~ [[1<=p39 & 1<=p28]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[p39<=1 & EX [~ [[1<=p39 & 1<=p28]]]]]]] & ~ [E [~ [[p39<=1 & EX [~ [[1<=p39 & 1<=p28]]]]] U [~ [[~ [[[E [p4<=p9 U p6<=p13] | E [p17<=0 U p52<=p50]] & [~ [1<=p29] & ~ [p31<=p3]]]] | [p56<=p11 | E [true U p54<=p44]]]] & ~ [[p39<=1 & EX [~ [[1<=p39 & 1<=p28]]]]]]]]]]]]

abstracting: (1<=p28)
states: 4
abstracting: (1<=p39)
states: 2
.abstracting: (p39<=1)
states: 149
abstracting: (p54<=p44)
states: 146
abstracting: (p56<=p11)
states: 31
abstracting: (p31<=p3)
states: 139
abstracting: (1<=p29)
states: 2
abstracting: (p52<=p50)
states: 140
abstracting: (p17<=0)
states: 145
abstracting: (p6<=p13)
states: 149
abstracting: (p4<=p9)
states: 148
abstracting: (1<=p28)
states: 4
abstracting: (1<=p39)
states: 2
.abstracting: (p39<=1)
states: 149
abstracting: (1<=p28)
states: 4
abstracting: (1<=p39)
states: 2
.abstracting: (p39<=1)
states: 149
.
EG iterations: 1
.-> the formula is TRUE

FORMULA DoubleExponent-PT-001-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 39496 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 98207 238587 336794
used/not used/entry size/cache size: 283906 66824958 16 1024MB
basic ops cache: hits/miss/sum: 11920 54727 66647
used/not used/entry size/cache size: 81663 16695553 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: 909 3083 3992
used/not used/entry size/cache size: 3083 8385525 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 67071443
1 36358
2 970
3 49
4 8
5 6
6 2
7 3
8 7
9 1
>= 10 17

Total processing time: 0m 5.297sec


BK_STOP 1680000514558

--------------------
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:1075 (22), effective:112 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:409 (8), effective:43 (0)

iterations count:568 (11), effective:55 (1)

iterations count:568 (11), effective:55 (1)

iterations count:568 (11), effective:55 (1)

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

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

iterations count:559 (11), effective:54 (1)

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

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

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

iterations count:175 (3), effective:12 (0)

iterations count:410 (8), effective:23 (0)

iterations count:177 (3), effective:13 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:288 (6), effective:18 (0)

iterations count:288 (6), effective:18 (0)

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

iterations count:288 (6), effective:18 (0)

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

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

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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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 r129-smll-167819404200441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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