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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.1K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.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 85K 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-05-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620936334700

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:05:37] [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:05:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:05:37] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-13 20:05:37] [INFO ] Transformed 368 places.
[2021-05-13 20:05:37] [INFO ] Transformed 319 transitions.
[2021-05-13 20:05:37] [INFO ] Found NUPN structural information;
[2021-05-13 20:05:37] [INFO ] Parsed PT model containing 368 places and 319 transitions in 127 ms.
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 1 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 94 resets, run finished after 104 ms. (steps per millisecond=96 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 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 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 53 ms. (steps per millisecond=188 ) 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 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 318 rows 367 cols
[2021-05-13 20:05:38] [INFO ] Computed 57 place invariants in 20 ms
[2021-05-13 20:05:38] [INFO ] [Real]Absence check using 41 positive place invariants in 68 ms returned sat
[2021-05-13 20:05:38] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 15 ms returned sat
[2021-05-13 20:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:39] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2021-05-13 20:05:39] [INFO ] Deduced a trap composed of 9 places in 286 ms
[2021-05-13 20:05:39] [INFO ] Deduced a trap composed of 22 places in 183 ms
[2021-05-13 20:05:40] [INFO ] Deduced a trap composed of 25 places in 184 ms
[2021-05-13 20:05:40] [INFO ] Deduced a trap composed of 19 places in 190 ms
[2021-05-13 20:05:40] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2021-05-13 20:05:40] [INFO ] Deduced a trap composed of 23 places in 154 ms
[2021-05-13 20:05:40] [INFO ] Deduced a trap composed of 17 places in 206 ms
[2021-05-13 20:05:41] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 15 places in 1112 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 17 places in 132 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 21 places in 73 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 30 places in 106 ms
[2021-05-13 20:05:42] [INFO ] Deduced a trap composed of 8 places in 85 ms
[2021-05-13 20:05:43] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2021-05-13 20:05:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3777 ms
[2021-05-13 20:05:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:43] [INFO ] [Nat]Absence check using 41 positive place invariants in 150 ms returned sat
[2021-05-13 20:05:43] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 16 ms returned sat
[2021-05-13 20:05:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:45] [INFO ] [Nat]Absence check using state equation in 1773 ms returned sat
[2021-05-13 20:05:45] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2021-05-13 20:05:45] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2021-05-13 20:05:45] [INFO ] Deduced a trap composed of 8 places in 401 ms
[2021-05-13 20:05:46] [INFO ] Deduced a trap composed of 15 places in 209 ms
[2021-05-13 20:05:46] [INFO ] Deduced a trap composed of 28 places in 479 ms
[2021-05-13 20:05:46] [INFO ] Deduced a trap composed of 18 places in 113 ms
[2021-05-13 20:05:47] [INFO ] Deduced a trap composed of 22 places in 165 ms
[2021-05-13 20:05:47] [INFO ] Deduced a trap composed of 36 places in 191 ms
[2021-05-13 20:05:47] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2021-05-13 20:05:47] [INFO ] Deduced a trap composed of 92 places in 123 ms
[2021-05-13 20:05:47] [INFO ] Deduced a trap composed of 17 places in 102 ms
[2021-05-13 20:05:48] [INFO ] Deduced a trap composed of 38 places in 353 ms
[2021-05-13 20:05:48] [INFO ] Deduced a trap composed of 44 places in 102 ms
[2021-05-13 20:05:48] [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 s90 s91 s92 s112 s113 s114 s135 s192 s193 s194 s198 s203 s227 s228 s229 s232 s233 s234 s238 s243 s248 s253 s258 s261 s263 s264 s265 s300 s301 s304 s309 s310 s330 s331 s336 s337 s342 s343 s346 s347 s350 s351) 0)") while checking expression at index 0
[2021-05-13 20:05:48] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-13 20:05:48] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:48] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2021-05-13 20:05:48] [INFO ] Deduced a trap composed of 9 places in 240 ms
[2021-05-13 20:05:49] [INFO ] Deduced a trap composed of 21 places in 263 ms
[2021-05-13 20:05:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 544 ms
[2021-05-13 20:05:49] [INFO ] [Real]Absence check using 41 positive place invariants in 33 ms returned sat
[2021-05-13 20:05:49] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:49] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2021-05-13 20:05:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:05:49] [INFO ] [Nat]Absence check using 41 positive place invariants in 35 ms returned sat
[2021-05-13 20:05:49] [INFO ] [Nat]Absence check using 41 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-13 20:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:51] [INFO ] [Nat]Absence check using state equation in 1687 ms returned sat
[2021-05-13 20:05:51] [INFO ] Deduced a trap composed of 9 places in 164 ms
[2021-05-13 20:05:51] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 11 places in 145 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 10 places in 156 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 19 places in 116 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 80 places in 121 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 16 places in 119 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2021-05-13 20:05:52] [INFO ] Deduced a trap composed of 24 places in 140 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 12 places in 115 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 23 places in 140 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 83 places in 141 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 23 places in 123 ms
[2021-05-13 20:05:53] [INFO ] Deduced a trap composed of 26 places in 123 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 30 places in 120 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 83 places in 140 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 87 places in 107 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 23 places in 133 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 89 places in 152 ms
[2021-05-13 20:05:54] [INFO ] Deduced a trap composed of 86 places in 118 ms
[2021-05-13 20:05:54] [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 s30 s31 s37 s38 s47 s48 s51 s52 s60 s61 s62 s63 s68 s95 s96 s118 s119 s120 s131 s134 s162 s163 s164 s168 s172 s173 s174 s183 s198 s203 s208 s213 s218 s223 s242 s243 s244 s248 s263 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s289 s290 s298 s299 s307 s308 s309 s310 s315 s316 s319 s320 s321 s324 s325 s332 s333 s336 s337 s340 s341 s346 s347 s350 s351 s352 s353 s354 s355 s360 s361 s362 s363 s366) 0)") while checking expression at index 2
[2021-05-13 20:05:54] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 20:05:54] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 9 ms returned sat
[2021-05-13 20:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:05:55] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2021-05-13 20:05:55] [INFO ] Deduced a trap composed of 11 places in 200 ms
[2021-05-13 20:05:55] [INFO ] Deduced a trap composed of 8 places in 132 ms
[2021-05-13 20:05:55] [INFO ] Deduced a trap composed of 14 places in 181 ms
[2021-05-13 20:05:56] [INFO ] Deduced a trap composed of 19 places in 187 ms
[2021-05-13 20:05:56] [INFO ] Deduced a trap composed of 21 places in 159 ms
[2021-05-13 20:05:56] [INFO ] Deduced a trap composed of 18 places in 181 ms
[2021-05-13 20:05:56] [INFO ] Deduced a trap composed of 19 places in 194 ms
[2021-05-13 20:05:56] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 90 places in 174 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 16 places in 178 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 95 places in 151 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 19 places in 147 ms
[2021-05-13 20:05:57] [INFO ] Deduced a trap composed of 22 places in 145 ms
[2021-05-13 20:05:58] [INFO ] Deduced a trap composed of 19 places in 94 ms
[2021-05-13 20:05:58] [INFO ] Deduced a trap composed of 97 places in 195 ms
[2021-05-13 20:05:58] [INFO ] Deduced a trap composed of 28 places in 160 ms
[2021-05-13 20:05:59] [INFO ] Deduced a trap composed of 20 places in 1299 ms
[2021-05-13 20:05:59] [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 s88 s89 s109 s112 s113 s114 s227 s228 s229 s247 s248 s249 s253) 0)") while checking expression at index 3
[2021-05-13 20:05:59] [INFO ] [Real]Absence check using 41 positive place invariants in 35 ms returned sat
[2021-05-13 20:05:59] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 7 ms returned sat
[2021-05-13 20:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:00] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2021-05-13 20:06:00] [INFO ] Deduced a trap composed of 14 places in 229 ms
[2021-05-13 20:06:01] [INFO ] Deduced a trap composed of 8 places in 1124 ms
[2021-05-13 20:06:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1385 ms
[2021-05-13 20:06:01] [INFO ] [Real]Absence check using 41 positive place invariants in 43 ms returned unsat
[2021-05-13 20:06:02] [INFO ] [Real]Absence check using 41 positive place invariants in 34 ms returned sat
[2021-05-13 20:06:02] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 8 ms returned sat
[2021-05-13 20:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:02] [INFO ] [Real]Absence check using state equation in 265 ms returned unsat
[2021-05-13 20:06:02] [INFO ] [Real]Absence check using 41 positive place invariants in 47 ms returned sat
[2021-05-13 20:06:02] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 6 ms returned sat
[2021-05-13 20:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:03] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2021-05-13 20:06:03] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2021-05-13 20:06:04] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2021-05-13 20:06:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 353 ms
[2021-05-13 20:06:04] [INFO ] [Real]Absence check using 41 positive place invariants in 252 ms returned sat
[2021-05-13 20:06:04] [INFO ] [Real]Absence check using 41 positive and 16 generalized place invariants in 105 ms returned sat
[2021-05-13 20:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:05] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2021-05-13 20:06:08] [INFO ] Deduced a trap composed of 31 places in 2765 ms
[2021-05-13 20:06:08] [INFO ] Deduced a trap composed of 9 places in 289 ms
[2021-05-13 20:06:08] [INFO ] Deduced a trap composed of 89 places in 269 ms
[2021-05-13 20:06:09] [INFO ] Deduced a trap composed of 27 places in 158 ms
[2021-05-13 20:06:09] [INFO ] Deduced a trap composed of 88 places in 816 ms
[2021-05-13 20:06:09] [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 s30 s31 s44 s45 s95 s96 s121 s124 s125 s126 s162 s163 s164 s168 s172 s173 s174 s178 s183 s192 s194 s198 s213 s218 s232 s233 s234 s237 s238 s239 s247 s248 s249 s257 s259 s267 s268 s269 s270 s271 s272 s273 s274 s291 s292 s293 s300 s301 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s319 s322 s323 s324 s325 s330 s331 s332 s333 s336 s337 s338 s339 s340 s341 s356 s357 s358 s359 s360 s361 s366) 0)") while checking expression at index 8
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 19 out of 367 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 367/367 places, 318/318 transitions.
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 710 edges and 367 vertex of which 364 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 364 transition count 256
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 304 transition count 256
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 122 place count 304 transition count 192
Deduced a syphon composed of 64 places in 6 ms
Ensure Unique test removed 11 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 139 rules applied. Total rules applied 261 place count 229 transition count 192
Symmetric choice reduction at 2 with 55 rule applications. Total rules 316 place count 229 transition count 192
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 55 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 426 place count 174 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 428 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 430 place count 173 transition count 134
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 430 place count 173 transition count 129
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 443 place count 165 transition count 129
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 555 place count 109 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 556 place count 108 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 557 place count 107 transition count 72
Applied a total of 557 rules in 182 ms. Remains 107 /367 variables (removed 260) and now considering 72/318 (removed 246) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/367 places, 72/318 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2040 ms. (steps per millisecond=490 ) properties seen :[1, 0, 0, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties seen :[0, 1, 0]
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties seen :[0, 0]
// Phase 1: matrix 72 rows 107 cols
[2021-05-13 20:06:14] [INFO ] Computed 41 place invariants in 8 ms
[2021-05-13 20:06:14] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2021-05-13 20:06:14] [INFO ] [Real]Absence check using 39 positive and 2 generalized place invariants in 15 ms returned sat
[2021-05-13 20:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:14] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 5 places in 610 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 25 places in 50 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 22 places in 94 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 23 places in 46 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 22 places in 43 ms
[2021-05-13 20:06:15] [INFO ] Deduced a trap composed of 25 places in 37 ms
[2021-05-13 20:06:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1077 ms
[2021-05-13 20:06:15] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2021-05-13 20:06:15] [INFO ] [Real]Absence check using 39 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-13 20:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 20 places in 23 ms
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 5 places in 34 ms
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 21 places in 23 ms
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 27 places in 26 ms
[2021-05-13 20:06:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 156 ms
[2021-05-13 20:06:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:06:16] [INFO ] [Nat]Absence check using 39 positive place invariants in 12 ms returned sat
[2021-05-13 20:06:16] [INFO ] [Nat]Absence check using 39 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-13 20:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:06:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 21 places in 26 ms
[2021-05-13 20:06:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2021-05-13 20:06:16] [INFO ] Computed and/alt/rep : 68/204/68 causal constraints in 7 ms.
[2021-05-13 20:06:16] [INFO ] Added : 48 causal constraints over 10 iterations in 154 ms. Result :sat
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 22 places in 38 ms
[2021-05-13 20:06:16] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2021-05-13 20:06:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Finished Parikh walk after 52 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
FORMULA BusinessProcesses-PT-05-ReachabilityFireability-15 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-05"
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-05, 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-162038177000180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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