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.r147-smll-167819433700191.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 itstools
Input is DiscoveryGPU-PT-07b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-smll-167819433700191
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:36 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 24K 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.3K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:37 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 54K 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 1678342700195

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=itstools
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DiscoveryGPU-PT-07b
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202303021504
[2023-03-09 06:18:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-09 06:18:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:18:23] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-03-09 06:18:23] [INFO ] Transformed 212 places.
[2023-03-09 06:18:23] [INFO ] Transformed 224 transitions.
[2023-03-09 06:18:23] [INFO ] Found NUPN structural information;
[2023-03-09 06:18:23] [INFO ] Parsed PT model containing 212 places and 224 transitions and 582 arcs in 302 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.18518KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 212/212 places, 224/224 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Graph (complete) has 363 edges and 212 vertex of which 184 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.10 ms
Discarding 28 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 184 transition count 162
Reduce places removed 48 places and 0 transitions.
Computed a total of 31 stabilizing places and 31 stable transitions
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 136 transition count 162
Computed a total of 31 stabilizing places and 31 stable transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 97 place count 136 transition count 155
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 111 place count 129 transition count 155
Computed a total of 24 stabilizing places and 24 stable transitions
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 122 place count 118 transition count 144
Iterating global reduction 2 with 11 rules applied. Total rules applied 133 place count 118 transition count 144
Computed a total of 22 stabilizing places and 22 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 133 place count 118 transition count 142
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 116 transition count 142
Computed a total of 24 stabilizing places and 22 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 110 transition count 136
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 110 transition count 136
Computed a total of 24 stabilizing places and 22 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 104 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 104 transition count 130
Computed a total of 24 stabilizing places and 22 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 98 transition count 118
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 98 transition count 118
Computed a total of 24 stabilizing places and 22 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 179 place count 92 transition count 112
Iterating global reduction 2 with 6 rules applied. Total rules applied 185 place count 92 transition count 112
Computed a total of 24 stabilizing places and 22 stable transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 273 place count 48 transition count 68
Computed a total of 48 stabilizing places and 54 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 279 place count 42 transition count 56
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 42 transition count 56
Computed a total of 42 stabilizing places and 48 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 291 place count 36 transition count 50
Iterating global reduction 2 with 6 rules applied. Total rules applied 297 place count 36 transition count 50
Computed a total of 36 stabilizing places and 42 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 303 place count 30 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 309 place count 30 transition count 38
Computed a total of 30 stabilizing places and 30 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 315 place count 24 transition count 32
Iterating global reduction 2 with 6 rules applied. Total rules applied 321 place count 24 transition count 32
Computed a total of 24 stabilizing places and 24 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 327 place count 18 transition count 20
Iterating global reduction 2 with 6 rules applied. Total rules applied 333 place count 18 transition count 20
Computed a total of 18 stabilizing places and 18 stable transitions
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 339 place count 12 transition count 14
Iterating global reduction 2 with 6 rules applied. Total rules applied 345 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 346 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 347 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.1 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 352 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 354 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 356 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 357 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 358 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 358 rules in 233 ms. Remains 2 /212 variables (removed 210) and now considering 4/224 (removed 220) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 235 ms. Remains : 2/212 places, 4/224 transitions.
Finished random walk after 16 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=8 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 643 ms.

BK_STOP 1678342705340

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-07b"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DiscoveryGPU-PT-07b, 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 r147-smll-167819433700191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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