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-2265
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 r050kn-ebro-143236503600314
=====================================================================

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

Model: HouseConstruction-PT-002
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Plain order (as read)
--memory=6 --suppress --rs-algorithm=3 --place-order=1

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=1

parse successfull
net created successfully

(NrP: 26 NrTr: 18 NrArc: 51)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m7sec


RS generation: 0m0sec


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



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

checking: EG [[[[3<=p21 | 3<=p17] | [p16<=p9 & p1<=p11]] | AX [p22<=p18]]]
normalized: EG [[~ [EX [~ [p22<=p18]]] | [[p16<=p9 & p1<=p11] | [3<=p21 | 3<=p17]]]]

abstracting: (3<=p17) states: 0
abstracting: (3<=p21) states: 0
abstracting: (p1<=p11) states: 1,447 (3)
abstracting: (p16<=p9) states: 1,120 (3)
abstracting: (p22<=p18) states: 1,321 (3)
..
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: [EG [~ [2<=p23]] | A [[p14<=p27 & 3<=p18] U [3<=p13 & p22<=p6]]]
normalized: [[~ [EG [~ [[3<=p13 & p22<=p6]]]] & ~ [E [~ [[p14<=p27 & 3<=p18]] U [~ [[p14<=p27 & 3<=p18]] & ~ [[3<=p13 & p22<=p6]]]]]] | EG [~ [2<=p23]]]

abstracting: (2<=p23) states: 45
.
EG iterations: 1
abstracting: (p22<=p6) states: 1,146 (3)
abstracting: (3<=p13) states: 0
abstracting: (3<=p18) states: 0
abstracting: (p14<=p27) states: 1,336 (3)
abstracting: (3<=p18) states: 0
abstracting: (p14<=p27) states: 1,336 (3)
abstracting: (p22<=p6) states: 1,146 (3)
abstracting: (3<=p13) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[E [p18<=p14 U 3<=p10] | AX [[2<=p20 & p2<=p17]]]]
normalized: ~ [[~ [EX [~ [[2<=p20 & p2<=p17]]]] | E [p18<=p14 U 3<=p10]]]

abstracting: (3<=p10) states: 0
abstracting: (p18<=p14) states: 1,006 (3)
abstracting: (p2<=p17) states: 1,440 (3)
abstracting: (2<=p20) states: 45
.-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [~ [[[3<=p5 | 3<=p17] | [p11<=p23 | 2<=p2]]]]
normalized: ~ [EG [[[p11<=p23 | 2<=p2] | [3<=p5 | 3<=p17]]]]

abstracting: (3<=p17) states: 0
abstracting: (3<=p5) states: 0
abstracting: (2<=p2) states: 1
abstracting: (p11<=p23) states: 1,154 (3)
.....
EG iterations: 5
-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [E [2<=p13 U p21<=p27]]
normalized: EG [E [2<=p13 U p21<=p27]]

abstracting: (p21<=p27) states: 1,171 (3)
abstracting: (2<=p13) states: 56
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [~ [EF [p8<=p3]]]
normalized: E [true U ~ [E [true U p8<=p3]]]

abstracting: (p8<=p3) states: 1,111 (3)
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (2<=p19) states: 45
............
EG iterations: 12
abstracting: (3<=p18) 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: 0m0sec

checking: [EG [p17<=p2] & ~ [AX [~ [p6<=p25]]]]
normalized: [EX [p6<=p25] & EG [p17<=p2]]

abstracting: (p17<=p2) states: 1,296 (3)
...............................
EG iterations: 31
abstracting: (p6<=p25) states: 1,398 (3)
.-> the formula is FALSE

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

MC time: 0m0sec

checking: [AF [AF [3<=p23]] | 2<=p19]
normalized: [2<=p19 | ~ [EG [EG [~ [3<=p23]]]]]

abstracting: (3<=p23) states: 0

EG iterations: 0

EG iterations: 0
abstracting: (2<=p19) states: 45
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [AF [[p27<=p5 & 3<=p8]]]
normalized: E [true U ~ [EG [~ [[p27<=p5 & 3<=p8]]]]]

abstracting: (3<=p8) states: 0
abstracting: (p27<=p5) states: 1,006 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[E [p26<=p4 U p1<=p6] & ~ [[p7<=p26 & [p18<=p11 | p25<=p21]]]] | ~ [[[[p17<=p18 & 1<=p17] & [3<=p18 | 2<=p16]] | AF [1<=p21]]]]
normalized: [~ [[~ [EG [~ [1<=p21]]] | [[3<=p18 | 2<=p16] & [p17<=p18 & 1<=p17]]]] | [E [p26<=p4 U p1<=p6] & ~ [[p7<=p26 & [p18<=p11 | p25<=p21]]]]]

abstracting: (p25<=p21) states: 1,199 (3)
abstracting: (p18<=p11) states: 1,105 (3)
abstracting: (p7<=p26) states: 1,110 (3)
abstracting: (p1<=p6) states: 1,437 (3)
abstracting: (p26<=p4) states: 1,451 (3)
abstracting: (1<=p17) states: 210
abstracting: (p17<=p18) states: 1,336 (3)
abstracting: (2<=p16) states: 75
abstracting: (3<=p18) states: 0
abstracting: (1<=p21) states: 540
................................
EG iterations: 32
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [AF [[p6<=p10 & p4<=p9]]]
normalized: ~ [E [true U EG [~ [[p6<=p10 & p4<=p9]]]]]

abstracting: (p4<=p9) states: 453
abstracting: (p6<=p10) states: 1,385 (3)
................................
EG iterations: 32
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[E [p15<=p1 U 3<=p2] & AF [2<=p16]]]
normalized: ~ [[~ [EG [~ [2<=p16]]] & E [p15<=p1 U 3<=p2]]]

abstracting: (3<=p2) states: 0
abstracting: (p15<=p1) states: 1,067 (3)
abstracting: (2<=p16) states: 75
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m0sec

checking: E [p22<=p11 U EX [3<=p12]]
normalized: E [p22<=p11 U EX [3<=p12]]

abstracting: (3<=p12) states: 0
.abstracting: (p22<=p11) states: 1,231 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [AF [AF [1<=p20]]]
normalized: EG [EG [~ [1<=p20]]]

abstracting: (1<=p20) states: 375
..........................
EG iterations: 26
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m13sec


BK_STOP 1432538228898

--------------------
content from stderr:

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: 0m0sec


iterations count:140 (7), effective:36 (2)

initing FirstDep: 0m0sec


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

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

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

iterations count:26 (1), effective:3 (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="/users/gast00/fkordon/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-2265"
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 r050kn-ebro-143236503600314"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;