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)
...................................................................................................................
/home/mcc/execution
total 205M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13M May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 34M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 464K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 6.5M May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 134M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DrinkVendingMachine-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-blw3-152649946100373
=====================================================================

--------------------
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 DrinkVendingMachine-PT-10-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527067839267


BK_STOP 1527067904784

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DrinkVendingMachine-PT-10 as instance name.
Using DrinkVendingMachine as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Extended Free Choice': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 98980, 'Memory': 8443.58, 'Tool': 'marcie'}, {'Time': 105099, 'Memory': 8443.64, 'Tool': 'marcie'}, {'Time': 133917, 'Memory': 7768.75, 'Tool': 'itstools'}, {'Time': 168749, 'Memory': 7646.65, 'Tool': 'itstools'}, {'Time': 3539962, 'Memory': 7167.57, 'Tool': 'lola'}, {'Time': 3540256, 'Memory': 7066.62, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 35.76441705395029x far from the best tool marcie.
UpperBounds marcie DrinkVendingMachine-PT-10...
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: DrinkVendingMachine_PT_10
(NrP: 120 NrTr: 111160 NrArc: 1026520)

check for maximal unmarked siphon
ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m10.239sec

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

net check time: 0m 0.141sec

init dd package: 0m 1.262sec

ptnet_zbdd.cc:66: Boundedness exception: net maybe not 1-bounded!

parse successfull
net created successfully

Net: DrinkVendingMachine_PT_10
(NrP: 120 NrTr: 111160 NrArc: 1026520)

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
parse formulas
formulas created successfully
place and transition orderings generation:0m10.385sec

ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


net check time: 0m 0.136sec

init dd package: 0m 4.119sec

initing FirstDep: 0m 2.641sec

170 173 175 186 177 178 179 180
iterations count:832369 (7), effective:461 (0)


RS generation: 0m 1.847sec


-> reachability set: #nodes 180 (1.8e+02) #states 1,152,921,504,606,846,976 (18)



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

initing FirstDep: 0m 2.706sec

checking: place_bound(optionSlots_2)
normalized: place_bound(optionSlots_2)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wait_7)
normalized: place_bound(wait_7)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wait_36)
normalized: place_bound(wait_36)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ready_24)
normalized: place_bound(ready_24)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(optionSlots_10)
normalized: place_bound(optionSlots_10)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ready_7)
normalized: place_bound(ready_7)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wait_25)
normalized: place_bound(wait_25)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ready_33)
normalized: place_bound(ready_33)

-> the formula is 1

FORMULA DrinkVendingMachine-PT-10-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(optionSlots_1,optionSlots_2,optionSlots_3,optionSlots_4,optionSlots_5,optionSlots_6,optionSlots_7,optionSlots_8,optionSlots_9,optionSlots_10)
normalized: place_bound(optionSlots_1,optionSlots_2,optionSlots_3,optionSlots_4,optionSlots_5,optionSlots_6,optionSlots_7,optionSlots_8,optionSlots_9,optionSlots_10)

-> the formula is 10

FORMULA DrinkVendingMachine-PT-10-UpperBounds-01 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(theOptions_1,theOptions_2,theOptions_3,theOptions_5,theOptions_4,theOptions_7,theOptions_6,theOptions_9,theOptions_8,theOptions_10)
normalized: place_bound(theOptions_1,theOptions_2,theOptions_3,theOptions_5,theOptions_4,theOptions_7,theOptions_6,theOptions_9,theOptions_8,theOptions_10)

-> the formula is 10

FORMULA DrinkVendingMachine-PT-10-UpperBounds-03 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(optionSlots_1,optionSlots_2,optionSlots_3,optionSlots_4,optionSlots_5,optionSlots_6,optionSlots_7,optionSlots_8,optionSlots_9,optionSlots_10)
normalized: place_bound(optionSlots_1,optionSlots_2,optionSlots_3,optionSlots_4,optionSlots_5,optionSlots_6,optionSlots_7,optionSlots_8,optionSlots_9,optionSlots_10)

-> the formula is 10

FORMULA DrinkVendingMachine-PT-10-UpperBounds-04 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(productSlots_1,productSlots_3,productSlots_2,productSlots_5,productSlots_4,productSlots_7,productSlots_6,productSlots_9,productSlots_8,productSlots_10)
normalized: place_bound(productSlots_1,productSlots_3,productSlots_2,productSlots_5,productSlots_4,productSlots_7,productSlots_6,productSlots_9,productSlots_8,productSlots_10)

-> the formula is 10

