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 59M
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K 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.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.7K 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.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 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 59M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is NeighborGrid-PT-d5n4m1t35, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478200234
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527291940784


BK_STOP 1527292169079

--------------------
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-d5n4m1t35 as instance name.
Using NeighborGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1125102, 'Memory': 10389.31, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola NeighborGrid-PT-d5n4m1t35...

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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d5n4m1t35: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3538 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 197632/65536 symbol table entries, 177787 collisions
lola: preprocessing...
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1024 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1))))) : ((E (X ((p_0_0_3_3_3 + 1 <= p_3_0_0_1_1))) OR ((p_2_1_3_3_2 + 1 <= p_0_2_3_1_0) OR (p_2_3_1_1_2 <= 2))) AND E (G ((p_2_3_2_2_2 <= p_0_0_3_2_1)))) : E (X (A (X (((2 <= p_2_3_2_3_0) OR (p_1_1_3_3_3 <= p_0_0_1_2_1)))))) : ((p_0_3_3_2_1 <= p_1_0_1_2_3) AND ((A (G ((p_2_2_0_1_1 <= p_0_2_1_2_3))) AND ((p_2_3_0_0_1 <= p_1_1_3_1_2) AND (p_2_3_2_1_0 <= p_2_0_1_1_2) AND (p_1_1_3_1_1 <= 1))) OR (((p_2_0_1_0_3 <= 0) OR (p_0_2_2_1_1 <= 1)) AND (p_2_3_3_2_1 <= 0)))) : A (F (A (X ((p_3_2_2_2_1 <= p_1_0_1_2_3))))) : A ((E (X ((2 <= p_0_1_0_1_3))) U A (X ((3 <= p_3_1_3_0_2))))) : ((NOT(E (F ((p_3_1_0_0_2 <= p_0_3_1_1_0)))) AND A (((2 <= p_1_3_0_1_2) U (p_1_1_1_2_0 <= p_2_0_3_0_2)))) OR E (G (((1 <= p_1_3_1_1_3) AND (p_0_1_3_2_1 <= p_0_0_2_1_2) AND (p_0_3_0_1_2 <= p_0_3_3_3_0))))) : ((3 <= p_0_0_3_1_1) OR ((1 <= p_2_1_1_3_1) AND (A (F ((2 <= p_0_3_0_2_3))) OR E (F ((3 <= p_1_3_1_1_3)))))) : (A (F (((p_2_2_0_2_3 <= 0) OR (p_3_1_3_3_3 + 1 <= p_0_1_0_0_3)))) AND E (F ((p_0_1_0_2_3 <= p_0_0_0_0_2)))) : E ((((p_3_3_1_0_3 <= 2) OR (p_0_2_3_0_1 <= p_0_0_0_1_0)) U ((3 <= p_2_2_3_3_0) AND (3 <= p_3_3_1_2_2)))) : A (X (A (F (((p_2_3_2_2_3 <= p_2_0_0_2_1) OR (2 <= p_3_3_1_3_1)))))) : ((p_3_3_3_1_0 <= p_1_0_0_2_3) AND E (F (A (F ((3 <= p_0_0_3_2_0)))))) : NOT(E (F (A (X ((3 <= p_3_0_2_0_1)))))) : A (G ((p_2_0_0_1_0 <= 2))) : A (F ((3 <= p_1_3_1_3_2))) : (A (X (E (F ((p_2_2_2_0_1 <= p_2_3_2_0_3))))) AND ((p_1_2_1_2_2 + 1 <= p_1_0_0_2_0) OR ((p_1_0_2_1_3 <= p_3_0_3_2_2) AND (1 <= p_0_3_2_0_0))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1)))))
lola: processed formula: A (F (((p_0_1_1_2_1 + 1 <= p_3_2_2_0_3) AND (p_1_0_1_2_2 <= 1) AND (((p_3_0_1_0_1 <= p_1_1_1_2_3) AND (3 <= p_3_3_0_1_3)) OR (p_1_0_3_3_1 <= 1)))))
lola: processed formula length: 148
lola: 0 rewrites
lola: formula mentions 0 of 1024 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d5n4m1t35-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4096 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 336 markings, 335 edges, 67 markings/sec, 0 secs
lola: 371 markings, 370 edges, 7 markings/sec, 5 secs
lola: 378 markings, 377 edges, 1 markings/sec, 10 secs
lola: 389 markings, 388 edges, 2 markings/sec, 15 secs
lola: 396 markings, 395 edges, 1 markings/sec, 20 secs
lola: 406 markings, 405 edges, 2 markings/sec, 25 secs
lola: 415 markings, 414 edges, 2 markings/sec, 30 secs
lola: 424 markings, 423 edges, 2 markings/sec, 35 secs
lola: 437 markings, 436 edges, 3 markings/sec, 40 secs
lola: 444 markings, 443 edges, 1 markings/sec, 45 secs
lola: 455 markings, 454 edges, 2 markings/sec, 50 secs
lola: 463 markings, 462 edges, 2 markings/sec, 55 secs
lola: 470 markings, 469 edges, 1 markings/sec, 60 secs
lola: 478 markings, 477 edges, 2 markings/sec, 65 secs
lola: 487 markings, 486 edges, 2 markings/sec, 70 secs
lola: 496 markings, 495 edges, 2 markings/sec, 75 secs
lola: 505 markings, 504 edges, 2 markings/sec, 80 secs
lola: 515 markings, 514 edges, 2 markings/sec, 85 secs
lola: 525 markings, 524 edges, 2 markings/sec, 90 secs
lola: 534 markings, 533 edges, 2 markings/sec, 95 secs
lola: 543 markings, 542 edges, 2 markings/sec, 100 secs
lola: 558 markings, 557 edges, 3 markings/sec, 105 secs
lola: 570 markings, 569 edges, 2 markings/sec, 110 secs
lola: 582 markings, 581 edges, 2 markings/sec, 115 secs
lola: 591 markings, 590 edges, 2 markings/sec, 120 secs
lola: 603 markings, 602 edges, 2 markings/sec, 125 secs
lola: 614 markings, 613 edges, 2 markings/sec, 130 secs
lola: 622 markings, 621 edges, 2 markings/sec, 135 secs
lola: 631 markings, 630 edges, 2 markings/sec, 140 secs
lola: 641 markings, 640 edges, 2 markings/sec, 145 secs
lola: 653 markings, 652 edges, 2 markings/sec, 150 secs
lola: 664 markings, 663 edges, 2 markings/sec, 155 secs
lola: 674 markings, 673 edges, 2 markings/sec, 160 secs
lola: 687 markings, 686 edges, 3 markings/sec, 165 secs
lola: 697 markings, 696 edges, 2 markings/sec, 170 secs
lola: 708 markings, 707 edges, 2 markings/sec, 175 secs
lola: 716 markings, 715 edges, 2 markings/sec, 180 secs
lola: 725 markings, 724 edges, 2 markings/sec, 185 secs
lola: 733 markings, 732 edges, 2 markings/sec, 190 secs
lola: 742 markings, 741 edges, 2 markings/sec, 195 secs
lola: 752 markings, 751 edges, 2 markings/sec, 200 secs
lola: 763 markings, 762 edges, 2 markings/sec, 205 secs
lola: 773 markings, 772 edges, 2 markings/sec, 210 secs
lola: 785 markings, 784 edges, 2 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 1: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL 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="NeighborGrid-PT-d5n4m1t35"
export BK_EXAMINATION="CTLCardinality"
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-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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-d5n4m1t35, examination is CTLCardinality"
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-152666478200234"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;