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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K 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 81K 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.2K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 4.1K Mar 23 03:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.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 161K 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-17-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620939619611

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 21:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:00:21] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2021-05-13 21:00:21] [INFO ] Transformed 650 places.
[2021-05-13 21:00:21] [INFO ] Transformed 580 transitions.
[2021-05-13 21:00:21] [INFO ] Found NUPN structural information;
[2021-05-13 21:00:21] [INFO ] Parsed PT model containing 650 places and 580 transitions in 127 ms.
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 36 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 65 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) 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, 1, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 576 rows 646 cols
[2021-05-13 21:00:21] [INFO ] Computed 108 place invariants in 28 ms
[2021-05-13 21:00:21] [INFO ] [Real]Absence check using 62 positive place invariants in 53 ms returned sat
[2021-05-13 21:00:21] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:22] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2021-05-13 21:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 108 ms returned sat
[2021-05-13 21:00:22] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:23] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2021-05-13 21:00:24] [INFO ] Deduced a trap composed of 15 places in 217 ms
[2021-05-13 21:00:24] [INFO ] Deduced a trap composed of 19 places in 158 ms
[2021-05-13 21:00:24] [INFO ] Deduced a trap composed of 20 places in 184 ms
[2021-05-13 21:00:24] [INFO ] Deduced a trap composed of 8 places in 159 ms
[2021-05-13 21:00:24] [INFO ] Deduced a trap composed of 24 places in 171 ms
[2021-05-13 21:00:25] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2021-05-13 21:00:25] [INFO ] Deduced a trap composed of 31 places in 150 ms
[2021-05-13 21:00:25] [INFO ] Deduced a trap composed of 15 places in 176 ms
[2021-05-13 21:00:25] [INFO ] Deduced a trap composed of 18 places in 161 ms
[2021-05-13 21:00:25] [INFO ] Deduced a trap composed of 25 places in 114 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 20 places in 171 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 27 places in 122 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 32 places in 147 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 27 places in 118 ms
[2021-05-13 21:00:26] [INFO ] Deduced a trap composed of 33 places in 155 ms
[2021-05-13 21:00:27] [INFO ] Deduced a trap composed of 38 places in 155 ms
[2021-05-13 21:00:27] [INFO ] Deduced a trap composed of 26 places in 111 ms
[2021-05-13 21:00:27] [INFO ] Deduced a trap composed of 36 places in 173 ms
[2021-05-13 21:00:27] [INFO ] Deduced a trap composed of 41 places in 205 ms
[2021-05-13 21:00:27] [INFO ] Deduced a trap composed of 28 places in 166 ms
[2021-05-13 21:00:27] [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 s15 s16 s17 s18 s19 s20 s21 s22 s23 s80 s345 s346 s347) 0)") while checking expression at index 0
[2021-05-13 21:00:27] [INFO ] [Real]Absence check using 62 positive place invariants in 59 ms returned sat
[2021-05-13 21:00:27] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:28] [INFO ] [Real]Absence check using state equation in 888 ms returned sat
[2021-05-13 21:00:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:29] [INFO ] [Nat]Absence check using 62 positive place invariants in 99 ms returned sat
[2021-05-13 21:00:29] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 32 ms returned sat
[2021-05-13 21:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:30] [INFO ] [Nat]Absence check using state equation in 1085 ms returned sat
[2021-05-13 21:00:30] [INFO ] Deduced a trap composed of 14 places in 305 ms
[2021-05-13 21:00:30] [INFO ] Deduced a trap composed of 15 places in 284 ms
[2021-05-13 21:00:31] [INFO ] Deduced a trap composed of 22 places in 258 ms
[2021-05-13 21:00:31] [INFO ] Deduced a trap composed of 125 places in 217 ms
[2021-05-13 21:00:31] [INFO ] Deduced a trap composed of 20 places in 193 ms
[2021-05-13 21:00:31] [INFO ] Deduced a trap composed of 18 places in 247 ms
[2021-05-13 21:00:32] [INFO ] Deduced a trap composed of 14 places in 217 ms
[2021-05-13 21:00:32] [INFO ] Deduced a trap composed of 11 places in 231 ms
[2021-05-13 21:00:32] [INFO ] Deduced a trap composed of 15 places in 224 ms
[2021-05-13 21:00:32] [INFO ] Deduced a trap composed of 21 places in 171 ms
[2021-05-13 21:00:33] [INFO ] Deduced a trap composed of 17 places in 251 ms
[2021-05-13 21:00:33] [INFO ] Deduced a trap composed of 21 places in 231 ms
[2021-05-13 21:00:33] [INFO ] Deduced a trap composed of 24 places in 223 ms
[2021-05-13 21:00:33] [INFO ] Deduced a trap composed of 18 places in 196 ms
[2021-05-13 21:00:34] [INFO ] Deduced a trap composed of 119 places in 184 ms
[2021-05-13 21:00:34] [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 s34 s35 s41 s42 s50 s51 s54 s55 s59 s60 s61 s89 s90 s91 s168 s171 s172 s199 s200 s208 s214 s215 s216 s220 s221 s222 s232 s233 s234 s251 s252 s253 s259 s262 s297 s306 s307 s308 s311 s313 s316 s318 s321 s322 s323 s326 s336 s340 s341 s342 s355 s356 s357 s360 s361 s362 s366 s371 s391 s396 s400 s401 s402 s411 s416 s431 s440 s441 s442 s446 s451 s456 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469 s470 s471 s472 s484 s485 s494 s495 s505 s506 s511 s512 s538 s539 s548 s549 s550 s551 s552 s553 s556 s557 s558 s559 s566 s567 s570 s571 s587 s588 s599 s600 s607) 0)") while checking expression at index 1
[2021-05-13 21:00:34] [INFO ] [Real]Absence check using 62 positive place invariants in 55 ms returned sat
[2021-05-13 21:00:34] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 32 ms returned sat
[2021-05-13 21:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:35] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2021-05-13 21:00:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:35] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2021-05-13 21:00:35] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 32 ms returned sat
[2021-05-13 21:00:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:36] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2021-05-13 21:00:36] [INFO ] Deduced a trap composed of 128 places in 292 ms
[2021-05-13 21:00:37] [INFO ] Deduced a trap composed of 14 places in 249 ms
[2021-05-13 21:00:37] [INFO ] Deduced a trap composed of 18 places in 260 ms
[2021-05-13 21:00:37] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2021-05-13 21:00:37] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2021-05-13 21:00:37] [INFO ] Deduced a trap composed of 20 places in 181 ms
[2021-05-13 21:00:38] [INFO ] Deduced a trap composed of 14 places in 250 ms
[2021-05-13 21:00:38] [INFO ] Deduced a trap composed of 15 places in 256 ms
[2021-05-13 21:00:38] [INFO ] Deduced a trap composed of 30 places in 267 ms
[2021-05-13 21:00:39] [INFO ] Deduced a trap composed of 133 places in 256 ms
[2021-05-13 21:00:39] [INFO ] Deduced a trap composed of 20 places in 237 ms
[2021-05-13 21:00:39] [INFO ] Deduced a trap composed of 21 places in 211 ms
[2021-05-13 21:00:39] [INFO ] Deduced a trap composed of 29 places in 264 ms
[2021-05-13 21:00:40] [INFO ] Deduced a trap composed of 22 places in 251 ms
[2021-05-13 21:00:40] [INFO ] Deduced a trap composed of 24 places in 259 ms
[2021-05-13 21:00: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 s2 s3 s4 s5 s6 s7 s8 s9 s34 s35 s214 s215 s216 s223 s226 s227 s228 s296 s297 s298 s416 s421) 0)") while checking expression at index 2
[2021-05-13 21:00:40] [INFO ] [Real]Absence check using 62 positive place invariants in 51 ms returned sat
[2021-05-13 21:00:40] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 29 ms returned sat
[2021-05-13 21:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:41] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2021-05-13 21:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:41] [INFO ] [Nat]Absence check using 62 positive place invariants in 96 ms returned sat
[2021-05-13 21:00:41] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 28 ms returned sat
[2021-05-13 21:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:42] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2021-05-13 21:00:43] [INFO ] Deduced a trap composed of 25 places in 290 ms
[2021-05-13 21:00:43] [INFO ] Deduced a trap composed of 12 places in 253 ms
[2021-05-13 21:00:43] [INFO ] Deduced a trap composed of 18 places in 252 ms
[2021-05-13 21:00:43] [INFO ] Deduced a trap composed of 25 places in 229 ms
[2021-05-13 21:00:44] [INFO ] Deduced a trap composed of 18 places in 212 ms
[2021-05-13 21:00:44] [INFO ] Deduced a trap composed of 131 places in 207 ms
[2021-05-13 21:00:44] [INFO ] Deduced a trap composed of 15 places in 209 ms
[2021-05-13 21:00:44] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2021-05-13 21:00:45] [INFO ] Deduced a trap composed of 120 places in 271 ms
[2021-05-13 21:00:45] [INFO ] Deduced a trap composed of 27 places in 267 ms
[2021-05-13 21:00:45] [INFO ] Deduced a trap composed of 21 places in 238 ms
[2021-05-13 21:00:45] [INFO ] Deduced a trap composed of 15 places in 250 ms
[2021-05-13 21:00:46] [INFO ] Deduced a trap composed of 20 places in 258 ms
[2021-05-13 21:00:46] [INFO ] Deduced a trap composed of 29 places in 274 ms
[2021-05-13 21:00:46] [INFO ] Deduced a trap composed of 30 places in 244 ms
[2021-05-13 21:00:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s168 s171 s172 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s375 s376 s377 s381 s386 s399 s401 s402 s403 s552 s553 s562 s563) 0)") while checking expression at index 3
[2021-05-13 21:00:46] [INFO ] [Real]Absence check using 62 positive place invariants in 52 ms returned sat
[2021-05-13 21:00:46] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2021-05-13 21:00:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:47] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2021-05-13 21:00:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 95 ms returned sat
[2021-05-13 21:00:48] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:49] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2021-05-13 21:00:49] [INFO ] Deduced a trap composed of 16 places in 293 ms
[2021-05-13 21:00:49] [INFO ] Deduced a trap composed of 11 places in 228 ms
[2021-05-13 21:00:49] [INFO ] Deduced a trap composed of 19 places in 233 ms
[2021-05-13 21:00:50] [INFO ] Deduced a trap composed of 18 places in 232 ms
[2021-05-13 21:00:50] [INFO ] Deduced a trap composed of 23 places in 238 ms
[2021-05-13 21:00:50] [INFO ] Deduced a trap composed of 15 places in 241 ms
[2021-05-13 21:00:50] [INFO ] Deduced a trap composed of 147 places in 249 ms
[2021-05-13 21:00:51] [INFO ] Deduced a trap composed of 148 places in 238 ms
[2021-05-13 21:00:51] [INFO ] Deduced a trap composed of 154 places in 253 ms
[2021-05-13 21:00:51] [INFO ] Deduced a trap composed of 17 places in 268 ms
[2021-05-13 21:00:52] [INFO ] Deduced a trap composed of 23 places in 266 ms
[2021-05-13 21:00:52] [INFO ] Deduced a trap composed of 14 places in 263 ms
[2021-05-13 21:00:52] [INFO ] Deduced a trap composed of 18 places in 237 ms
[2021-05-13 21:00:52] [INFO ] Deduced a trap composed of 146 places in 244 ms
[2021-05-13 21:00:52] [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 s50 s51 s54 s94 s96 s103 s109 s119 s122 s168 s171 s172 s177 s178 s220 s221 s222 s223 s226 s227 s228 s238 s239 s240 s297 s306 s308 s311 s312 s313 s322 s331 s336 s351 s361 s366 s371 s380 s381 s382 s386 s396 s401 s410 s411 s412 s415 s417 s446 s456 s460 s463 s464 s465 s466 s469 s470 s471 s472 s473 s474 s475 s476 s479 s482 s483 s486 s487 s494 s495 s496 s497 s498 s499 s500 s501 s502 s503 s504 s505 s506 s507 s508 s511 s512 s513 s514 s515 s516 s522 s524 s525 s528 s529 s530 s534 s535 s538 s539 s548 s549 s556 s557 s562 s563 s566 s567 s573 s574 s575 s576 s577 s578 s579 s580 s583 s584 s587 s588 s589 s590 s591 s592 s595 s596 s599 s600 s601 s602 s603 s604 s607 s627 s633 s636 s637) 0)") while checking expression at index 4
[2021-05-13 21:00:53] [INFO ] [Real]Absence check using 62 positive place invariants in 58 ms returned sat
[2021-05-13 21:00:53] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2021-05-13 21:00:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:53] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2021-05-13 21:00:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:00:54] [INFO ] [Nat]Absence check using 62 positive place invariants in 66 ms returned sat
[2021-05-13 21:00:54] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:00:54] [INFO ] [Nat]Absence check using state equation in 663 ms returned unsat
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 23 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (trivial) has 351 edges and 646 vertex of which 7 / 646 are part of one of the 1 SCC in 11 ms
Free SCC test removed 6 places
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1304 edges and 640 vertex of which 636 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 636 transition count 430
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 284 place count 499 transition count 430
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 284 place count 499 transition count 339
Deduced a syphon composed of 91 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 199 rules applied. Total rules applied 483 place count 391 transition count 339
Symmetric choice reduction at 2 with 76 rule applications. Total rules 559 place count 391 transition count 339
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 76 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 711 place count 315 transition count 263
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 711 place count 315 transition count 257
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 725 place count 307 transition count 257
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 917 place count 211 transition count 161
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 919 place count 210 transition count 165
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 921 place count 210 transition count 163
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 923 place count 208 transition count 163
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 928 place count 208 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 929 place count 207 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 930 place count 206 transition count 162
Applied a total of 930 rules in 194 ms. Remains 206 /646 variables (removed 440) and now considering 162/576 (removed 414) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/646 places, 162/576 transitions.
Incomplete random walk after 1000000 steps, including 19065 resets, run finished after 2359 ms. (steps per millisecond=423 ) properties seen :[0, 0, 1, 0, 1]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 6195 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties seen :[1, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 5564 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties seen :[1, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 7196 resets, run finished after 1138 ms. (steps per millisecond=878 ) properties seen :[0]
// Phase 1: matrix 162 rows 206 cols
[2021-05-13 21:01:00] [INFO ] Computed 85 place invariants in 3 ms
[2021-05-13 21:01:00] [INFO ] [Real]Absence check using 61 positive place invariants in 37 ms returned sat
[2021-05-13 21:01:00] [INFO ] [Real]Absence check using 61 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-13 21:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:00] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-13 21:01:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:01:00] [INFO ] [Nat]Absence check using 61 positive place invariants in 31 ms returned sat
[2021-05-13 21:01:00] [INFO ] [Nat]Absence check using 61 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-13 21:01:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:01] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-13 21:01:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 21:01:01] [INFO ] [Nat]Added 4 Read/Feed constraints in 12 ms returned sat
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 40 places in 108 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 42 places in 70 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 42 places in 58 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 39 places in 61 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 39 places in 68 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 41 places in 58 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 37 places in 58 ms
[2021-05-13 21:01:01] [INFO ] Deduced a trap composed of 42 places in 56 ms
[2021-05-13 21:01:02] [INFO ] Deduced a trap composed of 3 places in 8 ms
[2021-05-13 21:01:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 887 ms
[2021-05-13 21:01:02] [INFO ] Computed and/alt/rep : 159/613/159 causal constraints in 22 ms.
[2021-05-13 21:01:02] [INFO ] Added : 82 causal constraints over 17 iterations in 417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 7900 steps, including 318 resets, run finished after 36 ms. (steps per millisecond=219 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 162/162 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 206 transition count 158
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 202 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 8 place count 202 transition count 152
Deduced a syphon composed of 6 places in 5 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 23 place count 193 transition count 152
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 50 place count 178 transition count 140
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 178 transition count 140
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 178 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 177 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 176 transition count 138
Applied a total of 55 rules in 63 ms. Remains 176 /206 variables (removed 30) and now considering 138/162 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/206 places, 138/162 transitions.
Incomplete random walk after 1000000 steps, including 27896 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 14042 resets, run finished after 1412 ms. (steps per millisecond=708 ) properties seen :[0]
Finished probabilistic random walk after 2906 steps, run visited all 1 properties in 16 ms. (steps per millisecond=181 )
Probabilistic random walk after 2906 steps, saw 1176 distinct states, run finished after 16 ms. (steps per millisecond=181 ) properties seen :[1]
FORMULA BusinessProcesses-PT-17-ReachabilityCardinality-07 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-17"
export BK_EXAMINATION="ReachabilityCardinality"
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-17, examination is ReachabilityCardinality"
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-162038177100227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-17.tgz
mv BusinessProcesses-PT-17 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;