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

About the Execution of LTSMin+red for RERS17pb113-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2611.392 1800000.00 5380267.00 10363.70 [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.r343-tall-167889215000011.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 ltsminxred
Input is RERS17pb113-PT-3, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r343-tall-167889215000011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 7.4K Feb 26 18:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 18:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 26 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M 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 1679120805593

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=RERS17pb113-PT-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 06:26:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2023-03-18 06:26:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 06:26:48] [INFO ] Load time of PNML (sax parser for PT used): 591 ms
[2023-03-18 06:26:48] [INFO ] Transformed 639 places.
[2023-03-18 06:26:48] [INFO ] Transformed 31353 transitions.
[2023-03-18 06:26:48] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 784 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 3 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 23 ms.100789KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Computed a total of 13 stabilizing places and 1 stable transitions
Ensure Unique test removed 12 places
Computed a total of 1 stabilizing places and 1 stable transitions
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
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 13 rules in 961 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 967 ms. Remains : 626/639 places, 31352/31353 transitions.
Interrupted Random walk after 969655 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=32 )
[2023-03-18 06:27:19] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-18 06:27:19] [INFO ] Computed 13 place invariants in 121 ms
[2023-03-18 06:27:23] [INFO ] [Real]Absence check using 13 positive place invariants in 23 ms returned sat
[2023-03-18 06:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:27:38] [INFO ] [Real]Absence check using state equation in 15691 ms returned sat
[2023-03-18 06:27:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:27:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-18 06:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:28:00] [INFO ] [Nat]Absence check using state equation in 17065 ms returned sat
[2023-03-18 06:28:00] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:28:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:28:04] [INFO ] [Nat]Added 268 Read/Feed constraints in 4748 ms returned sat
[2023-03-18 06:28:07] [INFO ] Deduced a trap composed of 48 places in 1960 ms of which 10 ms to minimize.
[2023-03-18 06:28:09] [INFO ] Deduced a trap composed of 48 places in 1386 ms of which 1 ms to minimize.
[2023-03-18 06:28:10] [INFO ] Deduced a trap composed of 24 places in 1072 ms of which 2 ms to minimize.
[2023-03-18 06:28:11] [INFO ] Deduced a trap composed of 65 places in 882 ms of which 1 ms to minimize.
[2023-03-18 06:28:14] [INFO ] Deduced a trap composed of 40 places in 1660 ms of which 1 ms to minimize.
[2023-03-18 06:28:15] [INFO ] Deduced a trap composed of 40 places in 1491 ms of which 0 ms to minimize.
[2023-03-18 06:28:17] [INFO ] Deduced a trap composed of 48 places in 1649 ms of which 1 ms to minimize.
[2023-03-18 06:28:19] [INFO ] Deduced a trap composed of 40 places in 1514 ms of which 2 ms to minimize.
[2023-03-18 06:28:21] [INFO ] Deduced a trap composed of 64 places in 1286 ms of which 1 ms to minimize.
[2023-03-18 06:28:23] [INFO ] Deduced a trap composed of 64 places in 1413 ms of which 1 ms to minimize.
[2023-03-18 06:28:25] [INFO ] Deduced a trap composed of 112 places in 1286 ms of which 2 ms to minimize.
[2023-03-18 06:28:27] [INFO ] Deduced a trap composed of 64 places in 1154 ms of which 1 ms to minimize.
[2023-03-18 06:28:28] [INFO ] Deduced a trap composed of 64 places in 1039 ms of which 0 ms to minimize.
[2023-03-18 06:28:30] [INFO ] Deduced a trap composed of 48 places in 1273 ms of which 1 ms to minimize.
[2023-03-18 06:28:31] [INFO ] Deduced a trap composed of 64 places in 1057 ms of which 0 ms to minimize.
[2023-03-18 06:28:33] [INFO ] Deduced a trap composed of 40 places in 1194 ms of which 0 ms to minimize.
[2023-03-18 06:28:34] [INFO ] Deduced a trap composed of 64 places in 924 ms of which 0 ms to minimize.
[2023-03-18 06:28:35] [INFO ] Deduced a trap composed of 48 places in 913 ms of which 1 ms to minimize.
[2023-03-18 06:28:37] [INFO ] Deduced a trap composed of 64 places in 900 ms of which 0 ms to minimize.
[2023-03-18 06:28:39] [INFO ] Deduced a trap composed of 40 places in 680 ms of which 0 ms to minimize.
[2023-03-18 06:28:40] [INFO ] Deduced a trap composed of 64 places in 562 ms of which 1 ms to minimize.
[2023-03-18 06:28:42] [INFO ] Deduced a trap composed of 40 places in 438 ms of which 2 ms to minimize.
[2023-03-18 06:28:43] [INFO ] Deduced a trap composed of 48 places in 461 ms of which 1 ms to minimize.
[2023-03-18 06:28:44] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 39436 ms
[2023-03-18 06:28:46] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2511 ms.
[2023-03-18 06:28:48] [INFO ] Added : 0 causal constraints over 0 iterations in 3693 ms. Result :sat
Parikh directed walk for 544400 steps, including 1000 resets, run took 15836 ms. (steps per millisecond=34 )
Random directed walk for 500020 steps, including 0 resets, run took 20180 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 13483 ms (no deadlock found). (steps per millisecond=37 )
Random directed walk for 500001 steps, including 0 resets, run took 20087 ms (no deadlock found). (steps per millisecond=24 )
Random walk for 500000 steps, including 0 resets, run took 13751 ms (no deadlock found). (steps per millisecond=36 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 626/626 places, 31352/31352 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 246 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-18 06:30:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:12] [INFO ] Invariant cache hit.
[2023-03-18 06:30:14] [INFO ] Implicit Places using invariants in 2538 ms returned []
Implicit Place search using SMT only with invariants took 2551 ms to find 0 implicit places.
[2023-03-18 06:30:14] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:14] [INFO ] Invariant cache hit.
[2023-03-18 06:30:23] [INFO ] Dead Transitions using invariants and state equation in 8574 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 11386 ms. Remains : 626/626 places, 31352/31352 transitions.
Interrupted Random walk after 1184528 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=39 )
[2023-03-18 06:30:53] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-18 06:30:53] [INFO ] Invariant cache hit.
[2023-03-18 06:30:56] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-18 06:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:10] [INFO ] [Real]Absence check using state equation in 13911 ms returned sat
[2023-03-18 06:31:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 06:31:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-18 06:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 06:31:27] [INFO ] [Nat]Absence check using state equation in 12992 ms returned sat
[2023-03-18 06:31:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-18 06:31:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-18 06:31:33] [INFO ] [Nat]Added 268 Read/Feed constraints in 6539 ms returned unknown
Random directed walk for 500019 steps, including 0 resets, run took 19355 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 13409 ms (no deadlock found). (steps per millisecond=37 )
Random directed walk for 500016 steps, including 0 resets, run took 19500 ms (no deadlock found). (steps per millisecond=25 )
Random walk for 500000 steps, including 0 resets, run took 13662 ms (no deadlock found). (steps per millisecond=36 )
[2023-03-18 06:32:41] [INFO ] Flatten gal took : 1362 ms
[2023-03-18 06:32:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 4 ms.
[2023-03-18 06:32:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 639 places, 31353 transitions and 125418 arcs took 108 ms.
Total runtime 354489 ms.
There are residual formulas that ITS could not solve within timeout
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15358268 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16117080 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="RERS17pb113-PT-3"
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 RERS17pb113-PT-3, 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 r343-tall-167889215000011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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