Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143700331.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K 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.3K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620542374415

Running Version 0
[2021-05-09 06:39:36] [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 06:39:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:39:36] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-09 06:39:36] [INFO ] Transformed 262 places.
[2021-05-09 06:39:36] [INFO ] Transformed 219 transitions.
[2021-05-09 06:39:36] [INFO ] Found NUPN structural information;
[2021-05-09 06:39:36] [INFO ] Parsed PT model containing 262 places and 219 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
// Phase 1: matrix 204 rows 245 cols
[2021-05-09 06:39:36] [INFO ] Computed 43 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :13
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
// Phase 1: matrix 204 rows 245 cols
[2021-05-09 06:39:36] [INFO ] Computed 43 place invariants in 7 ms
[2021-05-09 06:39:36] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-09 06:39:36] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:36] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 6 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 61 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 517 ms
[2021-05-09 06:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:39:37] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 06:39:37] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:39:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:37] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 56 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:39:37] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 0 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 0 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 2 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2021-05-09 06:39:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 782 ms
[2021-05-09 06:39:38] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 19 ms.
[2021-05-09 06:39:38] [INFO ] Added : 139 causal constraints over 28 iterations in 527 ms. Result :sat
Minimization took 48 ms.
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 06:39:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:39:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:39] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-09 06:39:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2021-05-09 06:39:39] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:39:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2021-05-09 06:39:39] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:39:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 203 ms
[2021-05-09 06:39:39] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 18 ms.
[2021-05-09 06:39:39] [INFO ] Added : 113 causal constraints over 23 iterations in 283 ms. Result :sat
Minimization took 29 ms.
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:39] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 06:39:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:39:39] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-09 06:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:39:40] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-09 06:39:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:39:40] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2021-05-09 06:39:40] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2021-05-09 06:39:40] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2021-05-09 06:39:40] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2021-05-09 06:39:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 175 ms
[2021-05-09 06:39:40] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2021-05-09 06:39:40] [INFO ] Added : 111 causal constraints over 23 iterations in 325 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 12100 steps, including 193 resets, run finished after 24 ms. (steps per millisecond=504 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12300 steps, including 196 resets, run finished after 40 ms. (steps per millisecond=307 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12200 steps, including 162 resets, run finished after 20 ms. (steps per millisecond=610 ) properties (out of 3) seen :3 could not realise parikh vector
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620542380957

--------------------
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="BusinessProcesses-PT-02"
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 BusinessProcesses-PT-02, 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 r026-tajo-162038143700331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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