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

About the Execution of LoLa+red for RERS2020-PT-pb105

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9657.432 418898.00 466499.00 2207.40 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.r341-tall-167889213600156.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 lolaxred
Input is RERS2020-PT-pb105, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 87M
-rw-r--r-- 1 mcc users 7.7K Feb 26 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 08:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 09:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 86M 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 1679104342298

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=lolaxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb105
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 01:52:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 01:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:52:26] [INFO ] Load time of PNML (sax parser for PT used): 2270 ms
[2023-03-18 01:52:26] [INFO ] Transformed 1982 places.
[2023-03-18 01:52:26] [INFO ] Transformed 153412 transitions.
[2023-03-18 01:52:26] [INFO ] Found NUPN structural information;
[2023-03-18 01:52:26] [INFO ] Parsed PT model containing 1982 places and 153412 transitions and 610156 arcs in 2827 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 3773 transitions
Reduce redundant transitions removed 3773 transitions.
Built sparse matrix representations for Structural reductions in 54 ms.484032KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 1982/1982 places, 149639/149639 transitions.
Graph (trivial) has 1683 edges and 1982 vertex of which 115 / 1982 are part of one of the 43 SCC in 43 ms
Free SCC test removed 72 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Computed a total of 238 stabilizing places and 33716 stable transitions
Graph (complete) has 143884 edges and 1910 vertex of which 1908 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.584 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 10 places
Computed a total of 228 stabilizing places and 33716 stable transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 1898 transition count 149050
Reduce places removed 2 places and 0 transitions.
Computed a total of 227 stabilizing places and 33715 stable transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 16 place count 1896 transition count 149050
Computed a total of 227 stabilizing places and 33715 stable transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 1896 transition count 149047
Deduced a syphon composed of 3 places in 105 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 1893 transition count 149047
Computed a total of 227 stabilizing places and 33715 stable transitions
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 1884 transition count 148984
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 1884 transition count 148984
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Computed a total of 227 stabilizing places and 33698 stable transitions
Iterating post reduction 2 with 9 rules applied. Total rules applied 49 place count 1884 transition count 148975
Computed a total of 227 stabilizing places and 33698 stable transitions
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 56 place count 1877 transition count 148961
Iterating global reduction 3 with 7 rules applied. Total rules applied 63 place count 1877 transition count 148961
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Computed a total of 227 stabilizing places and 33698 stable transitions
Iterating post reduction 3 with 7 rules applied. Total rules applied 70 place count 1877 transition count 148954
Computed a total of 227 stabilizing places and 33698 stable transitions
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 73 place count 1874 transition count 148948
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 1874 transition count 148948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Computed a total of 227 stabilizing places and 33698 stable transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 79 place count 1874 transition count 148945
Computed a total of 227 stabilizing places and 33698 stable transitions
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 72 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 113 place count 1857 transition count 148928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Computed a total of 221 stabilizing places and 33692 stable transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 114 place count 1857 transition count 148927
Computed a total of 221 stabilizing places and 33692 stable transitions
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 28 places in 70 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 170 place count 1829 transition count 149023
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Computed a total of 221 stabilizing places and 33712 stable transitions
Iterating post reduction 6 with 19 rules applied. Total rules applied 189 place count 1829 transition count 149004
Computed a total of 221 stabilizing places and 33712 stable transitions
Computed a total of 221 stabilizing places and 33712 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 190 place count 1828 transition count 149003
Computed a total of 220 stabilizing places and 33782 stable transitions
Computed a total of 220 stabilizing places and 33782 stable transitions
Applied a total of 190 rules in 12066 ms. Remains 1828 /1982 variables (removed 154) and now considering 149003/149639 (removed 636) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 12080 ms. Remains : 1828/1982 places, 149003/149639 transitions.
Interrupted Random walk after 319781 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
[2023-03-18 01:53:09] [INFO ] Flow matrix only has 104704 transitions (discarded 44299 similar events)
// Phase 1: matrix 104704 rows 1828 cols
[2023-03-18 01:53:10] [INFO ] Computed 10 place invariants in 523 ms
[2023-03-18 01:53:27] [INFO ] [Real]Absence check using 10 positive place invariants in 32 ms returned sat
[2023-03-18 01:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:53:56] [INFO ] [Real]Absence check using state equation in 28791 ms returned sat
[2023-03-18 01:53:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:54:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 309 ms returned sat
[2023-03-18 01:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:54:43] [INFO ] [Nat]Absence check using state equation in 28469 ms returned sat
[2023-03-18 01:54:45] [INFO ] State equation strengthened by 5200 read => feed constraints.
[2023-03-18 01:54:57] [INFO ] [Nat]Added 5200 Read/Feed constraints in 12708 ms returned sat
[2023-03-18 01:55:12] [INFO ] Deduced a trap composed of 28 places in 12952 ms of which 14 ms to minimize.
[2023-03-18 01:55:25] [INFO ] Deduced a trap composed of 209 places in 11946 ms of which 2 ms to minimize.
[2023-03-18 01:55:38] [INFO ] Deduced a trap composed of 28 places in 12035 ms of which 2 ms to minimize.
[2023-03-18 01:55:50] [INFO ] Deduced a trap composed of 210 places in 9961 ms of which 2 ms to minimize.
[2023-03-18 01:56:03] [INFO ] Deduced a trap composed of 128 places in 12165 ms of which 1 ms to minimize.
[2023-03-18 01:56:15] [INFO ] Deduced a trap composed of 222 places in 10855 ms of which 6 ms to minimize.
[2023-03-18 01:56:28] [INFO ] Deduced a trap composed of 147 places in 10908 ms of which 2 ms to minimize.
[2023-03-18 01:56:40] [INFO ] Deduced a trap composed of 232 places in 11372 ms of which 2 ms to minimize.
[2023-03-18 01:56:52] [INFO ] Deduced a trap composed of 41 places in 10261 ms of which 2 ms to minimize.
[2023-03-18 01:57:03] [INFO ] Deduced a trap composed of 30 places in 10096 ms of which 1 ms to minimize.
[2023-03-18 01:57:15] [INFO ] Deduced a trap composed of 259 places in 10763 ms of which 2 ms to minimize.
[2023-03-18 01:57:25] [INFO ] Deduced a trap composed of 154 places in 8157 ms of which 1 ms to minimize.
[2023-03-18 01:57:34] [INFO ] Deduced a trap composed of 314 places in 7938 ms of which 1 ms to minimize.
[2023-03-18 01:57:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 160908 ms
[2023-03-18 01:57:58] [INFO ] Computed and/alt/rep : 1369/5683/1369 causal constraints (skipped 103326 transitions) in 19316 ms.
[2023-03-18 01:58:02] [INFO ] Added : 5 causal constraints over 1 iterations in 24088 ms.(timeout) Result :sat
Parikh directed walk for 72800 steps, including 1600 resets, run took 15104 ms. (steps per millisecond=4 )
Interrupted Random directed walk after 193852 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 )
Interrupted Random walk after 288772 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 )
Finished random directed walk after 468 steps, including 0 resets, run found a deadlock after 73 ms. (steps per millisecond=6 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 416521 ms.
ITS solved all properties within timeout

BK_STOP 1679104761196

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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="RERS2020-PT-pb105"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is RERS2020-PT-pb105, 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 r341-tall-167889213600156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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