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 S_Eratosthenes-PT-200, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440600073
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433367458067

Model: S_Eratosthenes-PT-200
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: 199 NrTr: 699 NrArc: 2097)

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 199 (2.0e+02) #states 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)



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

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

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p137)<=3 & maxVal(p191)<=1] & [maxVal(p140)<=1 & [[[maxVal(p101)<=3 & maxVal(p62)<=2] & maxVal(p46)<=2] & maxVal(p165)<=3]]] & [maxVal(p172)<=1 & maxVal(p79)<=2]]
normalized: [[maxVal(p172)<=1 & maxVal(p79)<=2] & [[maxVal(p140)<=1 & [maxVal(p165)<=3 & [maxVal(p46)<=2 & [maxVal(p101)<=3 & maxVal(p62)<=2]]]] & [maxVal(p137)<=3 & maxVal(p191)<=1]]]

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p71)<=1 & maxVal(p13)<=3]
normalized: [maxVal(p71)<=1 & maxVal(p13)<=3]

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p122)<=3 & [[maxVal(p16)<=3 & maxVal(p97)<=1] & maxVal(p195)<=2]]
normalized: [maxVal(p122)<=3 & [maxVal(p195)<=2 & [maxVal(p16)<=3 & maxVal(p97)<=1]]]

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p74)<=2 & maxVal(p127)<=2]
normalized: [maxVal(p74)<=2 & maxVal(p127)<=2]

abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p9)<=1 & maxVal(p156)<=3]
normalized: [maxVal(p9)<=1 & maxVal(p156)<=3]

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[maxVal(p138)<=3 & [maxVal(p22)<=1 & [[[maxVal(p79)<=1 & maxVal(p83)<=2] & [maxVal(p199)<=2 & maxVal(p5)<=1]] & [[maxVal(p43)<=1 & maxVal(p58)<=1] & [maxVal(p125)<=2 & maxVal(p148)<=3]]]]] & [[maxVal(p153)<=3 & maxVal(p160)<=2] & [[[[maxVal(p76)<=1 & maxVal(p30)<=1] & [maxVal(p30)<=1 & maxVal(p38)<=1]] & [[maxVal(p138)<=2 & maxVal(p26)<=3] & [maxVal(p182)<=3 & maxVal(p188)<=3]]] & maxVal(p28)<=1]]]
normalized: [[[maxVal(p28)<=1 & [[[maxVal(p138)<=2 & maxVal(p26)<=3] & [maxVal(p182)<=3 & maxVal(p188)<=3]] & [[maxVal(p76)<=1 & maxVal(p30)<=1] & [maxVal(p30)<=1 & maxVal(p38)<=1]]]] & [maxVal(p153)<=3 & maxVal(p160)<=2]] & [maxVal(p138)<=3 & [maxVal(p22)<=1 & [[[maxVal(p43)<=1 & maxVal(p58)<=1] & [maxVal(p125)<=2 & maxVal(p148)<=3]] & [[maxVal(p79)<=1 & maxVal(p83)<=2] & [maxVal(p199)<=2 & maxVal(p5)<=1]]]]]]

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [maxVal(p13)<=3 & maxVal(p196)<=3]
normalized: [maxVal(p13)<=3 & maxVal(p196)<=3]

abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[maxVal(p48)<=1 & [maxVal(p184)<=3 & maxVal(p99)<=2]] & maxVal(p139)<=1] & [maxVal(p108)<=3 & [[[maxVal(p116)<=1 & maxVal(p192)<=3] & maxVal(p143)<=3] & [maxVal(p127)<=1 & [[maxVal(p192)<=3 & maxVal(p176)<=3] & maxVal(p138)<=1]]]]]
normalized: [[maxVal(p108)<=3 & [[maxVal(p143)<=3 & [maxVal(p116)<=1 & maxVal(p192)<=3]] & [maxVal(p127)<=1 & [maxVal(p138)<=1 & [maxVal(p192)<=3 & maxVal(p176)<=3]]]]] & [maxVal(p139)<=1 & [maxVal(p48)<=1 & [maxVal(p184)<=3 & maxVal(p99)<=2]]]]

abstracting: (1<=2) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=1) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=3) states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityBounds-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433367467431

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

199 199 199 199 199 199 199 199 199 199 199
iterations count:11309 (16), effective:153 (0)

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="S_Eratosthenes-PT-200"
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/S_Eratosthenes-PT-200.tgz
mv S_Eratosthenes-PT-200 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 S_Eratosthenes-PT-200, 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 r162st-ebro-143319440600073"
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 ;