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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 4.3K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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.5K 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 3.0K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589256908264

[2020-05-12 04:15: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 04:15:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 04:15:12] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-05-12 04:15:12] [INFO ] Transformed 650 places.
[2020-05-12 04:15:12] [INFO ] Transformed 580 transitions.
[2020-05-12 04:15:12] [INFO ] Found NUPN structural information;
[2020-05-12 04:15:12] [INFO ] Parsed PT model containing 650 places and 580 transitions in 216 ms.
Deduced a syphon composed of 4 places in 21 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 100 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 66 resets, run finished after 127 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 576 rows 646 cols
[2020-05-12 04:15:13] [INFO ] Computed 108 place invariants in 71 ms
[2020-05-12 04:15:13] [INFO ] [Real]Absence check using 62 positive place invariants in 126 ms returned sat
[2020-05-12 04:15:13] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 93 ms returned sat
[2020-05-12 04:15:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:15] [INFO ] [Real]Absence check using state equation in 2085 ms returned sat
[2020-05-12 04:15:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:15:16] [INFO ] [Nat]Absence check using 62 positive place invariants in 136 ms returned sat
[2020-05-12 04:15:16] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 166 ms returned sat
[2020-05-12 04:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:17] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2020-05-12 04:15:18] [INFO ] Deduced a trap composed of 30 places in 1041 ms
[2020-05-12 04:15:19] [INFO ] Deduced a trap composed of 22 places in 555 ms
[2020-05-12 04:15:19] [INFO ] Deduced a trap composed of 20 places in 447 ms
[2020-05-12 04:15:20] [INFO ] Deduced a trap composed of 117 places in 451 ms
[2020-05-12 04:15:20] [INFO ] Deduced a trap composed of 16 places in 375 ms
[2020-05-12 04:15:21] [INFO ] Deduced a trap composed of 135 places in 394 ms
[2020-05-12 04:15:21] [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 s50 s51 s54 s55 s59 s60 s61 s65 s66 s69 s70 s75 s76 s89 s90 s91 s143 s144 s145 s157 s158 s168 s171 s172 s182 s183 s184 s199 s200 s208 s214 s215 s216 s226 s227 s228 s229 s232 s233 s234 s297 s301 s302 s303 s306 s308 s331 s341 s345 s346 s347 s360 s361 s362 s366 s371 s380 s382 s386 s391 s405 s406 s407 s411 s440 s441 s442 s446 s456 s460 s461 s462 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s479 s480 s481 s482 s483 s484 s485 s486 s487 s494 s495 s499 s500 s505 s506 s507 s508 s540 s541 s542 s543 s556 s557 s558 s559 s570 s571 s575 s576 s579 s580 s581 s582 s583 s584 s587 s588 s599 s600 s601 s602 s603 s604 s607) 0)") while checking expression at index 0
[2020-05-12 04:15:21] [INFO ] [Real]Absence check using 62 positive place invariants in 46 ms returned sat
[2020-05-12 04:15:21] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 25 ms returned sat
[2020-05-12 04:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:22] [INFO ] [Real]Absence check using state equation in 964 ms returned sat
[2020-05-12 04:15:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:15:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 89 ms returned sat
[2020-05-12 04:15:22] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 193 ms returned sat
[2020-05-12 04:15:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:27] [INFO ] [Nat]Absence check using state equation in 4472 ms returned sat
[2020-05-12 04:15:27] [INFO ] Deduced a trap composed of 14 places in 340 ms
[2020-05-12 04:15: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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s223 s316 s317 s318) 0)") while checking expression at index 1
[2020-05-12 04:15:28] [INFO ] [Real]Absence check using 62 positive place invariants in 390 ms returned sat
[2020-05-12 04:15:28] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 221 ms returned sat
[2020-05-12 04:15:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:32] [INFO ] [Real]Absence check using state equation in 4231 ms returned (error "Solver has unexpectedly terminated")
[2020-05-12 04:15:33] [INFO ] [Real]Absence check using 62 positive place invariants in 304 ms returned sat
[2020-05-12 04:15:33] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 69 ms returned unsat
[2020-05-12 04:15:33] [INFO ] [Real]Absence check using 62 positive place invariants in 278 ms returned sat
[2020-05-12 04:15:33] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 26 ms returned unsat
[2020-05-12 04:15:33] [INFO ] [Real]Absence check using 62 positive place invariants in 113 ms returned unsat
[2020-05-12 04:15:34] [INFO ] [Real]Absence check using 62 positive place invariants in 48 ms returned sat
[2020-05-12 04:15:34] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 210 ms returned sat
[2020-05-12 04:15:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:37] [INFO ] [Real]Absence check using state equation in 2847 ms returned sat
[2020-05-12 04:15:40] [INFO ] Deduced a trap composed of 11 places in 3692 ms
[2020-05-12 04:15:40] [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 s241 s450 s451 s452) 0)") while checking expression at index 6
[2020-05-12 04:15:41] [INFO ] [Real]Absence check using 62 positive place invariants in 233 ms returned sat
[2020-05-12 04:15:41] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 124 ms returned sat
[2020-05-12 04:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:45] [INFO ] [Real]Absence check using state equation in 3716 ms returned sat
[2020-05-12 04:15:50] [INFO ] Deduced a trap composed of 16 places in 5818 ms
[2020-05-12 04:15:50] [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 s211 s420 s421 s422) 0)") while checking expression at index 7
[2020-05-12 04:15:51] [INFO ] [Real]Absence check using 62 positive place invariants in 68 ms returned sat
[2020-05-12 04:15:51] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 56 ms returned sat
[2020-05-12 04:15:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:15:53] [INFO ] [Real]Absence check using state equation in 2377 ms returned sat
[2020-05-12 04:15:53] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-05-12 04:15:54] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-12 04:15:54] [INFO ] Deduced a trap composed of 12 places in 283 ms
[2020-05-12 04:15:54] [INFO ] Deduced a trap composed of 15 places in 313 ms
[2020-05-12 04:15:55] [INFO ] Deduced a trap composed of 20 places in 248 ms
[2020-05-12 04:15:55] [INFO ] Deduced a trap composed of 25 places in 477 ms
[2020-05-12 04:15:55] [INFO ] Deduced a trap composed of 8 places in 261 ms
[2020-05-12 04:15:56] [INFO ] Deduced a trap composed of 34 places in 220 ms
[2020-05-12 04:15:56] [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 s34 s35 s54 s55 s199 s200 s208 s226 s227 s228 s235 s297 s317 s410 s411 s412 s416 s421 s431 s436 s577 s578 s581 s582 s593 s594) 0)") while checking expression at index 8
[2020-05-12 04:15:56] [INFO ] [Real]Absence check using 62 positive place invariants in 50 ms returned unsat
[2020-05-12 04:15:56] [INFO ] [Real]Absence check using 62 positive place invariants in 162 ms returned sat
[2020-05-12 04:15:56] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned unsat
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 40 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.43 ms
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 642 transition count 483
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 550 transition count 483
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 185 place count 550 transition count 355
Deduced a syphon composed of 128 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 458 place count 405 transition count 355
Symmetric choice reduction at 2 with 74 rule applications. Total rules 532 place count 405 transition count 355
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 74 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 680 place count 331 transition count 281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 680 place count 331 transition count 276
Deduced a syphon composed of 5 places in 1 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 691 place count 325 transition count 276
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 193 rules applied. Total rules applied 884 place count 227 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 885 place count 227 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 887 place count 226 transition count 184
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 891 place count 226 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 892 place count 225 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 893 place count 224 transition count 183
Applied a total of 893 rules in 289 ms. Remains 224 /646 variables (removed 422) and now considering 183/576 (removed 393) transitions.
Finished structural reductions, in 1 iterations. Remains : 224/646 places, 183/576 transitions.
Incomplete random walk after 1000000 steps, including 37835 resets, run finished after 2820 ms. (steps per millisecond=354 ) properties seen :[1, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 7609 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7262 resets, run finished after 1104 ms. (steps per millisecond=905 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6763 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties seen :[0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7268 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5290 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 183 rows 224 cols
[2020-05-12 04:16:04] [INFO ] Computed 83 place invariants in 13 ms
[2020-05-12 04:16:05] [INFO ] [Real]Absence check using 60 positive place invariants in 315 ms returned sat
[2020-05-12 04:16:05] [INFO ] [Real]Absence check using 60 positive and 23 generalized place invariants in 21 ms returned sat
[2020-05-12 04:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:05] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-05-12 04:16:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 323 ms returned sat
[2020-05-12 04:16:06] [INFO ] [Nat]Absence check using 60 positive and 23 generalized place invariants in 32 ms returned sat
[2020-05-12 04:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:06] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2020-05-12 04:16:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-12 04:16:06] [INFO ] [Nat]Added 4 Read/Feed constraints in 131 ms returned sat
[2020-05-12 04:16:07] [INFO ] Deduced a trap composed of 12 places in 31 ms
[2020-05-12 04:16:07] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-05-12 04:16:07] [INFO ] Deduced a trap composed of 24 places in 58 ms
[2020-05-12 04:16:07] [INFO ] Deduced a trap composed of 8 places in 402 ms
[2020-05-12 04:16:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 594 ms
[2020-05-12 04:16:07] [INFO ] Computed and/alt/rep : 179/970/179 causal constraints in 12 ms.
[2020-05-12 04:16:08] [INFO ] Added : 82 causal constraints over 17 iterations in 505 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-12 04:16:08] [INFO ] [Real]Absence check using 60 positive place invariants in 38 ms returned sat
[2020-05-12 04:16:08] [INFO ] [Real]Absence check using 60 positive and 23 generalized place invariants in 10 ms returned sat
[2020-05-12 04:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:08] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2020-05-12 04:16:08] [INFO ] [Real]Added 4 Read/Feed constraints in 4 ms returned sat
[2020-05-12 04:16:08] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-12 04:16:08] [INFO ] Deduced a trap composed of 15 places in 81 ms
[2020-05-12 04:16:08] [INFO ] Deduced a trap composed of 16 places in 89 ms
[2020-05-12 04:16:08] [INFO ] Deduced a trap composed of 8 places in 56 ms
[2020-05-12 04:16:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 376 ms
[2020-05-12 04:16:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:09] [INFO ] [Nat]Absence check using 60 positive place invariants in 176 ms returned sat
[2020-05-12 04:16:09] [INFO ] [Nat]Absence check using 60 positive and 23 generalized place invariants in 13 ms returned sat
[2020-05-12 04:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:09] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2020-05-12 04:16:09] [INFO ] [Nat]Added 4 Read/Feed constraints in 32 ms returned sat
[2020-05-12 04:16:09] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2020-05-12 04:16:09] [INFO ] Deduced a trap composed of 5 places in 28 ms
[2020-05-12 04:16:09] [INFO ] Deduced a trap composed of 8 places in 43 ms
[2020-05-12 04:16:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2020-05-12 04:16:09] [INFO ] Computed and/alt/rep : 179/970/179 causal constraints in 13 ms.
[2020-05-12 04:16:10] [INFO ] Added : 77 causal constraints over 16 iterations in 446 ms. Result :sat
[2020-05-12 04:16:12] [INFO ] Deduced a trap composed of 49 places in 1852 ms
[2020-05-12 04:16:14] [INFO ] Deduced a trap composed of 49 places in 2163 ms
[2020-05-12 04:16:16] [INFO ] Deduced a trap composed of 48 places in 2609 ms
[2020-05-12 04:16:19] [INFO ] Deduced a trap composed of 45 places in 2531 ms
[2020-05-12 04:16:21] [INFO ] Deduced a trap composed of 50 places in 1832 ms
[2020-05-12 04:16:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 11216 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-12 04:16:21] [INFO ] [Real]Absence check using 60 positive place invariants in 240 ms returned sat
[2020-05-12 04:16:21] [INFO ] [Real]Absence check using 60 positive and 23 generalized place invariants in 115 ms returned sat
[2020-05-12 04:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:23] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2020-05-12 04:16:23] [INFO ] [Real]Added 4 Read/Feed constraints in 11 ms returned sat
[2020-05-12 04:16:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:23] [INFO ] [Nat]Absence check using 60 positive place invariants in 370 ms returned sat
[2020-05-12 04:16:23] [INFO ] [Nat]Absence check using 60 positive and 23 generalized place invariants in 78 ms returned sat
[2020-05-12 04:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:23] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2020-05-12 04:16:23] [INFO ] [Nat]Added 4 Read/Feed constraints in 18 ms returned sat
[2020-05-12 04:16:23] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-12 04:16:25] [INFO ] Deduced a trap composed of 47 places in 1475 ms
[2020-05-12 04:16:28] [INFO ] Deduced a trap composed of 47 places in 3445 ms
[2020-05-12 04:16:30] [INFO ] Deduced a trap composed of 48 places in 2025 ms
[2020-05-12 04:16:31] [INFO ] Deduced a trap composed of 45 places in 1000 ms
[2020-05-12 04:16:32] [INFO ] Deduced a trap composed of 25 places in 277 ms
[2020-05-12 04:16:32] [INFO ] Deduced a trap composed of 48 places in 68 ms
[2020-05-12 04:16:32] [INFO ] Deduced a trap composed of 48 places in 169 ms
[2020-05-12 04:16:32] [INFO ] Deduced a trap composed of 11 places in 79 ms
[2020-05-12 04:16:34] [INFO ] Deduced a trap composed of 48 places in 1505 ms
[2020-05-12 04:16:36] [INFO ] Deduced a trap composed of 47 places in 2062 ms
[2020-05-12 04:16:36] [INFO ] Deduced a trap composed of 48 places in 195 ms
[2020-05-12 04:16:36] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-05-12 04:16:36] [INFO ] Deduced a trap composed of 47 places in 97 ms
[2020-05-12 04:16:36] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 13014 ms
[2020-05-12 04:16:36] [INFO ] Computed and/alt/rep : 179/970/179 causal constraints in 11 ms.
[2020-05-12 04:16:37] [INFO ] Added : 65 causal constraints over 14 iterations in 931 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-05-12 04:16:38] [INFO ] [Real]Absence check using 60 positive place invariants in 199 ms returned sat
[2020-05-12 04:16:38] [INFO ] [Real]Absence check using 60 positive and 23 generalized place invariants in 74 ms returned sat
[2020-05-12 04:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:39] [INFO ] [Real]Absence check using state equation in 986 ms returned sat
[2020-05-12 04:16:39] [INFO ] [Real]Added 4 Read/Feed constraints in 16 ms returned sat
[2020-05-12 04:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 141 ms returned sat
[2020-05-12 04:16:39] [INFO ] [Nat]Absence check using 60 positive and 23 generalized place invariants in 48 ms returned sat
[2020-05-12 04:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:40] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2020-05-12 04:16:40] [INFO ] [Nat]Added 4 Read/Feed constraints in 40 ms returned sat
[2020-05-12 04:16:41] [INFO ] Deduced a trap composed of 12 places in 702 ms
[2020-05-12 04:16:41] [INFO ] Deduced a trap composed of 8 places in 679 ms
[2020-05-12 04:16:42] [INFO ] Deduced a trap composed of 9 places in 443 ms
[2020-05-12 04:16:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1897 ms
[2020-05-12 04:16:42] [INFO ] Computed and/alt/rep : 179/970/179 causal constraints in 19 ms.
[2020-05-12 04:16:43] [INFO ] Added : 82 causal constraints over 17 iterations in 884 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 12700 steps, including 562 resets, run finished after 74 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8300 steps, including 358 resets, run finished after 43 ms. (steps per millisecond=193 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 417 resets, run finished after 54 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 13700 steps, including 619 resets, run finished after 47 ms. (steps per millisecond=291 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 25 out of 224 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 224/224 places, 183/183 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 224 transition count 179
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 220 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 220 transition count 175
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 17 place count 215 transition count 175
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 207 transition count 168
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 206 transition count 167
Applied a total of 33 rules in 54 ms. Remains 206 /224 variables (removed 18) and now considering 167/183 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/224 places, 167/183 transitions.
Incomplete random walk after 1000000 steps, including 54474 resets, run finished after 2179 ms. (steps per millisecond=458 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13641 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties seen :[0, 1, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 12838 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9278 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties seen :[0, 0, 0]
// Phase 1: matrix 167 rows 206 cols
[2020-05-12 04:16:48] [INFO ] Computed 81 place invariants in 8 ms
[2020-05-12 04:16:48] [INFO ] [Real]Absence check using 58 positive place invariants in 152 ms returned sat
[2020-05-12 04:16:48] [INFO ] [Real]Absence check using 58 positive and 23 generalized place invariants in 61 ms returned sat
[2020-05-12 04:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:49] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2020-05-12 04:16:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-12 04:16:49] [INFO ] [Real]Added 4 Read/Feed constraints in 9 ms returned sat
[2020-05-12 04:16:50] [INFO ] Deduced a trap composed of 5 places in 1134 ms
[2020-05-12 04:16:52] [INFO ] Deduced a trap composed of 17 places in 1037 ms
[2020-05-12 04:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2245 ms
[2020-05-12 04:16:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:52] [INFO ] [Nat]Absence check using 58 positive place invariants in 133 ms returned sat
[2020-05-12 04:16:52] [INFO ] [Nat]Absence check using 58 positive and 23 generalized place invariants in 32 ms returned sat
[2020-05-12 04:16:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:52] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2020-05-12 04:16:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 23 ms returned sat
[2020-05-12 04:16:53] [INFO ] Computed and/alt/rep : 163/943/163 causal constraints in 29 ms.
[2020-05-12 04:16:53] [INFO ] Added : 72 causal constraints over 15 iterations in 817 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-12 04:16:54] [INFO ] [Real]Absence check using 58 positive place invariants in 162 ms returned sat
[2020-05-12 04:16:54] [INFO ] [Real]Absence check using 58 positive and 23 generalized place invariants in 38 ms returned sat
[2020-05-12 04:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:54] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2020-05-12 04:16:54] [INFO ] [Real]Added 4 Read/Feed constraints in 20 ms returned sat
[2020-05-12 04:16:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:54] [INFO ] [Nat]Absence check using 58 positive place invariants in 110 ms returned sat
[2020-05-12 04:16:55] [INFO ] [Nat]Absence check using 58 positive and 23 generalized place invariants in 89 ms returned sat
[2020-05-12 04:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:55] [INFO ] [Nat]Absence check using state equation in 741 ms returned sat
[2020-05-12 04:16:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2020-05-12 04:16:56] [INFO ] Deduced a trap composed of 45 places in 261 ms
[2020-05-12 04:16:56] [INFO ] Deduced a trap composed of 7 places in 32 ms
[2020-05-12 04:16:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2020-05-12 04:16:56] [INFO ] Computed and/alt/rep : 163/943/163 causal constraints in 11 ms.
[2020-05-12 04:16:56] [INFO ] Added : 69 causal constraints over 14 iterations in 227 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-12 04:16:56] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Real]Absence check using 58 positive and 23 generalized place invariants in 13 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:56] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2020-05-12 04:16:56] [INFO ] Deduced a trap composed of 22 places in 13 ms
[2020-05-12 04:16:56] [INFO ] Deduced a trap composed of 23 places in 11 ms
[2020-05-12 04:16:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 39 ms
[2020-05-12 04:16:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 04:16:56] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Nat]Absence check using 58 positive and 23 generalized place invariants in 8 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 04:16:56] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-05-12 04:16:56] [INFO ] [Nat]Added 4 Read/Feed constraints in 6 ms returned sat
[2020-05-12 04:16:56] [INFO ] Computed and/alt/rep : 163/943/163 causal constraints in 9 ms.
[2020-05-12 04:16:57] [INFO ] Added : 69 causal constraints over 14 iterations in 243 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 11800 steps, including 745 resets, run finished after 38 ms. (steps per millisecond=310 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 11000 steps, including 674 resets, run finished after 35 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 591 resets, run finished after 20 ms. (steps per millisecond=435 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 167/167 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 205 transition count 166
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 205 transition count 162
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 11 place count 200 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 198 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 198 transition count 160
Applied a total of 16 rules in 17 ms. Remains 198 /206 variables (removed 8) and now considering 160/167 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/206 places, 160/167 transitions.
Incomplete random walk after 1000000 steps, including 61018 resets, run finished after 1992 ms. (steps per millisecond=502 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 14364 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13947 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10460 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties seen :[0, 0, 0]
Finished probabilistic random walk after 11423 steps, run visited all 3 properties in 104 ms. (steps per millisecond=109 )
Probabilistic random walk after 11423 steps, saw 3409 distinct states, run finished after 104 ms. (steps per millisecond=109 ) properties seen :[1, 1, 1]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589257022740

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

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