About the Execution of M4M.full for QuasiCertifProtocol-PT-32
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7982.910 | 236829.00 | 261119.00 | 1907.70 | ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? | 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 2.5M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K 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 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583700100
=====================================================================
--------------------
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 QuasiCertifProtocol-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527953189984
BK_STOP 1527953426813
--------------------
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 QuasiCertifProtocol-PT-32 as instance name.
Using QuasiCertifProtocol 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': 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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 2272170, 'Memory': 15952.04, 'Tool': 'lola'}, {'Time': 2921905, 'Memory': 15952.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola QuasiCertifProtocol-PT-32...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-32: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
UpperBounds @ QuasiCertifProtocol-PT-32 @ 3538 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 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-32-UpperBounds.task
lola: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_23 + n4_24 + n4_25 + n4_26 + n4_27 + n4_28 + n4_29 + n4_30 + n4_31 + n4_32 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) : MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 + Sstart_23 + Sstart_24 + Sstart_25 + Sstart_26 + Sstart_27 + Sstart_28 + Sstart_29 + Sstart_30 + Sstart_31 + Sstart_32) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(malicious_reservoir) : MAX(n7_27_21) : MAX(n5_18) : MAX(n9_11_13) : MAX(n8_25_2) : MAX(n9_7_0) : MAX(n7_17_0) : MAX(n7_20_30) : MAX(n9_10_21)
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(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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: 267911 markings, 314841 edges, 53582 markings/sec, 0 secs
lola: 532453 markings, 633609 edges, 52908 markings/sec, 5 secs
lola: 799627 markings, 950737 edges, 53435 markings/sec, 10 secs
lola: 1067721 markings, 1282239 edges, 53619 markings/sec, 15 secs
lola: 1339851 markings, 1615503 edges, 54426 markings/sec, 20 secs
lola: 1604844 markings, 1948073 edges, 52999 markings/sec, 25 secs
lola: 1866423 markings, 2281663 edges, 52316 markings/sec, 30 secs
lola: 2131216 markings, 2618612 edges, 52959 markings/sec, 35 secs
lola: 2395540 markings, 2971357 edges, 52865 markings/sec, 40 secs
lola: 2661592 markings, 3314233 edges, 53210 markings/sec, 45 secs
lola: 2933099 markings, 3679147 edges, 54301 markings/sec, 50 secs
lola: 3201882 markings, 4055255 edges, 53757 markings/sec, 55 secs
lola: 3488690 markings, 4443706 edges, 57362 markings/sec, 60 secs
lola: 3764751 markings, 4834551 edges, 55212 markings/sec, 65 secs
lola: 4039007 markings, 5235548 edges, 54851 markings/sec, 70 secs
lola: 4311752 markings, 5640191 edges, 54549 markings/sec, 75 secs
lola: 4584742 markings, 6047200 edges, 54598 markings/sec, 80 secs
lola: 4858542 markings, 6476588 edges, 54760 markings/sec, 85 secs
lola: 5137362 markings, 6918262 edges, 55764 markings/sec, 90 secs
lola: 5406919 markings, 7366926 edges, 53911 markings/sec, 95 secs
lola: 5676863 markings, 7827553 edges, 53989 markings/sec, 100 secs
lola: 5950317 markings, 8310982 edges, 54691 markings/sec, 105 secs
lola: 6218463 markings, 8791158 edges, 53629 markings/sec, 110 secs
lola: 6477929 markings, 9378244 edges, 51893 markings/sec, 115 secs
lola: 6705515 markings, 10103453 edges, 45517 markings/sec, 120 secs
lola: 6950586 markings, 10807369 edges, 49014 markings/sec, 125 secs
lola: 7176251 markings, 11553932 edges, 45133 markings/sec, 130 secs
lola: 7412015 markings, 12242175 edges, 47153 markings/sec, 135 secs
lola: 7665820 markings, 12906429 edges, 50761 markings/sec, 140 secs
lola: 7889723 markings, 13656469 edges, 44781 markings/sec, 145 secs
lola: 8122348 markings, 14356694 edges, 46525 markings/sec, 150 secs
lola: 8338995 markings, 15100913 edges, 43329 markings/sec, 155 secs
lola: 8567436 markings, 15679164 edges, 45688 markings/sec, 160 secs
lola: 8828905 markings, 15997206 edges, 52294 markings/sec, 165 secs
lola: 9082537 markings, 16305443 edges, 50726 markings/sec, 170 secs
lola: 9341096 markings, 16628700 edges, 51712 markings/sec, 175 secs
lola: 9613040 markings, 16966888 edges, 54389 markings/sec, 180 secs
lola: 9879339 markings, 17317471 edges, 53260 markings/sec, 185 secs
lola: 10159271 markings, 17666879 edges, 55986 markings/sec, 190 secs
lola: 10432693 markings, 18027004 edges, 54684 markings/sec, 195 secs
lola: 10708914 markings, 18396888 edges, 55244 markings/sec, 200 secs
lola: 10988542 markings, 18769842 edges, 55926 markings/sec, 205 secs
lola: 11269384 markings, 19157141 edges, 56168 markings/sec, 210 secs
lola: 11555474 markings, 19567740 edges, 57218 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 QuasiCertifProtocol-PT-32-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA QuasiCertifProtocol-PT-32-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 stdout -----
----- Finished stderr -----
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="QuasiCertifProtocol-PT-32"
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/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-32 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 QuasiCertifProtocol-PT-32, 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 r142-qhx2-152673583700100"
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 '
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 ;