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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 13:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 13:22 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 26K 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 16K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 25 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:23 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 46K 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 1678438459017

Running Version 202205111006
[2023-03-10 08:54:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-10 08:54:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:54:22] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-10 08:54:22] [INFO ] Transformed 184 places.
[2023-03-10 08:54:22] [INFO ] Transformed 194 transitions.
[2023-03-10 08:54:22] [INFO ] Found NUPN structural information;
[2023-03-10 08:54:22] [INFO ] Parsed PT model containing 184 places and 194 transitions in 404 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 6 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 10 ms.8588KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 184/184 places, 194/194 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Graph (complete) has 314 edges and 184 vertex of which 160 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.26 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 160 transition count 140
Reduce places removed 42 places and 0 transitions.
Computed a total of 27 stabilizing places and 27 stable transitions
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 118 transition count 140
Computed a total of 27 stabilizing places and 27 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 85 place count 118 transition count 134
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 97 place count 112 transition count 134
Computed a total of 21 stabilizing places and 21 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 107 place count 102 transition count 124
Iterating global reduction 2 with 10 rules applied. Total rules applied 117 place count 102 transition count 124
Computed a total of 19 stabilizing places and 19 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 117 place count 102 transition count 122
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 121 place count 100 transition count 122
Computed a total of 21 stabilizing places and 19 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 95 transition count 117
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 95 transition count 117
Computed a total of 21 stabilizing places and 19 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 90 transition count 112
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 90 transition count 112
Computed a total of 21 stabilizing places and 19 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 146 place count 85 transition count 102
Iterating global reduction 2 with 5 rules applied. Total rules applied 151 place count 85 transition count 102
Computed a total of 21 stabilizing places and 19 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 156 place count 80 transition count 97
Iterating global reduction 2 with 5 rules applied. Total rules applied 161 place count 80 transition count 97
Computed a total of 21 stabilizing places and 19 stable transitions
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 237 place count 42 transition count 59
Computed a total of 42 stabilizing places and 47 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 242 place count 37 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 247 place count 37 transition count 49
Computed a total of 37 stabilizing places and 42 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 252 place count 32 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 257 place count 32 transition count 44
Computed a total of 32 stabilizing places and 37 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 262 place count 27 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 267 place count 27 transition count 34
Computed a total of 27 stabilizing places and 27 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 272 place count 22 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 277 place count 22 transition count 29
Computed a total of 22 stabilizing places and 22 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 282 place count 17 transition count 19
Iterating global reduction 2 with 5 rules applied. Total rules applied 287 place count 17 transition count 19
Computed a total of 17 stabilizing places and 17 stable transitions
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 292 place count 12 transition count 14
Iterating global reduction 2 with 5 rules applied. Total rules applied 297 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 298 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 299 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 304 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 306 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 308 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 309 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 310 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 310 rules in 217 ms. Remains 2 /184 variables (removed 182) and now considering 4/194 (removed 190) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/184 places, 4/194 transitions.
Finished random walk after 14 steps, including 0 resets, run found a deadlock after 2 ms. (steps per millisecond=7 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 743 ms.

BK_STOP 1678438462621

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityDeadlock = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityDeadlock -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06b"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is DiscoveryGPU-PT-06b, 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 r160-smll-167819445700181"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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