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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.1K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:45 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 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 156K 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-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589255070164

[2020-05-12 03:44:36] [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 03:44:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:44:36] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-05-12 03:44:36] [INFO ] Transformed 624 places.
[2020-05-12 03:44:36] [INFO ] Transformed 564 transitions.
[2020-05-12 03:44:36] [INFO ] Found NUPN structural information;
[2020-05-12 03:44:36] [INFO ] Parsed PT model containing 624 places and 564 transitions in 153 ms.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 149 ms. (steps per millisecond=67 ) properties seen :[1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2020-05-12 03:44:36] [INFO ] Computed 99 place invariants in 21 ms
[2020-05-12 03:44:37] [INFO ] [Real]Absence check using 60 positive place invariants in 57 ms returned unsat
[2020-05-12 03:44:37] [INFO ] [Real]Absence check using 60 positive place invariants in 58 ms returned sat
[2020-05-12 03:44:37] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2020-05-12 03:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:44:39] [INFO ] [Real]Absence check using state equation in 1405 ms returned sat
[2020-05-12 03:44:39] [INFO ] Deduced a trap composed of 23 places in 388 ms
[2020-05-12 03:44:41] [INFO ] Deduced a trap composed of 21 places in 1742 ms
[2020-05-12 03:44:44] [INFO ] Deduced a trap composed of 23 places in 3518 ms
[2020-05-12 03:44:44] [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 s8 s9 s77 s78 s213 s216 s217 s218 s347 s348 s349 s417 s418 s419 s423) 0)") while checking expression at index 1
[2020-05-12 03:44:45] [INFO ] [Real]Absence check using 60 positive place invariants in 246 ms returned sat
[2020-05-12 03:44:45] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 82 ms returned sat
[2020-05-12 03:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:44:49] [INFO ] [Real]Absence check using state equation in 3829 ms returned sat
[2020-05-12 03:44:55] [INFO ] Deduced a trap composed of 13 places in 5920 ms
[2020-05-12 03:44:55] [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 s8 s219 s332 s333 s334) 0)") while checking expression at index 2
[2020-05-12 03:44:55] [INFO ] [Real]Absence check using 60 positive place invariants in 105 ms returned sat
[2020-05-12 03:44:55] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 33 ms returned sat
[2020-05-12 03:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:44:58] [INFO ] [Real]Absence check using state equation in 3020 ms returned sat
[2020-05-12 03:44:59] [INFO ] Deduced a trap composed of 142 places in 765 ms
[2020-05-12 03:45:02] [INFO ] Deduced a trap composed of 37 places in 3059 ms
[2020-05-12 03:45:02] [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 s8 s9 s33 s34 s179 s213 s216 s217 s218 s279 s280 s281 s307 s308 s309 s348 s402 s403 s404 s418 s423 s497 s498 s538 s539 s547 s551 s601 s610) 0)") while checking expression at index 3
[2020-05-12 03:45:02] [INFO ] [Real]Absence check using 60 positive place invariants in 106 ms returned sat
[2020-05-12 03:45:02] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 68 ms returned sat
[2020-05-12 03:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:04] [INFO ] [Real]Absence check using state equation in 1895 ms returned sat
[2020-05-12 03:45:05] [INFO ] Deduced a trap composed of 128 places in 248 ms
[2020-05-12 03:45:05] [INFO ] Deduced a trap composed of 14 places in 209 ms
[2020-05-12 03:45:05] [INFO ] Deduced a trap composed of 14 places in 254 ms
[2020-05-12 03:45:05] [INFO ] Deduced a trap composed of 11 places in 353 ms
[2020-05-12 03:45:06] [INFO ] Deduced a trap composed of 15 places in 192 ms
[2020-05-12 03:45:06] [INFO ] Deduced a trap composed of 18 places in 448 ms
[2020-05-12 03:45:07] [INFO ] Deduced a trap composed of 18 places in 413 ms
[2020-05-12 03:45:07] [INFO ] Deduced a trap composed of 16 places in 541 ms
[2020-05-12 03:45:07] [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 s8 s9 s10 s11 s159 s312 s313 s314) 0)") while checking expression at index 4
[2020-05-12 03:45:07] [INFO ] [Real]Absence check using 60 positive place invariants in 74 ms returned sat
[2020-05-12 03:45:07] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2020-05-12 03:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:09] [INFO ] [Real]Absence check using state equation in 1724 ms returned sat
[2020-05-12 03:45:10] [INFO ] Deduced a trap composed of 12 places in 1427 ms
[2020-05-12 03:45:11] [INFO ] Deduced a trap composed of 131 places in 979 ms
[2020-05-12 03:45:12] [INFO ] Deduced a trap composed of 16 places in 225 ms
[2020-05-12 03:45:12] [INFO ] Deduced a trap composed of 21 places in 452 ms
[2020-05-12 03:45:12] [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 s63 s64 s222 s223 s224 s243 s246 s327 s328 s329 s333 s338 s428 s433 s573 s574 s577 s578) 0)") while checking expression at index 5
[2020-05-12 03:45:13] [INFO ] [Real]Absence check using 60 positive place invariants in 247 ms returned sat
[2020-05-12 03:45:13] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 73 ms returned sat
[2020-05-12 03:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:15] [INFO ] [Real]Absence check using state equation in 2262 ms returned unsat
[2020-05-12 03:45:15] [INFO ] [Real]Absence check using 60 positive place invariants in 393 ms returned sat
[2020-05-12 03:45:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned unsat
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 32 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.33 ms
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 610 transition count 468
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 175 place count 523 transition count 468
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 175 place count 523 transition count 340
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 268 rules applied. Total rules applied 443 place count 383 transition count 340
Symmetric choice reduction at 2 with 81 rule applications. Total rules 524 place count 383 transition count 340
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 81 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 686 place count 302 transition count 259
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 686 place count 302 transition count 251
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 705 place count 291 transition count 251
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 873 place count 207 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 874 place count 207 transition count 166
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 876 place count 206 transition count 170
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 877 place count 206 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 878 place count 205 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 879 place count 204 transition count 169
Applied a total of 879 rules in 427 ms. Remains 204 /616 variables (removed 412) and now considering 169/556 (removed 387) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/616 places, 169/556 transitions.
Incomplete random walk after 1000000 steps, including 62491 resets, run finished after 2349 ms. (steps per millisecond=425 ) properties seen :[1, 1, 0, 1, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 10937 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 12181 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties seen :[0, 0]
// Phase 1: matrix 169 rows 204 cols
[2020-05-12 03:45:21] [INFO ] Computed 78 place invariants in 23 ms
[2020-05-12 03:45:21] [INFO ] [Real]Absence check using 54 positive place invariants in 40 ms returned sat
[2020-05-12 03:45:21] [INFO ] [Real]Absence check using 54 positive and 24 generalized place invariants in 8 ms returned sat
[2020-05-12 03:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:21] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2020-05-12 03:45:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-12 03:45:21] [INFO ] [Real]Added 4 Read/Feed constraints in 31 ms returned sat
[2020-05-12 03:45:21] [INFO ] Deduced a trap composed of 6 places in 493 ms
[2020-05-12 03:45:23] [INFO ] Deduced a trap composed of 8 places in 1167 ms
[2020-05-12 03:45:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1695 ms
[2020-05-12 03:45:23] [INFO ] [Real]Absence check using 54 positive place invariants in 53 ms returned sat
[2020-05-12 03:45:23] [INFO ] [Real]Absence check using 54 positive and 24 generalized place invariants in 12 ms returned sat
[2020-05-12 03:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:23] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-05-12 03:45:23] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2020-05-12 03:45:24] [INFO ] Deduced a trap composed of 43 places in 1404 ms
[2020-05-12 03:45:26] [INFO ] Deduced a trap composed of 49 places in 1509 ms
[2020-05-12 03:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2939 ms
[2020-05-12 03:45:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:45:26] [INFO ] [Nat]Absence check using 54 positive place invariants in 65 ms returned sat
[2020-05-12 03:45:26] [INFO ] [Nat]Absence check using 54 positive and 24 generalized place invariants in 15 ms returned sat
[2020-05-12 03:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:45:26] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2020-05-12 03:45:26] [INFO ] [Nat]Added 4 Read/Feed constraints in 17 ms returned sat
[2020-05-12 03:45:26] [INFO ] Deduced a trap composed of 47 places in 189 ms
[2020-05-12 03:45:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2020-05-12 03:45:26] [INFO ] Computed and/alt/rep : 161/762/161 causal constraints in 17 ms.
[2020-05-12 03:45:27] [INFO ] Added : 67 causal constraints over 14 iterations in 431 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 170 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589255130037

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

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