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

About the Execution of LTSMin+red for ClientsAndServers-PT-N0020P3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
243.308 5651.00 9331.00 386.50 40 160 160 40 160 160 40 40 104 40 40 40 40 40 51 104 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.r073-smll-167814399400293.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 ClientsAndServers-PT-N0020P3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399400293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 13:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P3-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0020P3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678374444290

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=ClientsAndServers-PT-N0020P3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 15:07:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 15:07:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 15:07:27] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-09 15:07:27] [INFO ] Transformed 25 places.
[2023-03-09 15:07:27] [INFO ] Transformed 18 transitions.
[2023-03-09 15:07:27] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 15:07:27] [INFO ] Computed 8 place invariants in 8 ms
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-14 51 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-05 160 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10084 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=630 ) properties (out of 14) seen :744
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-13 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-12 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-11 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-10 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-09 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-07 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-06 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-03 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-02 160 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-00 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :40
[2023-03-09 15:07:27] [INFO ] Invariant cache hit.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-09 15:07:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-09 15:07:27] [INFO ] Added : 16 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 16 ms.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 15:07:27] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-09 15:07:27] [INFO ] Added : 16 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 9 ms.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 15:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-09 15:07:28] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 15:07:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-09 15:07:28] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 15:07:28] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2023-03-09 15:07:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:28] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-09 15:07:28] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-09 15:07:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 15:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 15:07:28] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-09 15:07:28] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-09 15:07:28] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [160, 160, 104, 104] Max seen :[104, 40, 41, 40]
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-15 104 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-08 104 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-04 160 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-01 160 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 1741 ms.
ITS solved all properties within timeout

BK_STOP 1678374449941

--------------------
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="ClientsAndServers-PT-N0020P3"
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 ClientsAndServers-PT-N0020P3, 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 r073-smll-167814399400293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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