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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15066.808 1370936.00 1534337.00 5707.10 F 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-167889213600136.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-pb101, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r341-tall-167889213600136
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 84M
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 08:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 08:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 08:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 08:23 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 83M 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 1679101450315

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-pb101
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 01:04:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 01:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 01:04:14] [INFO ] Load time of PNML (sax parser for PT used): 2293 ms
[2023-03-18 01:04:14] [INFO ] Transformed 906 places.
[2023-03-18 01:04:14] [INFO ] Transformed 149363 transitions.
[2023-03-18 01:04:14] [INFO ] Found NUPN structural information;
[2023-03-18 01:04:14] [INFO ] Parsed PT model containing 906 places and 149363 transitions and 595952 arcs in 3136 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 2798 transitions
Reduce redundant transitions removed 2798 transitions.
Built sparse matrix representations for Structural reductions in 85 ms.309501KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 906/906 places, 146565/146565 transitions.
Computed a total of 144 stabilizing places and 28382 stable transitions
Ensure Unique test removed 4 places
Computed a total of 140 stabilizing places and 28382 stable transitions
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 902 transition count 146565
Computed a total of 140 stabilizing places and 28382 stable transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 902 transition count 146564
Deduced a syphon composed of 1 places in 68 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 901 transition count 146564
Computed a total of 139 stabilizing places and 28381 stable transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 58 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 48 place count 880 transition count 146543
Ensure Unique test removed 1161 transitions
Reduce isomorphic transitions removed 1161 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Iterating post reduction 1 with 1161 rules applied. Total rules applied 1209 place count 880 transition count 145382
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 1209 rules in 5209 ms. Remains 880 /906 variables (removed 26) and now considering 145382/146565 (removed 1183) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 5225 ms. Remains : 880/906 places, 145382/146565 transitions.
Interrupted Random walk after 438040 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2023-03-18 01:04:51] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
// Phase 1: matrix 112309 rows 880 cols
[2023-03-18 01:04:51] [INFO ] Computed 5 place invariants in 505 ms
[2023-03-18 01:05:00] [INFO ] [Real]Absence check using 5 positive place invariants in 35 ms returned sat
[2023-03-18 01:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:05:32] [INFO ] [Real]Absence check using state equation in 32189 ms returned sat
[2023-03-18 01:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:05:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 42 ms returned sat
[2023-03-18 01:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:06:15] [INFO ] [Nat]Absence check using state equation in 32556 ms returned sat
[2023-03-18 01:06:17] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2023-03-18 01:06:34] [INFO ] [Nat]Added 2563 Read/Feed constraints in 17281 ms returned sat
[2023-03-18 01:06:48] [INFO ] Deduced a trap composed of 83 places in 12275 ms of which 10 ms to minimize.
[2023-03-18 01:07:02] [INFO ] Deduced a trap composed of 242 places in 12065 ms of which 1 ms to minimize.
[2023-03-18 01:07:15] [INFO ] Deduced a trap composed of 226 places in 11740 ms of which 3 ms to minimize.
[2023-03-18 01:07:27] [INFO ] Deduced a trap composed of 196 places in 11212 ms of which 4 ms to minimize.
[2023-03-18 01:07:40] [INFO ] Deduced a trap composed of 54 places in 11447 ms of which 2 ms to minimize.
[2023-03-18 01:07:53] [INFO ] Deduced a trap composed of 494 places in 11746 ms of which 2 ms to minimize.
[2023-03-18 01:08:06] [INFO ] Deduced a trap composed of 495 places in 11562 ms of which 1 ms to minimize.
[2023-03-18 01:08:14] [INFO ] Deduced a trap composed of 192 places in 6743 ms of which 1 ms to minimize.
[2023-03-18 01:08:22] [INFO ] Deduced a trap composed of 441 places in 6614 ms of which 1 ms to minimize.
[2023-03-18 01:08:35] [INFO ] Deduced a trap composed of 27 places in 11699 ms of which 2 ms to minimize.
[2023-03-18 01:08:43] [INFO ] Deduced a trap composed of 249 places in 6889 ms of which 1 ms to minimize.
[2023-03-18 01:08:51] [INFO ] Deduced a trap composed of 499 places in 6248 ms of which 0 ms to minimize.
[2023-03-18 01:09:03] [INFO ] Deduced a trap composed of 502 places in 10265 ms of which 1 ms to minimize.
[2023-03-18 01:09:15] [INFO ] Deduced a trap composed of 53 places in 11022 ms of which 2 ms to minimize.
[2023-03-18 01:09:27] [INFO ] Deduced a trap composed of 145 places in 10273 ms of which 1 ms to minimize.
[2023-03-18 01:09:38] [INFO ] Deduced a trap composed of 142 places in 10209 ms of which 2 ms to minimize.
[2023-03-18 01:09:50] [INFO ] Deduced a trap composed of 60 places in 10304 ms of which 1 ms to minimize.
[2023-03-18 01:10:02] [INFO ] Deduced a trap composed of 408 places in 9937 ms of which 2 ms to minimize.
[2023-03-18 01:10:12] [INFO ] Deduced a trap composed of 134 places in 9194 ms of which 1 ms to minimize.
[2023-03-18 01:10:16] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 221918 ms
[2023-03-18 01:10:43] [INFO ] Computed and/alt/rep : 151/1131/151 causal constraints (skipped 112155 transitions) in 27098 ms.
[2023-03-18 01:10:43] [INFO ] Added : 0 causal constraints over 0 iterations in 27102 ms. Result :unknown
Interrupted Parikh directed walk after 12944 steps, including 12944 resets, run timeout after 30001 ms. (steps per millisecond=0 )
Parikh directed walk for 12944 steps, including 12944 resets, run took 30001 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 311343 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 459803 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=15 )
Interrupted Random directed walk after 312961 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 441014 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 880/880 places, 145382/145382 transitions.
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Computed a total of 134 stabilizing places and 28154 stable transitions
Applied a total of 0 rules in 1379 ms. Remains 880 /880 variables (removed 0) and now considering 145382/145382 (removed 0) transitions.
[2023-03-18 01:13:15] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2023-03-18 01:13:15] [INFO ] Invariant cache hit.
[2023-03-18 01:13:24] [INFO ] Implicit Places using invariants in 9502 ms returned []
Implicit Place search using SMT only with invariants took 9503 ms to find 0 implicit places.
[2023-03-18 01:13:24] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2023-03-18 01:13:24] [INFO ] Invariant cache hit.
[2023-03-18 01:13:54] [INFO ] Performed 98168/145382 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 01:14:09] [INFO ] Dead Transitions using invariants and state equation in 44657 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55543 ms. Remains : 880/880 places, 145382/145382 transitions.
Interrupted Random walk after 447211 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
[2023-03-18 01:14:39] [INFO ] Flow matrix only has 112309 transitions (discarded 33073 similar events)
[2023-03-18 01:14:39] [INFO ] Invariant cache hit.
[2023-03-18 01:14:48] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2023-03-18 01:14:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 01:15:20] [INFO ] [Real]Absence check using state equation in 32577 ms returned sat
[2023-03-18 01:15:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 01:15:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 41 ms returned sat
[2023-03-18 01:15:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 01:16:02] [INFO ] [Nat]Absence check using state equation in 31880 ms returned sat
[2023-03-18 01:16:03] [INFO ] State equation strengthened by 2563 read => feed constraints.
[2023-03-18 01:16:18] [INFO ] [Nat]Added 2563 Read/Feed constraints in 15137 ms returned sat
[2023-03-18 01:16:32] [INFO ] Deduced a trap composed of 83 places in 12004 ms of which 2 ms to minimize.
[2023-03-18 01:16:45] [INFO ] Deduced a trap composed of 242 places in 11929 ms of which 2 ms to minimize.
[2023-03-18 01:17:01] [INFO ] Deduced a trap composed of 226 places in 14629 ms of which 4 ms to minimize.
[2023-03-18 01:17:14] [INFO ] Deduced a trap composed of 196 places in 11479 ms of which 2 ms to minimize.
[2023-03-18 01:17:28] [INFO ] Deduced a trap composed of 54 places in 11918 ms of which 2 ms to minimize.
[2023-03-18 01:17:41] [INFO ] Deduced a trap composed of 494 places in 11892 ms of which 1 ms to minimize.
[2023-03-18 01:17:55] [INFO ] Deduced a trap composed of 495 places in 12113 ms of which 2 ms to minimize.
[2023-03-18 01:18:03] [INFO ] Deduced a trap composed of 192 places in 6862 ms of which 1 ms to minimize.
[2023-03-18 01:18:11] [INFO ] Deduced a trap composed of 441 places in 6892 ms of which 1 ms to minimize.
[2023-03-18 01:18:24] [INFO ] Deduced a trap composed of 27 places in 11695 ms of which 2 ms to minimize.
[2023-03-18 01:18:33] [INFO ] Deduced a trap composed of 249 places in 6943 ms of which 1 ms to minimize.
[2023-03-18 01:18:41] [INFO ] Deduced a trap composed of 499 places in 6432 ms of which 1 ms to minimize.
[2023-03-18 01:18:53] [INFO ] Deduced a trap composed of 502 places in 10479 ms of which 1 ms to minimize.
[2023-03-18 01:19:06] [INFO ] Deduced a trap composed of 53 places in 11626 ms of which 2 ms to minimize.
[2023-03-18 01:19:18] [INFO ] Deduced a trap composed of 145 places in 10737 ms of which 2 ms to minimize.
[2023-03-18 01:19:30] [INFO ] Deduced a trap composed of 142 places in 10511 ms of which 1 ms to minimize.
[2023-03-18 01:19:42] [INFO ] Deduced a trap composed of 60 places in 10426 ms of which 2 ms to minimize.
[2023-03-18 01:19:53] [INFO ] Deduced a trap composed of 408 places in 9956 ms of which 1 ms to minimize.
[2023-03-18 01:20:04] [INFO ] Deduced a trap composed of 134 places in 9297 ms of which 1 ms to minimize.
[2023-03-18 01:20:08] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 229320 ms
[2023-03-18 01:20:37] [INFO ] Computed and/alt/rep : 151/1131/151 causal constraints (skipped 112155 transitions) in 29354 ms.
[2023-03-18 01:20:37] [INFO ] Added : 0 causal constraints over 0 iterations in 29366 ms. Result :unknown
Interrupted Parikh directed walk after 14948 steps, including 14948 resets, run timeout after 30002 ms. (steps per millisecond=0 )
Parikh directed walk for 14948 steps, including 14948 resets, run took 30002 ms. (steps per millisecond=0 )
Interrupted Random directed walk after 321620 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 447943 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=14 )
Interrupted Random directed walk after 320652 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 )
Interrupted Random walk after 459591 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=15 )
[2023-03-18 01:23:12] [INFO ] Flatten gal took : 4147 ms
[2023-03-18 01:23:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2023-03-18 01:23:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 906 places, 146565 transitions and 584844 arcs took 401 ms.
Total runtime 1141156 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT RERS2020-PT-pb101
BK_EXAMINATION: ReachabilityDeadlock
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
GlobalProperty: ReachabilityDeadlock

FORMULA ReachabilityDeadlock FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679102821251

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: No deadlock is reachable.

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

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