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

About the Execution of LTSMin+red for ShieldPPPt-PT-010B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9607.575 1800000.00 7126216.00 40.00 [undef] Time out reached

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.r407-oct2-167903726700386.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 ltsminxred
Input is ShieldPPPt-PT-010B, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r407-oct2-167903726700386
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 6.0K Feb 25 21:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 21:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 21:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 21:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 21:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 21:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 185K 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 1679763282394

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=ShieldPPPt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-25 16:54:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-25 16:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 16:54:44] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-25 16:54:44] [INFO ] Transformed 783 places.
[2023-03-25 16:54:44] [INFO ] Transformed 713 transitions.
[2023-03-25 16:54:44] [INFO ] Found NUPN structural information;
[2023-03-25 16:54:44] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 198 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 5 ms.25997KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 783/783 places, 713/713 transitions.
Computed a total of 200 stabilizing places and 200 stable transitions
Computed a total of 200 stabilizing places and 200 stable transitions
Drop transitions removed 193 transitions
Trivial Post-agglo rules discarded 193 transitions
Performed 193 trivial Post agglomeration. Transition count delta: 193
Iterating post reduction 0 with 193 rules applied. Total rules applied 193 place count 783 transition count 520
Reduce places removed 193 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 195 rules applied. Total rules applied 388 place count 590 transition count 518
Reduce places removed 1 places and 0 transitions.
Computed a total of 120 stabilizing places and 120 stable transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 389 place count 589 transition count 518
Computed a total of 120 stabilizing places and 120 stable transitions
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 389 place count 589 transition count 478
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 469 place count 549 transition count 478
Computed a total of 120 stabilizing places and 120 stable transitions
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 539 place count 479 transition count 408
Iterating global reduction 3 with 70 rules applied. Total rules applied 609 place count 479 transition count 408
Computed a total of 80 stabilizing places and 80 stable transitions
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 609 place count 479 transition count 378
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 669 place count 449 transition count 378
Computed a total of 81 stabilizing places and 80 stable transitions
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 1007 place count 280 transition count 209
Computed a total of 2 stabilizing places and 1 stable transitions
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1065 place count 251 transition count 209
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 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 1066 place count 250 transition count 208
Reduce places removed 1 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 1067 place count 249 transition count 208
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1067 place count 249 transition count 206
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1071 place count 247 transition count 206
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 1071 rules in 194 ms. Remains 247 /783 variables (removed 536) and now considering 206/713 (removed 507) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 194 ms. Remains : 247/783 places, 206/713 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3757 ms (no deadlock found). (steps per millisecond=332 )
Random directed walk for 1250002 steps, including 0 resets, run took 2186 ms (no deadlock found). (steps per millisecond=571 )
// Phase 1: matrix 206 rows 247 cols
[2023-03-25 16:54:50] [INFO ] Computed 110 place invariants in 15 ms
[2023-03-25 16:54:51] [INFO ] [Real]Absence check using 110 positive place invariants in 71 ms returned sat
[2023-03-25 16:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-25 16:54:51] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-25 16:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-25 16:54:51] [INFO ] [Nat]Absence check using 110 positive place invariants in 31 ms returned sat
[2023-03-25 16:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-25 16:54:52] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-25 16:54:52] [INFO ] Computed and/alt/rep : 202/319/202 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-25 16:54:52] [INFO ] Added : 153 causal constraints over 31 iterations in 706 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
Parikh directed walk for 103700 steps, including 363 resets, run took 316 ms. (steps per millisecond=328 )
Random directed walk for 500003 steps, including 0 resets, run took 863 ms (no deadlock found). (steps per millisecond=579 )
Random walk for 500000 steps, including 0 resets, run took 1393 ms (no deadlock found). (steps per millisecond=358 )
Random directed walk for 500000 steps, including 0 resets, run took 865 ms (no deadlock found). (steps per millisecond=578 )
Random walk for 500000 steps, including 0 resets, run took 1232 ms (no deadlock found). (steps per millisecond=405 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 247/247 places, 206/206 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 7 ms. Remains 247 /247 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-25 16:54:57] [INFO ] Invariant cache hit.
[2023-03-25 16:54:57] [INFO ] Implicit Places using invariants in 353 ms returned [230, 234]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 355 ms to find 2 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 245/247 places, 206/206 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 243 transition count 204
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 4 rules in 12 ms. Remains 243 /245 variables (removed 2) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 243 cols
[2023-03-25 16:54:57] [INFO ] Computed 108 place invariants in 6 ms
[2023-03-25 16:54:58] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-25 16:54:58] [INFO ] Invariant cache hit.
[2023-03-25 16:54:58] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 243/247 places, 204/206 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 955 ms. Remains : 243/247 places, 204/206 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3220 ms (no deadlock found). (steps per millisecond=388 )
Random directed walk for 1250000 steps, including 0 resets, run took 2076 ms (no deadlock found). (steps per millisecond=602 )
[2023-03-25 16:55:03] [INFO ] Invariant cache hit.
[2023-03-25 16:55:03] [INFO ] [Real]Absence check using 108 positive place invariants in 42 ms returned sat
[2023-03-25 16:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-25 16:55:04] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-25 16:55:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-25 16:55:04] [INFO ] [Nat]Absence check using 108 positive place invariants in 29 ms returned sat
[2023-03-25 16:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-25 16:55:04] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2023-03-25 16:55:04] [INFO ] Computed and/alt/rep : 200/313/200 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-25 16:55:05] [INFO ] Added : 162 causal constraints over 33 iterations in 1172 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Parikh directed walk for 107000 steps, including 723 resets, run took 329 ms. (steps per millisecond=325 )
Random directed walk for 500000 steps, including 0 resets, run took 806 ms (no deadlock found). (steps per millisecond=620 )
Random walk for 500000 steps, including 0 resets, run took 1250 ms (no deadlock found). (steps per millisecond=400 )
Random directed walk for 500000 steps, including 0 resets, run took 785 ms (no deadlock found). (steps per millisecond=636 )
Random walk for 500000 steps, including 0 resets, run took 1176 ms (no deadlock found). (steps per millisecond=425 )
[2023-03-25 16:55:10] [INFO ] Flatten gal took : 94 ms
[2023-03-25 16:55:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-25 16:55:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 783 places, 713 transitions and 1786 arcs took 4 ms.
Total runtime 25760 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393220 kB
MemFree: 6553064 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16112360 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
mcc2023

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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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 r407-oct2-167903726700386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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