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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
181.651 1685.00 2070.00 23.00 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-171734907600096.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-20, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907600096
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K 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 336K 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 1717361527210

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-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:52:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-02 20:52:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:52:08] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2024-06-02 20:52:08] [INFO ] Transformed 1178 places.
[2024-06-02 20:52:08] [INFO ] Transformed 1463 transitions.
[2024-06-02 20:52:08] [INFO ] Found NUPN structural information;
[2024-06-02 20:52:08] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 229 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 187 places in 17 ms
Reduce places removed 187 places and 251 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.21586KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Graph (trivial) has 1019 edges and 991 vertex of which 3 / 991 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Computed a total of 66 stabilizing places and 88 stable transitions
Graph (complete) has 1662 edges and 989 vertex of which 947 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.21 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 66 stabilizing places and 88 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 605 rules applied. Total rules applied 607 place count 947 transition count 582
Reduce places removed 602 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 41 stabilizing places and 63 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 632 rules applied. Total rules applied 1239 place count 345 transition count 552
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Computed a total of 41 stabilizing places and 63 stable transitions
Iterating post reduction 2 with 24 rules applied. Total rules applied 1263 place count 331 transition count 542
Computed a total of 41 stabilizing places and 63 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1263 place count 331 transition count 541
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1265 place count 330 transition count 541
Computed a total of 40 stabilizing places and 62 stable transitions
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 1317 place count 278 transition count 487
Iterating global reduction 3 with 52 rules applied. Total rules applied 1369 place count 278 transition count 487
Computed a total of 26 stabilizing places and 48 stable transitions
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1369 place count 278 transition count 475
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1393 place count 266 transition count 475
Computed a total of 26 stabilizing places and 48 stable transitions
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1425 place count 234 transition count 418
Iterating global reduction 3 with 32 rules applied. Total rules applied 1457 place count 234 transition count 418
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 19 stabilizing places and 32 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 7 rules applied. Total rules applied 1464 place count 234 transition count 411
Reduce places removed 1 places and 0 transitions.
Computed a total of 19 stabilizing places and 32 stable transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 1465 place count 233 transition count 411
Computed a total of 19 stabilizing places and 32 stable transitions
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1466 place count 232 transition count 409
Iterating global reduction 5 with 1 rules applied. Total rules applied 1467 place count 232 transition count 409
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 19 stabilizing places and 32 stable transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 1468 place count 232 transition count 408
Computed a total of 19 stabilizing places and 32 stable transitions
Performed 94 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 94 places in 1 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 6 with 188 rules applied. Total rules applied 1656 place count 138 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Iterating post reduction 6 with 6 rules applied. Total rules applied 1662 place count 138 transition count 285
Computed a total of 9 stabilizing places and 22 stable transitions
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 1744 place count 97 transition count 331
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Computed a total of 11 stabilizing places and 29 stable transitions
Iterating post reduction 7 with 21 rules applied. Total rules applied 1765 place count 97 transition count 310
Computed a total of 11 stabilizing places and 29 stable transitions
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 1793 place count 69 transition count 198
Iterating global reduction 8 with 28 rules applied. Total rules applied 1821 place count 69 transition count 198
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Computed a total of 11 stabilizing places and 29 stable transitions
Iterating post reduction 8 with 19 rules applied. Total rules applied 1840 place count 69 transition count 179
Computed a total of 11 stabilizing places and 29 stable transitions
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1847 place count 62 transition count 141
Iterating global reduction 9 with 7 rules applied. Total rules applied 1854 place count 62 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Computed a total of 11 stabilizing places and 29 stable transitions
Iterating post reduction 9 with 5 rules applied. Total rules applied 1859 place count 62 transition count 136
Computed a total of 11 stabilizing places and 29 stable transitions
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1867 place count 58 transition count 177
Computed a total of 11 stabilizing places and 29 stable transitions
Computed a total of 11 stabilizing places and 29 stable transitions
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 10 with 46 rules applied. Total rules applied 1913 place count 58 transition count 131
Computed a total of 11 stabilizing places and 23 stable transitions
Computed a total of 11 stabilizing places and 23 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1914 place count 57 transition count 130
Computed a total of 10 stabilizing places and 34 stable transitions
Computed a total of 10 stabilizing places and 34 stable transitions
Applied a total of 1914 rules in 246 ms. Remains 57 /991 variables (removed 934) and now considering 130/1212 (removed 1082) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 258 ms. Remains : 57/991 places, 130/1212 transitions.
Finished random walk after 15 steps, including 0 resets, run found a deadlock after 1 ms. (steps per millisecond=15 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 584 ms.
ITS solved all properties within timeout

BK_STOP 1717361528895

--------------------
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.202405141337.jar
+ 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-20"
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-20, 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-171734907600096"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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