About the Execution of MARCIE for DrinkVendingMachine-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) | Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status | 
| 8443.710 | 104318.00 | 106020.00 | 30.00 | F | 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 DrinkVendingMachine-PT-10, examination is ReachabilityDeadlock
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 1
    Run identifier is r021-blw3-149440255000233
=====================================================================
--------------------
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 DrinkVendingMachine-COL-10-ReachabilityDeadlock-0
=== Now, execution of the tool begins
BK_START 1494452395708
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=ReachabilityDeadlock.xml --memory=6 
parse successfull
net created successfully
Net: DrinkVendingMachine_PT_10
(NrP: 120  NrTr: 111160 NrArc: 1026520)
parse formulas
formulas created successfully
place and transition orderings generation:0m23.734sec
net check time: 0m 0.190sec
init dd package: 0m 1.028sec
parse successfull
net created successfully
Net: DrinkVendingMachine_PT_10
(NrP: 120  NrTr: 111160 NrArc: 1026520)
parse formulas
formulas created successfully
place and transition orderings generation:0m22.446sec
net check time: 0m 0.187sec
init dd package: 0m 3.570sec
RS generation: 0m 3.315sec
-> reachability set: #nodes 180 (1.8e+02) #states 1,152,921,504,606,846,976 (18)
starting MCC model checker
--------------------------
checking: EF [DEADLOCK]
normalized: E [true U DEADLOCK]
-> the formula is FALSE
FORMULA DrinkVendingMachine-COL-10-ReachabilityDeadlock-0 FALSE  TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.922sec
totally nodes used: 42163 (4.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1662997 8252312 9915309
used/not used/entry size/cache size: 7225496 59883368 16 1024MB
basic ops cache: hits/miss/sum: 1418 11390 12808
used/not used/entry size/cache size: 28586 16748630 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: 59 180 239
used/not used/entry size/cache size: 180 8388428 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 67066789
1 41987
2 88
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 1m44.177sec
BK_STOP 1494452500026
--------------------
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:66: Boundedness exception: net maybe 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 3.156sec
 170 173 175 186 177 178 179 180
iterations count:832369 (7), effective:461 (0)
initing FirstDep: 0m 3.108sec
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="DrinkVendingMachine-PT-10"
export BK_EXAMINATION="ReachabilityDeadlock"
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/DrinkVendingMachine-PT-10.tgz
mv DrinkVendingMachine-PT-10 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 DrinkVendingMachine-PT-10, examination is ReachabilityDeadlock"
echo "    Time confinement is $BK_TIME_CONFINEMENT seconds"
echo "    Memory confinement is 16384 MBytes"
echo "    Number of cores is 1"
echo "    Run identifier is r021-blw3-149440255000233"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
	echo "The expected result is a vector of positive values"
	echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
	echo "here is the order used to build the result vector(from text file)"
	for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
		echo "FORMULA_NAME $x"
	done
elif [ -f "ReachabilityDeadlock.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 ;

