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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 3.2K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:51 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.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 141K 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589253213476

[2020-05-12 03:13: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:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:13:36] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2020-05-12 03:13:36] [INFO ] Transformed 567 places.
[2020-05-12 03:13:36] [INFO ] Transformed 508 transitions.
[2020-05-12 03:13:36] [INFO ] Found NUPN structural information;
[2020-05-12 03:13:36] [INFO ] Parsed PT model containing 567 places and 508 transitions in 216 ms.
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 7 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 61 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 76 resets, run finished after 134 ms. (steps per millisecond=74 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 501 rows 560 cols
[2020-05-12 03:13:36] [INFO ] Computed 95 place invariants in 44 ms
[2020-05-12 03:13:37] [INFO ] [Real]Absence check using 53 positive place invariants in 48 ms returned sat
[2020-05-12 03:13:37] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 42 ms returned unsat
[2020-05-12 03:13:37] [INFO ] [Real]Absence check using 53 positive place invariants in 40 ms returned unsat
[2020-05-12 03:13:37] [INFO ] [Real]Absence check using 53 positive place invariants in 55 ms returned sat
[2020-05-12 03:13:37] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 45 ms returned sat
[2020-05-12 03:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:38] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2020-05-12 03:13:39] [INFO ] Deduced a trap composed of 12 places in 591 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 29 places in 894 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 17 places in 362 ms
[2020-05-12 03:13:40] [INFO ] Deduced a trap composed of 8 places in 297 ms
[2020-05-12 03:13:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 2322 ms
[2020-05-12 03:13:41] [INFO ] [Real]Absence check using 53 positive place invariants in 55 ms returned sat
[2020-05-12 03:13:41] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 37 ms returned sat
[2020-05-12 03:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:42] [INFO ] [Real]Absence check using state equation in 1647 ms returned sat
[2020-05-12 03:13:42] [INFO ] Deduced a trap composed of 15 places in 172 ms
[2020-05-12 03:13:43] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-05-12 03:13:43] [INFO ] Deduced a trap composed of 29 places in 156 ms
[2020-05-12 03:13:43] [INFO ] Deduced a trap composed of 43 places in 83 ms
[2020-05-12 03:13:43] [INFO ] Deduced a trap composed of 42 places in 90 ms
[2020-05-12 03:13:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 786 ms
[2020-05-12 03:13:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:13:43] [INFO ] [Nat]Absence check using 53 positive place invariants in 138 ms returned sat
[2020-05-12 03:13:43] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 22 ms returned sat
[2020-05-12 03:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:46] [INFO ] [Nat]Absence check using state equation in 3103 ms returned sat
[2020-05-12 03:13:47] [INFO ] Deduced a trap composed of 11 places in 218 ms
[2020-05-12 03:13:47] [INFO ] Deduced a trap composed of 13 places in 691 ms
[2020-05-12 03:13:48] [INFO ] Deduced a trap composed of 13 places in 231 ms
[2020-05-12 03:13:49] [INFO ] Deduced a trap composed of 12 places in 1097 ms
[2020-05-12 03:13:49] [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 s220 s221 s222 s228 s231 s388 s389 s390 s394) 0)") while checking expression at index 3
[2020-05-12 03:13:49] [INFO ] [Real]Absence check using 53 positive place invariants in 45 ms returned sat
[2020-05-12 03:13:49] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 25 ms returned sat
[2020-05-12 03:13:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:49] [INFO ] [Real]Absence check using state equation in 498 ms returned unsat
[2020-05-12 03:13:50] [INFO ] [Real]Absence check using 53 positive place invariants in 117 ms returned sat
[2020-05-12 03:13:50] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 24 ms returned sat
[2020-05-12 03:13:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:50] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2020-05-12 03:13:51] [INFO ] Deduced a trap composed of 15 places in 203 ms
[2020-05-12 03:13:51] [INFO ] Deduced a trap composed of 13 places in 347 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 23 places in 953 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 12 places in 228 ms
[2020-05-12 03:13:52] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 12 places in 183 ms
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 18 places in 228 ms
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 29 places in 195 ms
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 33 places in 184 ms
[2020-05-12 03:13:53] [INFO ] Deduced a trap composed of 16 places in 165 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 18 places in 149 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 22 places in 336 ms
[2020-05-12 03:13:54] [INFO ] Deduced a trap composed of 16 places in 313 ms
[2020-05-12 03:13:55] [INFO ] Deduced a trap composed of 23 places in 304 ms
[2020-05-12 03:13: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 s9 s10 s11 s180 s339 s340 s341 s355 s487 s488 s491 s492 s550 s551) 0)") while checking expression at index 5
[2020-05-12 03:13:55] [INFO ] [Real]Absence check using 53 positive place invariants in 34 ms returned sat
[2020-05-12 03:13:55] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 22 ms returned sat
[2020-05-12 03:13:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:56] [INFO ] [Real]Absence check using state equation in 713 ms returned sat
[2020-05-12 03:13:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:13:56] [INFO ] [Nat]Absence check using 53 positive place invariants in 122 ms returned sat
[2020-05-12 03:13:56] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 20 ms returned sat
[2020-05-12 03:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:13:56] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 12 places in 153 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 12 places in 195 ms
[2020-05-12 03:13:57] [INFO ] Deduced a trap composed of 21 places in 481 ms
[2020-05-12 03:13:58] [INFO ] Deduced a trap composed of 19 places in 214 ms
[2020-05-12 03:13:58] [INFO ] Deduced a trap composed of 24 places in 160 ms
[2020-05-12 03:13:58] [INFO ] Deduced a trap composed of 133 places in 245 ms
[2020-05-12 03:13:58] [INFO ] Deduced a trap composed of 19 places in 224 ms
[2020-05-12 03:13:59] [INFO ] Deduced a trap composed of 21 places in 259 ms
[2020-05-12 03:13:59] [INFO ] Deduced a trap composed of 18 places in 160 ms
[2020-05-12 03:13:59] [INFO ] Deduced a trap composed of 19 places in 402 ms
[2020-05-12 03:13:59] [INFO ] Deduced a trap composed of 18 places in 205 ms
[2020-05-12 03:14:00] [INFO ] Deduced a trap composed of 22 places in 305 ms
[2020-05-12 03:14:00] [INFO ] Deduced a trap composed of 104 places in 136 ms
[2020-05-12 03:14:00] [INFO ] Deduced a trap composed of 29 places in 159 ms
[2020-05-12 03:14:00] [INFO ] Deduced a trap composed of 15 places in 135 ms
[2020-05-12 03:14:01] [INFO ] Deduced a trap composed of 17 places in 138 ms
[2020-05-12 03:14:01] [INFO ] Deduced a trap composed of 6 places in 586 ms
[2020-05-12 03:14:01] [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 s223) 0)") while checking expression at index 6
[2020-05-12 03:14:01] [INFO ] [Real]Absence check using 53 positive place invariants in 33 ms returned sat
[2020-05-12 03:14:01] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 25 ms returned sat
[2020-05-12 03:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:02] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2020-05-12 03:14:02] [INFO ] Deduced a trap composed of 12 places in 405 ms
[2020-05-12 03:14:03] [INFO ] Deduced a trap composed of 11 places in 203 ms
[2020-05-12 03:14:03] [INFO ] Deduced a trap composed of 14 places in 300 ms
[2020-05-12 03:14:03] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-05-12 03:14:03] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-05-12 03:14:04] [INFO ] Deduced a trap composed of 11 places in 297 ms
[2020-05-12 03:14:04] [INFO ] Deduced a trap composed of 22 places in 333 ms
[2020-05-12 03:14:05] [INFO ] Deduced a trap composed of 15 places in 314 ms
[2020-05-12 03:14:05] [INFO ] Deduced a trap composed of 17 places in 343 ms
[2020-05-12 03:14:05] [INFO ] Deduced a trap composed of 20 places in 146 ms
[2020-05-12 03:14:06] [INFO ] Deduced a trap composed of 114 places in 419 ms
[2020-05-12 03:14:06] [INFO ] Deduced a trap composed of 28 places in 178 ms
[2020-05-12 03:14:06] [INFO ] Deduced a trap composed of 114 places in 137 ms
[2020-05-12 03:14:06] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-05-12 03:14:06] [INFO ] Deduced a trap composed of 24 places in 145 ms
[2020-05-12 03:14:06] [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 s207 s208 s209 s210 s215 s216 s364 s368 s369 s370 s374 s379 s384 s495 s496 s503 s504) 0)") while checking expression at index 7
[2020-05-12 03:14:06] [INFO ] [Real]Absence check using 53 positive place invariants in 72 ms returned sat
[2020-05-12 03:14:07] [INFO ] [Real]Absence check using 53 positive and 42 generalized place invariants in 45 ms returned sat
[2020-05-12 03:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:07] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2020-05-12 03:14:08] [INFO ] Deduced a trap composed of 12 places in 408 ms
[2020-05-12 03:14:08] [INFO ] Deduced a trap composed of 14 places in 621 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 29 places in 302 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 113 places in 205 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 18 places in 340 ms
[2020-05-12 03:14:09] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 17 places in 175 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 11 places in 138 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 36 places in 148 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 36 places in 179 ms
[2020-05-12 03:14:10] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2020-05-12 03:14:11] [INFO ] Deduced a trap composed of 26 places in 147 ms
[2020-05-12 03:14:11] [INFO ] Deduced a trap composed of 29 places in 140 ms
[2020-05-12 03:14:11] [INFO ] Deduced a trap composed of 22 places in 170 ms
[2020-05-12 03:14:11] [INFO ] Deduced a trap composed of 110 places in 154 ms
[2020-05-12 03:14:11] [INFO ] Deduced a trap composed of 32 places in 177 ms
[2020-05-12 03:14:11] [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 s168 s169 s170 s171 s204 s207 s208 s209 s324 s325 s326 s340 s355 s360 s369 s374 s476 s477 s491 s492 s495 s496 s499 s500) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 31 out of 560 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 560/560 places, 501/501 transitions.
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 555 transition count 427
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 482 transition count 427
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 119 Pre rules applied. Total rules applied 147 place count 482 transition count 308
Deduced a syphon composed of 119 places in 2 ms
Ensure Unique test removed 15 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 400 place count 348 transition count 308
Symmetric choice reduction at 2 with 65 rule applications. Total rules 465 place count 348 transition count 308
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 65 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 595 place count 283 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 595 place count 283 transition count 241
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 599 place count 281 transition count 241
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 169 rules applied. Total rules applied 768 place count 195 transition count 158
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 769 place count 195 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 770 place count 194 transition count 157
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 771 place count 194 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 772 place count 193 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 773 place count 192 transition count 156
Applied a total of 773 rules in 135 ms. Remains 192 /560 variables (removed 368) and now considering 156/501 (removed 345) transitions.
Finished structural reductions, in 1 iterations. Remains : 192/560 places, 156/501 transitions.
Incomplete random walk after 1000000 steps, including 44176 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties seen :[1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9146 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10066 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 9214 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9150 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 156 rows 192 cols
[2020-05-12 03:14:17] [INFO ] Computed 72 place invariants in 2 ms
[2020-05-12 03:14:17] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2020-05-12 03:14:17] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-12 03:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:17] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-12 03:14:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-12 03:14:17] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-12 03:14:17] [INFO ] Deduced a trap composed of 45 places in 175 ms
[2020-05-12 03:14:17] [INFO ] Deduced a trap composed of 3 places in 218 ms
[2020-05-12 03:14:17] [INFO ] Deduced a trap composed of 49 places in 123 ms
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 44 places in 133 ms
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 45 places in 49 ms
[2020-05-12 03:14:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 779 ms
[2020-05-12 03:14:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:18] [INFO ] [Nat]Absence check using 48 positive place invariants in 20 ms returned sat
[2020-05-12 03:14:18] [INFO ] [Nat]Absence check using 48 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-12 03:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:18] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2020-05-12 03:14:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2020-05-12 03:14:18] [INFO ] Deduced a trap composed of 44 places in 69 ms
[2020-05-12 03:14:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2020-05-12 03:14:18] [INFO ] Computed and/alt/rep : 149/856/149 causal constraints in 12 ms.
[2020-05-12 03:14:19] [INFO ] Added : 63 causal constraints over 13 iterations in 370 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2020-05-12 03:14:19] [INFO ] [Real]Absence check using 48 positive place invariants in 20 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 12 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:19] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-05-12 03:14:19] [INFO ] Computed and/alt/rep : 149/856/149 causal constraints in 11 ms.
[2020-05-12 03:14:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:19] [INFO ] [Nat]Absence check using 48 positive place invariants in 29 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Nat]Absence check using 48 positive and 24 generalized place invariants in 10 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:19] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2020-05-12 03:14:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-12 03:14:19] [INFO ] Deduced a trap composed of 44 places in 167 ms
[2020-05-12 03:14:19] [INFO ] Deduced a trap composed of 44 places in 41 ms
[2020-05-12 03:14:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2020-05-12 03:14:20] [INFO ] Computed and/alt/rep : 149/856/149 causal constraints in 79 ms.
[2020-05-12 03:14:20] [INFO ] Added : 67 causal constraints over 14 iterations in 269 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-05-12 03:14:20] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2020-05-12 03:14:20] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 8 ms returned sat
[2020-05-12 03:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:20] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2020-05-12 03:14:20] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-12 03:14:20] [INFO ] Deduced a trap composed of 45 places in 140 ms
[2020-05-12 03:14:20] [INFO ] Deduced a trap composed of 15 places in 111 ms
[2020-05-12 03:14:20] [INFO ] Deduced a trap composed of 47 places in 90 ms
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 14 places in 63 ms
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 44 places in 106 ms
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 14 places in 62 ms
[2020-05-12 03:14:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 774 ms
[2020-05-12 03:14:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:21] [INFO ] [Nat]Absence check using 48 positive place invariants in 45 ms returned sat
[2020-05-12 03:14:21] [INFO ] [Nat]Absence check using 48 positive and 24 generalized place invariants in 15 ms returned sat
[2020-05-12 03:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:21] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2020-05-12 03:14:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-12 03:14:21] [INFO ] Deduced a trap composed of 43 places in 127 ms
[2020-05-12 03:14:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2020-05-12 03:14:21] [INFO ] Computed and/alt/rep : 149/856/149 causal constraints in 9 ms.
[2020-05-12 03:14:22] [INFO ] Added : 79 causal constraints over 16 iterations in 515 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-12 03:14:22] [INFO ] [Real]Absence check using 48 positive place invariants in 34 ms returned sat
[2020-05-12 03:14:22] [INFO ] [Real]Absence check using 48 positive and 24 generalized place invariants in 6 ms returned sat
[2020-05-12 03:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:22] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-05-12 03:14:22] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-05-12 03:14:22] [INFO ] Deduced a trap composed of 48 places in 91 ms
[2020-05-12 03:14:22] [INFO ] Deduced a trap composed of 8 places in 45 ms
[2020-05-12 03:14:22] [INFO ] Deduced a trap composed of 46 places in 126 ms
[2020-05-12 03:14:22] [INFO ] Deduced a trap composed of 9 places in 80 ms
[2020-05-12 03:14:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 388 ms
[2020-05-12 03:14:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:22] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2020-05-12 03:14:22] [INFO ] [Nat]Absence check using 48 positive and 24 generalized place invariants in 8 ms returned sat
[2020-05-12 03:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:23] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2020-05-12 03:14:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2020-05-12 03:14:23] [INFO ] Deduced a trap composed of 47 places in 41 ms
[2020-05-12 03:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2020-05-12 03:14:23] [INFO ] Computed and/alt/rep : 149/856/149 causal constraints in 22 ms.
[2020-05-12 03:14:23] [INFO ] Added : 79 causal constraints over 17 iterations in 327 ms. Result :sat
[2020-05-12 03:14:23] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-12 03:14:23] [INFO ] Deduced a trap composed of 44 places in 48 ms
[2020-05-12 03:14:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 11300 steps, including 695 resets, run finished after 28 ms. (steps per millisecond=403 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 683 resets, run finished after 25 ms. (steps per millisecond=436 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 563 resets, run finished after 21 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 7900 steps, including 555 resets, run finished after 18 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 22 out of 192 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 192/192 places, 156/156 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 192 transition count 150
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 184 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 181 transition count 147
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 180 transition count 146
Applied a total of 21 rules in 14 ms. Remains 180 /192 variables (removed 12) and now considering 146/156 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 180/192 places, 146/156 transitions.
Incomplete random walk after 1000000 steps, including 53626 resets, run finished after 1603 ms. (steps per millisecond=623 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 13730 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16146 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 13743 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties seen :[1, 0, 1, 0]
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 146 rows 180 cols
[2020-05-12 03:14:28] [INFO ] Computed 70 place invariants in 2 ms
[2020-05-12 03:14:28] [INFO ] [Real]Absence check using 48 positive place invariants in 174 ms returned sat
[2020-05-12 03:14:28] [INFO ] [Real]Absence check using 48 positive and 22 generalized place invariants in 7 ms returned sat
[2020-05-12 03:14:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:28] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2020-05-12 03:14:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-12 03:14:28] [INFO ] [Real]Added 1 Read/Feed constraints in 27 ms returned sat
[2020-05-12 03:14:28] [INFO ] Computed and/alt/rep : 141/772/141 causal constraints in 12 ms.
[2020-05-12 03:14:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:28] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2020-05-12 03:14:28] [INFO ] [Nat]Absence check using 48 positive and 22 generalized place invariants in 11 ms returned sat
[2020-05-12 03:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:28] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2020-05-12 03:14:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-12 03:14:29] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2020-05-12 03:14:29] [INFO ] Deduced a trap composed of 41 places in 45 ms
[2020-05-12 03:14:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2020-05-12 03:14:29] [INFO ] Computed and/alt/rep : 141/772/141 causal constraints in 14 ms.
[2020-05-12 03:14:29] [INFO ] Added : 59 causal constraints over 12 iterations in 203 ms. Result :sat
[2020-05-12 03:14:29] [INFO ] Deduced a trap composed of 8 places in 22 ms
[2020-05-12 03:14:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-12 03:14:29] [INFO ] [Real]Absence check using 48 positive place invariants in 41 ms returned sat
[2020-05-12 03:14:29] [INFO ] [Real]Absence check using 48 positive and 22 generalized place invariants in 8 ms returned sat
[2020-05-12 03:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:29] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2020-05-12 03:14:29] [INFO ] [Real]Added 1 Read/Feed constraints in 26 ms returned sat
[2020-05-12 03:14:29] [INFO ] Computed and/alt/rep : 141/772/141 causal constraints in 7 ms.
[2020-05-12 03:14:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:14:30] [INFO ] [Nat]Absence check using 48 positive place invariants in 12 ms returned sat
[2020-05-12 03:14:30] [INFO ] [Nat]Absence check using 48 positive and 22 generalized place invariants in 6 ms returned sat
[2020-05-12 03:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:14:30] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2020-05-12 03:14:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-05-12 03:14:30] [INFO ] Computed and/alt/rep : 141/772/141 causal constraints in 7 ms.
[2020-05-12 03:14:30] [INFO ] Added : 68 causal constraints over 14 iterations in 199 ms. Result :sat
[2020-05-12 03:14:30] [INFO ] Deduced a trap composed of 42 places in 101 ms
[2020-05-12 03:14:30] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-05-12 03:14:30] [INFO ] Deduced a trap composed of 44 places in 85 ms
[2020-05-12 03:14:31] [INFO ] Deduced a trap composed of 41 places in 466 ms
[2020-05-12 03:14:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 851 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 9500 steps, including 729 resets, run finished after 25 ms. (steps per millisecond=380 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 653 resets, run finished after 16 ms. (steps per millisecond=456 ) properties seen :[0, 0] could not realise parikh vector
Support contains 13 out of 180 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 180/180 places, 146/146 transitions.
Graph (trivial) has 11 edges and 180 vertex of which 2 / 180 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 179 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 177 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 177 transition count 141
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 176 transition count 141
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 173 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 173 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 171 transition count 136
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 171 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 170 transition count 135
Applied a total of 21 rules in 43 ms. Remains 170 /180 variables (removed 10) and now considering 135/146 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/180 places, 135/146 transitions.
Finished random walk after 725 steps, including 23 resets, run visited all 2 properties in 2 ms. (steps per millisecond=362 )
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589253271617

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

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