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 11M
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 112K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 350K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S06J06T04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528500240
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526849505892


BK_STOP 1526849733756

--------------------
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 PolyORBLF-PT-S06J06T04 as instance name.
Using PolyORBLF 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, '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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539170, 'Memory': 946.11, 'Tool': 'lola'}, {'Time': 3539438, 'Memory': 942.26, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
UpperBounds lola PolyORBLF-PT-S06J06T04...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T04: translating PT formula UpperBounds into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
UpperBounds @ PolyORBLF-PT-S06J06T04 @ 3539 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 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7660/65536 symbol table entries, 4125 collisions
lola: preprocessing...
lola: finding significant places
lola: 506 places, 7154 transitions, 452 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2111 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T04-UpperBounds.task
lola: MAX(NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_4_5 + NotifyEventJobQueuedB_4_6 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6) : MAX(AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0) : MAX(AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0) : MAX(Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4) : MAX(NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4) : MAX(NoSigAbort) : MAX(NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4) : MAX(P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6) : MAX(DisablePollingE_1_3) : MAX(IdleTasks_4) : MAX(P_1725_6) : MAX(CreatedJobs_0_1) : MAX(PlaceSources_1) : MAX(ScheduleTaskE_Work_4_2) : MAX(P_1119_4_4) : MAX(AvailableJobId_5)
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(NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_2_6 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_3_5 + NotifyEventJobQueuedB_3_6 + Noti... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1808 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: 12407 markings, 12851 edges, 2481 markings/sec, 0 secs
lola: 25317 markings, 26317 edges, 2582 markings/sec, 5 secs
lola: 38265 markings, 39825 edges, 2590 markings/sec, 10 secs
lola: 50892 markings, 53122 edges, 2525 markings/sec, 15 secs
lola: 63738 markings, 66489 edges, 2569 markings/sec, 20 secs
lola: 76690 markings, 79957 edges, 2590 markings/sec, 25 secs
lola: 89693 markings, 93531 edges, 2601 markings/sec, 30 secs
lola: 102536 markings, 106925 edges, 2569 markings/sec, 35 secs
lola: 115552 markings, 120402 edges, 2603 markings/sec, 40 secs
lola: 128394 markings, 133749 edges, 2568 markings/sec, 45 secs
lola: 141222 markings, 147098 edges, 2566 markings/sec, 50 secs
lola: 153960 markings, 160288 edges, 2548 markings/sec, 55 secs
lola: 166976 markings, 173740 edges, 2603 markings/sec, 60 secs
lola: 179626 markings, 187015 edges, 2530 markings/sec, 65 secs
lola: 192492 markings, 200428 edges, 2573 markings/sec, 70 secs
lola: 205321 markings, 213787 edges, 2566 markings/sec, 75 secs
lola: 218080 markings, 227004 edges, 2552 markings/sec, 80 secs
lola: 230858 markings, 240336 edges, 2556 markings/sec, 85 secs
lola: 243461 markings, 253471 edges, 2521 markings/sec, 90 secs
lola: 256354 markings, 267000 edges, 2579 markings/sec, 95 secs
lola: 269023 markings, 280258 edges, 2534 markings/sec, 100 secs
lola: 281772 markings, 293618 edges, 2550 markings/sec, 105 secs
lola: 294823 markings, 307200 edges, 2610 markings/sec, 110 secs
lola: 307496 markings, 320474 edges, 2535 markings/sec, 115 secs
lola: 320609 markings, 334108 edges, 2623 markings/sec, 120 secs
lola: 333446 markings, 347566 edges, 2567 markings/sec, 125 secs
lola: 346230 markings, 361063 edges, 2557 markings/sec, 130 secs
lola: 358974 markings, 374437 edges, 2549 markings/sec, 135 secs
lola: 371924 markings, 388049 edges, 2590 markings/sec, 140 secs
lola: 384391 markings, 401329 edges, 2493 markings/sec, 145 secs
lola: 397128 markings, 414711 edges, 2547 markings/sec, 150 secs
lola: 409960 markings, 428179 edges, 2566 markings/sec, 155 secs
lola: 422899 markings, 441708 edges, 2588 markings/sec, 160 secs
lola: 435466 markings, 454908 edges, 2513 markings/sec, 165 secs
lola: 448226 markings, 468238 edges, 2552 markings/sec, 170 secs
lola: 460824 markings, 481498 edges, 2520 markings/sec, 175 secs
lola: 473695 markings, 494873 edges, 2574 markings/sec, 180 secs
lola: 486192 markings, 508019 edges, 2499 markings/sec, 185 secs
lola: 498866 markings, 521258 edges, 2535 markings/sec, 190 secs
lola: 511475 markings, 534462 edges, 2522 markings/sec, 195 secs
lola: 524187 markings, 547853 edges, 2542 markings/sec, 200 secs
lola: 537057 markings, 561314 edges, 2574 markings/sec, 205 secs
lola: 549894 markings, 574800 edges, 2567 markings/sec, 210 secs
lola: 562765 markings, 588194 edges, 2574 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 PolyORBLF-PT-S06J06T04-UpperBounds-0 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-1 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-2 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-3 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-4 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-5 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-6 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-7 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-8 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-9 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-10 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 CANNOT_COMPUTE TECHNIQUES SEQUENTIAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN
FORMULA PolyORBLF-PT-S06J06T04-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 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="PolyORBLF-PT-S06J06T04"
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/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 PolyORBLF-PT-S06J06T04, 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 r126-smll-152673528500240"
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 ;