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 QuasiCertifProtocol-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143500020
=====================================================================

--------------------
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 QuasiCertifProtocol-COL-06-UpperBounds-0
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-1
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-15
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-2
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-3
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-4
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-5
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-6
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-7
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-8
FORMULA_NAME QuasiCertifProtocol-COL-06-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1463693015970


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|=270|T|=116|A|=659
Time for unfolding: 0m 2.269sec

Net: QuasiCertifProtocol_COL_06
(NrP: 270 NrTr: 116 NrArc: 659)

net check time: 0m 0.000sec

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

init dd package: 0m 3.707sec


RS generation: 0m16.679sec


-> reachability set: #nodes 197396 (2.0e+05) #states 2,271,960 (6)



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

checking: place_bound(a1_dot)
normalized: place_bound(a1_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a5_dot)
normalized: place_bound(a5_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n2_tsid0,n2_tsid1,n2_tsid2,n2_tsid3,n2_tsid4,n2_tsid5,n2_tsid6)
normalized: place_bound(n2_tsid0,n2_tsid1,n2_tsid2,n2_tsid3,n2_tsid4,n2_tsid5,n2_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-0 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c1_tsid0,c1_tsid1,c1_tsid2,c1_tsid3,c1_tsid4,c1_tsid5,c1_tsid6)
normalized: place_bound(c1_tsid0,c1_tsid1,c1_tsid2,c1_tsid3,c1_tsid4,c1_tsid5,c1_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-2 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s3_tsid0,s3_tsid1,s3_tsid2,s3_tsid3,s3_tsid4,s3_tsid5,s3_tsid6)
normalized: place_bound(s3_tsid0,s3_tsid1,s3_tsid2,s3_tsid3,s3_tsid4,s3_tsid5,s3_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-3 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n4_tsid0,n4_tsid1,n4_tsid2,n4_tsid3,n4_tsid4,n4_tsid5,n4_tsid6)
normalized: place_bound(n4_tsid0,n4_tsid1,n4_tsid2,n4_tsid3,n4_tsid4,n4_tsid5,n4_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-5 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n2_tsid0,n2_tsid1,n2_tsid2,n2_tsid3,n2_tsid4,n2_tsid5,n2_tsid6)
normalized: place_bound(n2_tsid0,n2_tsid1,n2_tsid2,n2_tsid3,n2_tsid4,n2_tsid5,n2_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-6 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s2_tsid0,s2_tsid1,s2_tsid2,s2_tsid3,s2_tsid4,s2_tsid5,s2_tsid6)
normalized: place_bound(s2_tsid0,s2_tsid1,s2_tsid2,s2_tsid3,s2_tsid4,s2_tsid5,s2_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-8 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s5_tsid0,s5_tsid1,s5_tsid2,s5_tsid3,s5_tsid4,s5_tsid5,s5_tsid6)
normalized: place_bound(s5_tsid0,s5_tsid1,s5_tsid2,s5_tsid3,s5_tsid4,s5_tsid5,s5_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-9 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s4_tsid0,s4_tsid1,s4_tsid2,s4_tsid3,s4_tsid4,s4_tsid5,s4_tsid6)
normalized: place_bound(s4_tsid0,s4_tsid1,s4_tsid2,s4_tsid3,s4_tsid4,s4_tsid5,s4_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s2_tsid0,s2_tsid1,s2_tsid2,s2_tsid3,s2_tsid4,s2_tsid5,s2_tsid6)
normalized: place_bound(s2_tsid0,s2_tsid1,s2_tsid2,s2_tsid3,s2_tsid4,s2_tsid5,s2_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(CstopOK_tsid0,CstopOK_tsid1,CstopOK_tsid2,CstopOK_tsid3,CstopOK_tsid4,CstopOK_tsid5,CstopOK_tsid6)
normalized: place_bound(CstopOK_tsid0,CstopOK_tsid1,CstopOK_tsid2,CstopOK_tsid3,CstopOK_tsid4,CstopOK_tsid5,CstopOK_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(SstopOK_tsid0,SstopOK_tsid1,SstopOK_tsid2,SstopOK_tsid3,SstopOK_tsid4,SstopOK_tsid5,SstopOK_tsid6)
normalized: place_bound(SstopOK_tsid0,SstopOK_tsid1,SstopOK_tsid2,SstopOK_tsid3,SstopOK_tsid4,SstopOK_tsid5,SstopOK_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n5_tsid0,n5_tsid1,n5_tsid2,n5_tsid3,n5_tsid4,n5_tsid5,n5_tsid6)
normalized: place_bound(n5_tsid0,n5_tsid1,n5_tsid2,n5_tsid3,n5_tsid4,n5_tsid5,n5_tsid6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n9_tsid0_tsid0,n9_tsid0_tsid1,n9_tsid0_tsid2,n9_tsid0_tsid3,n9_tsid0_tsid4,n9_tsid0_tsid5,n9_tsid0_tsid6,n9_tsid1_tsid0,n9_tsid1_tsid1,n9_tsid1_tsid2,n9_tsid1_tsid3,n9_tsid1_tsid4,n9_tsid1_tsid5,n9_tsid1_tsid6,n9_tsid2_tsid0,n9_tsid2_tsid1,n9_tsid2_tsid2,n9_tsid2_tsid3,n9_tsid2_tsid4,n9_tsid2_tsid5,n9_tsid2_tsid6,n9_tsid3_tsid0,n9_tsid3_tsid1,n9_tsid3_tsid2,n9_tsid3_tsid3,n9_tsid3_tsid4,n9_tsid3_tsid5,n9_tsid3_tsid6,n9_tsid4_tsid0,n9_tsid4_tsid1,n9_tsid4_tsid2,n9_tsid4_tsid3,n9_tsid4_tsid4,n9_tsid4_tsid5,n9_tsid4_tsid6,n9_tsid5_tsid0,n9_tsid5_tsid1,n9_tsid5_tsid2,n9_tsid5_tsid3,n9_tsid5_tsid4,n9_tsid5_tsid5,n9_tsid5_tsid6,n9_tsid6_tsid0,n9_tsid6_tsid1,n9_tsid6_tsid2,n9_tsid6_tsid3,n9_tsid6_tsid4,n9_tsid6_tsid5,n9_tsid6_tsid6)
normalized: place_bound(n9_tsid0_tsid0,n9_tsid0_tsid1,n9_tsid0_tsid2,n9_tsid0_tsid3,n9_tsid0_tsid4,n9_tsid0_tsid5,n9_tsid0_tsid6,n9_tsid1_tsid0,n9_tsid1_tsid1,n9_tsid1_tsid2,n9_tsid1_tsid3,n9_tsid1_tsid4,n9_tsid1_tsid5,n9_tsid1_tsid6,n9_tsid2_tsid0,n9_tsid2_tsid1,n9_tsid2_tsid2,n9_tsid2_tsid3,n9_tsid2_tsid4,n9_tsid2_tsid5,n9_tsid2_tsid6,n9_tsid3_tsid0,n9_tsid3_tsid1,n9_tsid3_tsid2,n9_tsid3_tsid3,n9_tsid3_tsid4,n9_tsid3_tsid5,n9_tsid3_tsid6,n9_tsid4_tsid0,n9_tsid4_tsid1,n9_tsid4_tsid2,n9_tsid4_tsid3,n9_tsid4_tsid4,n9_tsid4_tsid5,n9_tsid4_tsid6,n9_tsid5_tsid0,n9_tsid5_tsid1,n9_tsid5_tsid2,n9_tsid5_tsid3,n9_tsid5_tsid4,n9_tsid5_tsid5,n9_tsid5_tsid6,n9_tsid6_tsid0,n9_tsid6_tsid1,n9_tsid6_tsid2,n9_tsid6_tsid3,n9_tsid6_tsid4,n9_tsid6_tsid5,n9_tsid6_tsid6)

-> the formula is 49

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-1 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid0_tsid3,n7_tsid0_tsid4,n7_tsid0_tsid5,n7_tsid0_tsid6,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid1_tsid3,n7_tsid1_tsid4,n7_tsid1_tsid5,n7_tsid1_tsid6,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2,n7_tsid2_tsid3,n7_tsid2_tsid4,n7_tsid2_tsid5,n7_tsid2_tsid6,n7_tsid3_tsid0,n7_tsid3_tsid1,n7_tsid3_tsid2,n7_tsid3_tsid3,n7_tsid3_tsid4,n7_tsid3_tsid5,n7_tsid3_tsid6,n7_tsid4_tsid0,n7_tsid4_tsid1,n7_tsid4_tsid2,n7_tsid4_tsid3,n7_tsid4_tsid4,n7_tsid4_tsid5,n7_tsid4_tsid6,n7_tsid5_tsid0,n7_tsid5_tsid1,n7_tsid5_tsid2,n7_tsid5_tsid3,n7_tsid5_tsid4,n7_tsid5_tsid5,n7_tsid5_tsid6,n7_tsid6_tsid0,n7_tsid6_tsid1,n7_tsid6_tsid2,n7_tsid6_tsid3,n7_tsid6_tsid4,n7_tsid6_tsid5,n7_tsid6_tsid6)
normalized: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid0_tsid3,n7_tsid0_tsid4,n7_tsid0_tsid5,n7_tsid0_tsid6,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid1_tsid3,n7_tsid1_tsid4,n7_tsid1_tsid5,n7_tsid1_tsid6,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2,n7_tsid2_tsid3,n7_tsid2_tsid4,n7_tsid2_tsid5,n7_tsid2_tsid6,n7_tsid3_tsid0,n7_tsid3_tsid1,n7_tsid3_tsid2,n7_tsid3_tsid3,n7_tsid3_tsid4,n7_tsid3_tsid5,n7_tsid3_tsid6,n7_tsid4_tsid0,n7_tsid4_tsid1,n7_tsid4_tsid2,n7_tsid4_tsid3,n7_tsid4_tsid4,n7_tsid4_tsid5,n7_tsid4_tsid6,n7_tsid5_tsid0,n7_tsid5_tsid1,n7_tsid5_tsid2,n7_tsid5_tsid3,n7_tsid5_tsid4,n7_tsid5_tsid5,n7_tsid5_tsid6,n7_tsid6_tsid0,n7_tsid6_tsid1,n7_tsid6_tsid2,n7_tsid6_tsid3,n7_tsid6_tsid4,n7_tsid6_tsid5,n7_tsid6_tsid6)

-> the formula is 49

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m38.887sec


BK_STOP 1463693054914

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

43420 70023 119864 197396
iterations count:4059 (34), effective:116 (1)

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="QuasiCertifProtocol-COL-06"
export BK_EXAMINATION="UpperBounds"
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/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 QuasiCertifProtocol-COL-06, 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 r101kn-smll-146369143500020"
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 ;