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-167819445800211.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-09b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-167819445800211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 15K Feb 25 15:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 13:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 68K 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 1678438674903

Running Version 202205111006
[2023-03-10 08:57:57] [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:57:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 08:57:58] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2023-03-10 08:57:58] [INFO ] Transformed 268 places.
[2023-03-10 08:57:58] [INFO ] Transformed 284 transitions.
[2023-03-10 08:57:58] [INFO ] Found NUPN structural information;
[2023-03-10 08:57:58] [INFO ] Parsed PT model containing 268 places and 284 transitions in 442 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 9 ms.9052KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 268/268 places, 284/284 transitions.
Computed a total of 42 stabilizing places and 42 stable transitions
Graph (complete) has 461 edges and 268 vertex of which 232 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.21 ms
Discarding 36 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Computed a total of 42 stabilizing places and 42 stable transitions
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 232 transition count 206
Reduce places removed 60 places and 0 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Iterating post reduction 1 with 60 rules applied. Total rules applied 121 place count 172 transition count 206
Computed a total of 39 stabilizing places and 39 stable transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 121 place count 172 transition count 197
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 139 place count 163 transition count 197
Computed a total of 30 stabilizing places and 30 stable transitions
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 152 place count 150 transition count 184
Iterating global reduction 2 with 13 rules applied. Total rules applied 165 place count 150 transition count 184
Computed a total of 28 stabilizing places and 28 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 165 place count 150 transition count 182
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 169 place count 148 transition count 182
Computed a total of 30 stabilizing places and 28 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 177 place count 140 transition count 174
Iterating global reduction 2 with 8 rules applied. Total rules applied 185 place count 140 transition count 174
Computed a total of 30 stabilizing places and 28 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 193 place count 132 transition count 166
Iterating global reduction 2 with 8 rules applied. Total rules applied 201 place count 132 transition count 166
Computed a total of 30 stabilizing places and 28 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 209 place count 124 transition count 150
Iterating global reduction 2 with 8 rules applied. Total rules applied 217 place count 124 transition count 150
Computed a total of 30 stabilizing places and 28 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 225 place count 116 transition count 142
Iterating global reduction 2 with 8 rules applied. Total rules applied 233 place count 116 transition count 142
Computed a total of 30 stabilizing places and 28 stable transitions
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 345 place count 60 transition count 86
Computed a total of 60 stabilizing places and 68 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 353 place count 52 transition count 70
Iterating global reduction 2 with 8 rules applied. Total rules applied 361 place count 52 transition count 70
Computed a total of 52 stabilizing places and 60 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 369 place count 44 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 377 place count 44 transition count 62
Computed a total of 44 stabilizing places and 52 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 385 place count 36 transition count 46
Iterating global reduction 2 with 8 rules applied. Total rules applied 393 place count 36 transition count 46
Computed a total of 36 stabilizing places and 36 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 401 place count 28 transition count 38
Iterating global reduction 2 with 8 rules applied. Total rules applied 409 place count 28 transition count 38
Computed a total of 28 stabilizing places and 28 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 417 place count 20 transition count 22
Iterating global reduction 2 with 8 rules applied. Total rules applied 425 place count 20 transition count 22
Computed a total of 20 stabilizing places and 20 stable transitions
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 433 place count 12 transition count 14
Iterating global reduction 2 with 8 rules applied. Total rules applied 441 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 442 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 443 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 448 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 450 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 452 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 453 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 454 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 454 rules in 337 ms. Remains 2 /268 variables (removed 266) and now considering 4/284 (removed 280) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/268 places, 4/284 transitions.
Finished random walk after 20 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=20 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 909 ms.

BK_STOP 1678438678623

--------------------
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-09b"
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-09b, 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-167819445800211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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