Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038177000216.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620938919259

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:48:40] [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, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:48:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:48:40] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2021-05-13 20:48:40] [INFO ] Transformed 624 places.
[2021-05-13 20:48:40] [INFO ] Transformed 564 transitions.
[2021-05-13 20:48:40] [INFO ] Found NUPN structural information;
[2021-05-13 20:48:40] [INFO ] Parsed PT model containing 624 places and 564 transitions in 125 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 68 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[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 34 ms. (steps per millisecond=294 ) 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 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[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 17 ms. (steps per millisecond=588 ) properties seen :[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 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[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 23 ms. (steps per millisecond=434 ) properties seen :[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 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 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]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2021-05-13 20:48:41] [INFO ] Computed 99 place invariants in 27 ms
[2021-05-13 20:48:41] [INFO ] [Real]Absence check using 60 positive place invariants in 51 ms returned sat
[2021-05-13 20:48:41] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 22 ms returned sat
[2021-05-13 20:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:42] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2021-05-13 20:48:42] [INFO ] Deduced a trap composed of 27 places in 246 ms
[2021-05-13 20:48:42] [INFO ] Deduced a trap composed of 14 places in 177 ms
[2021-05-13 20:48:42] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2021-05-13 20:48:43] [INFO ] Deduced a trap composed of 23 places in 166 ms
[2021-05-13 20:48:43] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2021-05-13 20:48:43] [INFO ] Deduced a trap composed of 122 places in 194 ms
[2021-05-13 20:48:43] [INFO ] Deduced a trap composed of 11 places in 233 ms
[2021-05-13 20:48:44] [INFO ] Deduced a trap composed of 16 places in 190 ms
[2021-05-13 20:48:44] [INFO ] Deduced a trap composed of 20 places in 186 ms
[2021-05-13 20:48:44] [INFO ] Deduced a trap composed of 20 places in 170 ms
[2021-05-13 20:48:44] [INFO ] Deduced a trap composed of 18 places in 169 ms
[2021-05-13 20:48:44] [INFO ] Deduced a trap composed of 131 places in 234 ms
[2021-05-13 20:48:45] [INFO ] Deduced a trap composed of 36 places in 149 ms
[2021-05-13 20:48:45] [INFO ] Deduced a trap composed of 37 places in 255 ms
[2021-05-13 20:48:45] [INFO ] Deduced a trap composed of 34 places in 271 ms
[2021-05-13 20:48:45] [INFO ] Deduced a trap composed of 139 places in 222 ms
[2021-05-13 20:48:46] [INFO ] Deduced a trap composed of 137 places in 193 ms
[2021-05-13 20:48:46] [INFO ] Deduced a trap composed of 32 places in 266 ms
[2021-05-13 20:48:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s247 s248 s249 s250 s251 s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s327 s328 s329 s331 s333 s334 s335 s569 s570) 0)") while checking expression at index 0
[2021-05-13 20:48:46] [INFO ] [Real]Absence check using 60 positive place invariants in 56 ms returned sat
[2021-05-13 20:48:46] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 31 ms returned sat
[2021-05-13 20:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:48] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2021-05-13 20:48:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 84 ms returned sat
[2021-05-13 20:48:48] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 29 ms returned sat
[2021-05-13 20:48:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:49] [INFO ] [Nat]Absence check using state equation in 1089 ms returned sat
[2021-05-13 20:48:49] [INFO ] Deduced a trap composed of 147 places in 187 ms
[2021-05-13 20:48:49] [INFO ] Deduced a trap composed of 20 places in 153 ms
[2021-05-13 20:48:49] [INFO ] Deduced a trap composed of 18 places in 121 ms
[2021-05-13 20:48:50] [INFO ] Deduced a trap composed of 19 places in 123 ms
[2021-05-13 20:48:50] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2021-05-13 20:48:50] [INFO ] Deduced a trap composed of 22 places in 197 ms
[2021-05-13 20:48:50] [INFO ] Deduced a trap composed of 23 places in 178 ms
[2021-05-13 20:48:50] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2021-05-13 20:48:51] [INFO ] Deduced a trap composed of 22 places in 164 ms
[2021-05-13 20:48:51] [INFO ] Deduced a trap composed of 17 places in 180 ms
[2021-05-13 20:48:51] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2021-05-13 20:48:51] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2021-05-13 20:48:51] [INFO ] Deduced a trap composed of 22 places in 130 ms
[2021-05-13 20:48:52] [INFO ] Deduced a trap composed of 34 places in 160 ms
[2021-05-13 20:48:52] [INFO ] Deduced a trap composed of 34 places in 119 ms
[2021-05-13 20:48:52] [INFO ] Deduced a trap composed of 21 places in 193 ms
[2021-05-13 20:48:52] [INFO ] Deduced a trap composed of 23 places in 235 ms
[2021-05-13 20:48:52] [INFO ] Deduced a trap composed of 22 places in 205 ms
[2021-05-13 20:48:53] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2021-05-13 20:48:53] [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 s29 s30 s33 s59 s60 s63 s64 s65 s66 s67 s162 s163 s164 s222 s223 s224 s247 s248 s279 s280 s281 s285 s298 s313 s322 s323 s324 s328 s333 s338 s343 s426 s428 s429 s430 s478 s479 s491 s492 s573 s574) 0)") while checking expression at index 1
[2021-05-13 20:48:53] [INFO ] [Real]Absence check using 60 positive place invariants in 53 ms returned sat
[2021-05-13 20:48:53] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 27 ms returned sat
[2021-05-13 20:48:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:54] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2021-05-13 20:48:54] [INFO ] Deduced a trap composed of 11 places in 305 ms
[2021-05-13 20:48:54] [INFO ] Deduced a trap composed of 8 places in 323 ms
[2021-05-13 20:48:55] [INFO ] Deduced a trap composed of 11 places in 287 ms
[2021-05-13 20:48:55] [INFO ] Deduced a trap composed of 25 places in 222 ms
[2021-05-13 20:48:55] [INFO ] Deduced a trap composed of 14 places in 219 ms
[2021-05-13 20:48:56] [INFO ] Deduced a trap composed of 35 places in 283 ms
[2021-05-13 20:48:56] [INFO ] Deduced a trap composed of 137 places in 240 ms
[2021-05-13 20:48:56] [INFO ] Deduced a trap composed of 136 places in 234 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 139 places in 218 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 142 places in 192 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 147 places in 189 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 144 places in 213 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 136 places in 189 ms
[2021-05-13 20:48:58] [INFO ] Deduced a trap composed of 146 places in 229 ms
[2021-05-13 20:48:58] [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 s43 s44 s47 s48 s110 s111 s112 s116 s117 s118 s132 s133 s134 s144 s145 s146 s162 s163 s164 s169 s171 s195 s201 s216 s217 s218 s228 s229 s230 s247 s248 s249 s250 s251 s285 s293 s303 s308 s313 s318 s332 s334 s338 s343 s348 s352 s353 s354 s362 s363 s364 s368 s383 s393 s398 s411 s413 s414 s415 s417 s419 s423 s428 s433 s437 s440 s441 s442 s443 s446 s447 s448 s449 s452 s453 s454 s455 s456 s459 s460 s463 s464 s476 s477 s478 s479 s480 s481 s482 s483 s484 s485 s486 s489 s490 s491 s492 s495 s496 s497 s498 s499 s500 s501 s502 s503 s504 s507 s508 s513 s514 s518 s519 s520 s521 s526 s527 s528 s529 s534 s535 s538 s539 s545 s550 s551 s554 s555 s556 s557 s558 s559 s560 s561 s562 s577 s578 s581 s582 s588 s589 s610 s611 s612) 0)") while checking expression at index 2
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 60 positive place invariants in 52 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 21 ms returned unsat
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 60 positive place invariants in 52 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 26 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:59] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2021-05-13 20:48:59] [INFO ] Deduced a trap composed of 13 places in 273 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 12 places in 227 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 28 places in 232 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 21 places in 206 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 22 places in 243 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 16 places in 207 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 20 places in 209 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 18 places in 211 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 19 places in 210 ms
[2021-05-13 20:49:02] [INFO ] Deduced a trap composed of 29 places in 247 ms
[2021-05-13 20:49:02] [INFO ] Deduced a trap composed of 125 places in 236 ms
[2021-05-13 20:49:02] [INFO ] Deduced a trap composed of 119 places in 250 ms
[2021-05-13 20:49:02] [INFO ] Deduced a trap composed of 36 places in 228 ms
[2021-05-13 20:49:03] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2021-05-13 20:49:03] [INFO ] Deduced a trap composed of 41 places in 215 ms
[2021-05-13 20:49:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s159 s222 s223 s224 s279 s280 s281 s285 s293 s298 s313 s322 s323 s324 s328 s333 s343 s452 s453 s456 s478 s479 s480 s481 s484 s491 s492 s542 s543) 0)") while checking expression at index 4
[2021-05-13 20:49:03] [INFO ] [Real]Absence check using 60 positive place invariants in 51 ms returned sat
[2021-05-13 20:49:03] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 49 ms returned sat
[2021-05-13 20:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:04] [INFO ] [Real]Absence check using state equation in 837 ms returned unsat
[2021-05-13 20:49:04] [INFO ] [Real]Absence check using 60 positive place invariants in 55 ms returned sat
[2021-05-13 20:49:04] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 31 ms returned sat
[2021-05-13 20:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:05] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2021-05-13 20:49:05] [INFO ] Deduced a trap composed of 19 places in 151 ms
[2021-05-13 20:49:05] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2021-05-13 20:49:05] [INFO ] Deduced a trap composed of 36 places in 130 ms
[2021-05-13 20:49:06] [INFO ] Deduced a trap composed of 14 places in 114 ms
[2021-05-13 20:49:06] [INFO ] Deduced a trap composed of 19 places in 84 ms
[2021-05-13 20:49:06] [INFO ] Deduced a trap composed of 16 places in 95 ms
[2021-05-13 20:49:06] [INFO ] Deduced a trap composed of 22 places in 91 ms
[2021-05-13 20:49:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 950 ms
[2021-05-13 20:49:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:06] [INFO ] [Nat]Absence check using 60 positive place invariants in 73 ms returned sat
[2021-05-13 20:49:06] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 30 ms returned sat
[2021-05-13 20:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:07] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2021-05-13 20:49:08] [INFO ] Deduced a trap composed of 31 places in 270 ms
[2021-05-13 20:49:08] [INFO ] Deduced a trap composed of 123 places in 234 ms
[2021-05-13 20:49:08] [INFO ] Deduced a trap composed of 39 places in 228 ms
[2021-05-13 20:49:08] [INFO ] Deduced a trap composed of 13 places in 217 ms
[2021-05-13 20:49:09] [INFO ] Deduced a trap composed of 17 places in 239 ms
[2021-05-13 20:49:09] [INFO ] Deduced a trap composed of 17 places in 216 ms
[2021-05-13 20:49:09] [INFO ] Deduced a trap composed of 18 places in 178 ms
[2021-05-13 20:49:09] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2021-05-13 20:49:09] [INFO ] Deduced a trap composed of 18 places in 158 ms
[2021-05-13 20:49:10] [INFO ] Deduced a trap composed of 16 places in 166 ms
[2021-05-13 20:49:10] [INFO ] Deduced a trap composed of 126 places in 190 ms
[2021-05-13 20:49:10] [INFO ] Deduced a trap composed of 125 places in 168 ms
[2021-05-13 20:49:10] [INFO ] Deduced a trap composed of 47 places in 199 ms
[2021-05-13 20:49:10] [INFO ] Deduced a trap composed of 127 places in 160 ms
[2021-05-13 20:49:11] [INFO ] Deduced a trap composed of 127 places in 204 ms
[2021-05-13 20:49:11] [INFO ] Deduced a trap composed of 126 places in 165 ms
[2021-05-13 20:49:11] [INFO ] Deduced a trap composed of 14 places in 194 ms
[2021-05-13 20:49: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 s8 s9 s213 s317 s318 s319) 0)") while checking expression at index 6
[2021-05-13 20:49:11] [INFO ] [Real]Absence check using 60 positive place invariants in 50 ms returned sat
[2021-05-13 20:49:11] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-13 20:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:12] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2021-05-13 20:49:12] [INFO ] Deduced a trap composed of 21 places in 154 ms
[2021-05-13 20:49:12] [INFO ] Deduced a trap composed of 18 places in 181 ms
[2021-05-13 20:49:13] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2021-05-13 20:49:13] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2021-05-13 20:49:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 744 ms
[2021-05-13 20:49:13] [INFO ] [Real]Absence check using 60 positive place invariants in 49 ms returned sat
[2021-05-13 20:49:13] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-13 20:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:14] [INFO ] [Real]Absence check using state equation in 758 ms returned unsat
[2021-05-13 20:49:14] [INFO ] [Real]Absence check using 60 positive place invariants in 48 ms returned sat
[2021-05-13 20:49:14] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 24 ms returned sat
[2021-05-13 20:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:15] [INFO ] [Real]Absence check using state equation in 713 ms returned unsat
[2021-05-13 20:49:15] [INFO ] [Real]Absence check using 60 positive place invariants in 41 ms returned sat
[2021-05-13 20:49:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 21 ms returned sat
[2021-05-13 20:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:16] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2021-05-13 20:49:16] [INFO ] Deduced a trap composed of 17 places in 155 ms
[2021-05-13 20:49:16] [INFO ] Deduced a trap composed of 12 places in 117 ms
[2021-05-13 20:49:16] [INFO ] Deduced a trap composed of 14 places in 113 ms
[2021-05-13 20:49:16] [INFO ] Deduced a trap composed of 22 places in 119 ms
[2021-05-13 20:49:16] [INFO ] Deduced a trap composed of 43 places in 120 ms
[2021-05-13 20:49:17] [INFO ] Deduced a trap composed of 81 places in 146 ms
[2021-05-13 20:49:17] [INFO ] Deduced a trap composed of 39 places in 114 ms
[2021-05-13 20:49:17] [INFO ] Deduced a trap composed of 14 places in 161 ms
[2021-05-13 20:49:17] [INFO ] Deduced a trap composed of 22 places in 111 ms
[2021-05-13 20:49:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1372 ms
[2021-05-13 20:49:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:17] [INFO ] [Nat]Absence check using 60 positive place invariants in 70 ms returned sat
[2021-05-13 20:49:17] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-13 20:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:18] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2021-05-13 20:49:18] [INFO ] Deduced a trap composed of 23 places in 121 ms
[2021-05-13 20:49:18] [INFO ] Deduced a trap composed of 12 places in 132 ms
[2021-05-13 20:49:18] [INFO ] Deduced a trap composed of 17 places in 140 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 21 places in 143 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 31 places in 133 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 38 places in 105 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 31 places in 104 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 35 places in 105 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 14 places in 102 ms
[2021-05-13 20:49:19] [INFO ] Deduced a trap composed of 62 places in 135 ms
[2021-05-13 20:49:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1429 ms
[2021-05-13 20:49:20] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 32 ms.
[2021-05-13 20:49:22] [INFO ] Added : 281 causal constraints over 57 iterations in 2534 ms. Result :unknown
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 28800 steps, including 204 resets, run finished after 120 ms. (steps per millisecond=240 ) properties seen :[0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 33 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 610 transition count 459
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 514 transition count 459
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 119 Pre rules applied. Total rules applied 193 place count 514 transition count 340
Deduced a syphon composed of 119 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 447 place count 379 transition count 340
Symmetric choice reduction at 2 with 79 rule applications. Total rules 526 place count 379 transition count 340
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 79 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 684 place count 300 transition count 261
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 684 place count 300 transition count 254
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 701 place count 290 transition count 254
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 871 place count 205 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 205 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 874 place count 204 transition count 172
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 878 place count 204 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 879 place count 203 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 880 place count 202 transition count 171
Applied a total of 880 rules in 154 ms. Remains 202 /616 variables (removed 414) and now considering 171/556 (removed 385) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/616 places, 171/556 transitions.
Incomplete random walk after 1000000 steps, including 54763 resets, run finished after 2729 ms. (steps per millisecond=366 ) properties seen :[0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 9992 resets, run finished after 1187 ms. (steps per millisecond=842 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9526 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 9992 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8807 resets, run finished after 1248 ms. (steps per millisecond=801 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 171 rows 202 cols
[2021-05-13 20:49:29] [INFO ] Computed 74 place invariants in 3 ms
[2021-05-13 20:49:30] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-13 20:49:30] [INFO ] [Real]Absence check using 55 positive and 19 generalized place invariants in 6 ms returned sat
[2021-05-13 20:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:30] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-13 20:49:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-13 20:49:30] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 48 places in 75 ms
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 47 places in 68 ms
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 50 places in 56 ms
[2021-05-13 20:49:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2021-05-13 20:49:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:30] [INFO ] [Nat]Absence check using 55 positive place invariants in 29 ms returned sat
[2021-05-13 20:49:30] [INFO ] [Nat]Absence check using 55 positive and 19 generalized place invariants in 8 ms returned sat
[2021-05-13 20:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:30] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-13 20:49:30] [INFO ] [Nat]Added 5 Read/Feed constraints in 35 ms returned sat
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 45 places in 76 ms
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 50 places in 83 ms
[2021-05-13 20:49:30] [INFO ] Deduced a trap composed of 44 places in 62 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 48 places in 60 ms
[2021-05-13 20:49:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 364 ms
[2021-05-13 20:49:31] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-13 20:49:31] [INFO ] [Real]Absence check using 55 positive and 19 generalized place invariants in 8 ms returned sat
[2021-05-13 20:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:31] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-13 20:49:31] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 47 places in 60 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 13 places in 80 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 45 places in 55 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 48 places in 47 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 43 places in 50 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 48 places in 70 ms
[2021-05-13 20:49:31] [INFO ] Deduced a trap composed of 46 places in 51 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 47 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 45 places in 44 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 76 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 43 places in 55 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 48 ms
[2021-05-13 20:49:32] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1047 ms
[2021-05-13 20:49:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-13 20:49:32] [INFO ] [Nat]Absence check using 55 positive and 19 generalized place invariants in 7 ms returned sat
[2021-05-13 20:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:32] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2021-05-13 20:49:32] [INFO ] [Nat]Added 5 Read/Feed constraints in 17 ms returned sat
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 61 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 75 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 46 places in 64 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2021-05-13 20:49:32] [INFO ] Deduced a trap composed of 42 places in 51 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 44 places in 54 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 47 places in 43 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 47 places in 42 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 46 places in 41 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 43 places in 66 ms
[2021-05-13 20:49:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1011 ms
[2021-05-13 20:49:33] [INFO ] Computed and/alt/rep : 164/818/164 causal constraints in 15 ms.
[2021-05-13 20:49:33] [INFO ] Added : 69 causal constraints over 15 iterations in 352 ms. Result :sat
[2021-05-13 20:49:33] [INFO ] Deduced a trap composed of 48 places in 64 ms
[2021-05-13 20:49:34] [INFO ] Deduced a trap composed of 46 places in 49 ms
[2021-05-13 20:49:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-13 20:49:34] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Real]Absence check using 55 positive and 19 generalized place invariants in 13 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:34] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:49:34] [INFO ] Computed and/alt/rep : 164/818/164 causal constraints in 19 ms.
[2021-05-13 20:49:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:34] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Nat]Absence check using 55 positive and 19 generalized place invariants in 7 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:34] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Nat]Added 5 Read/Feed constraints in 25 ms returned sat
[2021-05-13 20:49:34] [INFO ] Computed and/alt/rep : 164/818/164 causal constraints in 17 ms.
[2021-05-13 20:49:34] [INFO ] Added : 46 causal constraints over 10 iterations in 145 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-13 20:49:34] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Real]Absence check using 55 positive and 19 generalized place invariants in 8 ms returned sat
[2021-05-13 20:49:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:35] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-13 20:49:35] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2021-05-13 20:49:35] [INFO ] Deduced a trap composed of 44 places in 50 ms
[2021-05-13 20:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2021-05-13 20:49:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-13 20:49:35] [INFO ] [Nat]Absence check using 55 positive and 19 generalized place invariants in 8 ms returned sat
[2021-05-13 20:49:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:35] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-13 20:49:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 11 ms returned sat
[2021-05-13 20:49:35] [INFO ] Deduced a trap composed of 45 places in 101 ms
[2021-05-13 20:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2021-05-13 20:49:35] [INFO ] Computed and/alt/rep : 164/818/164 causal constraints in 13 ms.
[2021-05-13 20:49:35] [INFO ] Added : 68 causal constraints over 14 iterations in 204 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 7700 steps, including 269 resets, run finished after 46 ms. (steps per millisecond=167 ) properties seen :[0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 8100 steps, including 131 resets, run finished after 33 ms. (steps per millisecond=245 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 50 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;