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 Vasy2003-PT-none, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r106kn-smll-143285115500450
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433209843595

Model: Vasy2003-PT-none
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: 485 NrTr: 776 NrArc: 2809)

net check time: 0m0sec

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

init dd package: 0m3sec


RS generation: 0m17sec


-> reachability set: #nodes 11506 (1.2e+04) #states 9,794,739,147,610,899,087,361 (21)



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

checking: [[maxVal(p439)<=2 & maxVal(p420)<=3] & maxVal(p66)<=3]
normalized: [maxVal(p66)<=3 & [maxVal(p439)<=2 & maxVal(p420)<=3]]

abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p209)<=2 & [[maxVal(p112)<=2 & [maxVal(p257)<=1 & maxVal(p265)<=3]] & [maxVal(p101)<=1 & [[maxVal(p105)<=1 & maxVal(p405)<=3] & [maxVal(p50)<=3 & maxVal(p392)<=2]]]]] & [maxVal(p109)<=1 & maxVal(p330)<=2]]
normalized: [[maxVal(p209)<=2 & [[maxVal(p101)<=1 & [[maxVal(p105)<=1 & maxVal(p405)<=3] & [maxVal(p50)<=3 & maxVal(p392)<=2]]] & [maxVal(p112)<=2 & [maxVal(p257)<=1 & maxVal(p265)<=3]]]] & [maxVal(p109)<=1 & maxVal(p330)<=2]]

abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p401)<=1 & [maxVal(p252)<=2 & maxVal(p207)<=2]]
normalized: [maxVal(p401)<=1 & [maxVal(p252)<=2 & maxVal(p207)<=2]]

abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[[maxVal(p130)<=1 & maxVal(p227)<=1] & maxVal(p7)<=1] & maxVal(p383)<=3] & [[[maxVal(p87)<=3 & maxVal(p385)<=3] & [maxVal(p245)<=1 & maxVal(p417)<=3]] & maxVal(p178)<=1]] & [[maxVal(p189)<=3 & [maxVal(p97)<=1 & maxVal(p464)<=1]] & [[maxVal(p404)<=2 & [maxVal(p333)<=3 & maxVal(p339)<=3]] & maxVal(p256)<=3]]] & maxVal(p49)<=1]
normalized: [maxVal(p49)<=1 & [[[maxVal(p189)<=3 & [maxVal(p97)<=1 & maxVal(p464)<=1]] & [maxVal(p256)<=3 & [maxVal(p404)<=2 & [maxVal(p333)<=3 & maxVal(p339)<=3]]]] & [[maxVal(p178)<=1 & [[maxVal(p87)<=3 & maxVal(p385)<=3] & [maxVal(p245)<=1 & maxVal(p417)<=3]]] & [maxVal(p383)<=3 & [maxVal(p7)<=1 & [maxVal(p130)<=1 & maxVal(p227)<=1]]]]]]

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p447)<=3 & maxVal(p220)<=2] & maxVal(p5)<=3]
normalized: [maxVal(p5)<=3 & [maxVal(p447)<=3 & maxVal(p220)<=2]]

abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[maxVal(p163)<=3 & maxVal(p145)<=2] & maxVal(p289)<=1] & maxVal(p308)<=2] & [maxVal(p300)<=3 & [[maxVal(p244)<=3 & [maxVal(p391)<=1 & maxVal(p277)<=1]] & maxVal(p382)<=1]]] & [[maxVal(p74)<=3 & [[maxVal(p334)<=2 & [maxVal(p459)<=2 & maxVal(p24)<=3]] & [maxVal(p20)<=1 & maxVal(p45)<=1]]] & maxVal(p273)<=3]]
normalized: [[maxVal(p273)<=3 & [maxVal(p74)<=3 & [[maxVal(p20)<=1 & maxVal(p45)<=1] & [maxVal(p334)<=2 & [maxVal(p459)<=2 & maxVal(p24)<=3]]]]] & [[maxVal(p308)<=2 & [maxVal(p289)<=1 & [maxVal(p163)<=3 & maxVal(p145)<=2]]] & [maxVal(p300)<=3 & [maxVal(p382)<=1 & [maxVal(p244)<=3 & [maxVal(p391)<=1 & maxVal(p277)<=1]]]]]]

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[[[maxVal(p124)<=3 & [maxVal(p342)<=3 & maxVal(p105)<=2]] & maxVal(p19)<=1] & [maxVal(p380)<=3 & [[maxVal(p426)<=3 & maxVal(p140)<=1] & [maxVal(p455)<=3 & maxVal(p131)<=1]]]] & maxVal(p311)<=1] & maxVal(p17)<=1]
normalized: [maxVal(p17)<=1 & [maxVal(p311)<=1 & [[maxVal(p19)<=1 & [maxVal(p124)<=3 & [maxVal(p342)<=3 & maxVal(p105)<=2]]] & [maxVal(p380)<=3 & [[maxVal(p426)<=3 & maxVal(p140)<=1] & [maxVal(p455)<=3 & maxVal(p131)<=1]]]]]]

abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p339)<=3 & [maxVal(p325)<=1 & maxVal(p390)<=3]] & maxVal(p37)<=3] & maxVal(p481)<=3]
normalized: [maxVal(p481)<=3 & [maxVal(p37)<=3 & [maxVal(p339)<=3 & [maxVal(p325)<=1 & maxVal(p390)<=3]]]]

abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p243)<=1 & [maxVal(p342)<=2 & maxVal(p290)<=2]] & [maxVal(p351)<=3 & maxVal(p348)<=1]]
normalized: [[maxVal(p351)<=3 & maxVal(p348)<=1] & [maxVal(p243)<=1 & [maxVal(p342)<=2 & maxVal(p290)<=2]]]

abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=2) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=1) states: 9,794,739,147,610,899,087,361 (21)
abstracting: (1<=3) states: 9,794,739,147,610,899,087,361 (21)
-> the formula is TRUE

FORMULA Vasy2003-PT-none-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m24sec


BK_STOP 1433209868542

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

.........10 5546.........20 23625.........30 17117....
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="Vasy2003-PT-none"
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/Vasy2003-PT-none.tgz
mv Vasy2003-PT-none 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 Vasy2003-PT-none, 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 r106kn-smll-143285115500450"
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 ;