Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is HouseConstruction-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440255400597
=====================================================================

--------------------
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-002-CTLCardinality-0
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-1
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-10
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-11
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-12
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-13
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-14
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-15
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-2
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-3
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-4
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-5
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-6
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-7
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-8
FORMULA_NAME HouseConstruction-PT-002-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494466323638

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: HouseConstruction_PT_002
(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 1.181sec

parse successfull
net created successfully

Net: HouseConstruction_PT_002
(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.827sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 258 (2.6e+02) #states 1,501 (3)



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

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

abstracting: (2<=p18)
states: 90
.
EG iterations: 1
..............
EG iterations: 14
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AF [~ [~ [3<=p9]]]
normalized: ~ [EG [~ [3<=p9]]]

abstracting: (3<=p9)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [AX [AF [3<=p9]]]
normalized: EX [EG [~ [3<=p9]]]

abstracting: (3<=p9)
states: 0

EG iterations: 0
.-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [p12<=p3]]
normalized: ~ [EG [E [true U ~ [p12<=p3]]]]

abstracting: (p12<=p3)
states: 936
..............................
EG iterations: 30
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EG [~ [~ [p21<=p8]]]
normalized: EG [p21<=p8]

abstracting: (p21<=p8)
states: 1,051 (3)
...................................
EG iterations: 35
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EG [p17<=p5]
normalized: EG [p17<=p5]

abstracting: (p17<=p5)
states: 1,311 (3)
...............................
EG iterations: 31
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [p12<=p12]
normalized: EG [p12<=p12]

abstracting: (p12<=p12)
states: 1,501 (3)

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: A [EX [p23<=p4] U EF [3<=p21]]
normalized: [~ [EG [~ [E [true U 3<=p21]]]] & ~ [E [~ [E [true U 3<=p21]] U [~ [EX [p23<=p4]] & ~ [E [true U 3<=p21]]]]]]

abstracting: (3<=p21)
states: 0
abstracting: (p23<=p4)
states: 1,404 (3)
.abstracting: (3<=p21)
states: 0
abstracting: (3<=p21)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [AX [[1<=p26 & p27<=p22]]]
normalized: E [true U ~ [EX [~ [[1<=p26 & p27<=p22]]]]]

abstracting: (p27<=p22)
states: 1,021 (3)
abstracting: (1<=p26)
states: 210
.-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [EX [[p4<=p3 | 1<=p16]]]
normalized: EG [EX [[p4<=p3 | 1<=p16]]]

abstracting: (1<=p16)
states: 446
abstracting: (p4<=p3)
states: 369
......................................
EG iterations: 37
-> the formula is FALSE

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

MC time: 0m 0.019sec

checking: E [[p13<=p3 | ~ [p27<=p12]] U AX [3<=p16]]
normalized: E [[~ [p27<=p12] | p13<=p3] U ~ [EX [~ [3<=p16]]]]

abstracting: (3<=p16)
states: 0
.abstracting: (p13<=p3)
states: 1,056 (3)
abstracting: (p27<=p12)
states: 1,081 (3)
-> the formula is FALSE

FORMULA HouseConstruction-PT-002-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [~ [~ [1<=p15]]] | [EG [~ [p4<=p9]] & [[p2<=p12 & ~ [1<=p19]] & 3<=p21]]]
normalized: [~ [EG [~ [1<=p15]]] | [[[~ [1<=p19] & p2<=p12] & 3<=p21] & EG [~ [p4<=p9]]]]

abstracting: (p4<=p9)
states: 453
................................
EG iterations: 32
abstracting: (3<=p21)
states: 0
abstracting: (p2<=p12)
states: 1,450 (3)
abstracting: (1<=p19)
states: 375
abstracting: (1<=p15)
states: 446
..............................
EG iterations: 30
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: [EG [[[p1<=p16 | p18<=p10] & ~ [3<=p22]]] | E [~ [p17<=p27] U [3<=p2 & p22<=p4]]]
normalized: [E [~ [p17<=p27] U [3<=p2 & p22<=p4]] | EG [[~ [3<=p22] & [p1<=p16 | p18<=p10]]]]

