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 SwimmingPool-PT-05, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r288su-ebro-143385262200125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433940980297

Model: SwimmingPool-PT-05
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

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=ReachabilityBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 9 NrTr: 7 NrArc: 20)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m38sec


-> reachability set: #nodes 88309 (8.8e+04) #states 591,371,001 (8)



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

checking: maxVal(Bags)<=3
normalized: maxVal(Bags)<=3

abstracting: (75<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Dress)<=1
normalized: maxVal(Dress)<=1

abstracting: (50<=1) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Entered)<=2
normalized: maxVal(Entered)<=2

abstracting: (100<=2) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Dressed)<=1
normalized: maxVal(Dressed)<=1

abstracting: (50<=1) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[maxVal(Out)<=2 & maxVal(Dress)<=3] & maxVal(WaitBag)<=2] & maxVal(Out)<=1] & maxVal(Undress)<=3] & [[maxVal(Undress)<=1 & maxVal(Bags)<=2] & [[maxVal(Undress)<=2 & maxVal(Bags)<=2] & maxVal(Dressed)<=1]]]
normalized: [[maxVal(Undress)<=3 & [maxVal(Out)<=1 & [maxVal(WaitBag)<=2 & [maxVal(Out)<=2 & maxVal(Dress)<=3]]]] & [[maxVal(Dressed)<=1 & [maxVal(Undress)<=2 & maxVal(Bags)<=2]] & [maxVal(Undress)<=1 & maxVal(Bags)<=2]]]

abstracting: (75<=2) states: 0
abstracting: (50<=1) states: 0
abstracting: (75<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=3) states: 0
abstracting: (100<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (100<=1) states: 0
abstracting: (50<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Out)<=3
normalized: maxVal(Out)<=3

abstracting: (100<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(Bags)<=3 & [[maxVal(Out)<=3 & maxVal(Dress)<=3] & [maxVal(Cabins)<=2 & maxVal(Cabins)<=2]]] & [maxVal(Cabins)<=1 & maxVal(Undress)<=3]] & [maxVal(Cabins)<=1 & [[maxVal(Undress)<=1 & [maxVal(Bags)<=3 & maxVal(Undress)<=1]] & [maxVal(InBath)<=1 & maxVal(Undress)<=3]]]] & [maxVal(WaitBag)<=3 & [maxVal(Undress)<=1 & maxVal(WaitBag)<=1]]]
normalized: [[maxVal(WaitBag)<=3 & [maxVal(Undress)<=1 & maxVal(WaitBag)<=1]] & [[maxVal(Cabins)<=1 & [[maxVal(InBath)<=1 & maxVal(Undress)<=3] & [maxVal(Undress)<=1 & [maxVal(Bags)<=3 & maxVal(Undress)<=1]]]] & [[maxVal(Cabins)<=1 & maxVal(Undress)<=3] & [maxVal(Bags)<=3 & [[maxVal(Cabins)<=2 & maxVal(Cabins)<=2] & [maxVal(Out)<=3 & maxVal(Dress)<=3]]]]]]

abstracting: (50<=3) states: 0
abstracting: (100<=3) states: 0
abstracting: (50<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (75<=3) states: 0
abstracting: (50<=3) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=1) states: 0
abstracting: (75<=3) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=3) states: 0
abstracting: (75<=1) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=1) states: 0
abstracting: (50<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Entered)<=3
normalized: maxVal(Entered)<=3

abstracting: (100<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Dressed)<=2
normalized: maxVal(Dressed)<=2

abstracting: (50<=2) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(InBath)<=2 & [[[[[maxVal(Dressed)<=3 & maxVal(Bags)<=1] & [maxVal(Entered)<=1 & maxVal(Dress)<=2]] & maxVal(InBath)<=3] & maxVal(Dress)<=2] & [maxVal(Dress)<=2 & [[[maxVal(Dressed)<=2 & maxVal(Undress)<=1] & maxVal(Dress)<=2] & maxVal(Dressed)<=2]]]]
normalized: [maxVal(InBath)<=2 & [[maxVal(Dress)<=2 & [maxVal(InBath)<=3 & [[maxVal(Entered)<=1 & maxVal(Dress)<=2] & [maxVal(Dressed)<=3 & maxVal(Bags)<=1]]]] & [maxVal(Dress)<=2 & [maxVal(Dressed)<=2 & [maxVal(Dress)<=2 & [maxVal(Dressed)<=2 & maxVal(Undress)<=1]]]]]]

abstracting: (50<=1) states: 0
abstracting: (50<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (50<=2) states: 0
abstracting: (75<=1) states: 0
abstracting: (50<=3) states: 0
abstracting: (50<=2) states: 0
abstracting: (100<=1) states: 0
abstracting: (75<=3) states: 0
abstracting: (50<=2) states: 0
abstracting: (75<=2) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(Bags)<=3 & [maxVal(Out)<=2 & [maxVal(InBath)<=3 & maxVal(Out)<=1]]]
normalized: [maxVal(Bags)<=3 & [maxVal(Out)<=2 & [maxVal(InBath)<=3 & maxVal(Out)<=1]]]

abstracting: (100<=1) states: 0
abstracting: (75<=3) states: 0
abstracting: (100<=2) states: 0
abstracting: (75<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Dressed)<=1
normalized: maxVal(Dressed)<=1

abstracting: (50<=1) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(WaitBag)<=3 & maxVal(WaitBag)<=2]
normalized: [maxVal(WaitBag)<=3 & maxVal(WaitBag)<=2]

abstracting: (50<=2) states: 0
abstracting: (50<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(Cabins)<=3 & [maxVal(Out)<=3 & maxVal(WaitBag)<=2]] & maxVal(Entered)<=2]
normalized: [maxVal(Entered)<=2 & [maxVal(Cabins)<=3 & [maxVal(Out)<=3 & maxVal(WaitBag)<=2]]]

abstracting: (50<=2) states: 0
abstracting: (100<=3) states: 0
abstracting: (50<=3) states: 0
abstracting: (100<=2) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(Dress)<=2
normalized: maxVal(Dress)<=2

abstracting: (50<=2) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: maxVal(InBath)<=3
normalized: maxVal(InBath)<=3

abstracting: (75<=3) states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-05-ReachabilityBounds-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m50sec


BK_STOP 1433941031273

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

212873 88308
iterations count:2007 (286), effective:600 (85)

initing FirstDep: 0m0sec

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="SwimmingPool-PT-05"
export BK_EXAMINATION="ReachabilityBounds"
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/SwimmingPool-PT-05.tgz
mv SwimmingPool-PT-05 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 SwimmingPool-PT-05, examination is ReachabilityBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r288su-ebro-143385262200125"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityBounds" != "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 "ReachabilityBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityBounds.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 '' ReachabilityBounds.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 ;