fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291600195
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools 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.947 4500.00 10389.00 85.50 160 160 40 40 160 40 40 160 40 40 160 40 40 104 40 40 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291600195.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r045-oct2-162038291600195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 1620566574844

Running Version 0
[2021-05-09 13:22:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 13:22:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:22:57] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2021-05-09 13:22:57] [INFO ] Transformed 25 places.
[2021-05-09 13:22:57] [INFO ] Transformed 18 transitions.
[2021-05-09 13:22:57] [INFO ] Parsed PT model containing 25 places and 18 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 13:22:57] [INFO ] Computed 8 place invariants in 10 ms
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-10 160 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-01 160 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :832
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-15 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-14 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-09 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-08 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-06 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-05 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-04 160 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-03 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-02 40 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :37
// Phase 1: matrix 18 rows 25 cols
[2021-05-09 13:22:57] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 13:22:57] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2021-05-09 13:22:57] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 16 ms returned sat
[2021-05-09 13:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:57] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-09 13:22:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 13:22:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-09 13:22:57] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 13:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-09 13:22:58] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-09 13:22:58] [INFO ] Added : 16 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 13 ms.
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-09 13:22:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2021-05-09 13:22:58] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-09 13:22:58] [INFO ] Added : 16 causal constraints over 4 iterations in 57 ms. Result :sat
Minimization took 5 ms.
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 7 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-09 13:22:58] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 13:22:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 13:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 13:22:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-09 13:22:58] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-09 13:22:58] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [160, 160, 104] Max seen :[104, 104, 64]
Incomplete Parikh walk after 93600 steps, including 99 resets, run finished after 121 ms. (steps per millisecond=773 ) properties (out of 3) seen :128 could not realise parikh vector
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-13 104 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 187200 steps, including 163 resets, run finished after 211 ms. (steps per millisecond=887 ) properties (out of 2) seen :230 could not realise parikh vector
Incomplete Parikh walk after 187200 steps, including 162 resets, run finished after 191 ms. (steps per millisecond=980 ) properties (out of 2) seen :214 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, 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 25 ms. Remains 2 /25 variables (removed 23) and now considering 2/18 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/25 places, 2/18 transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-09 13:22:58] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000092 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=5376 ) properties (out of 2) seen :320
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-07 160 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ClientsAndServers-PT-N0020P3-UpperBounds-00 160 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620566579344

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="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-4028"
echo " Executing tool itstools"
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 r045-oct2-162038291600195"
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 ;