FORMULA DrinkVendingMachine-PT-10-UpperBounds-05 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(theProducts_2,theProducts_3,theProducts_1,theProducts_6,theProducts_7,theProducts_4,theProducts_5,theProducts_10,theProducts_8,theProducts_9)
normalized: place_bound(theProducts_2,theProducts_3,theProducts_1,theProducts_6,theProducts_7,theProducts_4,theProducts_5,theProducts_10,theProducts_8,theProducts_9)

-> the formula is 10

FORMULA DrinkVendingMachine-PT-10-UpperBounds-07 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wait_1,wait_4,wait_5,wait_2,wait_3,wait_9,wait_8,wait_7,wait_6,wait_13,wait_12,wait_11,wait_10,wait_17,wait_16,wait_15,wait_14,wait_21,wait_20,wait_19,wait_18,wait_26,wait_27,wait_28,wait_29,wait_22,wait_23,wait_24,wait_25,wait_34,wait_35,wait_36,wait_37,wait_30,wait_31,wait_32,wait_33,wait_39,wait_38,wait_40)
normalized: place_bound(wait_1,wait_4,wait_5,wait_2,wait_3,wait_9,wait_8,wait_7,wait_6,wait_13,wait_12,wait_11,wait_10,wait_17,wait_16,wait_15,wait_14,wait_21,wait_20,wait_19,wait_18,wait_26,wait_27,wait_28,wait_29,wait_22,wait_23,wait_24,wait_25,wait_34,wait_35,wait_36,wait_37,wait_30,wait_31,wait_32,wait_33,wait_39,wait_38,wait_40)

-> the formula is 40

FORMULA DrinkVendingMachine-PT-10-UpperBounds-00 40 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(wait_1,wait_4,wait_5,wait_2,wait_3,wait_9,wait_8,wait_7,wait_6,wait_13,wait_12,wait_11,wait_10,wait_17,wait_16,wait_15,wait_14,wait_21,wait_20,wait_19,wait_18,wait_26,wait_27,wait_28,wait_29,wait_22,wait_23,wait_24,wait_25,wait_34,wait_35,wait_36,wait_37,wait_30,wait_31,wait_32,wait_33,wait_39,wait_38,wait_40)
normalized: place_bound(wait_1,wait_4,wait_5,wait_2,wait_3,wait_9,wait_8,wait_7,wait_6,wait_13,wait_12,wait_11,wait_10,wait_17,wait_16,wait_15,wait_14,wait_21,wait_20,wait_19,wait_18,wait_26,wait_27,wait_28,wait_29,wait_22,wait_23,wait_24,wait_25,wait_34,wait_35,wait_36,wait_37,wait_30,wait_31,wait_32,wait_33,wait_39,wait_38,wait_40)

-> the formula is 40

FORMULA DrinkVendingMachine-PT-10-UpperBounds-02 40 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ready_3,ready_2,ready_5,ready_4,ready_1,ready_11,ready_10,ready_13,ready_12,ready_7,ready_6,ready_9,ready_8,ready_20,ready_21,ready_18,ready_19,ready_16,ready_17,ready_14,ready_15,ready_28,ready_29,ready_26,ready_27,ready_24,ready_25,ready_22,ready_23,ready_37,ready_36,ready_35,ready_34,ready_33,ready_32,ready_31,ready_30,ready_40,ready_39,ready_38)
normalized: place_bound(ready_3,ready_2,ready_5,ready_4,ready_1,ready_11,ready_10,ready_13,ready_12,ready_7,ready_6,ready_9,ready_8,ready_20,ready_21,ready_18,ready_19,ready_16,ready_17,ready_14,ready_15,ready_28,ready_29,ready_26,ready_27,ready_24,ready_25,ready_22,ready_23,ready_37,ready_36,ready_35,ready_34,ready_33,ready_32,ready_31,ready_30,ready_40,ready_39,ready_38)

-> the formula is 40

FORMULA DrinkVendingMachine-PT-10-UpperBounds-06 40 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 38895 (3.9e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1068551 6160818 7229369
used/not used/entry size/cache size: 5537550 61571314 16 1024MB
basic ops cache: hits/miss/sum: 1396 11345 12741
used/not used/entry size/cache size: 28541 16748675 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: 354 1080 1434
used/not used/entry size/cache size: 180 8388428 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67070031
1 38771
2 62
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 1m 2.940sec

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="UpperBounds"
export BK_TOOL="irma4mcc-full"
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
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is DrinkVendingMachine-PT-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-blw3-152649946100373"
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 '' UpperBounds.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 ;