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

About the Execution of LTSMin+red for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
517.936 37394.00 46762.00 202.90 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.r530-tall-171683778800176.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 ShieldIIPt-PT-020B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r530-tall-171683778800176
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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 1717223540204

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:32:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 06:32:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:32:21] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-01 06:32:21] [INFO ] Transformed 1403 places.
[2024-06-01 06:32:21] [INFO ] Transformed 1303 transitions.
[2024-06-01 06:32:21] [INFO ] Found NUPN structural information;
[2024-06-01 06:32:21] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 265 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.23574KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 1403 transition count 961
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 240 stabilizing places and 240 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 1 with 344 rules applied. Total rules applied 686 place count 1061 transition count 959
Reduce places removed 1 places and 0 transitions.
Computed a total of 240 stabilizing places and 240 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 687 place count 1060 transition count 959
Computed a total of 240 stabilizing places and 240 stable transitions
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 687 place count 1060 transition count 878
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 849 place count 979 transition count 878
Computed a total of 240 stabilizing places and 240 stable transitions
Discarding 140 places :
Symmetric choice reduction at 3 with 140 rule applications. Total rules 989 place count 839 transition count 738
Iterating global reduction 3 with 140 rules applied. Total rules applied 1129 place count 839 transition count 738
Computed a total of 160 stabilizing places and 160 stable transitions
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 1129 place count 839 transition count 678
Deduced a syphon composed of 60 places in 8 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 1249 place count 779 transition count 678
Computed a total of 161 stabilizing places and 160 stable transitions
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1927 place count 440 transition count 339
Computed a total of 3 stabilizing places and 1 stable transitions
Renaming transitions due to excessive name length > 1024 char.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 2045 place count 381 transition count 378
Computed a total of 3 stabilizing places and 1 stable transitions
Computed a total of 3 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2046 place count 380 transition count 377
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 2048 place count 378 transition count 377
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2048 place count 378 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2050 place count 377 transition count 376
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 2050 rules in 447 ms. Remains 377 /1403 variables (removed 1026) and now considering 376/1303 (removed 927) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 459 ms. Remains : 377/1403 places, 376/1303 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4699 ms (no deadlock found). (steps per millisecond=266 )
Random directed walk for 1250000 steps, including 0 resets, run took 3372 ms (no deadlock found). (steps per millisecond=370 )
// Phase 1: matrix 376 rows 377 cols
[2024-06-01 06:32:30] [INFO ] Computed 179 invariants in 16 ms
[2024-06-01 06:32:30] [INFO ] [Real]Absence check using 179 positive place invariants in 62 ms returned sat
[2024-06-01 06:32:30] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-06-01 06:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:30] [INFO ] [Nat]Absence check using 179 positive place invariants in 51 ms returned sat
[2024-06-01 06:32:31] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2024-06-01 06:32:31] [INFO ] Computed and/alt/rep : 372/568/372 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 06:32:33] [INFO ] Added : 294 causal constraints over 59 iterations in 1893 ms. Result :sat
Parikh directed walk for 182000 steps, including 1000 resets, run took 752 ms. (steps per millisecond=242 )
Random directed walk for 500002 steps, including 0 resets, run took 1359 ms (no deadlock found). (steps per millisecond=367 )
Random walk for 500000 steps, including 0 resets, run took 1800 ms (no deadlock found). (steps per millisecond=277 )
Random directed walk for 500001 steps, including 0 resets, run took 1356 ms (no deadlock found). (steps per millisecond=368 )
Random walk for 500000 steps, including 0 resets, run took 1805 ms (no deadlock found). (steps per millisecond=277 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 377/377 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 11 ms. Remains 377 /377 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2024-06-01 06:32:40] [INFO ] Invariant cache hit.
[2024-06-01 06:32:40] [INFO ] Implicit Places using invariants in 229 ms returned [366]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 231 ms to find 1 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 376/377 places, 376/376 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 375 transition count 375
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 2 rules in 16 ms. Remains 375 /376 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 375 cols
[2024-06-01 06:32:40] [INFO ] Computed 178 invariants in 10 ms
[2024-06-01 06:32:40] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 06:32:40] [INFO ] Invariant cache hit.
[2024-06-01 06:32:40] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 375/377 places, 375/376 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 766 ms. Remains : 375/377 places, 375/376 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4547 ms (no deadlock found). (steps per millisecond=274 )
Random directed walk for 1250000 steps, including 0 resets, run took 3295 ms (no deadlock found). (steps per millisecond=379 )
[2024-06-01 06:32:48] [INFO ] Invariant cache hit.
[2024-06-01 06:32:48] [INFO ] [Real]Absence check using 178 positive place invariants in 39 ms returned sat
[2024-06-01 06:32:49] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-06-01 06:32:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:32:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 42 ms returned sat
[2024-06-01 06:32:49] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-06-01 06:32:49] [INFO ] Computed and/alt/rep : 371/565/371 causal constraints (skipped 0 transitions) in 20 ms.
[2024-06-01 06:32:51] [INFO ] Added : 287 causal constraints over 58 iterations in 1869 ms. Result :sat
Parikh directed walk for 191300 steps, including 786 resets, run took 790 ms. (steps per millisecond=242 )
Random directed walk for 500004 steps, including 0 resets, run took 1305 ms (no deadlock found). (steps per millisecond=383 )
Random walk for 500000 steps, including 0 resets, run took 1787 ms (no deadlock found). (steps per millisecond=279 )
Random directed walk for 500000 steps, including 0 resets, run took 1314 ms (no deadlock found). (steps per millisecond=380 )
Finished random walk after 257400 steps, including 0 resets, run found a deadlock after 941 ms. (steps per millisecond=273 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 36251 ms.
ITS solved all properties within timeout

BK_STOP 1717223577598

--------------------
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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r530-tall-171683778800176"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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