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

About the Execution of LTSMin+red for CANConstruction-PT-070

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1517.563 76485.00 96509.00 61.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813695000669.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CANConstruction-PT-070, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695000669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 11K Feb 25 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 21:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 21:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 22:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 22:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 22:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.3M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-070-UpperBounds-00
FORMULA_NAME CANConstruction-PT-070-UpperBounds-01
FORMULA_NAME CANConstruction-PT-070-UpperBounds-02
FORMULA_NAME CANConstruction-PT-070-UpperBounds-03
FORMULA_NAME CANConstruction-PT-070-UpperBounds-04
FORMULA_NAME CANConstruction-PT-070-UpperBounds-05
FORMULA_NAME CANConstruction-PT-070-UpperBounds-06
FORMULA_NAME CANConstruction-PT-070-UpperBounds-07
FORMULA_NAME CANConstruction-PT-070-UpperBounds-08
FORMULA_NAME CANConstruction-PT-070-UpperBounds-09
FORMULA_NAME CANConstruction-PT-070-UpperBounds-10
FORMULA_NAME CANConstruction-PT-070-UpperBounds-11
FORMULA_NAME CANConstruction-PT-070-UpperBounds-12
FORMULA_NAME CANConstruction-PT-070-UpperBounds-13
FORMULA_NAME CANConstruction-PT-070-UpperBounds-14
FORMULA_NAME CANConstruction-PT-070-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678655128597

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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 21:05:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 21:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:05:31] [INFO ] Load time of PNML (sax parser for PT used): 534 ms
[2023-03-12 21:05:31] [INFO ] Transformed 10642 places.
[2023-03-12 21:05:31] [INFO ] Transformed 20160 transitions.
[2023-03-12 21:05:31] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 774 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 20160 rows 10642 cols
[2023-03-12 21:05:31] [INFO ] Computed 141 place invariants in 368 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 16) seen :7
FORMULA CANConstruction-PT-070-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
[2023-03-12 21:05:32] [INFO ] Invariant cache hit.
[2023-03-12 21:05:34] [INFO ] [Real]Absence check using 71 positive place invariants in 388 ms returned sat
[2023-03-12 21:05:34] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-12 21:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:05:37] [INFO ] [Real]Absence check using state equation in 2896 ms returned unknown
[2023-03-12 21:05:39] [INFO ] [Real]Absence check using 71 positive place invariants in 308 ms returned sat
[2023-03-12 21:05:39] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 117 ms returned sat
[2023-03-12 21:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:05:42] [INFO ] [Real]Absence check using state equation in 3330 ms returned unknown
[2023-03-12 21:05:44] [INFO ] [Real]Absence check using 71 positive place invariants in 278 ms returned sat
[2023-03-12 21:05:44] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 63 ms returned sat
[2023-03-12 21:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:05:47] [INFO ] [Real]Absence check using state equation in 3431 ms returned unknown
[2023-03-12 21:05:49] [INFO ] [Real]Absence check using 71 positive place invariants in 272 ms returned sat
[2023-03-12 21:05:49] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 53 ms returned sat
[2023-03-12 21:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:05:52] [INFO ] [Real]Absence check using state equation in 3466 ms returned unknown
[2023-03-12 21:05:53] [INFO ] [Real]Absence check using 71 positive place invariants in 269 ms returned sat
[2023-03-12 21:05:53] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-12 21:05:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:05:57] [INFO ] [Real]Absence check using state equation in 3657 ms returned unknown
[2023-03-12 21:05:58] [INFO ] [Real]Absence check using 71 positive place invariants in 351 ms returned sat
[2023-03-12 21:05:59] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 68 ms returned sat
[2023-03-12 21:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:06:02] [INFO ] [Real]Absence check using state equation in 3552 ms returned unknown
[2023-03-12 21:06:04] [INFO ] [Real]Absence check using 71 positive place invariants in 280 ms returned sat
[2023-03-12 21:06:04] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 63 ms returned sat
[2023-03-12 21:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:06:07] [INFO ] [Real]Absence check using state equation in 3484 ms returned unknown
[2023-03-12 21:06:09] [INFO ] [Real]Absence check using 71 positive place invariants in 271 ms returned sat
[2023-03-12 21:06:09] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 61 ms returned sat
[2023-03-12 21:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:06:12] [INFO ] [Real]Absence check using state equation in 3584 ms returned unknown
[2023-03-12 21:06:14] [INFO ] [Real]Absence check using 71 positive place invariants in 250 ms returned sat
[2023-03-12 21:06:14] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-12 21:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 21:06:17] [INFO ] [Real]Absence check using state equation in 3524 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 490 place count 10642 transition count 19670
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 980 place count 10152 transition count 19670
Discarding 4755 places :
Symmetric choice reduction at 2 with 4755 rule applications. Total rules 5735 place count 5397 transition count 10160
Iterating global reduction 2 with 4755 rules applied. Total rules applied 10490 place count 5397 transition count 10160
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 10 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 10630 place count 5327 transition count 10090
Free-agglomeration rule applied 130 times.
Iterating global reduction 2 with 130 rules applied. Total rules applied 10760 place count 5327 transition count 9960
Reduce places removed 130 places and 0 transitions.
Iterating post reduction 2 with 130 rules applied. Total rules applied 10890 place count 5197 transition count 9960
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 10900 place count 5197 transition count 9960
Applied a total of 10900 rules in 7613 ms. Remains 5197 /10642 variables (removed 5445) and now considering 9960/20160 (removed 10200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7617 ms. Remains : 5197/10642 places, 9960/20160 transitions.
// Phase 1: matrix 9960 rows 5197 cols
[2023-03-12 21:06:25] [INFO ] Computed 141 place invariants in 110 ms
Incomplete random walk after 1000000 steps, including 2060 resets, run finished after 19321 ms. (steps per millisecond=51 ) properties (out of 9) seen :9
FORMULA CANConstruction-PT-070-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 74372 ms.
ITS solved all properties within timeout

BK_STOP 1678655205082

--------------------
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 UpperBounds -timeout 360 -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="CANConstruction-PT-070"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 CANConstruction-PT-070, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813695000669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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