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-162038177000212.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-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.5K 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 18K 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 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.8K 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 148K 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-13-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-13-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620938597248

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:43:18] [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:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:43:19] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-13 20:43:19] [INFO ] Transformed 593 places.
[2021-05-13 20:43:19] [INFO ] Transformed 536 transitions.
[2021-05-13 20:43:19] [INFO ] Found NUPN structural information;
[2021-05-13 20:43:19] [INFO ] Parsed PT model containing 593 places and 536 transitions in 128 ms.
Deduced a syphon composed of 8 places in 15 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 70 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 11 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[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]
// Phase 1: matrix 528 rows 585 cols
[2021-05-13 20:43:19] [INFO ] Computed 95 place invariants in 27 ms
[2021-05-13 20:43:19] [INFO ] [Real]Absence check using 57 positive place invariants in 56 ms returned sat
[2021-05-13 20:43:19] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 24 ms returned sat
[2021-05-13 20:43:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:20] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2021-05-13 20:43:20] [INFO ] Deduced a trap composed of 15 places in 263 ms
[2021-05-13 20:43:20] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2021-05-13 20:43:21] [INFO ] Deduced a trap composed of 36 places in 200 ms
[2021-05-13 20:43:21] [INFO ] Deduced a trap composed of 29 places in 206 ms
[2021-05-13 20:43:21] [INFO ] Deduced a trap composed of 15 places in 233 ms
[2021-05-13 20:43:21] [INFO ] Deduced a trap composed of 14 places in 229 ms
[2021-05-13 20:43:22] [INFO ] Deduced a trap composed of 121 places in 202 ms
[2021-05-13 20:43:22] [INFO ] Deduced a trap composed of 31 places in 260 ms
[2021-05-13 20:43:22] [INFO ] Deduced a trap composed of 45 places in 221 ms
[2021-05-13 20:43:22] [INFO ] Deduced a trap composed of 23 places in 226 ms
[2021-05-13 20:43:23] [INFO ] Deduced a trap composed of 27 places in 224 ms
[2021-05-13 20:43:23] [INFO ] Deduced a trap composed of 34 places in 175 ms
[2021-05-13 20:43:23] [INFO ] Deduced a trap composed of 34 places in 225 ms
[2021-05-13 20:43:23] [INFO ] Deduced a trap composed of 135 places in 261 ms
[2021-05-13 20:43:24] [INFO ] Deduced a trap composed of 41 places in 226 ms
[2021-05-13 20:43:24] [INFO ] Deduced a trap composed of 53 places in 246 ms
[2021-05-13 20:43:24] [INFO ] Deduced a trap composed of 6 places in 382 ms
[2021-05-13 20:43:24] [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 s228) 0)") while checking expression at index 0
[2021-05-13 20:43:25] [INFO ] [Real]Absence check using 57 positive place invariants in 57 ms returned sat
[2021-05-13 20:43:25] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 29 ms returned sat
[2021-05-13 20:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:25] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2021-05-13 20:43:26] [INFO ] Deduced a trap composed of 133 places in 287 ms
[2021-05-13 20:43:26] [INFO ] Deduced a trap composed of 15 places in 249 ms
[2021-05-13 20:43:26] [INFO ] Deduced a trap composed of 17 places in 239 ms
[2021-05-13 20:43:27] [INFO ] Deduced a trap composed of 20 places in 241 ms
[2021-05-13 20:43:27] [INFO ] Deduced a trap composed of 8 places in 254 ms
[2021-05-13 20:43:27] [INFO ] Deduced a trap composed of 16 places in 246 ms
[2021-05-13 20:43:27] [INFO ] Deduced a trap composed of 47 places in 232 ms
[2021-05-13 20:43:28] [INFO ] Deduced a trap composed of 49 places in 214 ms
[2021-05-13 20:43:28] [INFO ] Deduced a trap composed of 27 places in 243 ms
[2021-05-13 20:43:28] [INFO ] Deduced a trap composed of 22 places in 278 ms
[2021-05-13 20:43:28] [INFO ] Deduced a trap composed of 25 places in 218 ms
[2021-05-13 20:43:29] [INFO ] Deduced a trap composed of 29 places in 186 ms
[2021-05-13 20:43:29] [INFO ] Deduced a trap composed of 129 places in 224 ms
[2021-05-13 20:43:29] [INFO ] Deduced a trap composed of 133 places in 208 ms
[2021-05-13 20:43:29] [INFO ] Deduced a trap composed of 24 places in 193 ms
[2021-05-13 20:43:30] [INFO ] Deduced a trap composed of 21 places in 175 ms
[2021-05-13 20:43:30] [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 s111 s112 s116 s237 s238 s239 s240 s241 s242 s243 s244 s245 s365 s366 s367 s369 s371 s372 s373) 0)") while checking expression at index 1
[2021-05-13 20:43:30] [INFO ] [Real]Absence check using 57 positive place invariants in 48 ms returned sat
[2021-05-13 20:43:30] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 23 ms returned sat
[2021-05-13 20:43:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:30] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2021-05-13 20:43:31] [INFO ] Deduced a trap composed of 14 places in 246 ms
[2021-05-13 20:43:31] [INFO ] Deduced a trap composed of 8 places in 213 ms
[2021-05-13 20:43:31] [INFO ] Deduced a trap composed of 32 places in 239 ms
[2021-05-13 20:43:31] [INFO ] Deduced a trap composed of 25 places in 222 ms
[2021-05-13 20:43:32] [INFO ] Deduced a trap composed of 27 places in 238 ms
[2021-05-13 20:43:32] [INFO ] Deduced a trap composed of 27 places in 227 ms
[2021-05-13 20:43:32] [INFO ] Deduced a trap composed of 15 places in 191 ms
[2021-05-13 20:43:32] [INFO ] Deduced a trap composed of 39 places in 192 ms
[2021-05-13 20:43:33] [INFO ] Deduced a trap composed of 61 places in 188 ms
[2021-05-13 20:43:33] [INFO ] Deduced a trap composed of 28 places in 185 ms
[2021-05-13 20:43:33] [INFO ] Deduced a trap composed of 19 places in 213 ms
[2021-05-13 20:43:33] [INFO ] Deduced a trap composed of 21 places in 200 ms
[2021-05-13 20:43:33] [INFO ] Deduced a trap composed of 43 places in 213 ms
[2021-05-13 20:43:34] [INFO ] Deduced a trap composed of 41 places in 207 ms
[2021-05-13 20:43:34] [INFO ] Deduced a trap composed of 32 places in 193 ms
[2021-05-13 20:43:34] [INFO ] Deduced a trap composed of 36 places in 211 ms
[2021-05-13 20:43:34] [INFO ] Deduced a trap composed of 150 places in 213 ms
[2021-05-13 20:43:35] [INFO ] Deduced a trap composed of 30 places in 199 ms
[2021-05-13 20:43:35] [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 s46 s47 s209 s271 s276 s291 s300 s301 s302 s306 s311 s321 s449 s450 s453 s460 s461 s511 s512 s538 s539) 0)") while checking expression at index 2
[2021-05-13 20:43:35] [INFO ] [Real]Absence check using 57 positive place invariants in 53 ms returned sat
[2021-05-13 20:43:35] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 26 ms returned sat
[2021-05-13 20:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:36] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2021-05-13 20:43:36] [INFO ] Deduced a trap composed of 127 places in 276 ms
[2021-05-13 20:43:36] [INFO ] Deduced a trap composed of 16 places in 239 ms
[2021-05-13 20:43:37] [INFO ] Deduced a trap composed of 14 places in 273 ms
[2021-05-13 20:43:37] [INFO ] Deduced a trap composed of 16 places in 236 ms
[2021-05-13 20:43:37] [INFO ] Deduced a trap composed of 18 places in 248 ms
[2021-05-13 20:43:37] [INFO ] Deduced a trap composed of 121 places in 255 ms
[2021-05-13 20:43:38] [INFO ] Deduced a trap composed of 16 places in 261 ms
[2021-05-13 20:43:38] [INFO ] Deduced a trap composed of 24 places in 240 ms
[2021-05-13 20:43:38] [INFO ] Deduced a trap composed of 24 places in 236 ms
[2021-05-13 20:43:38] [INFO ] Deduced a trap composed of 21 places in 219 ms
[2021-05-13 20:43:39] [INFO ] Deduced a trap composed of 11 places in 221 ms
[2021-05-13 20:43:39] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2021-05-13 20:43:39] [INFO ] Deduced a trap composed of 37 places in 214 ms
[2021-05-13 20:43:40] [INFO ] Deduced a trap composed of 120 places in 310 ms
[2021-05-13 20:43:40] [INFO ] Deduced a trap composed of 22 places in 282 ms
[2021-05-13 20:43: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 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247 s355 s356 s357 s359 s361 s362 s363 s484 s485) 0)") while checking expression at index 3
[2021-05-13 20:43:40] [INFO ] [Real]Absence check using 57 positive place invariants in 54 ms returned sat
[2021-05-13 20:43:40] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 5 ms returned unsat
[2021-05-13 20:43:40] [INFO ] [Real]Absence check using 57 positive place invariants in 46 ms returned unsat
[2021-05-13 20:43:40] [INFO ] [Real]Absence check using 57 positive place invariants in 52 ms returned sat
[2021-05-13 20:43:40] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 31 ms returned sat
[2021-05-13 20:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:42] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2021-05-13 20:43:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:43:42] [INFO ] [Nat]Absence check using 57 positive place invariants in 103 ms returned sat
[2021-05-13 20:43:42] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 27 ms returned sat
[2021-05-13 20:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:43] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2021-05-13 20:43:43] [INFO ] Deduced a trap composed of 14 places in 267 ms
[2021-05-13 20:43:43] [INFO ] Deduced a trap composed of 12 places in 289 ms
[2021-05-13 20:43:44] [INFO ] Deduced a trap composed of 19 places in 297 ms
[2021-05-13 20:43:44] [INFO ] Deduced a trap composed of 17 places in 228 ms
[2021-05-13 20:43:44] [INFO ] Deduced a trap composed of 32 places in 278 ms
[2021-05-13 20:43:45] [INFO ] Deduced a trap composed of 23 places in 243 ms
[2021-05-13 20:43:45] [INFO ] Deduced a trap composed of 33 places in 261 ms
[2021-05-13 20:43:45] [INFO ] Deduced a trap composed of 35 places in 231 ms
[2021-05-13 20:43:45] [INFO ] Deduced a trap composed of 43 places in 264 ms
[2021-05-13 20:43:46] [INFO ] Deduced a trap composed of 45 places in 252 ms
[2021-05-13 20:43:46] [INFO ] Deduced a trap composed of 14 places in 280 ms
[2021-05-13 20:43:46] [INFO ] Deduced a trap composed of 132 places in 247 ms
[2021-05-13 20:43:47] [INFO ] Deduced a trap composed of 137 places in 242 ms
[2021-05-13 20:43:47] [INFO ] Deduced a trap composed of 123 places in 215 ms
[2021-05-13 20:43:47] [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 s32 s33 s39 s40 s111 s112 s116 s128 s129 s130 s134 s135 s136 s146 s147 s148 s157 s166 s173 s174 s182 s212 s213 s214 s218 s219 s220 s233 s236 s276 s281 s295 s296 s297 s305 s306 s307 s311 s316 s321 s326 s330 s331 s332 s346 s351 s355 s356 s357 s360 s361 s362 s366 s371 s376 s386 s395 s396 s397 s406 s415 s418 s419 s420 s421 s424 s425 s426 s427 s430 s431 s436 s437 s440 s449 s450 s453 s454 s455 s456 s457 s460 s461 s466 s467 s468 s469 s472 s473 s474 s475 s476 s477 s480 s481 s491 s492 s493 s494 s497 s498 s505 s506 s511 s512 s516 s518 s520 s524 s525 s526 s529 s546 s547 s548 s549 s550 s567 s576 s582) 0)") while checking expression at index 6
[2021-05-13 20:43:47] [INFO ] [Real]Absence check using 57 positive place invariants in 47 ms returned sat
[2021-05-13 20:43:47] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 24 ms returned sat
[2021-05-13 20:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:48] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2021-05-13 20:43:48] [INFO ] Deduced a trap composed of 16 places in 173 ms
[2021-05-13 20:43:48] [INFO ] Deduced a trap composed of 8 places in 174 ms
[2021-05-13 20:43:48] [INFO ] Deduced a trap composed of 20 places in 158 ms
[2021-05-13 20:43:48] [INFO ] Deduced a trap composed of 14 places in 143 ms
[2021-05-13 20:43:49] [INFO ] Deduced a trap composed of 36 places in 141 ms
[2021-05-13 20:43:49] [INFO ] Deduced a trap composed of 31 places in 146 ms
[2021-05-13 20:43:49] [INFO ] Deduced a trap composed of 16 places in 167 ms
[2021-05-13 20:43:49] [INFO ] Deduced a trap composed of 23 places in 145 ms
[2021-05-13 20:43:49] [INFO ] Deduced a trap composed of 28 places in 144 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 31 places in 147 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 22 places in 138 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 30 places in 158 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 34 places in 146 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 32 places in 135 ms
[2021-05-13 20:43:50] [INFO ] Deduced a trap composed of 38 places in 102 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 29 places in 132 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 34 places in 99 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 32 places in 104 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 50 places in 124 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 46 places in 121 ms
[2021-05-13 20:43:51] [INFO ] Deduced a trap composed of 28 places in 94 ms
[2021-05-13 20:43:51] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3494 ms
[2021-05-13 20:43:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:43:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 87 ms returned sat
[2021-05-13 20:43:52] [INFO ] [Nat]Absence check using 57 positive and 38 generalized place invariants in 46 ms returned sat
[2021-05-13 20:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:52] [INFO ] [Nat]Absence check using state equation in 906 ms returned sat
[2021-05-13 20:43:53] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2021-05-13 20:43:53] [INFO ] Deduced a trap composed of 14 places in 170 ms
[2021-05-13 20:43:53] [INFO ] Deduced a trap composed of 22 places in 152 ms
[2021-05-13 20:43:53] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2021-05-13 20:43:53] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 27 places in 144 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 30 places in 161 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 38 places in 162 ms
[2021-05-13 20:43:54] [INFO ] Deduced a trap composed of 34 places in 137 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 33 places in 144 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 34 places in 141 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 43 places in 142 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 48 places in 142 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 58 places in 142 ms
[2021-05-13 20:43:55] [INFO ] Deduced a trap composed of 25 places in 94 ms
[2021-05-13 20:43:56] [INFO ] Deduced a trap composed of 28 places in 101 ms
[2021-05-13 20:43:56] [INFO ] Deduced a trap composed of 23 places in 78 ms
[2021-05-13 20:43:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3256 ms
[2021-05-13 20:43:56] [INFO ] Computed and/alt/rep : 527/2262/527 causal constraints in 40 ms.
[2021-05-13 20:43:56] [INFO ] Added : 105 causal constraints over 21 iterations in 598 ms. Result :unknown
[2021-05-13 20:43:56] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned unsat
[2021-05-13 20:43:57] [INFO ] [Real]Absence check using 57 positive place invariants in 53 ms returned sat
[2021-05-13 20:43:57] [INFO ] [Real]Absence check using 57 positive and 38 generalized place invariants in 26 ms returned sat
[2021-05-13 20:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:43:57] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2021-05-13 20:43:58] [INFO ] Deduced a trap composed of 14 places in 276 ms
[2021-05-13 20:43:58] [INFO ] Deduced a trap composed of 8 places in 263 ms
[2021-05-13 20:43:58] [INFO ] Deduced a trap composed of 15 places in 262 ms
[2021-05-13 20:43:59] [INFO ] Deduced a trap composed of 17 places in 259 ms
[2021-05-13 20:43:59] [INFO ] Deduced a trap composed of 38 places in 272 ms
[2021-05-13 20:43:59] [INFO ] Deduced a trap composed of 28 places in 259 ms
[2021-05-13 20:43:59] [INFO ] Deduced a trap composed of 36 places in 243 ms
[2021-05-13 20:44:00] [INFO ] Deduced a trap composed of 16 places in 233 ms
[2021-05-13 20:44:00] [INFO ] Deduced a trap composed of 23 places in 229 ms
[2021-05-13 20:44:00] [INFO ] Deduced a trap composed of 39 places in 196 ms
[2021-05-13 20:44:00] [INFO ] Deduced a trap composed of 141 places in 266 ms
[2021-05-13 20:44:01] [INFO ] Deduced a trap composed of 36 places in 252 ms
[2021-05-13 20:44:01] [INFO ] Deduced a trap composed of 34 places in 236 ms
[2021-05-13 20:44:01] [INFO ] Deduced a trap composed of 139 places in 225 ms
[2021-05-13 20:44:01] [INFO ] Deduced a trap composed of 141 places in 228 ms
[2021-05-13 20:44: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 s5 s6 s7 s8 s9 s10 s27 s28 s29 s32 s33 s35 s36 s39 s40 s49 s50 s53 s54 s82 s83 s84 s85 s92 s93 s111 s112 s113 s146 s147 s148 s155 s159 s161 s167 s168 s169 s170 s171 s172 s173 s174 s185 s191 s212 s213 s214 s218 s219 s220 s233 s236 s271 s276 s296 s301 s311 s316 s321 s326 s330 s332 s336 s340 s341 s342 s346 s356 s361 s365 s366 s367 s375 s376 s377 s395 s397 s406 s415 s418 s419 s420 s421 s422 s423 s425 s426 s427 s432 s433 s443 s444 s447 s448 s460 s461 s464 s465 s466 s467 s468 s469 s470 s471 s472 s473 s476 s477 s484 s485 s495 s496 s499 s500 s505 s506 s511 s512 s514 s519 s520 s523 s532 s533 s534 s535 s536 s537 s546 s547 s548 s549 s550 s557 s558 s582 s583 s584) 0)") while checking expression at index 9
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 28700 steps, including 140 resets, run finished after 79 ms. (steps per millisecond=363 ) properties seen :[1, 1, 1, 0, 0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 21 out of 585 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 585/585 places, 528/528 transitions.
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1197 edges and 585 vertex of which 579 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 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 579 transition count 435
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 185 place count 487 transition count 435
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 119 Pre rules applied. Total rules applied 185 place count 487 transition count 316
Deduced a syphon composed of 119 places in 1 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 439 place count 352 transition count 316
Symmetric choice reduction at 2 with 76 rule applications. Total rules 515 place count 352 transition count 316
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 76 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 667 place count 276 transition count 240
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 667 place count 276 transition count 234
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 681 place count 268 transition count 234
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 2 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 849 place count 183 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 850 place count 183 transition count 150
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 852 place count 182 transition count 154
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 855 place count 182 transition count 154
Applied a total of 855 rules in 108 ms. Remains 182 /585 variables (removed 403) and now considering 154/528 (removed 374) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/585 places, 154/528 transitions.
Incomplete random walk after 1000000 steps, including 70208 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 17938 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 18456 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties seen :[0, 0]
Finished probabilistic random walk after 1269993 steps, run visited all 2 properties in 2213 ms. (steps per millisecond=573 )
Probabilistic random walk after 1269993 steps, saw 239550 distinct states, run finished after 2214 ms. (steps per millisecond=573 ) properties seen :[1, 1]
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-13-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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-13"
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-13, 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-162038177000212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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