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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 104K 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-09-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652627331745

Running Version 202205111006
[2022-05-15 15:08:52] [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 15:08:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:08:53] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-15 15:08:53] [INFO ] Transformed 403 places.
[2022-05-15 15:08:53] [INFO ] Transformed 374 transitions.
[2022-05-15 15:08:53] [INFO ] Found NUPN structural information;
[2022-05-15 15:08:53] [INFO ] Parsed PT model containing 403 places and 374 transitions in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 374 rows 403 cols
[2022-05-15 15:08:53] [INFO ] Computed 65 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 105 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :10
FORMULA BusinessProcesses-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :1
FORMULA BusinessProcesses-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 5) seen :0
// Phase 1: matrix 374 rows 403 cols
[2022-05-15 15:08:53] [INFO ] Computed 65 place invariants in 15 ms
[2022-05-15 15:08:53] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2022-05-15 15:08:53] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-15 15:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:53] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-05-15 15:08:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:08:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-15 15:08:53] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-15 15:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:53] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-05-15 15:08:53] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 8 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-15 15:08:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 550 ms
[2022-05-15 15:08:54] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 41 ms.
[2022-05-15 15:08:55] [INFO ] Added : 204 causal constraints over 41 iterations in 1204 ms. Result :sat
Minimization took 68 ms.
[2022-05-15 15:08:55] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-15 15:08:55] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-15 15:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:55] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-15 15:08:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:08:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-15 15:08:55] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-15 15:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:56] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2022-05-15 15:08:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 522 ms
[2022-05-15 15:08:56] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 47 ms.
[2022-05-15 15:08:57] [INFO ] Added : 184 causal constraints over 37 iterations in 998 ms. Result :sat
Minimization took 65 ms.
[2022-05-15 15:08:57] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-15 15:08:57] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-15 15:08:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:57] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-15 15:08:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:08:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-15 15:08:57] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-15 15:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:58] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-15 15:08:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2022-05-15 15:08:58] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2022-05-15 15:08:58] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2022-05-15 15:08:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2022-05-15 15:08:58] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2022-05-15 15:08:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 325 ms
[2022-05-15 15:08:58] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 21 ms.
[2022-05-15 15:08:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-05-15 15:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-15 15:08:59] [INFO ] Added : 215 causal constraints over 43 iterations in 1267 ms. Result :sat
Minimization took 73 ms.
[2022-05-15 15:08:59] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-15 15:08:59] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-15 15:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:08:59] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-15 15:08:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:09:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-15 15:09:00] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2022-05-15 15:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:09:00] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2022-05-15 15:09:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 586 ms
[2022-05-15 15:09:00] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 36 ms.
[2022-05-15 15:09:01] [INFO ] Added : 178 causal constraints over 36 iterations in 948 ms. Result :sat
Minimization took 69 ms.
[2022-05-15 15:09:01] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-15 15:09:01] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-15 15:09:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:09:02] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2022-05-15 15:09:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 15:09:02] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-15 15:09:02] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-15 15:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 15:09:02] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-15 15:09:02] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-05-15 15:09:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2022-05-15 15:09:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2022-05-15 15:09:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2022-05-15 15:09:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 301 ms
[2022-05-15 15:09:02] [INFO ] Computed and/alt/rep : 352/641/352 causal constraints (skipped 21 transitions) in 21 ms.
[2022-05-15 15:09:03] [INFO ] Added : 210 causal constraints over 42 iterations in 1143 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 403 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 403/403 places, 373/373 transitions.
Graph (trivial) has 226 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 836 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 88 place count 395 transition count 278
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 174 place count 309 transition count 278
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 174 place count 309 transition count 216
Deduced a syphon composed of 62 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 308 place count 237 transition count 216
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 354 place count 191 transition count 170
Iterating global reduction 2 with 46 rules applied. Total rules applied 400 place count 191 transition count 170
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 400 place count 191 transition count 164
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 413 place count 184 transition count 164
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 537 place count 121 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 539 place count 120 transition count 106
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 541 place count 120 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 543 place count 118 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 544 place count 118 transition count 104
Applied a total of 544 rules in 161 ms. Remains 118 /403 variables (removed 285) and now considering 104/373 (removed 269) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/403 places, 104/373 transitions.
// Phase 1: matrix 104 rows 118 cols
[2022-05-15 15:09:04] [INFO ] Computed 51 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 68728 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
FORMULA BusinessProcesses-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13150 ms.

BK_STOP 1652627346045

--------------------
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-09"
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-09, 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-165251918500389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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