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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.8K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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.2K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:14 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 146K 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620938286648

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:38:08] [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:38:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:38:08] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-13 20:38:08] [INFO ] Transformed 586 places.
[2021-05-13 20:38:08] [INFO ] Transformed 525 transitions.
[2021-05-13 20:38:08] [INFO ] Found NUPN structural information;
[2021-05-13 20:38:08] [INFO ] Parsed PT model containing 586 places and 525 transitions in 126 ms.
Deduced a syphon composed of 4 places in 8 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 72 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 12 ms. (steps per millisecond=833 ) 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 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
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]
// Phase 1: matrix 521 rows 582 cols
[2021-05-13 20:38:09] [INFO ] Computed 98 place invariants in 22 ms
[2021-05-13 20:38:09] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2021-05-13 20:38:09] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 12 ms returned unsat
[2021-05-13 20:38:09] [INFO ] [Real]Absence check using 55 positive place invariants in 38 ms returned sat
[2021-05-13 20:38:09] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned sat
[2021-05-13 20:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using state equation in 518 ms returned unsat
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using 55 positive place invariants in 35 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-13 20:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:11] [INFO ] [Real]Absence check using state equation in 860 ms returned sat
[2021-05-13 20:38:11] [INFO ] Deduced a trap composed of 18 places in 317 ms
[2021-05-13 20:38:11] [INFO ] Deduced a trap composed of 33 places in 255 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 11 places in 240 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 13 places in 246 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 38 places in 222 ms
[2021-05-13 20:38:12] [INFO ] Deduced a trap composed of 30 places in 223 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 39 places in 215 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 125 places in 242 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 23 places in 223 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2021-05-13 20:38:13] [INFO ] Deduced a trap composed of 30 places in 168 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 19 places in 179 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 25 places in 158 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 23 places in 168 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 22 places in 151 ms
[2021-05-13 20:38:14] [INFO ] Deduced a trap composed of 25 places in 163 ms
[2021-05-13 20:38:15] [INFO ] Deduced a trap composed of 43 places in 206 ms
[2021-05-13 20:38:15] [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 s31 s32 s171 s172 s173 s176 s177 s185 s191 s192 s193 s215 s216 s217 s225 s270 s343 s344 s345 s364 s369 s374 s384 s389 s394 s398 s399 s400 s404 s517 s518 s521 s522 s535 s536 s539 s540) 0)") while checking expression at index 2
[2021-05-13 20:38:15] [INFO ] [Real]Absence check using 55 positive place invariants in 45 ms returned sat
[2021-05-13 20:38:15] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 27 ms returned sat
[2021-05-13 20:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:16] [INFO ] [Real]Absence check using state equation in 901 ms returned sat
[2021-05-13 20:38:16] [INFO ] Deduced a trap composed of 22 places in 182 ms
[2021-05-13 20:38:16] [INFO ] Deduced a trap composed of 26 places in 138 ms
[2021-05-13 20:38:16] [INFO ] Deduced a trap composed of 12 places in 141 ms
[2021-05-13 20:38:16] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 14 places in 138 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 20 places in 136 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 17 places in 154 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 24 places in 122 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2021-05-13 20:38:17] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 29 places in 138 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 26 places in 132 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 28 places in 131 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 31 places in 144 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2021-05-13 20:38:18] [INFO ] Deduced a trap composed of 27 places in 178 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 32 places in 146 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 36 places in 131 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 19 places in 75 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 31 places in 67 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 31 places in 69 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 31 places in 59 ms
[2021-05-13 20:38:19] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 32 places in 86 ms
[2021-05-13 20:38:20] [INFO ] Deduced a trap composed of 28 places in 100 ms
[2021-05-13 20:38:20] [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 s31 s32 s197 s198 s199 s223 s224 s240 s269 s270 s271 s384 s389 s394 s398 s399 s400 s404 s407 s409 s410 s411 s529 s530 s539 s540) 0)") while checking expression at index 3
[2021-05-13 20:38:20] [INFO ] [Real]Absence check using 55 positive place invariants in 47 ms returned sat
[2021-05-13 20:38:20] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2021-05-13 20:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:21] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2021-05-13 20:38:21] [INFO ] Deduced a trap composed of 15 places in 228 ms
[2021-05-13 20:38:21] [INFO ] Deduced a trap composed of 25 places in 226 ms
[2021-05-13 20:38:21] [INFO ] Deduced a trap composed of 11 places in 218 ms
[2021-05-13 20:38:22] [INFO ] Deduced a trap composed of 12 places in 215 ms
[2021-05-13 20:38:22] [INFO ] Deduced a trap composed of 26 places in 172 ms
[2021-05-13 20:38:22] [INFO ] Deduced a trap composed of 122 places in 210 ms
[2021-05-13 20:38:22] [INFO ] Deduced a trap composed of 109 places in 184 ms
[2021-05-13 20:38:22] [INFO ] Deduced a trap composed of 17 places in 153 ms
[2021-05-13 20:38:23] [INFO ] Deduced a trap composed of 18 places in 167 ms
[2021-05-13 20:38:23] [INFO ] Deduced a trap composed of 25 places in 150 ms
[2021-05-13 20:38:23] [INFO ] Deduced a trap composed of 33 places in 145 ms
[2021-05-13 20:38:23] [INFO ] Deduced a trap composed of 17 places in 237 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 33 places in 226 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 25 places in 145 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 19 places in 146 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 20 places in 143 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2021-05-13 20:38:24] [INFO ] Deduced a trap composed of 40 places in 204 ms
[2021-05-13 20:38:25] [INFO ] Deduced a trap composed of 24 places in 155 ms
[2021-05-13 20:38:25] [INFO ] Deduced a trap composed of 22 places in 154 ms
[2021-05-13 20:38:25] [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 s12 s13 s14 s162 s165 s166 s167 s348 s349 s350) 0)") while checking expression at index 4
[2021-05-13 20:38:25] [INFO ] [Real]Absence check using 55 positive place invariants in 37 ms returned sat
[2021-05-13 20:38:25] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2021-05-13 20:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:26] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 24 places in 104 ms
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 14 places in 105 ms
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 20 places in 102 ms
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 26 places in 101 ms
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 11 places in 161 ms
[2021-05-13 20:38:26] [INFO ] Deduced a trap composed of 21 places in 133 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 31 places in 99 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 20 places in 103 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 24 places in 98 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 26 places in 154 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 23 places in 93 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 13 places in 93 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 19 places in 92 ms
[2021-05-13 20:38:27] [INFO ] Deduced a trap composed of 19 places in 90 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 28 places in 144 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 26 places in 90 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 27 places in 127 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 37 places in 109 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 38 places in 78 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 20 places in 113 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 33 places in 71 ms
[2021-05-13 20:38:28] [INFO ] Deduced a trap composed of 21 places in 94 ms
[2021-05-13 20:38:29] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-13 20:38:29] [INFO ] Deduced a trap composed of 32 places in 70 ms
[2021-05-13 20:38:29] [INFO ] Deduced a trap composed of 35 places in 659 ms
[2021-05-13 20:38:29] [INFO ] Deduced a trap composed of 23 places in 74 ms
[2021-05-13 20:38:30] [INFO ] Deduced a trap composed of 28 places in 71 ms
[2021-05-13 20:38:30] [INFO ] Deduced a trap composed of 43 places in 67 ms
[2021-05-13 20:38:30] [INFO ] Deduced a trap composed of 44 places in 63 ms
[2021-05-13 20:38:30] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2021-05-13 20:38: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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s129 s132 s133 s134 s135 s139 s140 s141 s145 s154 s155 s162 s318 s319 s320 s329 s334 s349 s502 s503) 0)") while checking expression at index 5
[2021-05-13 20:38:30] [INFO ] [Real]Absence check using 55 positive place invariants in 47 ms returned sat
[2021-05-13 20:38:30] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 19 ms returned unsat
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 12 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Graph (trivial) has 314 edges and 582 vertex of which 7 / 582 are part of one of the 1 SCC in 17 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1178 edges and 576 vertex of which 572 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.20 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 572 transition count 391
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 252 place count 451 transition count 391
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 252 place count 451 transition count 302
Deduced a syphon composed of 89 places in 3 ms
Ensure Unique test removed 18 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 448 place count 344 transition count 302
Symmetric choice reduction at 2 with 64 rule applications. Total rules 512 place count 344 transition count 302
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 640 place count 280 transition count 238
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 640 place count 280 transition count 232
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 653 place count 273 transition count 232
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 836 place count 180 transition count 142
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 2 with 2 rules applied. Total rules applied 838 place count 179 transition count 146
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 840 place count 179 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 842 place count 177 transition count 144
Applied a total of 842 rules in 172 ms. Remains 177 /582 variables (removed 405) and now considering 144/521 (removed 377) transitions.
Finished structural reductions, in 1 iterations. Remains : 177/582 places, 144/521 transitions.
Incomplete random walk after 1000000 steps, including 25086 resets, run finished after 2385 ms. (steps per millisecond=419 ) properties seen :[1, 1, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7151 resets, run finished after 1316 ms. (steps per millisecond=759 ) properties seen :[0]
// Phase 1: matrix 144 rows 177 cols
[2021-05-13 20:38:34] [INFO ] Computed 73 place invariants in 4 ms
[2021-05-13 20:38:34] [INFO ] [Real]Absence check using 52 positive place invariants in 30 ms returned sat
[2021-05-13 20:38:34] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 18 ms returned sat
[2021-05-13 20:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:34] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-13 20:38:34] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-13 20:38:34] [INFO ] [Real]Added 14 Read/Feed constraints in 13 ms returned sat
[2021-05-13 20:38:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:38:34] [INFO ] [Nat]Absence check using 52 positive place invariants in 32 ms returned sat
[2021-05-13 20:38:34] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-13 20:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:38:34] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-13 20:38:34] [INFO ] [Nat]Added 14 Read/Feed constraints in 43 ms returned sat
[2021-05-13 20:38:34] [INFO ] Deduced a trap composed of 37 places in 101 ms
[2021-05-13 20:38:35] [INFO ] Deduced a trap composed of 19 places in 155 ms
[2021-05-13 20:38:35] [INFO ] Deduced a trap composed of 38 places in 218 ms
[2021-05-13 20:38:35] [INFO ] Deduced a trap composed of 27 places in 31 ms
[2021-05-13 20:38:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 595 ms
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
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-12"
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-12, 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-162038177000208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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