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

About the Execution of ITS-Tools for HouseConstruction-PT-00100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
171.279 3653.00 6518.00 97.60 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 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.r114-smll-165264477600397.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 HouseConstruction-PT-00100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477600397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.4K Apr 29 18:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 18:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Apr 29 18:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 18:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K 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 HouseConstruction-PT-00100-UpperBounds-00
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-01
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-02
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-03
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-04
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-05
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-06
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-07
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-08
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-09
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-10
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-11
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-12
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-13
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-14
FORMULA_NAME HouseConstruction-PT-00100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652797409836

Running Version 202205111006
[2022-05-17 14:23:31] [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-17 14:23:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 14:23:32] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2022-05-17 14:23:32] [INFO ] Transformed 26 places.
[2022-05-17 14:23:32] [INFO ] Transformed 18 transitions.
[2022-05-17 14:23:32] [INFO ] Parsed PT model containing 26 places and 18 transitions in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 14:23:32] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10004 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1600
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :347
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :225
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :323
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :252
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :236
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :221
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :233
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :312
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :210
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :252
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :295
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :432
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :319
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :214
// Phase 1: matrix 18 rows 26 cols
[2022-05-17 14:23:32] [INFO ] Computed 8 place invariants in 8 ms
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 24 ms returned sat
[2022-05-17 14:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-17 14:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:32] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 14:23:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 14:23:33] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
FORMULA HouseConstruction-PT-00100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA HouseConstruction-PT-00100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 1465 ms.

BK_STOP 1652797413489

--------------------
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="HouseConstruction-PT-00100"
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 HouseConstruction-PT-00100, 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 r114-smll-165264477600397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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