abstracting: (p18<=p10)
states: 1,006 (3)
abstracting: (p1<=p16)
states: 1,447 (3)
abstracting: (3<=p22)
states: 0
.
EG iterations: 1
abstracting: (p22<=p4)
states: 1,404 (3)
abstracting: (3<=p2)
states: 0
abstracting: (p17<=p27)
states: 1,336 (3)
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [[EG [[1<=p13 & 3<=p17]] | A [p15<=p13 U p1<=p16]] | AF [[[3<=p9 | p17<=p16] & 2<=p14]]]
normalized: [~ [EG [~ [[2<=p14 & [3<=p9 | p17<=p16]]]]] | [[~ [EG [~ [p1<=p16]]] & ~ [E [~ [p1<=p16] U [~ [p15<=p13] & ~ [p1<=p16]]]]] | EG [[1<=p13 & 3<=p17]]]]

abstracting: (3<=p17)
states: 0
abstracting: (1<=p13)
states: 456
.
EG iterations: 1
abstracting: (p1<=p16)
states: 1,447 (3)
abstracting: (p15<=p13)
states: 1,171 (3)
abstracting: (p1<=p16)
states: 1,447 (3)
abstracting: (p1<=p16)
states: 1,447 (3)
.................
EG iterations: 17
abstracting: (p17<=p16)
states: 1,353 (3)
abstracting: (3<=p9)
states: 0
abstracting: (2<=p14)
states: 15
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.007sec

checking: [[[p13<=p17 & AF [1<=p11]] | ~ [[[p22<=p22 & p5<=p13] | 3<=p11]]] & EF [~ [[p1<=p2 | p1<=p8]]]]
normalized: [E [true U ~ [[p1<=p2 | p1<=p8]]] & [~ [[3<=p11 | [p22<=p22 & p5<=p13]]] | [p13<=p17 & ~ [EG [~ [1<=p11]]]]]]

abstracting: (1<=p11)
states: 446
............................
EG iterations: 28
abstracting: (p13<=p17)
states: 1,080 (3)
abstracting: (p5<=p13)
states: 1,276 (3)
abstracting: (p22<=p22)
states: 1,501 (3)
abstracting: (3<=p11)
states: 0
abstracting: (p1<=p8)
states: 1,445 (3)
abstracting: (p1<=p2)
states: 1,436 (3)
-> the formula is TRUE

FORMULA HouseConstruction-PT-002-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: [~ [EG [[1<=p3 | p19<=p20]]] & [[[~ [2<=p20] | [3<=p3 & 3<=p9]] & [p3<=p3 & 1<=p21]] | EF [[p22<=p4 & p13<=p19]]]]
normalized: [[[[~ [2<=p20] | [3<=p3 & 3<=p9]] & [p3<=p3 & 1<=p21]] | E [true U [p22<=p4 & p13<=p19]]] & ~ [EG [[1<=p3 | p19<=p20]]]]

abstracting: (p19<=p20)
states: 1,501 (3)
abstracting: (1<=p3)
states: 66

EG iterations: 0
abstracting: (p13<=p19)
states: 1,115 (3)
abstracting: (p22<=p4)
states: 1,404 (3)
abstracting: (1<=p21)
states: 540
abstracting: (p3<=p3)
states: 1,501 (3)
abstracting: (3<=p9)
states: 0
abstracting: (3<=p3)
states: 0
abstracting: (2<=p20)
states: 45
-> the formula is FALSE

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

MC time: 0m 0.003sec

totally nodes used: 69581 (7.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 73324 143818 217142
used/not used/entry size/cache size: 207237 66901627 16 1024MB
basic ops cache: hits/miss/sum: 18989 45469 64458
used/not used/entry size/cache size: 87805 16689411 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: 1011 1839 2850
used/not used/entry size/cache size: 1839 8386769 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 67041966
1 64621
2 2075
3 134
4 26
5 7
6 11
7 9
8 8
9 3
>= 10 4

Total processing time: 0m 6.918sec


BK_STOP 1494466330661

--------------------
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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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:77 (4), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

iterations count:101 (5), effective:27 (1)

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

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

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

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

iterations count:38 (2), effective:7 (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="HouseConstruction-PT-002"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-002.tgz
mv HouseConstruction-PT-002 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is HouseConstruction-PT-002, 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 r021-blw3-149440255400597"
echo "====================================================================="
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
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 ;