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

About the Execution of 2022-gold for BART-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
419.071 9376.00 19466.00 335.20 5 36 5 36 36 36 5 50 1 1 1 1 1 1 1 1 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.r031-oct2-167813615500101.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 BART-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-oct2-167813615500101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 108M
-rw-r--r-- 1 mcc users 2.2M Feb 26 06:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 06:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Feb 26 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.7M Feb 26 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2M Feb 26 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19M Feb 26 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8M Feb 26 07:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32M Feb 26 07:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 138K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 278K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 12M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-050-UpperBounds-00
FORMULA_NAME BART-PT-050-UpperBounds-01
FORMULA_NAME BART-PT-050-UpperBounds-02
FORMULA_NAME BART-PT-050-UpperBounds-03
FORMULA_NAME BART-PT-050-UpperBounds-04
FORMULA_NAME BART-PT-050-UpperBounds-05
FORMULA_NAME BART-PT-050-UpperBounds-06
FORMULA_NAME BART-PT-050-UpperBounds-07
FORMULA_NAME BART-PT-050-UpperBounds-08
FORMULA_NAME BART-PT-050-UpperBounds-09
FORMULA_NAME BART-PT-050-UpperBounds-10
FORMULA_NAME BART-PT-050-UpperBounds-11
FORMULA_NAME BART-PT-050-UpperBounds-12
FORMULA_NAME BART-PT-050-UpperBounds-13
FORMULA_NAME BART-PT-050-UpperBounds-14
FORMULA_NAME BART-PT-050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678867275392

Running Version 202205111006
[2023-03-15 08:01:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2023-03-15 08:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 08:01:18] [INFO ] Load time of PNML (sax parser for PT used): 705 ms
[2023-03-15 08:01:18] [INFO ] Transformed 6810 places.
[2023-03-15 08:01:18] [INFO ] Transformed 10100 transitions.
[2023-03-15 08:01:18] [INFO ] Found NUPN structural information;
[2023-03-15 08:01:18] [INFO ] Parsed PT model containing 6810 places and 10100 transitions in 907 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 125 ms.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-050-UpperBounds-00 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-01 36 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-03 36 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-04 36 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-05 36 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 10100 rows 6600 cols
[2023-03-15 08:01:18] [INFO ] Computed 50 place invariants in 105 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 2) seen :1
FORMULA BART-PT-050-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 10100 rows 6600 cols
[2023-03-15 08:01:19] [INFO ] Computed 50 place invariants in 98 ms
[2023-03-15 08:01:20] [INFO ] [Real]Absence check using 50 positive place invariants in 254 ms returned sat
[2023-03-15 08:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 08:01:24] [INFO ] [Real]Absence check using state equation in 3492 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 6600 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 6600/6600 places, 10099/10099 transitions.
Graph (trivial) has 10098 edges and 6600 vertex of which 6598 / 6600 are part of one of the 50 SCC in 60 ms
Free SCC test removed 6548 places
Drop transitions removed 10097 transitions
Reduce isomorphic transitions removed 10097 transitions.
Graph (complete) has 2 edges and 52 vertex of which 3 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.2 ms
Discarding 49 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2 transition count 1
Applied a total of 4 rules in 123 ms. Remains 2 /6600 variables (removed 6598) and now considering 1/10099 (removed 10098) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/6600 places, 1/10099 transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-15 08:01:24] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 1) seen :1
FORMULA BART-PT-050-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 7298 ms.

BK_STOP 1678867284768

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -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 3600 -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="BART-PT-050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 BART-PT-050, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r031-oct2-167813615500101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-050.tgz
mv BART-PT-050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;