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-2979
Executing tool marcie
Input is S_Philosophers-COL-000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r173kn-ebro-146433146500749
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000010-UpperBounds-0
FORMULA_NAME Philosophers-COL-000010-UpperBounds-1
FORMULA_NAME Philosophers-COL-000010-UpperBounds-10
FORMULA_NAME Philosophers-COL-000010-UpperBounds-11
FORMULA_NAME Philosophers-COL-000010-UpperBounds-12
FORMULA_NAME Philosophers-COL-000010-UpperBounds-13
FORMULA_NAME Philosophers-COL-000010-UpperBounds-14
FORMULA_NAME Philosophers-COL-000010-UpperBounds-15
FORMULA_NAME Philosophers-COL-000010-UpperBounds-2
FORMULA_NAME Philosophers-COL-000010-UpperBounds-3
FORMULA_NAME Philosophers-COL-000010-UpperBounds-4
FORMULA_NAME Philosophers-COL-000010-UpperBounds-5
FORMULA_NAME Philosophers-COL-000010-UpperBounds-6
FORMULA_NAME Philosophers-COL-000010-UpperBounds-7
FORMULA_NAME Philosophers-COL-000010-UpperBounds-8
FORMULA_NAME Philosophers-COL-000010-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1464808555338


Marcie rev. 8535M (built: crohr on 2016-04-27)
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=UpperBounds.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Unfolding complete |P|=50|T|=50|A|=160
Time for unfolding: 0m 0.967sec

Net: Philosophers_COL_000010
(NrP: 50 NrTr: 50 NrArc: 160)

net check time: 0m 0.000sec

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

init dd package: 0m 7.631sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 240 (2.4e+02) #states 59,049 (4)



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

checking: place_bound(catch2_Id1,catch2_Id10,catch2_Id2,catch2_Id3,catch2_Id4,catch2_Id5,catch2_Id6,catch2_Id7,catch2_Id8,catch2_Id9)
normalized: place_bound(catch2_Id1,catch2_Id10,catch2_Id2,catch2_Id3,catch2_Id4,catch2_Id5,catch2_Id6,catch2_Id7,catch2_Id8,catch2_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)
normalized: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(catch2_Id1,catch2_Id10,catch2_Id2,catch2_Id3,catch2_Id4,catch2_Id5,catch2_Id6,catch2_Id7,catch2_Id8,catch2_Id9)
normalized: place_bound(catch2_Id1,catch2_Id10,catch2_Id2,catch2_Id3,catch2_Id4,catch2_Id5,catch2_Id6,catch2_Id7,catch2_Id8,catch2_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)
normalized: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)

-> the formula is 5

FORMULA Philosophers-COL-000010-UpperBounds-5 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)
normalized: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)
normalized: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(catch1_Id1,catch1_Id10,catch1_Id2,catch1_Id3,catch1_Id4,catch1_Id5,catch1_Id6,catch1_Id7,catch1_Id8,catch1_Id9)
normalized: place_bound(catch1_Id1,catch1_Id10,catch1_Id2,catch1_Id3,catch1_Id4,catch1_Id5,catch1_Id6,catch1_Id7,catch1_Id8,catch1_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)
normalized: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)

-> the formula is 5

FORMULA Philosophers-COL-000010-UpperBounds-11 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)
normalized: place_bound(think_Id1,think_Id10,think_Id2,think_Id3,think_Id4,think_Id5,think_Id6,think_Id7,think_Id8,think_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)
normalized: place_bound(fork_Id1,fork_Id10,fork_Id2,fork_Id3,fork_Id4,fork_Id5,fork_Id6,fork_Id7,fork_Id8,fork_Id9)

-> the formula is 10

FORMULA Philosophers-COL-000010-UpperBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)
normalized: place_bound(eat_Id1,eat_Id10,eat_Id2,eat_Id3,eat_Id4,eat_Id5,eat_Id6,eat_Id7,eat_Id8,eat_Id9)

-> the formula is 5

FORMULA Philosophers-COL-000010-UpperBounds-15 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m13.282sec


BK_STOP 1464808568668

--------------------
content from stderr:

check for maximal unmarked siphon
ok
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: 0m 0.000sec


iterations count:263 (5), effective:30 (0)

initing FirstDep: 0m 0.000sec

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_Philosophers-COL-000010"
export BK_EXAMINATION="UpperBounds"
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_Philosophers-COL-000010.tgz
mv S_Philosophers-COL-000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_Philosophers-COL-000010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r173kn-ebro-146433146500749"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;