fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r150-smll-165276998600269
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ParamProductionCell-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
217.640 8783.00 17459.00 201.40 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 '/data/fkordon/mcc2022-input.r150-smll-165276998600269.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 ParamProductionCell-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 9.0K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 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 ParamProductionCell-PT-2-UpperBounds-00
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-01
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-02
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-03
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-04
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-05
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-06
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-07
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-08
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-09
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-10
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-11
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-12
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-13
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-14
FORMULA_NAME ParamProductionCell-PT-2-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653049893791

Running Version 202205111006
[2022-05-20 12:31:35] [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]
[2022-05-20 12:31:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:31:36] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2022-05-20 12:31:36] [INFO ] Transformed 231 places.
[2022-05-20 12:31:36] [INFO ] Transformed 202 transitions.
[2022-05-20 12:31:36] [INFO ] Found NUPN structural information;
[2022-05-20 12:31:36] [INFO ] Parsed PT model containing 231 places and 202 transitions in 368 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
FORMULA ParamProductionCell-PT-2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 202 rows 231 cols
[2022-05-20 12:31:36] [INFO ] Computed 59 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :13
FORMULA ParamProductionCell-PT-2-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ParamProductionCell-PT-2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 202 rows 231 cols
[2022-05-20 12:31:36] [INFO ] Computed 59 place invariants in 16 ms
[2022-05-20 12:31:37] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2022-05-20 12:31:37] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 25 ms returned sat
[2022-05-20 12:31:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:37] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-05-20 12:31:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:31:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-20 12:31:37] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2022-05-20 12:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:37] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-05-20 12:31:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:37] [INFO ] [Nat]Added 68 Read/Feed constraints in 38 ms returned sat
[2022-05-20 12:31:37] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 9 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2022-05-20 12:31:38] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2022-05-20 12:31:39] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2022-05-20 12:31:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1278 ms
[2022-05-20 12:31:39] [INFO ] Computed and/alt/rep : 195/512/195 causal constraints (skipped 5 transitions) in 20 ms.
[2022-05-20 12:31:39] [INFO ] Added : 133 causal constraints over 27 iterations in 704 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 231/231 places, 200/200 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 199
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 1 place count 230 transition count 185
Deduced a syphon composed of 14 places in 5 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 28 rules applied. Total rules applied 29 place count 216 transition count 185
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 211 transition count 180
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 211 transition count 180
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 75 place count 193 transition count 162
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 193 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 189 transition count 158
Applied a total of 83 rules in 155 ms. Remains 189 /231 variables (removed 42) and now considering 158/200 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/231 places, 158/200 transitions.
// Phase 1: matrix 158 rows 189 cols
[2022-05-20 12:31:40] [INFO ] Computed 59 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 20 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties (out of 1) seen :1
FORMULA ParamProductionCell-PT-2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6588 ms.

BK_STOP 1653049902574

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ParamProductionCell-PT-2"
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 ParamProductionCell-PT-2, 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 r150-smll-165276998600269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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