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 RwMutex-PT-r0010w2000, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650200099
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432981403352

Model: RwMutex-PT-r0010w2000
reachability algorithm:
Transition chaining algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=2 --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=2 --place-order=5

parse successfull
net created successfully

(NrP: 4030 NrTr: 4020 NrArc: 48060)

net check time: 0m0sec

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

init dd package: 0m12sec


RS generation: 3m41sec


-> reachability set: #nodes 846141 (8.5e+05) #states 3,024 (3)



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

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

abstracting: (1<=1) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p1643)<=1 & [[[maxVal(p3099)<=2 & [maxVal(p3876)<=3 & maxVal(p1387)<=3]] & maxVal(p2997)<=3] & maxVal(p96)<=1]] & maxVal(p1423)<=3]
normalized: [maxVal(p1423)<=3 & [maxVal(p1643)<=1 & [maxVal(p96)<=1 & [maxVal(p2997)<=3 & [maxVal(p3099)<=2 & [maxVal(p3876)<=3 & maxVal(p1387)<=3]]]]]]

abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p2719)<=2 & [[maxVal(p108)<=2 & maxVal(p971)<=2] & maxVal(p3733)<=3]]
normalized: [maxVal(p2719)<=2 & [maxVal(p3733)<=3 & [maxVal(p108)<=2 & maxVal(p971)<=2]]]

abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p1867)<=3 & [[maxVal(p1082)<=2 & [[maxVal(p2289)<=3 & maxVal(p518)<=3] & [maxVal(p575)<=2 & maxVal(p3976)<=1]]] & maxVal(p3229)<=1]] & [maxVal(p3845)<=1 & [maxVal(p506)<=3 & [maxVal(p838)<=2 & maxVal(p2263)<=1]]]]
normalized: [[maxVal(p3845)<=1 & [maxVal(p506)<=3 & [maxVal(p838)<=2 & maxVal(p2263)<=1]]] & [maxVal(p1867)<=3 & [maxVal(p3229)<=1 & [maxVal(p1082)<=2 & [[maxVal(p575)<=2 & maxVal(p3976)<=1] & [maxVal(p2289)<=3 & maxVal(p518)<=3]]]]]]

abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
abstracting: (1<=2) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p1723)<=3 & maxVal(p3901)<=3] & maxVal(p3741)<=1]
normalized: [maxVal(p3741)<=1 & [maxVal(p1723)<=3 & maxVal(p3901)<=3]]

abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=3) states: 3,024 (3)
abstracting: (1<=1) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 3,024 (3)
-> the formula is TRUE

FORMULA RwMutex-PT-r0010w2000-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 11m47sec


BK_STOP 1432982111089

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

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="RwMutex-PT-r0010w2000"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/RwMutex-PT-r0010w2000.tgz
mv RwMutex-PT-r0010w2000 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 RwMutex-PT-r0010w2000, 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 r092kn-qhx2-143267650200099"
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 ;