Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r149-smll-167819435600201.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DiscoveryGPU-PT-08b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r149-smll-167819435600201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 61K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1678370976849

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DiscoveryGPU-PT-08b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 14:09:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-09 14:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:09:40] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2023-03-09 14:09:40] [INFO ] Transformed 240 places.
[2023-03-09 14:09:40] [INFO ] Transformed 254 transitions.
[2023-03-09 14:09:40] [INFO ] Found NUPN structural information;
[2023-03-09 14:09:40] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 292 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 7 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 8 ms.18517KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 240/240 places, 254/254 transitions.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 412 edges and 240 vertex of which 208 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.11 ms
Discarding 32 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 208 transition count 184
Reduce places removed 54 places and 0 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Iterating post reduction 1 with 54 rules applied. Total rules applied 109 place count 154 transition count 184
Computed a total of 35 stabilizing places and 35 stable transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 109 place count 154 transition count 176
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 125 place count 146 transition count 176
Computed a total of 27 stabilizing places and 27 stable transitions
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 137 place count 134 transition count 164
Iterating global reduction 2 with 12 rules applied. Total rules applied 149 place count 134 transition count 164
Computed a total of 25 stabilizing places and 25 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 149 place count 134 transition count 162
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 132 transition count 162
Computed a total of 27 stabilizing places and 25 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 125 transition count 155
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 125 transition count 155
Computed a total of 27 stabilizing places and 25 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 118 transition count 148
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 118 transition count 148
Computed a total of 27 stabilizing places and 25 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 188 place count 111 transition count 134
Iterating global reduction 2 with 7 rules applied. Total rules applied 195 place count 111 transition count 134
Computed a total of 27 stabilizing places and 25 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 104 transition count 127
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 104 transition count 127
Computed a total of 27 stabilizing places and 25 stable transitions
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 309 place count 54 transition count 77
Computed a total of 54 stabilizing places and 61 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 316 place count 47 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 323 place count 47 transition count 63
Computed a total of 47 stabilizing places and 54 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 40 transition count 56
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 40 transition count 56
Computed a total of 40 stabilizing places and 47 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 344 place count 33 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 351 place count 33 transition count 42
Computed a total of 33 stabilizing places and 33 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 358 place count 26 transition count 35
Iterating global reduction 2 with 7 rules applied. Total rules applied 365 place count 26 transition count 35
Computed a total of 26 stabilizing places and 26 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 372 place count 19 transition count 21
Iterating global reduction 2 with 7 rules applied. Total rules applied 379 place count 19 transition count 21
Computed a total of 19 stabilizing places and 19 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 386 place count 12 transition count 14
Iterating global reduction 2 with 7 rules applied. Total rules applied 393 place count 12 transition count 14
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 12 transition count 13
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Graph (complete) has 10 edges and 9 vertex of which 6 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 400 place count 6 transition count 7
Reduce places removed 2 places and 0 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 402 place count 4 transition count 7
Computed a total of 4 stabilizing places and 5 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 404 place count 3 transition count 6
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 405 place count 3 transition count 5
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 406 place count 2 transition count 4
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Applied a total of 406 rules in 219 ms. Remains 2 /240 variables (removed 238) and now considering 4/254 (removed 250) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 220 ms. Remains : 2/240 places, 4/254 transitions.
Finished random walk after 18 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=9 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 611 ms.
ITS solved all properties within timeout

BK_STOP 1678370982670

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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="DiscoveryGPU-PT-08b"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-08b, 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 r149-smll-167819435600201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;