About the Execution of Marcie for SharedMemory-PT-000005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3957.450 | 16303.00 | 16351.00 | 30.20 | 1 5 1 20 5 5 1 5 5 5 20 20 5 5 20 20 | 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-2265
Executing tool marcie
Input is SharedMemory-PT-000005, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r092kn-qhx2-143267650500361
=====================================================================
--------------------
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 SharedMemory-COL-000005-ReachabilityComputeBounds-0
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-1
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-10
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-11
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-12
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-13
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-14
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-15
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-2
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-3
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-4
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-5
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-6
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-7
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-8
FORMULA_NAME SharedMemory-COL-000005-ReachabilityComputeBounds-9
=== Now, execution of the tool begins
BK_START 1433024217186
Model: SharedMemory-PT-000005
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=ReachabilityComputeBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 41 NrTr: 55 NrArc: 200)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m12sec
RS generation: 0m0sec
-> reachability set: #nodes 361 (3.6e+02) #states 1,863 (3)
starting MCC model checker
--------------------------
checking: maxVal(Ext_Bus)
normalized: maxVal(Ext_Bus)
-> the formula is 1
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Queue_4), maxVal(Queue_3), maxVal(Queue_5), maxVal(Queue_2), maxVal(Queue_1))
normalized: sum(maxVal(Queue_4), maxVal(Queue_3), maxVal(Queue_5), maxVal(Queue_2), maxVal(Queue_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-1 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Memory_5), maxVal(Memory_3), maxVal(Memory_4), maxVal(Memory_1), maxVal(Memory_2))
normalized: sum(maxVal(Memory_5), maxVal(Memory_3), maxVal(Memory_4), maxVal(Memory_1), maxVal(Memory_2))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-2 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(OwnMemAcc_3), maxVal(OwnMemAcc_2), maxVal(OwnMemAcc_5), maxVal(OwnMemAcc_4), maxVal(OwnMemAcc_1))
normalized: sum(maxVal(OwnMemAcc_3), maxVal(OwnMemAcc_2), maxVal(OwnMemAcc_5), maxVal(OwnMemAcc_4), maxVal(OwnMemAcc_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-3 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
normalized: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
-> the formula is 20
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-4 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
normalized: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
-> the formula is 20
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-5 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Active_5), maxVal(Active_4), maxVal(Active_2), maxVal(Active_3), maxVal(Active_1))
normalized: sum(maxVal(Active_5), maxVal(Active_4), maxVal(Active_2), maxVal(Active_3), maxVal(Active_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-6 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Memory_5), maxVal(Memory_3), maxVal(Memory_4), maxVal(Memory_1), maxVal(Memory_2))
normalized: sum(maxVal(Memory_5), maxVal(Memory_3), maxVal(Memory_4), maxVal(Memory_1), maxVal(Memory_2))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-7 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
normalized: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
-> the formula is 20
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-8 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
normalized: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
-> the formula is 20
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-9 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(Ext_Bus)
normalized: maxVal(Ext_Bus)
-> the formula is 1
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
normalized: sum(maxVal(Ext_Mem_Acc_4_5), maxVal(Ext_Mem_Acc_2_5), maxVal(Ext_Mem_Acc_3_5), maxVal(Ext_Mem_Acc_5_4), maxVal(Ext_Mem_Acc_1_5), maxVal(Ext_Mem_Acc_2_4), maxVal(Ext_Mem_Acc_3_4), maxVal(Ext_Mem_Acc_1_4), maxVal(Ext_Mem_Acc_5_3), maxVal(Ext_Mem_Acc_4_3), maxVal(Ext_Mem_Acc_2_3), maxVal(Ext_Mem_Acc_1_3), maxVal(Ext_Mem_Acc_5_2), maxVal(Ext_Mem_Acc_4_2), maxVal(Ext_Mem_Acc_3_2), maxVal(Ext_Mem_Acc_1_2), maxVal(Ext_Mem_Acc_5_1), maxVal(Ext_Mem_Acc_4_1), maxVal(Ext_Mem_Acc_3_1), maxVal(Ext_Mem_Acc_2_1))
-> the formula is 20
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-11 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(OwnMemAcc_3), maxVal(OwnMemAcc_2), maxVal(OwnMemAcc_5), maxVal(OwnMemAcc_4), maxVal(OwnMemAcc_1))
normalized: sum(maxVal(OwnMemAcc_3), maxVal(OwnMemAcc_2), maxVal(OwnMemAcc_5), maxVal(OwnMemAcc_4), maxVal(OwnMemAcc_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-12 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Active_5), maxVal(Active_4), maxVal(Active_2), maxVal(Active_3), maxVal(Active_1))
normalized: sum(maxVal(Active_5), maxVal(Active_4), maxVal(Active_2), maxVal(Active_3), maxVal(Active_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-13 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: maxVal(Ext_Bus)
normalized: maxVal(Ext_Bus)
-> the formula is 1
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: sum(maxVal(Queue_4), maxVal(Queue_3), maxVal(Queue_5), maxVal(Queue_2), maxVal(Queue_1))
normalized: sum(maxVal(Queue_4), maxVal(Queue_3), maxVal(Queue_5), maxVal(Queue_2), maxVal(Queue_1))
-> the formula is 5
FORMULA SharedMemory-COL-000005-ReachabilityComputeBounds-15 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m16sec
BK_STOP 1433024233489
--------------------
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
iterations count:667 (12), effective:30 (0)
initing FirstDep: 0m0sec
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="SharedMemory-PT-000005"
export BK_EXAMINATION="ReachabilityComputeBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/SharedMemory-PT-000005.tgz
mv SharedMemory-PT-000005 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 SharedMemory-PT-000005, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r092kn-qhx2-143267650500361"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 ;