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

About the Execution of LoLa+red for ShieldIIPs-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
375.004 70084.00 125449.00 60.70 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.r405-oct2-167903725200082.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 lolaxred
Input is ShieldIIPs-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r405-oct2-167903725200082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1679750049059

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=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-25 13:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-25 13:14:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-25 13:14:12] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-25 13:14:12] [INFO ] Transformed 1003 places.
[2023-03-25 13:14:12] [INFO ] Transformed 963 transitions.
[2023-03-25 13:14:12] [INFO ] Found NUPN structural information;
[2023-03-25 13:14:12] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 226 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1003 transition count 962
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1001 transition count 961
Applied a total of 4 rules in 125 ms. Remains 1001 /1003 variables (removed 2) and now considering 961/963 (removed 2) transitions.
// Phase 1: matrix 961 rows 1001 cols
[2023-03-25 13:14:12] [INFO ] Computed 361 place invariants in 21 ms
[2023-03-25 13:14:15] [INFO ] Implicit Places using invariants in 3447 ms returned []
[2023-03-25 13:14:15] [INFO ] Invariant cache hit.
[2023-03-25 13:14:16] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-25 13:14:18] [INFO ] Implicit Places using invariants and state equation in 2573 ms returned [987]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6088 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1000/1003 places, 961/963 transitions.
Applied a total of 0 rules in 80 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6294 ms. Remains : 1000/1003 places, 961/963 transitions.
Discarding 240 transitions out of 961. Remains 721
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 720) seen :688
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
// Phase 1: matrix 961 rows 1000 cols
[2023-03-25 13:14:20] [INFO ] Computed 360 place invariants in 9 ms
[2023-03-25 13:14:22] [INFO ] [Real]Absence check using 360 positive place invariants in 157 ms returned sat
[2023-03-25 13:14:28] [INFO ] After 7539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-25 13:14:31] [INFO ] [Nat]Absence check using 360 positive place invariants in 1430 ms returned sat
[2023-03-25 13:14:38] [INFO ] After 5622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-25 13:14:38] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 19 ms to minimize.
[2023-03-25 13:14:39] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 14 ms to minimize.
[2023-03-25 13:14:40] [INFO ] Deduced a trap composed of 9 places in 966 ms of which 29 ms to minimize.
[2023-03-25 13:14:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1667 ms
[2023-03-25 13:14:40] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2023-03-25 13:14:43] [INFO ] Deduced a trap composed of 13 places in 2193 ms of which 1 ms to minimize.
[2023-03-25 13:14:46] [INFO ] Deduced a trap composed of 17 places in 3336 ms of which 26 ms to minimize.
[2023-03-25 13:14:46] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 0 ms to minimize.
[2023-03-25 13:14:47] [INFO ] Deduced a trap composed of 10 places in 484 ms of which 1 ms to minimize.
[2023-03-25 13:14:48] [INFO ] Deduced a trap composed of 11 places in 822 ms of which 1 ms to minimize.
[2023-03-25 13:14:48] [INFO ] Deduced a trap composed of 11 places in 265 ms of which 1 ms to minimize.
[2023-03-25 13:14:49] [INFO ] Deduced a trap composed of 11 places in 835 ms of which 1 ms to minimize.
[2023-03-25 13:14:49] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2023-03-25 13:14:49] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
[2023-03-25 13:14:49] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2023-03-25 13:14:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 9646 ms
[2023-03-25 13:14:50] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-25 13:14:50] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-25 13:14:50] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 1 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-25 13:14:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1727 ms
[2023-03-25 13:14:52] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-25 13:14:52] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2023-03-25 13:14:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2023-03-25 13:14:52] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 0 ms to minimize.
[2023-03-25 13:14:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-25 13:14:53] [INFO ] After 20248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-25 13:14:53] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 9 properties in 24738 ms.
Support contains 66 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 961/961 transitions.
Partial Free-agglomeration rule applied 236 times.
Drop transitions removed 236 transitions
Iterating global reduction 0 with 236 rules applied. Total rules applied 236 place count 1000 transition count 961
Applied a total of 236 rules in 146 ms. Remains 1000 /1000 variables (removed 0) and now considering 961/961 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 1000/1000 places, 961/961 transitions.
Finished random walk after 17590 steps, including 6 resets, run visited all 23 properties in 685 ms. (steps per millisecond=25 )
Able to resolve query QuasiLiveness after proving 721 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 66786 ms.
ITS solved all properties within timeout

BK_STOP 1679750119143

--------------------
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 QuasiLiveness -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="ShieldIIPs-PT-040A"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldIIPs-PT-040A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r405-oct2-167903725200082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-040A.tgz
mv ShieldIIPs-PT-040A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;