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

About the Execution of ITS-Tools for ClientsAndServers-PT-N0010P2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
244.296 5415.00 8687.00 431.70 80 80 20 20 20 56 20 80 20 20 56 80 20 20 56 20 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.r069-smll-167814396200261.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 itstools
Input is ClientsAndServers-PT-N0010P2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-167814396200261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 26 13:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 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-N0010P2-UpperBounds-00
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-01
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-02
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-03
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-04
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-05
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-06
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-07
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-08
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-09
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-10
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-11
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-12
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-13
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-14
FORMULA_NAME ClientsAndServers-PT-N0010P2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678341515333

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 05:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 05:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:58:38] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2023-03-09 05:58:38] [INFO ] Transformed 25 places.
[2023-03-09 05:58:38] [INFO ] Transformed 18 transitions.
[2023-03-09 05:58:38] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 05:58:38] [INFO ] Computed 8 place invariants in 9 ms
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-05 56 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10049 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 14) seen :476
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-10 56 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-01 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :39
[2023-03-09 05:58:38] [INFO ] Invariant cache hit.
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 05:58:38] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-09 05:58:38] [INFO ] Added : 16 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 15 ms.
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:58:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 05:58:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:58:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-09 05:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:58:38] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 05:58:38] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-09 05:58:38] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [80, 56] Max seen :[60, 39]
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-14 56 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 11 transition count 7
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 11 transition count 4
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 6 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 6 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 5 transition count 3
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 39 place count 2 transition count 2
Applied a total of 39 rules in 84 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 2/25 places, 2/18 transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-09 05:58:39] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000078 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=3125 ) properties (out of 1) seen :80
FORMULA ClientsAndServers-PT-N0010P2-UpperBounds-07 80 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1565 ms.

BK_STOP 1678341520748

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-N0010P2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ClientsAndServers-PT-N0010P2, 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 r069-smll-167814396200261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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