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

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

=== Now, execution of the tool begins

BK_START 1463717255956


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: QuasiCertifProtocol_PT_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.008sec

init dd package: 0m 4.224sec


RS generation: 0m17.451sec


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



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

checking: EF [~ [~ [[3<=a3 | 2<=AstopAbort]]]]
normalized: E [true U [3<=a3 | 2<=AstopAbort]]

abstracting: (2<=AstopAbort) states: 0
abstracting: (3<=a3) states: 0
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.190sec

checking: AG [~ [~ [a4<=a1]]]
normalized: ~ [E [true U ~ [a4<=a1]]]

abstracting: (a4<=a1) states: 2,271,896 (6)
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.435sec

checking: EF [3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)]
normalized: E [true U 3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)]

abstracting: (3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)) states: 579,690 (5)
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.519sec

checking: EF [2<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)]
normalized: E [true U 2<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)]

abstracting: (2<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)) states: 1,578,512 (6)
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m14.618sec

checking: EF [~ [sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=a2]]
normalized: E [true U ~ [sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=a2]]

abstracting: (sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=a2) states: 264,459 (5)
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.162sec

checking: AG [~ [~ [[sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=sum(Sstart_4, Sstart_5, Sstart_6, Sstart_0, Sstart_1, Sstart_2, Sstart_3) | 3<=Astart]]]]
normalized: ~ [E [true U ~ [[sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=sum(Sstart_4, Sstart_5, Sstart_6, Sstart_0, Sstart_1, Sstart_2, Sstart_3) | 3<=Astart]]]]

abstracting: (3<=Astart) states: 0
abstracting: (sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)<=sum(Sstart_4, Sstart_5, Sstart_6, Sstart_0, Sstart_1, Sstart_2, Sstart_3)) states: 264,459 (5)
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.401sec

checking: AG [[3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2) | ~ [[3<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1) & AstopOK<=a5]]]]
normalized: ~ [E [true U ~ [[3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2) | ~ [[3<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1) & AstopOK<=a5]]]]]]

abstracting: (AstopOK<=a5) states: 1,613,520 (6)
abstracting: (3<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)) states: 1,567,760 (6)
abstracting: (3<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)) states: 579,690 (5)
-> the formula is FALSE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.127sec

checking: EF [~ [[[3<=a2 | AstopOK<=sum(n4_0, n4_2, n4_1, n4_4, n4_3, n4_6, n4_5)] & ~ [2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)]]]]
normalized: E [true U ~ [[~ [2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)] & [3<=a2 | AstopOK<=sum(n4_0, n4_2, n4_1, n4_4, n4_3, n4_6, n4_5)]]]]

abstracting: (AstopOK<=sum(n4_0, n4_2, n4_1, n4_4, n4_3, n4_6, n4_5)) states: 1,613,520 (6)
abstracting: (3<=a2) states: 0
abstracting: (2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)) states: 1,398,158 (6)
-> the formula is TRUE

FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.247sec

checking: EF [[~ [[sum(n5_6, n5_1, n5_0, n5_3, n5_2, n5_5, n5_4)<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1) & sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)]] & 2<=SstopAbort]]
normalized: E [true U [2<=SstopAbort & ~ [[sum(n5_6, n5_1, n5_0, n5_3, n5_2, n5_5, n5_4)<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1) & sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)]]]]

abstracting: (sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2)<=sum(n6_4, n6_3, n6_6, n6_5, n6_0, n6_2, n6_1)) states: 1,708,458 (6)
abstracting: (sum(n5_6, n5_1, n5_0, n5_3, n5_2, n5_5, n5_4)<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)) states: 2,114,556 (6)
abstracting: (2<=SstopAbort) states: 887,943 (5)

BK_TIME_CONFINEMENT_REACHED

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

82674 100914 117263 197623
iterations count:4059 (34), effective:116 (1)

initing FirstDep: 0m 0.000sec


iterations count:287 (2), effective:18 (0)
162533
iterations count:1289 (11), effective:115 (0)

iterations count:712 (6), effective:51 (0)

iterations count:638 (5), effective:48 (0)

iterations count:638 (5), effective:48 (0)

iterations count:726 (6), effective:52 (0)

iterations count:975 (8), effective:73 (0)
110602 139262
iterations count:2768 (23), effective:129 (1)

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-PT-06"
export BK_EXAMINATION="ReachabilityCardinality"
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-PT-06.tgz
mv QuasiCertifProtocol-PT-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-PT-06, examination is ReachabilityCardinality"
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-146369143600088"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;