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.r151-smll-167819438000266.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 ltsminxred
Input is DiscoveryGPU-PT-15a, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-smll-167819438000266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:41 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 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Feb 25 13:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 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 53K 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 1678389927492

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=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DiscoveryGPU-PT-15a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 19:25:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-09 19:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 19:25:31] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-09 19:25:31] [INFO ] Transformed 153 places.
[2023-03-09 19:25:31] [INFO ] Transformed 211 transitions.
[2023-03-09 19:25:31] [INFO ] Found NUPN structural information;
[2023-03-09 19:25:31] [INFO ] Parsed PT model containing 153 places and 211 transitions and 678 arcs in 281 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 5 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 8 ms.17987KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 153/153 places, 211/211 transitions.
Computed a total of 18 stabilizing places and 16 stable transitions
Graph (complete) has 454 edges and 153 vertex of which 138 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.6 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 124 transition count 182
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 124 transition count 182
Computed a total of 18 stabilizing places and 16 stable transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 43 place count 110 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 57 place count 110 transition count 154
Computed a total of 18 stabilizing places and 16 stable transitions
Computed a total of 18 stabilizing places and 16 stable transitions
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 110 transition count 153
Computed a total of 18 stabilizing places and 16 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 58 place count 110 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 109 transition count 152
Computed a total of 18 stabilizing places and 16 stable transitions
Computed a total of 18 stabilizing places and 16 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 108 transition count 151
Reduce places removed 2 places and 0 transitions.
Computed a total of 15 stabilizing places and 31 stable transitions
Graph (complete) has 135 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (trivial) has 120 edges and 105 vertex of which 60 / 105 are part of one of the 30 SCC in 4 ms
Free SCC test removed 30 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 19 rules applied. Total rules applied 80 place count 75 transition count 135
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Computed a total of 60 stabilizing places and 75 stable transitions
Iterating post reduction 1 with 45 rules applied. Total rules applied 125 place count 60 transition count 105
Computed a total of 60 stabilizing places and 75 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 139 place count 46 transition count 77
Iterating global reduction 2 with 14 rules applied. Total rules applied 153 place count 46 transition count 77
Computed a total of 46 stabilizing places and 61 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 167 place count 32 transition count 49
Iterating global reduction 2 with 14 rules applied. Total rules applied 181 place count 32 transition count 49
Computed a total of 32 stabilizing places and 33 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 195 place count 18 transition count 21
Iterating global reduction 2 with 14 rules applied. Total rules applied 209 place count 18 transition count 21
Computed a total of 18 stabilizing places and 19 stable transitions
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 223 place count 4 transition count 7
Iterating global reduction 2 with 14 rules applied. Total rules applied 237 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 2 with 2 rules applied. Total rules applied 239 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 2 with 1 rules applied. Total rules applied 240 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 2 with 1 rules applied. Total rules applied 241 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 241 rules in 173 ms. Remains 2 /153 variables (removed 151) and now considering 4/211 (removed 207) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 174 ms. Remains : 2/153 places, 4/211 transitions.
Finished random walk after 32 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=32 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 562 ms.
ITS solved all properties within timeout

BK_STOP 1678389932882

--------------------
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-15a"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DiscoveryGPU-PT-15a, 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 r151-smll-167819438000266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-15a.tgz
mv DiscoveryGPU-PT-15a 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 ;