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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.5K Feb 25 13:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 13:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 13:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 13:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 13:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:37 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 82K 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 1678438820986

Running Version 202205111006
[2023-03-10 09:00:23] [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 09:00:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:00:23] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-10 09:00:23] [INFO ] Transformed 324 places.
[2023-03-10 09:00:23] [INFO ] Transformed 344 transitions.
[2023-03-10 09:00:23] [INFO ] Found NUPN structural information;
[2023-03-10 09:00:23] [INFO ] Parsed PT model containing 324 places and 344 transitions in 441 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.9516KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 324/324 places, 344/344 transitions.
Computed a total of 50 stabilizing places and 50 stable transitions
Graph (complete) has 559 edges and 324 vertex of which 280 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.21 ms
Discarding 44 places :
Also discarding 22 output transitions
Drop transitions removed 22 transitions
Computed a total of 50 stabilizing places and 50 stable transitions
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 280 transition count 250
Reduce places removed 72 places and 0 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Iterating post reduction 1 with 72 rules applied. Total rules applied 145 place count 208 transition count 250
Computed a total of 47 stabilizing places and 47 stable transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 145 place count 208 transition count 239
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 167 place count 197 transition count 239
Computed a total of 36 stabilizing places and 36 stable transitions
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 182 place count 182 transition count 224
Iterating global reduction 2 with 15 rules applied. Total rules applied 197 place count 182 transition count 224
Computed a total of 34 stabilizing places and 34 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 197 place count 182 transition count 222
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 201 place count 180 transition count 222
Computed a total of 36 stabilizing places and 34 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 211 place count 170 transition count 212
Iterating global reduction 2 with 10 rules applied. Total rules applied 221 place count 170 transition count 212
Computed a total of 36 stabilizing places and 34 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 231 place count 160 transition count 202
Iterating global reduction 2 with 10 rules applied. Total rules applied 241 place count 160 transition count 202
Computed a total of 36 stabilizing places and 34 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 251 place count 150 transition count 182
Iterating global reduction 2 with 10 rules applied. Total rules applied 261 place count 150 transition count 182
Computed a total of 36 stabilizing places and 34 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 271 place count 140 transition count 172
Iterating global reduction 2 with 10 rules applied. Total rules applied 281 place count 140 transition count 172
Computed a total of 36 stabilizing places and 34 stable transitions
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 417 place count 72 transition count 104
Computed a total of 72 stabilizing places and 82 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 427 place count 62 transition count 84
Iterating global reduction 2 with 10 rules applied. Total rules applied 437 place count 62 transition count 84
Computed a total of 62 stabilizing places and 72 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 447 place count 52 transition count 74
Iterating global reduction 2 with 10 rules applied. Total rules applied 457 place count 52 transition count 74
Computed a total of 52 stabilizing places and 62 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 467 place count 42 transition count 54
Iterating global reduction 2 with 10 rules applied. Total rules applied 477 place count 42 transition count 54
Computed a total of 42 stabilizing places and 42 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 487 place count 32 transition count 44
Iterating global reduction 2 with 10 rules applied. Total rules applied 497 place count 32 transition count 44
Computed a total of 32 stabilizing places and 32 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 507 place count 22 transition count 24
Iterating global reduction 2 with 10 rules applied. Total rules applied 517 place count 22 transition count 24
Computed a total of 22 stabilizing places and 22 stable transitions
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 527 place count 12 transition count 14
Iterating global reduction 2 with 10 rules applied. Total rules applied 537 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 538 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 539 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 544 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 546 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 548 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 549 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 550 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 550 rules in 265 ms. Remains 2 /324 variables (removed 322) and now considering 4/344 (removed 340) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/324 places, 4/344 transitions.
Finished random walk after 24 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=24 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 831 ms.

BK_STOP 1678438824196

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

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