About the Execution of Irma.struct for NeighborGrid-PT-d5n4m1t35
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1964.200 | 110858.00 | 295330.00 | 146.90 | F | 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 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 irma4mcc-structural
Input is NeighborGrid-PT-d5n4m1t35, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473800237
=====================================================================
--------------------
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-ReachabilityDeadlock-0
=== Now, execution of the tool begins
BK_START 1527151946518
BK_STOP 1527152057376
--------------------
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 NeighborGrid-PT-d5n4m1t35 as instance name.
Using NeighborGrid as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityDeadlock', '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': 103557, 'Memory': 1655.49, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
ReachabilityDeadlock lola NeighborGrid-PT-d5n4m1t35...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 ReachabilityDeadlock into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityDeadlock @ NeighborGrid-PT-d5n4m1t35 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-ReachabilityDeadlock.task
lola: E (F (DEADLOCK))
lola: E (F (DEADLOCK))
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: siphon||findpath||search) (--findpath=par,--siphontrap=par)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4092 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH (findpath)
lola: findpath: using deadlock preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: findpath: starting randomized, memory-less exploration (--search=findpath)
lola: findpath: searching for paths with maximal depth 1000000 (--depthlimit)
lola: findpath: no retry limit given (--retrylimit)
lola: findpath: transitions are chosen randomly
lola: computing symmetries (--symmetry)
lola: time limit for symmetry computation of 300 seconds given (--symmtimelimit)
lola: STP running || 1 tries, 27351 fired transitions, 0 secs
lola: 80 generators; 521743 candidates remain ( 0%), 0 secs
lola: STP: formula with 2567170 variables and 7689220 clauses shipped to Minisat
lola: STP running || 1 tries, 55982 fired transitions, 5 secs
lola: 602 generators; 503016 candidates remain ( 0%), 5 secs
lola: computed 1115 generators (9 in search tree, 1106 by composition)
lola: representing 3.93216E+06 symmetries
lola: 0 dead branches visited in search tree
lola: STP running || 1 tries, 83438 fired transitions, 10 secs || 7456 markings, 7455 edges, 1491 markings/sec, 10 secs
lola: STP running || 1 tries, 112247 fired transitions, 15 secs || 31825 markings, 32042 edges, 4874 markings/sec, 15 secs
lola: STP running || 1 tries, 144235 fired transitions, 20 secs || 59323 markings, 61359 edges, 5500 markings/sec, 20 secs
lola: STP running || 1 tries, 169635 fired transitions, 25 secs || 85574 markings, 89700 edges, 5250 markings/sec, 25 secs
lola: STP running || 1 tries, 203113 fired transitions, 30 secs || 113847 markings, 120224 edges, 5655 markings/sec, 30 secs
lola: STP running || 1 tries, 234439 fired transitions, 35 secs || 142865 markings, 150850 edges, 5804 markings/sec, 35 secs
lola: STP running || 1 tries, 263667 fired transitions, 40 secs || 170120 markings, 179154 edges, 5451 markings/sec, 40 secs
lola: STP running || 1 tries, 293144 fired transitions, 45 secs || 197127 markings, 207669 edges, 5401 markings/sec, 45 secs
lola: STP running || 1 tries, 322076 fired transitions, 50 secs || 210297 markings, 417500 edges, 2634 markings/sec, 50 secs
lola: STP running || 1 tries, 351755 fired transitions, 55 secs || 212835 markings, 729868 edges, 508 markings/sec, 55 secs
lola: stp: The siphon/trap property holds
lola: RESULT
lola: result: no
lola: produced by: stp
lola: The net does not have deadlocks.
FORMULA NeighborGrid-PT-d5n4m1t35-ReachabilityDeadlock-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL 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="NeighborGrid-PT-d5n4m1t35"
export BK_EXAMINATION="ReachabilityDeadlock"
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/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 irma4mcc-structural"
echo " Input is NeighborGrid-PT-d5n4m1t35, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666473800237"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 ;