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 644K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 2.7K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is NeighborGrid-PT-d4n3m2c23, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478200226
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527291586607


BK_STOP 1527291811366

--------------------
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 NeighborGrid-PT-d4n3m2c23 as instance name.
Using NeighborGrid 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': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': 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': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 355029, 'Memory': 611.46, 'Tool': 'gspn'}, {'Time': 474589, 'Memory': 2567.8, 'Tool': 'itstools'}, {'Time': 3540046, 'Memory': 11757.83, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 9.971146019057597x far from the best tool gspn.
UpperBounds lola NeighborGrid-PT-d4n3m2c23...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
UpperBounds @ NeighborGrid-PT-d4n3m2c23 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-UpperBounds.task
lola: MAX(p_0_0_2_2) : MAX(p_2_2_0_1) : MAX(p_1_0_0_0) : MAX(p_2_2_0_2) : MAX(p_2_1_1_0) : MAX(p_1_0_1_0) : MAX(p_2_2_0_0) : MAX(p_0_2_0_0) : MAX(p_0_0_2_2) : MAX(p_1_1_0_2) : MAX(p_2_2_1_2) : MAX(p_2_1_0_1) : MAX(p_1_2_0_0) : MAX(p_2_2_2_0) : MAX(p_0_1_2_0) : MAX(p_1_1_0_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: MAX(p_0_0_2_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 63544 markings, 152461 edges, 12709 markings/sec, 0 secs
lola: 134217 markings, 347062 edges, 14135 markings/sec, 5 secs
lola: 204237 markings, 523353 edges, 14004 markings/sec, 10 secs
lola: 273460 markings, 718842 edges, 13845 markings/sec, 15 secs
lola: 342487 markings, 908731 edges, 13805 markings/sec, 20 secs
lola: 411806 markings, 1116377 edges, 13864 markings/sec, 25 secs
lola: 479601 markings, 1317704 edges, 13559 markings/sec, 30 secs
lola: 549437 markings, 1536082 edges, 13967 markings/sec, 35 secs
lola: 617251 markings, 1749100 edges, 13563 markings/sec, 40 secs
lola: 683875 markings, 1963013 edges, 13325 markings/sec, 45 secs
lola: 750382 markings, 2185464 edges, 13301 markings/sec, 50 secs
lola: 819083 markings, 2432128 edges, 13740 markings/sec, 55 secs
lola: 887940 markings, 2646363 edges, 13771 markings/sec, 60 secs
lola: 953519 markings, 2865859 edges, 13116 markings/sec, 65 secs
lola: 1015947 markings, 3049312 edges, 12486 markings/sec, 70 secs
lola: 1081550 markings, 3251499 edges, 13121 markings/sec, 75 secs
lola: 1144654 markings, 3480035 edges, 12621 markings/sec, 80 secs
lola: 1206888 markings, 3701167 edges, 12447 markings/sec, 85 secs
lola: 1272320 markings, 3913133 edges, 13086 markings/sec, 90 secs
lola: 1341362 markings, 4118749 edges, 13808 markings/sec, 95 secs
lola: 1412512 markings, 4377730 edges, 14230 markings/sec, 100 secs
lola: 1483022 markings, 4599253 edges, 14102 markings/sec, 105 secs
lola: 1552430 markings, 4759781 edges, 13882 markings/sec, 110 secs
lola: 1620784 markings, 4940926 edges, 13671 markings/sec, 115 secs
lola: 1691431 markings, 5129540 edges, 14129 markings/sec, 120 secs
lola: 1763525 markings, 5338886 edges, 14419 markings/sec, 125 secs
lola: 1835401 markings, 5545575 edges, 14375 markings/sec, 130 secs
lola: 1908049 markings, 5747613 edges, 14530 markings/sec, 135 secs
lola: 1979937 markings, 5917634 edges, 14378 markings/sec, 140 secs
lola: 2051293 markings, 6114423 edges, 14271 markings/sec, 145 secs
lola: 2122630 markings, 6332301 edges, 14267 markings/sec, 150 secs
lola: 2193119 markings, 6536308 edges, 14098 markings/sec, 155 secs
lola: 2263448 markings, 6746912 edges, 14066 markings/sec, 160 secs
lola: 2334046 markings, 6989910 edges, 14120 markings/sec, 165 secs
lola: 2404749 markings, 7223024 edges, 14141 markings/sec, 170 secs
lola: 2473586 markings, 7453908 edges, 13767 markings/sec, 175 secs
lola: 2542329 markings, 7658979 edges, 13749 markings/sec, 180 secs
lola: 2610411 markings, 7846747 edges, 13616 markings/sec, 185 secs
lola: 2679370 markings, 8037095 edges, 13792 markings/sec, 190 secs
lola: 2747259 markings, 8224397 edges, 13578 markings/sec, 195 secs
lola: 2817283 markings, 8417712 edges, 14005 markings/sec, 200 secs
lola: 2881616 markings, 8595379 edges, 12867 markings/sec, 205 secs
lola: 2944113 markings, 8767737 edges, 12499 markings/sec, 210 secs
lola: 3006580 markings, 8940245 edges, 12493 markings/sec, 215 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 NeighborGrid-PT-d4n3m2c23-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-UpperBounds-15 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="NeighborGrid-PT-d4n3m2c23"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="mcc4mcc-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/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 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 mcc4mcc-full"
echo " Input is NeighborGrid-PT-d4n3m2c23, 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 r118-csrt-152666478200226"
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 ;