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-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503700347
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432538322880

Model: HouseConstruction-PT-010
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=ReachabilityCardinality.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: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 26071 (2.6e+04) #states 1,663,565,805 (9)



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

checking: EF [[[2<=p14 & ~ [2<=p17]] & ~ [~ [2<=p18]]]]
normalized: E [true U [2<=p18 & [2<=p14 & ~ [2<=p17]]]]

abstracting: (2<=p17) states: 310,208,535 (8)
abstracting: (2<=p14) states: 310,208,535 (8)
abstracting: (2<=p18) states: 783,069,249 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [[p14<=p26 & 3<=p13]] & [[p20<=p17 & 3<=p17] & [p14<=p23 & 2<=p15]]]]
normalized: E [true U [[[p14<=p23 & 2<=p15] & [p20<=p17 & 3<=p17]] & ~ [[p14<=p26 & 3<=p13]]]]

abstracting: (3<=p13) states: 452,914,851 (8)
abstracting: (p14<=p26) states: 1,142,475,414 (9)
abstracting: (3<=p17) states: 119,407,818 (8)
abstracting: (p20<=p17) states: 951,734,360 (8)
abstracting: (2<=p15) states: 678,577,647 (8)
abstracting: (p14<=p23) states: 1,228,493,109 (9)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 23m37sec

checking: EF [2<=p20]
normalized: E [true U 2<=p20]

abstracting: (2<=p20) states: 516,848,925 (8)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[p15<=p5 | p5<=p6] | [p17<=p15 & p20<=p13]] | ~ [[p2<=p20 & 2<=p7]]]]
normalized: ~ [E [true U ~ [[~ [[p2<=p20 & 2<=p7]] | [[p17<=p15 & p20<=p13] | [p15<=p5 | p5<=p6]]]]]]

abstracting: (p5<=p6) states: 1,059,607,010 (9)
abstracting: (p15<=p5) states: 904,401,008 (8)
abstracting: (p20<=p13) states: 1,199,737,349 (9)
abstracting: (p17<=p15) states: 1,309,261,690 (9)
abstracting: (2<=p7) states: 678,577,647 (8)
abstracting: (p2<=p20) states: 1,406,158,047 (9)
-> the formula is FALSE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m57sec

checking: AG [[p17<=p3 | p23<=p7]]
normalized: ~ [E [true U ~ [[p17<=p3 | p23<=p7]]]]

abstracting: (p23<=p7) states: 1,147,506,140 (9)
abstracting: (p17<=p3) states: 1,059,607,010 (9)
-> the formula is FALSE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 16m2sec

checking: AG [~ [[3<=p26 | [1<=p21 & p1<=p4]]]]
normalized: ~ [E [true U [3<=p26 | [1<=p21 & p1<=p4]]]]

abstracting: (p1<=p4) states: 1,642,958,641 (9)
abstracting: (1<=p21) states: 1,196,773,710 (9)
abstracting: (3<=p26) states: 119,407,818 (8)
-> the formula is FALSE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [[[~ [2<=p9] | p13<=p4] | [~ [1<=p3] | p5<=p22]]]
normalized: ~ [E [true U ~ [[[p5<=p22 | ~ [1<=p3]] | [p13<=p4 | ~ [2<=p9]]]]]]

abstracting: (2<=p9) states: 445,544,319 (8)
abstracting: (p13<=p4) states: 1,565,233,466 (9)
abstracting: (1<=p3) states: 490,042,604 (8)
abstracting: (p5<=p22) states: 1,105,826,931 (9)
-> the formula is FALSE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m53sec

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

abstracting: (p20<=p20) states: 1,663,565,805 (9)
-> the formula is TRUE

FORMULA HouseConstruction-PT-010-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m25sec

checking: AG [p18<=p1]
normalized: ~ [E [true U ~ [p18<=p1]]]

abstracting: (p18<=p1) states: 623,968,270 (8)

BK_TIME_CONFINEMENT_REACHED

--------------------
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:628 (34), effective:180 (10)

initing FirstDep: 0m0sec


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

iterations count:59 (3), effective:15 (0)

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

iterations count:49 (2), effective:11 (0)

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

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

iterations count:58 (3), effective:9 (0)

iterations count:46 (2), effective:9 (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-010"
export BK_EXAMINATION="ReachabilityCardinality"
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-010.tgz
mv HouseConstruction-PT-010 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-010, examination is ReachabilityCardinality"
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-143236503700347"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;