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

About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d1m160

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
336.571 3555.00 8062.00 137.30 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.r343-tall-167889215700546.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 ltsminxred
Input is RingSingleMessageInMbox-PT-d1m160, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215700546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 6.8K Feb 26 05:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 05:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 05:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 05:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 5.8M Mar 5 18:23 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 1679139613060

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=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RingSingleMessageInMbox-PT-d1m160
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 11:40:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 11:40:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:40:14] [INFO ] Load time of PNML (sax parser for PT used): 405 ms
[2023-03-18 11:40:14] [INFO ] Transformed 6690 places.
[2023-03-18 11:40:15] [INFO ] Transformed 11934 transitions.
[2023-03-18 11:40:15] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 512 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 4305 places in 27 ms
Reduce places removed 4305 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 20 ms.39024KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Computed a total of 1062 stabilizing places and 6007 stable transitions
Graph (complete) has 16729 edges and 2385 vertex of which 2368 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.57 ms
Discarding 17 places :
Also discarding 0 output transitions
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Computed a total of 1054 stabilizing places and 5978 stable transitions
Graph (complete) has 16567 edges and 2368 vertex of which 2367 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 2367 transition count 11832
Computed a total of 1054 stabilizing places and 5979 stable transitions
Discarding 1107 places :
Symmetric choice reduction at 1 with 1107 rule applications. Total rules 1211 place count 1260 transition count 2421
Iterating global reduction 1 with 1107 rules applied. Total rules applied 2318 place count 1260 transition count 2421
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Computed a total of 538 stabilizing places and 1073 stable transitions
Iterating post reduction 1 with 72 rules applied. Total rules applied 2390 place count 1260 transition count 2349
Computed a total of 538 stabilizing places and 1073 stable transitions
Discarding 943 places :
Symmetric choice reduction at 2 with 943 rule applications. Total rules 3333 place count 317 transition count 1406
Iterating global reduction 2 with 943 rules applied. Total rules applied 4276 place count 317 transition count 1406
Ensure Unique test removed 896 transitions
Reduce isomorphic transitions removed 896 transitions.
Computed a total of 73 stabilizing places and 160 stable transitions
Iterating post reduction 2 with 896 rules applied. Total rules applied 5172 place count 317 transition count 510
Computed a total of 73 stabilizing places and 160 stable transitions
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5302 place count 187 transition count 380
Iterating global reduction 3 with 130 rules applied. Total rules applied 5432 place count 187 transition count 380
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Computed a total of 7 stabilizing places and 44 stable transitions
Iterating post reduction 3 with 98 rules applied. Total rules applied 5530 place count 187 transition count 282
Computed a total of 7 stabilizing places and 44 stable transitions
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 5541 place count 176 transition count 235
Iterating global reduction 4 with 11 rules applied. Total rules applied 5552 place count 176 transition count 235
Computed a total of 5 stabilizing places and 17 stable transitions
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 5554 place count 174 transition count 233
Iterating global reduction 4 with 2 rules applied. Total rules applied 5556 place count 174 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 4 stabilizing places and 15 stable transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 5557 place count 174 transition count 232
Computed a total of 4 stabilizing places and 15 stable transitions
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 5561 place count 170 transition count 228
Iterating global reduction 5 with 4 rules applied. Total rules applied 5565 place count 170 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Computed a total of 4 stabilizing places and 15 stable transitions
Iterating post reduction 5 with 4 rules applied. Total rules applied 5569 place count 170 transition count 224
Computed a total of 4 stabilizing places and 15 stable transitions
Computed a total of 4 stabilizing places and 15 stable transitions
Applied a total of 5569 rules in 554 ms. Remains 170 /2385 variables (removed 2215) and now considering 224/11934 (removed 11710) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 554 ms. Remains : 170/2385 places, 224/11934 transitions.
Finished random walk after 2 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=2 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 1221 ms.
ITS solved all properties within timeout

BK_STOP 1679139616615

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

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="RingSingleMessageInMbox-PT-d1m160"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d1m160, 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 r343-tall-167889215700546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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