About the Execution of MARCIE for S_GPPP-PT-C0001N0000000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7482.610 | 6876.00 | 6019.00 | 20.20 | 3 3 7 7 2 1 20 3 7 7 20 7 2 14 3 10 | 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-3254
Executing tool marcie
Input is S_GPPP-PT-C0001N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101-blw3-149441599100515
=====================================================================
--------------------
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 GPPP-PT-C0001N0000000010-UpperBounds-0
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-1
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-15
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-2
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-3
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-4
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-5
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-6
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-7
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-8
FORMULA_NAME GPPP-PT-C0001N0000000010-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1494883474428
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --memory=6
parse successfull
net created successfully
Net: GPPP_PT_C0001N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 1.206sec
parse successfull
net created successfully
Net: GPPP_PT_C0001N0000000010
(NrP: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.781sec
RS generation: 0m 0.014sec
-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)
starting MCC model checker
--------------------------
checking: place_bound(F6P)
normalized: place_bound(F6P)
-> the formula is 3
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Ru5P)
normalized: place_bound(Ru5P)
-> the formula is 3
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(c1)
normalized: place_bound(c1)
-> the formula is 7
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-2 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(NADH)
normalized: place_bound(NADH)
-> the formula is 7
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-3 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(NADPH)
normalized: place_bound(NADPH)
-> the formula is 20
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-4 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Pyr)
normalized: place_bound(Pyr)
-> the formula is 7
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-5 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(a2)
normalized: place_bound(a2)
-> the formula is 2
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-6 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(ADP)
normalized: place_bound(ADP)
-> the formula is 14
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-7 14 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Ru5P)
normalized: place_bound(Ru5P)
-> the formula is 3
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-8 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(GSSG)
normalized: place_bound(GSSG)
-> the formula is 10
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(NADH)
normalized: place_bound(NADH)
-> the formula is 7
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-10 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(PEP)
normalized: place_bound(PEP)
-> the formula is 7
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-11 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(a2)
normalized: place_bound(a2)
-> the formula is 2
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(R5P)
normalized: place_bound(R5P)
-> the formula is 1
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(NADPplus)
normalized: place_bound(NADPplus)
-> the formula is 20
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-14 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(Ru5P)
normalized: place_bound(Ru5P)
-> the formula is 3
FORMULA GPPP-PT-C0001N0000000010-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 5936 (5.9e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34278 28289 62567
used/not used/entry size/cache size: 32183 67076681 16 1024MB
basic ops cache: hits/miss/sum: 496 749 1245
used/not used/entry size/cache size: 2122 16775094 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 568 1088 1656
used/not used/entry size/cache size: 1088 8387520 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67103208
1 5620
2 19
3 1
4 1
5 0
6 8
7 0
8 0
9 0
>= 10 7
Total processing time: 0m 6.764sec
BK_STOP 1494883481304
--------------------
content from stderr:
check for maximal unmarked siphon
ok
check for constant places
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
ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
check for constant places
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:1795 (81), effective:420 (19)
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_GPPP-PT-C0001N0000000010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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_GPPP-PT-C0001N0000000010.tgz
mv S_GPPP-PT-C0001N0000000010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_GPPP-PT-C0001N0000000010, 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 r101-blw3-149441599100515"
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 '
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 ;