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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3728.752 385518.00 432528.00 1189.60 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-167889213600161.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-pb106, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 71M
-rw-r--r-- 1 mcc users 7.8K Feb 26 08:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 08:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 08:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 08:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 70M 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 1679104714224

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-pb106
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 01:58:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 01:58:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:58:37] [INFO ] Load time of PNML (sax parser for PT used): 2080 ms
[2023-03-18 01:58:37] [INFO ] Transformed 2041 places.
[2023-03-18 01:58:38] [INFO ] Transformed 125740 transitions.
[2023-03-18 01:58:38] [INFO ] Found NUPN structural information;
[2023-03-18 01:58:38] [INFO ] Parsed PT model containing 2041 places and 125740 transitions and 498326 arcs in 2510 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 2 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 5937 transitions
Reduce redundant transitions removed 5937 transitions.
Built sparse matrix representations for Structural reductions in 68 ms.263128KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 2041/2041 places, 119803/119803 transitions.
Computed a total of 672 stabilizing places and 64843 stable transitions
Ensure Unique test removed 11 places
Computed a total of 661 stabilizing places and 64843 stable transitions
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 2030 transition count 119803
Computed a total of 661 stabilizing places and 64843 stable transitions
Performed 54 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 54 places in 86 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 1 with 108 rules applied. Total rules applied 119 place count 1976 transition count 119721
Ensure Unique test removed 2953 transitions
Reduce isomorphic transitions removed 2953 transitions.
Computed a total of 623 stabilizing places and 61829 stable transitions
Iterating post reduction 1 with 2953 rules applied. Total rules applied 3072 place count 1976 transition count 116768
Computed a total of 623 stabilizing places and 61829 stable transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 78 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 3078 place count 1973 transition count 116765
Computed a total of 622 stabilizing places and 61828 stable transitions
Performed 14 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 14 places in 71 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 3106 place count 1959 transition count 116779
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Computed a total of 608 stabilizing places and 61826 stable transitions
Iterating post reduction 2 with 16 rules applied. Total rules applied 3122 place count 1959 transition count 116763
Computed a total of 608 stabilizing places and 61826 stable transitions
Computed a total of 608 stabilizing places and 61826 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3123 place count 1958 transition count 116762
Computed a total of 607 stabilizing places and 61825 stable transitions
Computed a total of 607 stabilizing places and 61825 stable transitions
Applied a total of 3123 rules in 8624 ms. Remains 1958 /2041 variables (removed 83) and now considering 116762/119803 (removed 3041) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 8636 ms. Remains : 1958/2041 places, 116762/119803 transitions.
Interrupted Random walk after 494711 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=16 )
[2023-03-18 01:59:17] [INFO ] Flow matrix only has 92066 transitions (discarded 24696 similar events)
// Phase 1: matrix 92066 rows 1958 cols
[2023-03-18 01:59:18] [INFO ] Computed 12 place invariants in 608 ms
[2023-03-18 01:59:31] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2023-03-18 01:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:59:54] [INFO ] [Real]Absence check using state equation in 22822 ms returned sat
[2023-03-18 01:59:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 02:00:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 82 ms returned sat
[2023-03-18 02:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 02:00:31] [INFO ] [Nat]Absence check using state equation in 22373 ms returned sat
[2023-03-18 02:00:32] [INFO ] State equation strengthened by 4538 read => feed constraints.
[2023-03-18 02:00:38] [INFO ] [Nat]Added 4538 Read/Feed constraints in 5152 ms returned sat
[2023-03-18 02:00:46] [INFO ] Deduced a trap composed of 38 places in 7534 ms of which 7 ms to minimize.
[2023-03-18 02:00:55] [INFO ] Deduced a trap composed of 66 places in 7560 ms of which 1 ms to minimize.
[2023-03-18 02:01:04] [INFO ] Deduced a trap composed of 25 places in 7808 ms of which 2 ms to minimize.
[2023-03-18 02:01:13] [INFO ] Deduced a trap composed of 31 places in 7673 ms of which 3 ms to minimize.
[2023-03-18 02:01:23] [INFO ] Deduced a trap composed of 38 places in 8794 ms of which 2 ms to minimize.
[2023-03-18 02:01:34] [INFO ] Deduced a trap composed of 33 places in 9624 ms of which 2 ms to minimize.
[2023-03-18 02:01:44] [INFO ] Deduced a trap composed of 196 places in 9297 ms of which 2 ms to minimize.
[2023-03-18 02:01:55] [INFO ] Deduced a trap composed of 437 places in 9139 ms of which 2 ms to minimize.
[2023-03-18 02:02:05] [INFO ] Deduced a trap composed of 190 places in 9328 ms of which 2 ms to minimize.
[2023-03-18 02:02:15] [INFO ] Deduced a trap composed of 151 places in 8960 ms of which 1 ms to minimize.
[2023-03-18 02:02:24] [INFO ] Deduced a trap composed of 52 places in 7172 ms of which 1 ms to minimize.
[2023-03-18 02:02:32] [INFO ] Deduced a trap composed of 23 places in 7595 ms of which 1 ms to minimize.
[2023-03-18 02:02:40] [INFO ] Deduced a trap composed of 505 places in 6198 ms of which 1 ms to minimize.
[2023-03-18 02:02:50] [INFO ] Deduced a trap composed of 608 places in 9509 ms of which 2 ms to minimize.
[2023-03-18 02:03:01] [INFO ] Deduced a trap composed of 49 places in 9593 ms of which 3 ms to minimize.
[2023-03-18 02:03:12] [INFO ] Deduced a trap composed of 98 places in 9959 ms of which 2 ms to minimize.
[2023-03-18 02:03:23] [INFO ] Deduced a trap composed of 108 places in 9420 ms of which 2 ms to minimize.
[2023-03-18 02:03:34] [INFO ] Deduced a trap composed of 74 places in 9703 ms of which 2 ms to minimize.
[2023-03-18 02:03:44] [INFO ] Deduced a trap composed of 285 places in 9380 ms of which 1 ms to minimize.
[2023-03-18 02:03:55] [INFO ] Deduced a trap composed of 44 places in 10105 ms of which 2 ms to minimize.
[2023-03-18 02:04:06] [INFO ] Deduced a trap composed of 458 places in 9525 ms of which 3 ms to minimize.
[2023-03-18 02:04:16] [INFO ] Deduced a trap composed of 332 places in 8384 ms of which 2 ms to minimize.
[2023-03-18 02:04:26] [INFO ] Deduced a trap composed of 285 places in 9202 ms of which 2 ms to minimize.
[2023-03-18 02:04:37] [INFO ] Deduced a trap composed of 57 places in 10091 ms of which 2 ms to minimize.
[2023-03-18 02:04:49] [INFO ] Deduced a trap composed of 192 places in 10305 ms of which 2 ms to minimize.
[2023-03-18 02:04:58] [INFO ] Deduced a trap composed of 207 places in 8266 ms of which 2 ms to minimize.
[2023-03-18 02:04:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking Deadlocks.
Finished random directed walk after 337 steps, including 0 resets, run found a deadlock after 45 ms. (steps per millisecond=7 )
FORMULA ReachabilityDeadlock TRUE TECHNIQUES TOPOLOGICAL STRUCTURAL_REDUCTION RANDOM_WALK
Total runtime 383126 ms.
ITS solved all properties within timeout

BK_STOP 1679105099742

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

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-pb106"
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-pb106, 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-167889213600161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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