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 7.0M
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 6.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DLCshifumi-PT-6a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-smll-152649737300212
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526659490693


BK_STOP 1526659510107

--------------------
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 DLCshifumi-PT-6a as instance name.
Using DLCshifumi as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 25777, 'Memory': 2298.54, 'Tool': 'marcie'}, {'Time': 26353, 'Memory': 2298.64, 'Tool': 'marcie'}, {'Time': 2420025, 'Memory': 1148.51, 'Tool': 'lola'}, {'Time': 2420475, 'Memory': 1146.12, 'Tool': 'lola'}, {'Time': 3536272, 'Memory': 2373.31, 'Tool': 'itstools'}, {'Time': 3537305, 'Memory': 2348.53, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'gspn'}].
UpperBounds marcie DLCshifumi-PT-6a...
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)

check for maximal unmarked siphon
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: DLCshifumi_PT_6a
(NrP: 3568 NrTr: 25936 NrArc: 101182)

ok
check for constant places
ok
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.083sec

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.024sec

init dd package: 0m 1.554sec


RS generation: 0m10.599sec


-> reachability set: #nodes 3568 (3.6e+03) #states 44,971,908,938,350,550,203,690,037,845,046,502,858,910,712,208,821,747,267,590,169,606,165,280,652,717,530,801,503,529,268,103,662,016,668,696,336,336,122,037,734,100,478,204,746,341,255,232,210,040,244,343,000,001 (160)



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

checking: place_bound(p469)
normalized: place_bound(p469)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1293)
normalized: place_bound(p1293)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-01 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1015)
normalized: place_bound(p1015)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p608)
normalized: place_bound(p608)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1824)
normalized: place_bound(p1824)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-04 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1041)
normalized: place_bound(p1041)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1759)
normalized: place_bound(p1759)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1184)
normalized: place_bound(p1184)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1426)
normalized: place_bound(p1426)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1883)
normalized: place_bound(p1883)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p2860)
normalized: place_bound(p2860)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p1834)
normalized: place_bound(p1834)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p3465)
normalized: place_bound(p3465)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p2936)
normalized: place_bound(p2936)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p627)
normalized: place_bound(p627)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: place_bound(p3491)
normalized: place_bound(p3491)

-> the formula is 1

FORMULA DLCshifumi-PT-6a-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

totally nodes used: 1118766(1.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 25338422 56929593 82268015
used/not used/entry size/cache size: 37825927 29282937 16 1024MB
basic ops cache: hits/miss/sum: 804790 1018940 1823730
used/not used/entry size/cache size: 1178312 15598904 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 1152 3568 4720
used/not used/entry size/cache size: 3567 2093585 32 64MB
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 65998359
1 1102276
2 8197
3 32
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m14.864sec

...

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="DLCshifumi-PT-6a"
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/DLCshifumi-PT-6a.tgz
mv DLCshifumi-PT-6a 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 DLCshifumi-PT-6a, 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 r066-smll-152649737300212"
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 ;