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.r024-tall-165251918400333.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 BusinessProcesses-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 9.0K Apr 30 00:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 00:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 30 00:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 00:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 59K May 10 09:33 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 1652623140997

Running Version 202205111006
[2022-05-15 13:59:02] [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-15 13:59:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:59:02] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-15 13:59:02] [INFO ] Transformed 262 places.
[2022-05-15 13:59:02] [INFO ] Transformed 219 transitions.
[2022-05-15 13:59:02] [INFO ] Found NUPN structural information;
[2022-05-15 13:59:02] [INFO ] Parsed PT model containing 262 places and 219 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 204 rows 245 cols
[2022-05-15 13:59:02] [INFO ] Computed 43 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :11
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-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 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-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :0
// Phase 1: matrix 204 rows 245 cols
[2022-05-15 13:59:02] [INFO ] Computed 43 place invariants in 7 ms
[2022-05-15 13:59:02] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2022-05-15 13:59:02] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2022-05-15 13:59:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:02] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-15 13:59:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:59:02] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-05-15 13:59:02] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-15 13:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:02] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 6 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 0 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 0 ms to minimize.
[2022-05-15 13:59:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 670 ms
[2022-05-15 13:59:03] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2022-05-15 13:59:04] [INFO ] Added : 124 causal constraints over 25 iterations in 444 ms. Result :sat
Minimization took 39 ms.
[2022-05-15 13:59:04] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2022-05-15 13:59:04] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 11 ms returned sat
[2022-05-15 13:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:04] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-15 13:59:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:59:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-05-15 13:59:04] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-15 13:59:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:04] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 0 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2022-05-15 13:59:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 380 ms
[2022-05-15 13:59:04] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 14 ms.
[2022-05-15 13:59:05] [INFO ] Added : 140 causal constraints over 29 iterations in 477 ms. Result :sat
Minimization took 34 ms.
[2022-05-15 13:59:05] [INFO ] [Real]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-05-15 13:59:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2022-05-15 13:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:05] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2022-05-15 13:59:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:59:05] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2022-05-15 13:59:05] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-15 13:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:05] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-15 13:59:05] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2022-05-15 13:59:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-05-15 13:59:05] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2022-05-15 13:59:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 210 ms
[2022-05-15 13:59:05] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 1 ms to minimize.
[2022-05-15 13:59:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2022-05-15 13:59:06] [INFO ] Added : 123 causal constraints over 26 iterations in 656 ms. Result :sat
Minimization took 38 ms.
[2022-05-15 13:59:06] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2022-05-15 13:59:06] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2022-05-15 13:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:06] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2022-05-15 13:59:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 13:59:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2022-05-15 13:59:06] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2022-05-15 13:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 13:59:06] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2022-05-15 13:59:06] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2022-05-15 13:59:07] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 690 ms
[2022-05-15 13:59:07] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 13 ms.
[2022-05-15 13:59:07] [INFO ] Added : 144 causal constraints over 29 iterations in 438 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 138 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 227 transition count 139
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 103 place count 177 transition count 139
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 103 place count 177 transition count 101
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 187 place count 131 transition count 101
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 214 place count 104 transition count 74
Iterating global reduction 2 with 27 rules applied. Total rules applied 241 place count 104 transition count 74
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 319 place count 64 transition count 36
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 320 place count 64 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 321 place count 63 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 322 place count 63 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 62 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 61 transition count 34
Applied a total of 324 rules in 59 ms. Remains 61 /245 variables (removed 184) and now considering 34/204 (removed 170) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/245 places, 34/204 transitions.
// Phase 1: matrix 34 rows 61 cols
[2022-05-15 13:59:08] [INFO ] Computed 27 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44972 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 4) seen :4
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 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
All properties solved without resorting to model-checking.
Total runtime 7038 ms.

BK_STOP 1652623149222

--------------------
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="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 r024-tall-165251918400333"
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 ;