About the Execution of Marcie for S_QuasiCertifProtocol-PT-06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6490.420 | 3600000.00 | 3599929.00 | 100.70 | ???FFF?????????? | normal |
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_QuasiCertifProtocol-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444127900084
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-1
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-15
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-2
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-3
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-4
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-5
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-6
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-7
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-8
FORMULA_NAME QuasiCertifProtocol-COL-06-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1464537585731
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=CTLCardinality.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.004sec
init dd package: 0m 3.871sec
RS generation: 0m19.455sec
-> reachability set: #nodes 197623 (2.0e+05) #states 2,271,960 (6)
starting MCC model checker
--------------------------
checking: ~ [EF [1<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)]]
normalized: ~ [E [true U 1<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)]]
abstracting: (1<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)) states: 2,007,501 (6)
-> the formula is FALSE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.200sec
checking: AX [A [a4<=malicious_reservoir U 2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)]]
normalized: ~ [EX [~ [[~ [EG [~ [2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)]]] & ~ [E [~ [2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)] U [~ [2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)] & ~ [a4<=malicious_reservoir]]]]]]]]
abstracting: (a4<=malicious_reservoir) states: 2,271,925 (6)
abstracting: (2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)) states: 1,177,242 (6)
abstracting: (2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)) states: 1,177,242 (6)
abstracting: (2<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)) states: 1,177,242 (6)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.965sec
checking: EX [EG [[sum(n2_0, n2_1, n2_2, n2_3, n2_4, n2_5, n2_6)<=sum(s4_6, s4_5, s4_3, s4_4, s4_1, s4_2, s4_0) & sum(s3_6, s3_3, s3_2, s3_5, s3_4, s3_1, s3_0)<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)]]]
normalized: EX [EG [[sum(n2_0, n2_1, n2_2, n2_3, n2_4, n2_5, n2_6)<=sum(s4_6, s4_5, s4_3, s4_4, s4_1, s4_2, s4_0) & sum(s3_6, s3_3, s3_2, s3_5, s3_4, s3_1, s3_0)<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)]]]
abstracting: (sum(s3_6, s3_3, s3_2, s3_5, s3_4, s3_1, s3_0)<=sum(s6_6, s6_4, s6_5, s6_3, s6_2, s6_1, s6_0)) states: 2,021,550 (6)
abstracting: (sum(n2_0, n2_1, n2_2, n2_3, n2_4, n2_5, n2_6)<=sum(s4_6, s4_5, s4_3, s4_4, s4_1, s4_2, s4_0)) states: 2,255,704 (6)
.......
EG iterations: 7
.-> the formula is FALSE
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.570sec
checking: [[AG [~ [2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)]] | [2<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2) & AX [2<=sum(n1_2, n1_3, n1_4, n1_5, n1_6, n1_1, n1_0)]]] & AstopOK<=sum(n4_0, n4_2, n4_1, n4_4, n4_3, n4_6, n4_5)]
normalized: [AstopOK<=sum(n4_0, n4_2, n4_1, n4_4, n4_3, n4_6, n4_5) & [[2<=sum(SstopOK_5, SstopOK_4, SstopOK_6, SstopOK_1, SstopOK_0, SstopOK_3, SstopOK_2) & ~ [EX [~ [2<=sum(n1_2, n1_3, n1_4, n1_5, n1_6, n1_1, n1_0)]]]] | ~ [E [true U 2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)]]]]
abstracting: (2<=sum(s5_6, s5_4, s5_5, s5_2, s5_3, s5_0, s5_1)) states: 1,398,158 (6)
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:638 (5), effective:48 (0)
iterations count:544 (4), effective:24 (0)
iterations count:757 (6), effective:56 (0)
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-PT-06"
export BK_EXAMINATION="CTLCardinality"
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/S_QuasiCertifProtocol-PT-06.tgz
mv S_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 S_QuasiCertifProtocol-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r185kn-smll-146444127900084"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;