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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 3.4K Mar 26 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 26 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 100K 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-07-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-07-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1589251267566

[2020-05-12 02:41:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:41:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 02:41:09] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-05-12 02:41:09] [INFO ] Transformed 386 places.
[2020-05-12 02:41:09] [INFO ] Transformed 360 transitions.
[2020-05-12 02:41:09] [INFO ] Found NUPN structural information;
[2020-05-12 02:41:09] [INFO ] Parsed PT model containing 386 places and 360 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 110 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0]
// Phase 1: matrix 360 rows 386 cols
[2020-05-12 02:41:10] [INFO ] Computed 62 place invariants in 15 ms
[2020-05-12 02:41:10] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-12 02:41:10] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2020-05-12 02:41:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:10] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-12 02:41:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-12 02:41:10] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 11 ms returned sat
[2020-05-12 02:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:11] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2020-05-12 02:41:11] [INFO ] Deduced a trap composed of 13 places in 375 ms
[2020-05-12 02:41:11] [INFO ] Deduced a trap composed of 12 places in 221 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 15 places in 187 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 13 places in 226 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 28 places in 120 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 94 places in 106 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 96 places in 91 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 97 places in 89 ms
[2020-05-12 02:41:12] [INFO ] Deduced a trap composed of 88 places in 95 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 28 places in 89 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 91 places in 87 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 101 places in 101 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 94 places in 81 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 27 places in 91 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 91 places in 116 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 87 places in 98 ms
[2020-05-12 02:41:13] [INFO ] Deduced a trap composed of 85 places in 110 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 91 places in 85 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 20 places in 126 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 87 places in 85 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 91 places in 108 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 96 places in 89 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 95 places in 104 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 104 places in 86 ms
[2020-05-12 02:41:14] [INFO ] Deduced a trap composed of 11 places in 123 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 86 places in 115 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 91 places in 83 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 91 places in 85 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 96 places in 114 ms
[2020-05-12 02:41:15] [INFO ] Deduced a trap composed of 85 places in 104 ms
[2020-05-12 02:41:15] [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 s3 s4 s5 s6 s7 s17 s18 s21 s41 s42 s46 s73 s79 s82 s98 s113 s131 s152 s153 s154 s181 s195 s196 s197 s215 s217 s225 s226 s227 s231 s240 s241 s242 s245 s246 s247 s251 s261 s265 s268 s269 s270 s271 s274 s275 s276 s277 s278 s279 s282 s283 s284 s285 s286 s291 s292 s293 s294 s295 s302 s303 s309 s311 s319 s322 s323 s324 s325 s326 s327 s328 s331 s332 s343 s344 s345 s346 s351 s356 s357 s368 s374) 0)") while checking expression at index 0
[2020-05-12 02:41:15] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2020-05-12 02:41:15] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 15 ms returned sat
[2020-05-12 02:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:16] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2020-05-12 02:41:16] [INFO ] Deduced a trap composed of 8 places in 289 ms
[2020-05-12 02:41:16] [INFO ] Deduced a trap composed of 13 places in 218 ms
[2020-05-12 02:41:16] [INFO ] Deduced a trap composed of 11 places in 120 ms
[2020-05-12 02:41:16] [INFO ] Deduced a trap composed of 35 places in 89 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 10 places in 276 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 34 places in 118 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 15 places in 111 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 28 places in 47 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 27 places in 44 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 22 places in 35 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 18 places in 40 ms
[2020-05-12 02:41:17] [INFO ] Deduced a trap composed of 26 places in 47 ms
[2020-05-12 02:41:17] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1662 ms
[2020-05-12 02:41:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-12 02:41:17] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 16 ms returned sat
[2020-05-12 02:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:18] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2020-05-12 02:41:18] [INFO ] Deduced a trap composed of 12 places in 121 ms
[2020-05-12 02:41:18] [INFO ] Deduced a trap composed of 11 places in 115 ms
[2020-05-12 02:41:18] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2020-05-12 02:41:18] [INFO ] Deduced a trap composed of 13 places in 112 ms
[2020-05-12 02:41:19] [INFO ] Deduced a trap composed of 29 places in 125 ms
[2020-05-12 02:41:19] [INFO ] Deduced a trap composed of 12 places in 108 ms
[2020-05-12 02:41:19] [INFO ] Deduced a trap composed of 19 places in 103 ms
[2020-05-12 02:41:19] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2020-05-12 02:41:19] [INFO ] Deduced a trap composed of 100 places in 100 ms
[2020-05-12 02:41:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1205 ms
[2020-05-12 02:41:19] [INFO ] Computed and/alt/rep : 359/1286/359 causal constraints in 24 ms.
[2020-05-12 02:41:21] [INFO ] Added : 251 causal constraints over 51 iterations in 1848 ms. Result :sat
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 98 places in 99 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 95 places in 96 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 98 places in 98 ms
[2020-05-12 02:41:21] [INFO ] Deduced a trap composed of 109 places in 94 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 102 places in 95 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 95 places in 98 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 104 places in 146 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 102 places in 97 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 100 places in 93 ms
[2020-05-12 02:41:22] [INFO ] Deduced a trap composed of 98 places in 94 ms
[2020-05-12 02:41:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-12 02:41:23] [INFO ] Deduced a trap composed of 15 places in 165 ms
[2020-05-12 02:41:23] [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 s163 s164 s165 s166 s167 s168 s169 s170 s224 s225 s226 s227 s228) 0)") while checking expression at index 1
[2020-05-12 02:41:23] [INFO ] [Real]Absence check using 33 positive place invariants in 17 ms returned sat
[2020-05-12 02:41:23] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 12 ms returned sat
[2020-05-12 02:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 02:41:23] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2020-05-12 02:41:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 02:41:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 52 ms returned sat
[2020-05-12 02:41:23] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 9 ms returned unsat
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 9 out of 386 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 386/386 places, 360/360 transitions.
Graph (trivial) has 203 edges and 386 vertex of which 4 / 386 are part of one of the 1 SCC in 16 ms
Free SCC test removed 3 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 809 edges and 383 vertex of which 381 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 381 transition count 276
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 164 place count 302 transition count 276
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 164 place count 302 transition count 223
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 113 rules applied. Total rules applied 277 place count 242 transition count 223
Symmetric choice reduction at 2 with 41 rule applications. Total rules 318 place count 242 transition count 223
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 41 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 400 place count 201 transition count 182
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 400 place count 201 transition count 177
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 411 place count 195 transition count 177
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 535 place count 132 transition count 116
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 537 place count 131 transition count 119
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 539 place count 131 transition count 117
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 541 place count 129 transition count 117
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 542 place count 129 transition count 117
Applied a total of 542 rules in 104 ms. Remains 129 /386 variables (removed 257) and now considering 117/360 (removed 243) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/386 places, 117/360 transitions.
Finished random walk after 110982 steps, including 4828 resets, run visited all 2 properties in 197 ms. (steps per millisecond=563 )
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-07-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589251284074

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-07"
export BK_EXAMINATION="ReachabilityCardinality"
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-07, examination is ReachabilityCardinality"
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-158897699100502"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-07.tgz
mv BusinessProcesses-PT-07 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;