fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r032-oct2-167813615900346
Last Updated
May 14, 2023

About the Execution of 2022-gold for AutonomousCar-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
124.231 3635.00 6181.00 18.20 T normal

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.r032-oct2-167813615900346.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-02b, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r032-oct2-167813615900346
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 49K 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 1678837517506

Running Version 202205111006
[2023-03-14 23:45:20] [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-14 23:45:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:45:20] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-14 23:45:20] [INFO ] Transformed 155 places.
[2023-03-14 23:45:20] [INFO ] Transformed 194 transitions.
[2023-03-14 23:45:20] [INFO ] Found NUPN structural information;
[2023-03-14 23:45:20] [INFO ] Parsed PT model containing 155 places and 194 transitions in 337 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 6 ms.8605KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 155/155 places, 194/194 transitions.
Graph (trivial) has 147 edges and 155 vertex of which 4 / 155 are part of one of the 2 SCC in 16 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 38 stabilizing places and 39 stable transitions
Computed a total of 38 stabilizing places and 39 stable transitions
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 153 transition count 117
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Computed a total of 16 stabilizing places and 17 stable transitions
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 92 rules applied. Total rules applied 168 place count 78 transition count 100
Reduce places removed 9 places and 0 transitions.
Computed a total of 16 stabilizing places and 17 stable transitions
Iterating post reduction 2 with 9 rules applied. Total rules applied 177 place count 69 transition count 100
Computed a total of 16 stabilizing places and 17 stable transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 177 place count 69 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 187 place count 64 transition count 95
Computed a total of 15 stabilizing places and 16 stable transitions
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 201 place count 50 transition count 81
Iterating global reduction 3 with 14 rules applied. Total rules applied 215 place count 50 transition count 81
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 3 with 16 rules applied. Total rules applied 231 place count 50 transition count 65
Computed a total of 9 stabilizing places and 10 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 231 place count 50 transition count 63
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 235 place count 48 transition count 63
Computed a total of 10 stabilizing places and 10 stable transitions
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 238 place count 45 transition count 58
Iterating global reduction 4 with 3 rules applied. Total rules applied 241 place count 45 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 9 stabilizing places and 9 stable 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 4 with 4 rules applied. Total rules applied 245 place count 45 transition count 54
Reduce places removed 2 places and 0 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 247 place count 43 transition count 54
Computed a total of 9 stabilizing places and 9 stable transitions
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 281 place count 26 transition count 36
Computed a total of 3 stabilizing places and 3 stable transitions
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 283 place count 24 transition count 30
Iterating global reduction 6 with 2 rules applied. Total rules applied 285 place count 24 transition count 30
Computed a total of 3 stabilizing places and 3 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 289 place count 22 transition count 36
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 6 with 1 rules applied. Total rules applied 290 place count 21 transition count 35
Reduce places removed 1 places and 0 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 291 place count 20 transition count 35
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Applied a total of 291 rules in 73 ms. Remains 20 /155 variables (removed 135) and now considering 35/194 (removed 159) transitions.
Finished structural reductions, in 1 iterations. Remains : 20/155 places, 35/194 transitions.
Finished random walk after 4 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=4 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 505 ms.

BK_STOP 1678837521141

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="AutonomousCar-PT-02b"
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 AutonomousCar-PT-02b, 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 r032-oct2-167813615900346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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