Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r198-tall-171640626200161.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-b064, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-171640626200161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 15:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 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 1716496224896

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=gold2023
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FunctionPointer-PT-b064
Not applying reductions.
Model is PT
ReachabilityDeadlock PT
Running Version 202304061127
[2024-05-23 20:30:26] [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]
[2024-05-23 20:30:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:30:26] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-23 20:30:26] [INFO ] Transformed 306 places.
[2024-05-23 20:30:26] [INFO ] Transformed 840 transitions.
[2024-05-23 20:30:26] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 182 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.27600KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 222/222 places, 648/648 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1224 edges and 222 vertex of which 212 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.8 ms
Discarding 10 places :
Also discarding 0 output transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 30 place count 183 transition count 484
Iterating global reduction 0 with 29 rules applied. Total rules applied 59 place count 183 transition count 484
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Iterating post reduction 0 with 30 rules applied. Total rules applied 89 place count 183 transition count 454
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 105 place count 167 transition count 422
Iterating global reduction 1 with 16 rules applied. Total rules applied 121 place count 167 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 125 place count 167 transition count 418
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 132 place count 160 transition count 404
Iterating global reduction 2 with 7 rules applied. Total rules applied 139 place count 160 transition count 404
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 153 transition count 376
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 153 transition count 376
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 160 place count 146 transition count 362
Iterating global reduction 2 with 7 rules applied. Total rules applied 167 place count 146 transition count 362
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 139 transition count 334
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 139 transition count 334
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 188 place count 132 transition count 306
Iterating global reduction 2 with 7 rules applied. Total rules applied 195 place count 132 transition count 306
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 202 place count 125 transition count 292
Iterating global reduction 2 with 7 rules applied. Total rules applied 209 place count 125 transition count 292
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 216 place count 118 transition count 278
Iterating global reduction 2 with 7 rules applied. Total rules applied 223 place count 118 transition count 278
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 230 place count 111 transition count 264
Iterating global reduction 2 with 7 rules applied. Total rules applied 237 place count 111 transition count 264
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 244 place count 104 transition count 250
Iterating global reduction 2 with 7 rules applied. Total rules applied 251 place count 104 transition count 250
Computed a total of 24 stabilizing places and 64 stable transitions
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 258 place count 97 transition count 236
Iterating global reduction 2 with 7 rules applied. Total rules applied 265 place count 97 transition count 236
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 267 place count 97 transition count 234
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Applied a total of 267 rules in 166 ms. Remains 97 /222 variables (removed 125) and now considering 234/648 (removed 414) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 166 ms. Remains : 97/222 places, 234/648 transitions.
Finished random walk after 1069 steps, including 0 resets, run found a deadlock after 7 ms. (steps per millisecond=152 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 415 ms.

BK_STOP 1716496228630

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="FunctionPointer-PT-b064"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-b064, 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 r198-tall-171640626200161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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