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-2270
Executing tool marcie
Input is Parking-PT-104, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800138
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433637776795

Model: Parking-PT-104
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: 65 NrTr: 97 NrArc: 284)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 444 (4.4e+02) #states 31,745 (4)



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

checking: [maxVal(p7)<=3 & [[[maxVal(p39)<=2 & [[maxVal(p63)<=1 & maxVal(p17)<=1] & maxVal(p39)<=3]] & [[maxVal(p2)<=1 & maxVal(p53)<=1] & [maxVal(p54)<=2 & [maxVal(p39)<=3 & maxVal(p20)<=3]]]] & [maxVal(p46)<=1 & [maxVal(p4)<=3 & maxVal(p62)<=3]]]]
normalized: [maxVal(p7)<=3 & [[[maxVal(p39)<=2 & [maxVal(p39)<=3 & [maxVal(p63)<=1 & maxVal(p17)<=1]]] & [[maxVal(p2)<=1 & maxVal(p53)<=1] & [maxVal(p54)<=2 & [maxVal(p39)<=3 & maxVal(p20)<=3]]]] & [maxVal(p46)<=1 & [maxVal(p4)<=3 & maxVal(p62)<=3]]]]

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

FORMULA Parking-PT-104-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Parking-PT-104-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p23)<=1 & [[[[maxVal(p1)<=3 & maxVal(p34)<=1] & [[maxVal(p26)<=3 & maxVal(p15)<=3] & maxVal(p30)<=3]] & [maxVal(p58)<=2 & [[maxVal(p44)<=2 & maxVal(p34)<=2] & maxVal(p54)<=2]]] & maxVal(p19)<=1]]
normalized: [maxVal(p23)<=1 & [maxVal(p19)<=1 & [[[maxVal(p1)<=3 & maxVal(p34)<=1] & [maxVal(p30)<=3 & [maxVal(p26)<=3 & maxVal(p15)<=3]]] & [maxVal(p58)<=2 & [maxVal(p54)<=2 & [maxVal(p44)<=2 & maxVal(p34)<=2]]]]]]

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

FORMULA Parking-PT-104-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[maxVal(p18)<=1 & [maxVal(p15)<=1 & maxVal(p16)<=3]] & maxVal(p41)<=1] & maxVal(p39)<=2] & [maxVal(p29)<=1 & maxVal(p38)<=1]] & maxVal(p36)<=1]
normalized: [maxVal(p36)<=1 & [[maxVal(p39)<=2 & [maxVal(p41)<=1 & [maxVal(p18)<=1 & [maxVal(p15)<=1 & maxVal(p16)<=3]]]] & [maxVal(p29)<=1 & maxVal(p38)<=1]]]

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

FORMULA Parking-PT-104-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p24)<=1 & [[maxVal(p16)<=1 & [[[maxVal(p49)<=1 & maxVal(p49)<=2] & maxVal(p44)<=1] & maxVal(p5)<=1]] & maxVal(p11)<=1]]
normalized: [maxVal(p24)<=1 & [maxVal(p11)<=1 & [maxVal(p16)<=1 & [maxVal(p5)<=1 & [maxVal(p44)<=1 & [maxVal(p49)<=1 & maxVal(p49)<=2]]]]]]

abstracting: (1<=2) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p40)<=1 & maxVal(p31)<=2] & [[maxVal(p54)<=1 & [maxVal(p6)<=2 & maxVal(p8)<=3]] & [maxVal(p9)<=1 & maxVal(p20)<=3]]] & maxVal(p46)<=1]
normalized: [maxVal(p46)<=1 & [[maxVal(p40)<=1 & maxVal(p31)<=2] & [[maxVal(p54)<=1 & [maxVal(p6)<=2 & maxVal(p8)<=3]] & [maxVal(p9)<=1 & maxVal(p20)<=3]]]]

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

FORMULA Parking-PT-104-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p18)<=1 & maxVal(p2)<=1]
normalized: [maxVal(p18)<=1 & maxVal(p2)<=1]

abstracting: (1<=1) states: 31,745 (4)
abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 31,745 (4)
-> the formula is TRUE

FORMULA Parking-PT-104-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[maxVal(p42)<=1 & maxVal(p2)<=3] & [[maxVal(p17)<=3 & maxVal(p16)<=1] & [[maxVal(p64)<=1 & maxVal(p19)<=3] & maxVal(p64)<=1]]] & [maxVal(p53)<=1 & maxVal(p17)<=3]] & maxVal(p16)<=2]
normalized: [maxVal(p16)<=2 & [[[[maxVal(p17)<=3 & maxVal(p16)<=1] & [maxVal(p64)<=1 & [maxVal(p64)<=1 & maxVal(p19)<=3]]] & [maxVal(p42)<=1 & maxVal(p2)<=3]] & [maxVal(p53)<=1 & maxVal(p17)<=3]]]

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

FORMULA Parking-PT-104-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Parking-PT-104-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433637782411

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

416
iterations count:1147 (11), effective:103 (1)

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="Parking-PT-104"
export BK_EXAMINATION="ReachabilityBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/Parking-PT-104.tgz
mv Parking-PT-104 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is Parking-PT-104, 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 r232su-smll-143354324800138"
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 ;