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-158897699100463.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-02, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699100463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 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.4K 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 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 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 59K 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-02-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589250136698

[2020-05-12 02:22:20] [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:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:22:20] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2020-05-12 02:22:20] [INFO ] Transformed 262 places.
[2020-05-12 02:22:20] [INFO ] Transformed 219 transitions.
[2020-05-12 02:22:20] [INFO ] Found NUPN structural information;
[2020-05-12 02:22:20] [INFO ] Parsed PT model containing 262 places and 219 transitions in 202 ms.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 135 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1]
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 204 rows 245 cols
[2020-05-12 02:22:21] [INFO ] Computed 43 place invariants in 28 ms
[2020-05-12 02:22:21] [INFO ] [Real]Absence check using 30 positive place invariants in 202 ms returned sat
[2020-05-12 02:22:21] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 106 ms returned sat
[2020-05-12 02:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:22] [INFO ] [Real]Absence check using state equation in 1041 ms returned unsat
[2020-05-12 02:22:22] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:22:22] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 9 ms returned sat
[2020-05-12 02:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:23] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2020-05-12 02:22:24] [INFO ] Deduced a trap composed of 11 places in 312 ms
[2020-05-12 02:22:24] [INFO ] Deduced a trap composed of 11 places in 227 ms
[2020-05-12 02:22:24] [INFO ] Deduced a trap composed of 8 places in 235 ms
[2020-05-12 02:22:25] [INFO ] Deduced a trap composed of 19 places in 196 ms
[2020-05-12 02:22:26] [INFO ] Deduced a trap composed of 15 places in 1055 ms
[2020-05-12 02:22:26] [INFO ] Deduced a trap composed of 19 places in 117 ms
[2020-05-12 02:22:26] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2020-05-12 02:22:27] [INFO ] Deduced a trap composed of 57 places in 592 ms
[2020-05-12 02:22:27] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-05-12 02:22:27] [INFO ] Deduced a trap composed of 54 places in 764 ms
[2020-05-12 02:22:27] [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 s31 s32 s45 s46 s47 s56 s57 s58 s80 s81 s82 s119 s127 s137 s142 s147 s152 s157 s162 s172 s177 s180 s181 s184 s185 s186 s187 s188 s189 s190 s191 s192 s193 s194 s195 s196 s199 s200 s201 s202 s209 s210 s211 s212 s222 s223 s224 s225 s226 s227 s230 s231 s238) 0)") while checking expression at index 1
[2020-05-12 02:22:28] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-05-12 02:22:28] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2020-05-12 02:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:28] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2020-05-12 02:22:28] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2020-05-12 02:22:28] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-05-12 02:22:28] [INFO ] Deduced a trap composed of 20 places in 92 ms
[2020-05-12 02:22:28] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-05-12 02:22:28] [INFO ] Deduced a trap composed of 42 places in 104 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 16 places in 101 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 19 places in 69 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 24 places in 72 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 26 places in 127 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 55 places in 126 ms
[2020-05-12 02:22:29] [INFO ] Deduced a trap composed of 21 places in 102 ms
[2020-05-12 02:22:30] [INFO ] Deduced a trap composed of 37 places in 902 ms
[2020-05-12 02:22:31] [INFO ] Deduced a trap composed of 28 places in 533 ms
[2020-05-12 02:22:32] [INFO ] Deduced a trap composed of 36 places in 1418 ms
[2020-05-12 02:22:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4336 ms
[2020-05-12 02:22:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:22:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 45 ms returned sat
[2020-05-12 02:22:32] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 13 ms returned sat
[2020-05-12 02:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:33] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2020-05-12 02:22:33] [INFO ] Deduced a trap composed of 10 places in 509 ms
[2020-05-12 02:22:33] [INFO ] Deduced a trap composed of 15 places in 66 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 15 places in 489 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 17 places in 80 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 14 places in 85 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 8 places in 182 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-05-12 02:22:34] [INFO ] Deduced a trap composed of 21 places in 120 ms
[2020-05-12 02:22:35] [INFO ] Deduced a trap composed of 26 places in 127 ms
[2020-05-12 02:22:35] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-05-12 02:22:35] [INFO ] Deduced a trap composed of 28 places in 128 ms
[2020-05-12 02:22:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2232 ms
[2020-05-12 02:22:35] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 26 ms.
[2020-05-12 02:22:36] [INFO ] Added : 152 causal constraints over 31 iterations in 895 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-05-12 02:22:36] [INFO ] [Real]Absence check using 30 positive place invariants in 57 ms returned unsat
[2020-05-12 02:22:36] [INFO ] [Real]Absence check using 30 positive place invariants in 44 ms returned sat
[2020-05-12 02:22:36] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-05-12 02:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:38] [INFO ] [Real]Absence check using state equation in 1531 ms returned sat
[2020-05-12 02:22:38] [INFO ] Deduced a trap composed of 14 places in 38 ms
[2020-05-12 02:22:38] [INFO ] Deduced a trap composed of 12 places in 380 ms
[2020-05-12 02:22:39] [INFO ] Deduced a trap composed of 8 places in 1083 ms
[2020-05-12 02:22:39] [INFO ] Deduced a trap composed of 26 places in 159 ms
[2020-05-12 02:22:40] [INFO ] Deduced a trap composed of 18 places in 191 ms
[2020-05-12 02:22:40] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-05-12 02:22:40] [INFO ] Deduced a trap composed of 32 places in 574 ms
[2020-05-12 02:22:40] [INFO ] Deduced a trap composed of 30 places in 65 ms
[2020-05-12 02:22:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2677 ms
[2020-05-12 02:22:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:22:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 43 ms returned sat
[2020-05-12 02:22:40] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2020-05-12 02:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:41] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2020-05-12 02:22:43] [INFO ] Deduced a trap composed of 14 places in 2460 ms
[2020-05-12 02:22:43] [INFO ] Deduced a trap composed of 17 places in 91 ms
[2020-05-12 02:22:45] [INFO ] Deduced a trap composed of 14 places in 1544 ms
[2020-05-12 02:22:45] [INFO ] Deduced a trap composed of 16 places in 100 ms
[2020-05-12 02:22:45] [INFO ] Deduced a trap composed of 8 places in 40 ms
[2020-05-12 02:22:45] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2020-05-12 02:22:46] [INFO ] Deduced a trap composed of 18 places in 823 ms
[2020-05-12 02:22:46] [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 s1 s2 s45 s46 s47 s87 s90 s151 s152 s153 s162 s172 s177 s218 s219 s222 s223) 0)") while checking expression at index 4
[2020-05-12 02:22:46] [INFO ] [Real]Absence check using 30 positive place invariants in 61 ms returned unsat
[2020-05-12 02:22:46] [INFO ] [Real]Absence check using 30 positive place invariants in 93 ms returned sat
[2020-05-12 02:22:46] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 11 ms returned sat
[2020-05-12 02:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:22:47] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2020-05-12 02:22:48] [INFO ] Deduced a trap composed of 11 places in 202 ms
[2020-05-12 02:22:48] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-05-12 02:22:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 317 ms
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 14800 steps, including 230 resets, run finished after 57 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 17 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Graph (complete) has 446 edges and 245 vertex of which 233 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.57 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 233 transition count 162
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 72 place count 198 transition count 162
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 72 place count 198 transition count 115
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 172 place count 145 transition count 115
Symmetric choice reduction at 2 with 27 rule applications. Total rules 199 place count 145 transition count 115
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 253 place count 118 transition count 88
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 325 place count 81 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 81 transition count 52
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 328 place count 80 transition count 51
Applied a total of 328 rules in 226 ms. Remains 80 /245 variables (removed 165) and now considering 51/204 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/245 places, 51/204 transitions.
Finished random walk after 539799 steps, including 32106 resets, run visited all 3 properties in 973 ms. (steps per millisecond=554 )
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589250170085

--------------------
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-02"
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-02, 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-158897699100463"
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 [ "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 ;