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_QuasiCertifProtocol-COL-06, examination is ReachabilityBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930100775
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433778372462

Model: S_QuasiCertifProtocol-COL-06
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

Unfolding complete |P|=270|T|=116|A|=659
Time for unfolding: 0m0sec

(NrP: 270 NrTr: 116 NrArc: 659)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m5sec


-> reachability set: #nodes 123450 (1.2e+05) #states 203,320,234 (8)



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

checking: [[[[[[maxVal(n1)<=2 & maxVal(CstopAbort)<=3] & [maxVal(SstopAbort)<=1 & maxVal(CstopOK)<=3]] & maxVal(CstopOK)<=2] & [maxVal(a1)<=1 & maxVal(n6)<=1]] & maxVal(s6)<=2] & [[maxVal(s6)<=3 & [maxVal(n5)<=1 & maxVal(AstopOK)<=3]] & maxVal(s2)<=3]]
normalized: [[maxVal(s6)<=2 & [[maxVal(CstopOK)<=2 & [[maxVal(n1)<=2 & maxVal(CstopAbort)<=3] & [maxVal(SstopAbort)<=1 & maxVal(CstopOK)<=3]]] & [maxVal(a1)<=1 & maxVal(n6)<=1]]] & [maxVal(s2)<=3 & [maxVal(s6)<=3 & [maxVal(n5)<=1 & maxVal(AstopOK)<=3]]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-0CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-1CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(n5)<=3 & [maxVal(n6)<=2 & [maxVal(AstopAbort)<=1 & maxVal(n8)<=3]]]
normalized: [maxVal(n5)<=3 & [maxVal(n6)<=2 & [maxVal(AstopAbort)<=1 & maxVal(n8)<=3]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-2CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-3CANNOT_COMPUTE

MC time: 0m0sec

checking: [[[maxVal(a5)<=2 & maxVal(Sstart)<=1] & [[[[maxVal(SstopOK)<=1 & maxVal(n8)<=2] & maxVal(Cstart)<=2] & maxVal(malicious_reservoir)<=3] & [maxVal(SstopAbort)<=2 & maxVal(n3)<=2]]] & maxVal(s5)<=2]
normalized: [maxVal(s5)<=2 & [[maxVal(a5)<=2 & maxVal(Sstart)<=1] & [[maxVal(malicious_reservoir)<=3 & [maxVal(Cstart)<=2 & [maxVal(SstopOK)<=1 & maxVal(n8)<=2]]] & [maxVal(SstopAbort)<=2 & maxVal(n3)<=2]]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-4CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-5CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-6CANNOT_COMPUTE

MC time: 0m0sec

checking: [[maxVal(malicious_reservoir)<=1 & [maxVal(a2)<=3 & [[[maxVal(s6)<=1 & maxVal(CstopAbort)<=3] & maxVal(Cstart)<=3] & maxVal(a2)<=2]]] & maxVal(AstopAbort)<=1]
normalized: [maxVal(AstopAbort)<=1 & [maxVal(malicious_reservoir)<=1 & [maxVal(a2)<=3 & [maxVal(a2)<=2 & [maxVal(Cstart)<=3 & [maxVal(s6)<=1 & maxVal(CstopAbort)<=3]]]]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-7CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-8CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(s5)<=2 & [[[[maxVal(Sstart)<=2 & [maxVal(n7)<=1 & maxVal(s2)<=3]] & maxVal(n9)<=3] & [maxVal(a5)<=1 & [[maxVal(a3)<=2 & maxVal(n1)<=1] & maxVal(SstopOK)<=1]]] & [maxVal(a1)<=3 & maxVal(c1)<=2]]]
normalized: [maxVal(s5)<=2 & [[[maxVal(a5)<=1 & [maxVal(SstopOK)<=1 & [maxVal(a3)<=2 & maxVal(n1)<=1]]] & [maxVal(n9)<=3 & [maxVal(Sstart)<=2 & [maxVal(n7)<=1 & maxVal(s2)<=3]]]] & [maxVal(a1)<=3 & maxVal(c1)<=2]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-9CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(n5)<=2 & [maxVal(a5)<=1 & [[[maxVal(n6)<=2 & maxVal(n4)<=3] & [[maxVal(n1)<=3 & maxVal(s2)<=2] & maxVal(Cstart)<=1]] & maxVal(n5)<=1]]]
normalized: [maxVal(n5)<=2 & [maxVal(a5)<=1 & [maxVal(n5)<=1 & [[maxVal(Cstart)<=1 & [maxVal(n1)<=3 & maxVal(s2)<=2]] & [maxVal(n6)<=2 & maxVal(n4)<=3]]]]]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-10CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(s6)<=1 & maxVal(a5)<=3]
normalized: [maxVal(s6)<=1 & maxVal(a5)<=3]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-11CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(s2)<=2 & maxVal(CstopAbort)<=1]
normalized: [maxVal(s2)<=2 & maxVal(CstopAbort)<=1]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-12CANNOT_COMPUTE

MC time: 0m0sec

checking: [maxVal(n9)<=1 & maxVal(Sstart)<=3]
normalized: [maxVal(n9)<=1 & maxVal(Sstart)<=3]


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-13CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-14CANNOT_COMPUTE

MC time: 0m0sec

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


FORMULA QuasiCertifProtocol-COL-06-ReachabilityBounds-15CANNOT_COMPUTE

MC time: 0m0sec


Total processing time: 0m29sec


BK_STOP 1433778402108

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

39583 62621 89235
iterations count:3324 (28), effective:116 (1)

initing FirstDep: 0m0sec

Unknown names:
maxVal(AstopOK)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(a5)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n8)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n5)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n3)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(CstopOK)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(s4)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(CstopAbort)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n7)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(c1)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n4)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(a5)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(CstopAbort)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(Sstart)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(n6)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

Unknown names:
maxVal(s4)
/home/mcc/workspace/dssz_util/src/dssz/idd/idd_il.cc:106: Exception: Faulty IL formula

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_QuasiCertifProtocol-COL-06"
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_QuasiCertifProtocol-COL-06.tgz
mv S_QuasiCertifProtocol-COL-06 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_QuasiCertifProtocol-COL-06, 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 r218st-ebro-143344930100775"
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 ;