Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200519.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.7K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 104K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-09-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589251809830

[2020-05-12 02:50:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 02:50:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:50:13] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2020-05-12 02:50:13] [INFO ] Transformed 403 places.
[2020-05-12 02:50:13] [INFO ] Transformed 374 transitions.
[2020-05-12 02:50:13] [INFO ] Found NUPN structural information;
[2020-05-12 02:50:13] [INFO ] Parsed PT model containing 403 places and 374 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 69 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 104 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1]
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 374 rows 403 cols
[2020-05-12 02:50:13] [INFO ] Computed 65 place invariants in 20 ms
[2020-05-12 02:50:13] [INFO ] [Real]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-05-12 02:50:13] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 16 ms returned sat
[2020-05-12 02:50:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:14] [INFO ] [Real]Absence check using state equation in 649 ms returned unsat
[2020-05-12 02:50:14] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-05-12 02:50:14] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-05-12 02:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:14] [INFO ] [Real]Absence check using state equation in 391 ms returned unsat
[2020-05-12 02:50:15] [INFO ] [Real]Absence check using 36 positive place invariants in 173 ms returned sat
[2020-05-12 02:50:15] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 214 ms returned sat
[2020-05-12 02:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:17] [INFO ] [Real]Absence check using state equation in 2354 ms returned unsat
[2020-05-12 02:50:17] [INFO ] [Real]Absence check using 36 positive place invariants in 21 ms returned sat
[2020-05-12 02:50:17] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 15 ms returned sat
[2020-05-12 02:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:20] [INFO ] [Real]Absence check using state equation in 2788 ms returned unsat
[2020-05-12 02:50:20] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-05-12 02:50:20] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 108 ms returned sat
[2020-05-12 02:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:23] [INFO ] [Real]Absence check using state equation in 2561 ms returned sat
[2020-05-12 02:50:23] [INFO ] Deduced a trap composed of 12 places in 240 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 8 places in 435 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 11 places in 121 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 14 places in 56 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 19 places in 72 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 40 places in 70 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 20 places in 80 ms
[2020-05-12 02:50:24] [INFO ] Deduced a trap composed of 46 places in 130 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 31 places in 109 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 35 places in 71 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 30 places in 58 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 26 places in 70 ms
[2020-05-12 02:50:25] [INFO ] Deduced a trap composed of 28 places in 48 ms
[2020-05-12 02:50:25] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2146 ms
[2020-05-12 02:50:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:50:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 55 ms returned sat
[2020-05-12 02:50:25] [INFO ] [Nat]Absence check using 36 positive and 29 generalized place invariants in 23 ms returned sat
[2020-05-12 02:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:26] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2020-05-12 02:50:26] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-05-12 02:50:27] [INFO ] Deduced a trap composed of 15 places in 541 ms
[2020-05-12 02:50:27] [INFO ] Deduced a trap composed of 8 places in 131 ms
[2020-05-12 02:50:27] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-05-12 02:50:27] [INFO ] Deduced a trap composed of 17 places in 69 ms
[2020-05-12 02:50:27] [INFO ] Deduced a trap composed of 20 places in 65 ms
[2020-05-12 02:50:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1197 ms
[2020-05-12 02:50:27] [INFO ] Computed and/alt/rep : 373/1354/373 causal constraints in 24 ms.
[2020-05-12 02:50:28] [INFO ] Added : 200 causal constraints over 41 iterations in 1432 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 11 ms returned sat
[2020-05-12 02:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using state equation in 306 ms returned unsat
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using 36 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-12 02:50:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:50:29] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-05-12 02:50:30] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-05-12 02:50:30] [INFO ] Deduced a trap composed of 12 places in 220 ms
[2020-05-12 02:50:30] [INFO ] Deduced a trap composed of 27 places in 242 ms
[2020-05-12 02:50:30] [INFO ] Deduced a trap composed of 94 places in 109 ms
[2020-05-12 02:50:30] [INFO ] Deduced a trap composed of 19 places in 272 ms
[2020-05-12 02:50:31] [INFO ] Deduced a trap composed of 19 places in 294 ms
[2020-05-12 02:50:31] [INFO ] Deduced a trap composed of 16 places in 265 ms
[2020-05-12 02:50:31] [INFO ] Deduced a trap composed of 108 places in 219 ms
[2020-05-12 02:50:32] [INFO ] Deduced a trap composed of 102 places in 211 ms
[2020-05-12 02:50:32] [INFO ] Deduced a trap composed of 110 places in 232 ms
[2020-05-12 02:50:32] [INFO ] Deduced a trap composed of 93 places in 229 ms
[2020-05-12 02:50:32] [INFO ] Deduced a trap composed of 109 places in 327 ms
[2020-05-12 02:50:33] [INFO ] Deduced a trap composed of 110 places in 230 ms
[2020-05-12 02:50:33] [INFO ] Deduced a trap composed of 105 places in 229 ms
[2020-05-12 02:50:33] [INFO ] Deduced a trap composed of 106 places in 205 ms
[2020-05-12 02:50:33] [INFO ] Deduced a trap composed of 107 places in 206 ms
[2020-05-12 02:50:34] [INFO ] Deduced a trap composed of 112 places in 204 ms
[2020-05-12 02:50:34] [INFO ] Deduced a trap composed of 105 places in 239 ms
[2020-05-12 02:50:34] [INFO ] Deduced a trap composed of 111 places in 102 ms
[2020-05-12 02:50:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2 s3 s4 s39 s41 s42 s48 s49 s50 s59 s60 s61 s78 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s120 s121 s122 s135 s136 s137 s156 s188 s190 s204 s219 s228 s230 s239 s254 s269 s277 s278 s279 s280 s281 s282 s283 s284 s287 s288 s289 s290 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s306 s307 s310 s311 s312 s315 s316 s319 s320 s321 s322 s323 s324 s325 s326 s327 s328 s340 s341 s344 s345 s346 s347 s354 s355 s356 s357 s360 s361 s364 s365 s366 s367 s368 s370 s371 s373 s374 s382 s383 s384 s388 s389 s390 s391 s392 s393) 0)") while checking expression at index 6
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 15300 steps, including 164 resets, run finished after 41 ms. (steps per millisecond=373 ) properties seen :[1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 403/403 places, 374/374 transitions.
Graph (trivial) has 226 edges and 403 vertex of which 7 / 403 are part of one of the 1 SCC in 26 ms
Free SCC test removed 6 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 837 edges and 397 vertex of which 395 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 395 transition count 279
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 182 place count 309 transition count 279
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 182 place count 309 transition count 218
Deduced a syphon composed of 61 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 314 place count 238 transition count 218
Symmetric choice reduction at 2 with 47 rule applications. Total rules 361 place count 238 transition count 218
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 47 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 455 place count 191 transition count 171
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 455 place count 191 transition count 165
Deduced a syphon composed of 6 places in 1 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 468 place count 184 transition count 165
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 592 place count 121 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 594 place count 120 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 596 place count 120 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 598 place count 118 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 599 place count 118 transition count 105
Applied a total of 599 rules in 141 ms. Remains 118 /403 variables (removed 285) and now considering 105/374 (removed 269) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/403 places, 105/374 transitions.
Finished random walk after 56 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
FORMULA BusinessProcesses-PT-09-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251834864

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-oct2-158897699200519"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;