fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r564-tall-171734907600081
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CO4-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
173.128 1692.00 2181.00 12.70 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/mcc2024-input.r564-tall-171734907600081.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 ltsminxred
Input is CO4-PT-17, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 248K Jun 2 16:33 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 1717361498247

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CO4-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:51:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-02 20:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:51:39] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 20:51:39] [INFO ] Transformed 967 places.
[2024-06-02 20:51:39] [INFO ] Transformed 1150 transitions.
[2024-06-02 20:51:39] [INFO ] Found NUPN structural information;
[2024-06-02 20:51:39] [INFO ] Parsed PT model containing 967 places and 1150 transitions and 2568 arcs in 201 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 198 places in 10 ms
Reduce places removed 198 places and 238 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.18306KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 769/769 places, 912/912 transitions.
Graph (trivial) has 797 edges and 769 vertex of which 2 / 769 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 30 stabilizing places and 31 stable transitions
Graph (complete) has 1146 edges and 768 vertex of which 731 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.13 ms
Discarding 37 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 30 stabilizing places and 31 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 375 transitions
Trivial Post-agglo rules discarded 375 transitions
Performed 375 trivial Post agglomeration. Transition count delta: 375
Iterating post reduction 0 with 377 rules applied. Total rules applied 379 place count 731 transition count 510
Reduce places removed 375 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 386 rules applied. Total rules applied 765 place count 356 transition count 499
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 776 place count 351 transition count 493
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 779 place count 350 transition count 491
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 782 place count 349 transition count 489
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 26 stabilizing places and 27 stable transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 784 place count 348 transition count 488
Computed a total of 26 stabilizing places and 27 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 784 place count 348 transition count 487
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 786 place count 347 transition count 487
Computed a total of 25 stabilizing places and 26 stable transitions
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 826 place count 307 transition count 447
Iterating global reduction 6 with 40 rules applied. Total rules applied 866 place count 307 transition count 447
Computed a total of 17 stabilizing places and 18 stable transitions
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 17 Pre rules applied. Total rules applied 866 place count 307 transition count 430
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 900 place count 290 transition count 430
Computed a total of 17 stabilizing places and 18 stable transitions
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 928 place count 262 transition count 402
Iterating global reduction 6 with 28 rules applied. Total rules applied 956 place count 262 transition count 402
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 15 stabilizing places and 16 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 960 place count 262 transition count 398
Reduce places removed 1 places and 0 transitions.
Computed a total of 15 stabilizing places and 16 stable transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 961 place count 261 transition count 398
Computed a total of 15 stabilizing places and 16 stable transitions
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 962 place count 260 transition count 396
Iterating global reduction 8 with 1 rules applied. Total rules applied 963 place count 260 transition count 396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 15 stabilizing places and 16 stable transitions
Iterating post reduction 8 with 1 rules applied. Total rules applied 964 place count 260 transition count 395
Computed a total of 15 stabilizing places and 16 stable transitions
Performed 118 Post agglomeration using F-continuation condition with reduction of 18 identical transitions.
Deduced a syphon composed of 118 places in 0 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 9 with 236 rules applied. Total rules applied 1200 place count 142 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 9 with 3 rules applied. Total rules applied 1203 place count 142 transition count 256
Computed a total of 9 stabilizing places and 10 stable transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 10 with 90 rules applied. Total rules applied 1293 place count 97 transition count 259
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 10 with 30 rules applied. Total rules applied 1323 place count 97 transition count 229
Computed a total of 9 stabilizing places and 10 stable transitions
Discarding 40 places :
Symmetric choice reduction at 11 with 40 rule applications. Total rules 1363 place count 57 transition count 149
Iterating global reduction 11 with 40 rules applied. Total rules applied 1403 place count 57 transition count 149
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 11 with 27 rules applied. Total rules applied 1430 place count 57 transition count 122
Computed a total of 9 stabilizing places and 10 stable transitions
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 1440 place count 47 transition count 93
Iterating global reduction 12 with 10 rules applied. Total rules applied 1450 place count 47 transition count 93
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Computed a total of 9 stabilizing places and 10 stable transitions
Iterating post reduction 12 with 7 rules applied. Total rules applied 1457 place count 47 transition count 86
Computed a total of 9 stabilizing places and 10 stable transitions
Computed a total of 9 stabilizing places and 10 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1460 place count 47 transition count 83
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 1461 place count 46 transition count 82
Computed a total of 8 stabilizing places and 13 stable transitions
Computed a total of 8 stabilizing places and 13 stable transitions
Applied a total of 1461 rules in 249 ms. Remains 46 /769 variables (removed 723) and now considering 82/912 (removed 830) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 261 ms. Remains : 46/769 places, 82/912 transitions.
Finished random walk after 10 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=10 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 554 ms.
ITS solved all properties within timeout

BK_STOP 1717361499939

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CO4-PT-17"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CO4-PT-17, 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 r564-tall-171734907600081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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