fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r091-blw7-152650003700373
Last Updated
June 26, 2018

About the Execution of Irma.struct for GlobalResAllocation-COL-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3702.520 867424.00 1505537.00 3168.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)
...............
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 28K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is GlobalResAllocation-COL-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003700373
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527207870030


BK_STOP 1527208737454

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using GlobalResAllocation-COL-06 as instance name.
Using GlobalResAllocation as model name.
Using algorithm or tool random-forest.
Model characteristics are: {'Examination': 'UpperBounds', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': None, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 3539567, 'Memory': 2589.83, 'Tool': 'lola'}, {'Time': 3540602, 'Memory': 2513.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
UpperBounds lola GlobalResAllocation-COL-06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
GlobalResAllocation-COL-06: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
GlobalResAllocation-COL-06: translating COL formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ GlobalResAllocation-COL-06 @ 2878 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 2878 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 136764/65536 symbol table entries, 111398 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 136662 transitions, 78 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5250 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-06-UpperBounds.task
lola: MAX(p100 + p101 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p79 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p78 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p76 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p65 + p77 + p53 + p41 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p6 + p7 + p8 + p9 + p10 + p11) : MAX(p29 + p28 + p27 + p26 + p25 + p24) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) : MAX(p6 + p7 + p8 + p9 + p10 + p11) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p6 + p7 + p8 + p9 + p10 + p11) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p100 + p101 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p79 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p78 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p76 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p65 + p77 + p53 + p41 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p29 + p28 + p27 + p26 + p25 + p24) : MAX(p29 + p28 + p27 + p26 + p25 + p24) : MAX(p0 + p1 + p2 + p3 + p4 + p5) : MAX(p29 + p28 + p27 + p26 + p25 + p24) : MAX(p100 + p101 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p79 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p78 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p76 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p65 + p77 + p53 + p41 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p100 + p101 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p79 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p78 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p76 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p65 + p77 + p53 + p41 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 178 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p79 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p78 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p76 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p65 + p77 + p53 + p41 + p87 + p88 + p89 + p90 + p91 + p92 + p93 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 312 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 1 markings, 0 edges, 0 markings/sec, 0 secs
lola: 61 markings, 74 edges, 12 markings/sec, 5 secs
lola: 167 markings, 212 edges, 21 markings/sec, 10 secs
lola: 293 markings, 380 edges, 25 markings/sec, 15 secs
lola: 434 markings, 579 edges, 28 markings/sec, 20 secs
lola: 573 markings, 775 edges, 28 markings/sec, 25 secs
lola: 713 markings, 975 edges, 28 markings/sec, 30 secs
lola: 790 markings, 1079 edges, 15 markings/sec, 35 secs
lola: 911 markings, 1252 edges, 24 markings/sec, 40 secs
lola: 989 markings, 1362 edges, 16 markings/sec, 45 secs
lola: 1099 markings, 1518 edges, 22 markings/sec, 50 secs
lola: 1167 markings, 1618 edges, 14 markings/sec, 55 secs
lola: 1239 markings, 1727 edges, 14 markings/sec, 60 secs
lola: 1315 markings, 1838 edges, 15 markings/sec, 65 secs
lola: 1397 markings, 1951 edges, 16 markings/sec, 70 secs
lola: 1503 markings, 2091 edges, 21 markings/sec, 75 secs
lola: 1649 markings, 2294 edges, 29 markings/sec, 80 secs
lola: 1788 markings, 2485 edges, 28 markings/sec, 85 secs
lola: 1960 markings, 2726 edges, 34 markings/sec, 90 secs
lola: 2141 markings, 2988 edges, 36 markings/sec, 95 secs
lola: 2222 markings, 3102 edges, 16 markings/sec, 100 secs
lola: 2393 markings, 3366 edges, 34 markings/sec, 105 secs
lola: 2572 markings, 3637 edges, 36 markings/sec, 110 secs
lola: 2675 markings, 3784 edges, 21 markings/sec, 115 secs
lola: 2755 markings, 3889 edges, 16 markings/sec, 120 secs
lola: 2876 markings, 4067 edges, 24 markings/sec, 125 secs
lola: 2986 markings, 4220 edges, 22 markings/sec, 130 secs
lola: 3107 markings, 4381 edges, 24 markings/sec, 135 secs
lola: 3245 markings, 4576 edges, 28 markings/sec, 140 secs
lola: 3444 markings, 4890 edges, 40 markings/sec, 145 secs
lola: 3549 markings, 5041 edges, 21 markings/sec, 150 secs
lola: 3646 markings, 5173 edges, 19 markings/sec, 155 secs
lola: 3806 markings, 5396 edges, 32 markings/sec, 160 secs
lola: 3983 markings, 5665 edges, 35 markings/sec, 165 secs
lola: 4158 markings, 5922 edges, 35 markings/sec, 170 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
Aborted (core dumped)
FORMULA GlobalResAllocation-COL-06-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA GlobalResAllocation-COL-06-UpperBounds-15 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="GlobalResAllocation-COL-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="irma4mcc-structural"
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/GlobalResAllocation-COL-06.tgz
mv GlobalResAllocation-COL-06 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-structural"
echo " Input is GlobalResAllocation-COL-06, 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 r091-blw7-152650003700373"
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 ;