fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r037-tajo-162038177100228
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for BusinessProcesses-PT-17

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
384.228 3600000.00 138044.00 271.40 TFTTFTTTTTTFFFFT normal

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

--------------------
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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620939680586

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:01:23] [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 21:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:01:23] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2021-05-13 21:01:23] [INFO ] Transformed 650 places.
[2021-05-13 21:01:23] [INFO ] Transformed 580 transitions.
[2021-05-13 21:01:23] [INFO ] Found NUPN structural information;
[2021-05-13 21:01:23] [INFO ] Parsed PT model containing 650 places and 580 transitions in 302 ms.
Deduced a syphon composed of 4 places in 28 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 79 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 63 resets, run finished after 148 ms. (steps per millisecond=67 ) properties seen :[0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 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 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 9 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 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 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 12 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 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 576 rows 646 cols
[2021-05-13 21:01:24] [INFO ] Computed 108 place invariants in 51 ms
[2021-05-13 21:01:24] [INFO ] [Real]Absence check using 62 positive place invariants in 78 ms returned sat
[2021-05-13 21:01:24] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 71 ms returned sat
[2021-05-13 21:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:25] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2021-05-13 21:01:27] [INFO ] Deduced a trap composed of 10 places in 1154 ms
[2021-05-13 21:01:27] [INFO ] Deduced a trap composed of 11 places in 471 ms
[2021-05-13 21:01:28] [INFO ] Deduced a trap composed of 8 places in 419 ms
[2021-05-13 21:01:28] [INFO ] Deduced a trap composed of 15 places in 418 ms
[2021-05-13 21:01:29] [INFO ] Deduced a trap composed of 18 places in 325 ms
[2021-05-13 21:01:29] [INFO ] Deduced a trap composed of 41 places in 304 ms
[2021-05-13 21:01:29] [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 s214 s215 s216 s238 s239 s240 s246 s247 s248 s251 s252 s253 s296 s297 s298 s317 s416 s421 s431 s436 s441 s445 s446 s447 s451 s479 s480 s481 s496 s497 s498 s581 s582 s585 s586) 0)") while checking expression at index 0
[2021-05-13 21:01:29] [INFO ] [Real]Absence check using 62 positive place invariants in 74 ms returned sat
[2021-05-13 21:01:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned unsat
[2021-05-13 21:01:29] [INFO ] [Real]Absence check using 62 positive place invariants in 55 ms returned sat
[2021-05-13 21:01:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 23 ms returned sat
[2021-05-13 21:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:31] [INFO ] [Real]Absence check using state equation in 1335 ms returned unsat
[2021-05-13 21:01:31] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2021-05-13 21:01:31] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 37 ms returned sat
[2021-05-13 21:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:33] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2021-05-13 21:01:36] [INFO ] Deduced a trap composed of 33 places in 3308 ms
[2021-05-13 21:01:36] [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 s174 s175 s194 s195 s196 s199 s200 s208 s263 s264 s265 s266 s267 s268 s269 s270 s271 s297 s380 s381 s382 s391 s411 s414 s416 s417 s418 s479 s480 s481) 0)") while checking expression at index 3
[2021-05-13 21:01:36] [INFO ] [Real]Absence check using 62 positive place invariants in 106 ms returned sat
[2021-05-13 21:01:36] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 41 ms returned sat
[2021-05-13 21:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:38] [INFO ] [Real]Absence check using state equation in 2203 ms returned sat
[2021-05-13 21:01:39] [INFO ] Deduced a trap composed of 11 places in 318 ms
[2021-05-13 21:01:39] [INFO ] Deduced a trap composed of 15 places in 347 ms
[2021-05-13 21:01:40] [INFO ] Deduced a trap composed of 8 places in 451 ms
[2021-05-13 21:01:40] [INFO ] Deduced a trap composed of 125 places in 276 ms
[2021-05-13 21:01:40] [INFO ] Deduced a trap composed of 44 places in 353 ms
[2021-05-13 21:01:41] [INFO ] Deduced a trap composed of 124 places in 302 ms
[2021-05-13 21:01:41] [INFO ] Deduced a trap composed of 41 places in 287 ms
[2021-05-13 21:01:41] [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 s34 s35 s199 s200 s201 s202 s232 s233 s234 s241 s297 s317 s400 s401 s402 s416 s421 s426 s435 s436 s437 s441 s446 s492 s493 s496 s577 s578 s585 s586 s593 s594 s599 s600) 0)") while checking expression at index 4
[2021-05-13 21:01:41] [INFO ] [Real]Absence check using 62 positive place invariants in 70 ms returned sat
[2021-05-13 21:01:41] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 58 ms returned sat
[2021-05-13 21:01:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:43] [INFO ] [Real]Absence check using state equation in 1659 ms returned sat
[2021-05-13 21:01:43] [INFO ] Deduced a trap composed of 12 places in 235 ms
[2021-05-13 21:01:44] [INFO ] Deduced a trap composed of 11 places in 211 ms
[2021-05-13 21:01:44] [INFO ] Deduced a trap composed of 8 places in 183 ms
[2021-05-13 21:01:44] [INFO ] Deduced a trap composed of 25 places in 178 ms
[2021-05-13 21:01:44] [INFO ] Deduced a trap composed of 11 places in 316 ms
[2021-05-13 21:01:45] [INFO ] Deduced a trap composed of 20 places in 191 ms
[2021-05-13 21:01:45] [INFO ] Deduced a trap composed of 17 places in 143 ms
[2021-05-13 21:01:45] [INFO ] Deduced a trap composed of 33 places in 151 ms
[2021-05-13 21:01:46] [INFO ] Deduced a trap composed of 15 places in 1154 ms
[2021-05-13 21:01: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 s2 s3 s4 s5 s6 s241 s244 s245 s246 s247 s440 s441 s442) 0)") while checking expression at index 5
[2021-05-13 21:01:46] [INFO ] [Real]Absence check using 62 positive place invariants in 54 ms returned sat
[2021-05-13 21:01:46] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:47] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2021-05-13 21:01:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:01:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 101 ms returned sat
[2021-05-13 21:01:48] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2021-05-13 21:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:49] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2021-05-13 21:01:49] [INFO ] Deduced a trap composed of 24 places in 495 ms
[2021-05-13 21:01:50] [INFO ] Deduced a trap composed of 131 places in 396 ms
[2021-05-13 21:01:50] [INFO ] Deduced a trap composed of 11 places in 209 ms
[2021-05-13 21:01:50] [INFO ] Deduced a trap composed of 135 places in 214 ms
[2021-05-13 21:01:50] [INFO ] Deduced a trap composed of 31 places in 215 ms
[2021-05-13 21:01:51] [INFO ] Deduced a trap composed of 26 places in 199 ms
[2021-05-13 21:01:51] [INFO ] Deduced a trap composed of 122 places in 201 ms
[2021-05-13 21:01:51] [INFO ] Deduced a trap composed of 135 places in 276 ms
[2021-05-13 21:01:51] [INFO ] Deduced a trap composed of 139 places in 218 ms
[2021-05-13 21:01:52] [INFO ] Deduced a trap composed of 118 places in 257 ms
[2021-05-13 21:01:52] [INFO ] Deduced a trap composed of 39 places in 250 ms
[2021-05-13 21:01:52] [INFO ] Deduced a trap composed of 49 places in 249 ms
[2021-05-13 21:01:52] [INFO ] Deduced a trap composed of 45 places in 309 ms
[2021-05-13 21:01: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 s34 s35 s199 s200 s201 s202 s232 s233 s234 s246 s247 s259 s262 s297 s317 s400 s401 s402 s416 s421 s426 s431 s436 s441 s446 s451 s456 s492 s493 s496 s497 s498 s577 s578 s581 s582 s585 s586 s593 s594 s603 s604) 0)") while checking expression at index 6
[2021-05-13 21:01:53] [INFO ] [Real]Absence check using 62 positive place invariants in 163 ms returned sat
[2021-05-13 21:01:53] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 52 ms returned sat
[2021-05-13 21:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:54] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2021-05-13 21:01:54] [INFO ] Deduced a trap composed of 15 places in 191 ms
[2021-05-13 21:01:54] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2021-05-13 21:01:55] [INFO ] Deduced a trap composed of 25 places in 258 ms
[2021-05-13 21:01:55] [INFO ] Deduced a trap composed of 29 places in 187 ms
[2021-05-13 21:01:55] [INFO ] Deduced a trap composed of 34 places in 198 ms
[2021-05-13 21:01:55] [INFO ] Deduced a trap composed of 47 places in 132 ms
[2021-05-13 21:01:58] [INFO ] Deduced a trap composed of 59 places in 2252 ms
[2021-05-13 21:01:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s149 s150 s151 s157 s158 s162 s163 s164 s168 s174 s175 s199 s200 s208 s214 s215 s216 s223 s226 s227 s228 s297 s302 s307 s312 s355 s356 s357 s365 s366 s367 s371 s376 s381 s391 s411 s416 s421 s475 s476 s479 s480 s481 s486 s487 s490 s491 s570 s571) 0)") while checking expression at index 7
[2021-05-13 21:01:58] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2021-05-13 21:01:58] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 27 ms returned sat
[2021-05-13 21:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:01:59] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2021-05-13 21:02:01] [INFO ] Deduced a trap composed of 8 places in 1876 ms
[2021-05-13 21:02:02] [INFO ] Deduced a trap composed of 20 places in 1342 ms
[2021-05-13 21:02:02] [INFO ] Deduced a trap composed of 14 places in 223 ms
[2021-05-13 21:02:02] [INFO ] Deduced a trap composed of 122 places in 223 ms
[2021-05-13 21:02:03] [INFO ] Deduced a trap composed of 25 places in 371 ms
[2021-05-13 21:02:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s232 s233 s234 s263 s264 s265 s317 s415 s416 s417 s421 s426 s444 s446 s447 s448 s492 s493 s496 s577 s578 s585 s586) 0)") while checking expression at index 8
[2021-05-13 21:02:03] [INFO ] [Real]Absence check using 62 positive place invariants in 68 ms returned sat
[2021-05-13 21:02:03] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 70 ms returned sat
[2021-05-13 21:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:05] [INFO ] [Real]Absence check using state equation in 2066 ms returned sat
[2021-05-13 21:02:05] [INFO ] Deduced a trap composed of 20 places in 190 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 17 places in 144 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 21 places in 153 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 11 places in 142 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 20 places in 145 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 23 places in 144 ms
[2021-05-13 21:02:06] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2021-05-13 21:02:07] [INFO ] Deduced a trap composed of 17 places in 134 ms
[2021-05-13 21:02:07] [INFO ] Deduced a trap composed of 15 places in 127 ms
[2021-05-13 21:02:07] [INFO ] Deduced a trap composed of 21 places in 136 ms
[2021-05-13 21:02:07] [INFO ] Deduced a trap composed of 38 places in 251 ms
[2021-05-13 21:02:07] [INFO ] Deduced a trap composed of 28 places in 162 ms
[2021-05-13 21:02:08] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2021-05-13 21:02:11] [INFO ] Deduced a trap composed of 30 places in 3518 ms
[2021-05-13 21:02:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s34 s35 s223 s297 s385 s386 s387 s401 s416 s421 s562 s563 s573 s574 s577 s578 s585 s586 s636 s637) 0)") while checking expression at index 9
[2021-05-13 21:02:11] [INFO ] [Real]Absence check using 62 positive place invariants in 56 ms returned sat
[2021-05-13 21:02:11] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 30 ms returned sat
[2021-05-13 21:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:12] [INFO ] [Real]Absence check using state equation in 1182 ms returned sat
[2021-05-13 21:02:14] [INFO ] Deduced a trap composed of 10 places in 1215 ms
[2021-05-13 21:02:16] [INFO ] Deduced a trap composed of 11 places in 2039 ms
[2021-05-13 21:02:16] [INFO ] Deduced a trap composed of 12 places in 334 ms
[2021-05-13 21:02:16] [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 s251 s252 s253 s259 s262 s450 s451 s452 s456) 0)") while checking expression at index 10
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 50 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.15 ms
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 642 transition count 489
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 173 place count 556 transition count 489
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 173 place count 556 transition count 367
Deduced a syphon composed of 122 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 431 place count 420 transition count 367
Symmetric choice reduction at 2 with 73 rule applications. Total rules 504 place count 420 transition count 367
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 73 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 650 place count 347 transition count 294
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 650 place count 347 transition count 288
Deduced a syphon composed of 6 places in 4 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 664 place count 339 transition count 288
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 844 place count 249 transition count 198
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 249 transition count 197
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 846 place count 248 transition count 197
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 849 place count 248 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 850 place count 247 transition count 196
Applied a total of 850 rules in 201 ms. Remains 247 /646 variables (removed 399) and now considering 196/576 (removed 380) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/646 places, 196/576 transitions.
Incomplete random walk after 1000000 steps, including 29133 resets, run finished after 2704 ms. (steps per millisecond=369 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5714 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6220 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5707 resets, run finished after 1029 ms. (steps per millisecond=971 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5557 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4860 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5538 resets, run finished after 1104 ms. (steps per millisecond=905 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 5613 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5696 resets, run finished after 1074 ms. (steps per millisecond=931 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5986 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 196 rows 247 cols
[2021-05-13 21:02:29] [INFO ] Computed 89 place invariants in 18 ms
[2021-05-13 21:02:29] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2021-05-13 21:02:29] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-13 21:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:29] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-13 21:02:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 21:02:29] [INFO ] [Real]Added 2 Read/Feed constraints in 50 ms returned sat
[2021-05-13 21:02:29] [INFO ] Deduced a trap composed of 5 places in 61 ms
[2021-05-13 21:02:29] [INFO ] Deduced a trap composed of 16 places in 50 ms
[2021-05-13 21:02:29] [INFO ] Deduced a trap composed of 6 places in 50 ms
[2021-05-13 21:02:29] [INFO ] Deduced a trap composed of 20 places in 28 ms
[2021-05-13 21:02:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2021-05-13 21:02:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:29] [INFO ] [Nat]Absence check using 60 positive place invariants in 18 ms returned sat
[2021-05-13 21:02:29] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 26 ms returned sat
[2021-05-13 21:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:29] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2021-05-13 21:02:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2021-05-13 21:02:30] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2021-05-13 21:02:30] [INFO ] Deduced a trap composed of 5 places in 101 ms
[2021-05-13 21:02:30] [INFO ] Deduced a trap composed of 20 places in 160 ms
[2021-05-13 21:02:30] [INFO ] Deduced a trap composed of 18 places in 41 ms
[2021-05-13 21:02:30] [INFO ] Deduced a trap composed of 22 places in 120 ms
[2021-05-13 21:02:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 624 ms
[2021-05-13 21:02:30] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 20 ms.
[2021-05-13 21:02:31] [INFO ] Added : 93 causal constraints over 19 iterations in 706 ms. Result :sat
[2021-05-13 21:02:31] [INFO ] Deduced a trap composed of 56 places in 96 ms
[2021-05-13 21:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-13 21:02:31] [INFO ] [Real]Absence check using 60 positive place invariants in 49 ms returned sat
[2021-05-13 21:02:31] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 39 ms returned sat
[2021-05-13 21:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:32] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2021-05-13 21:02:32] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:32] [INFO ] Deduced a trap composed of 16 places in 474 ms
[2021-05-13 21:02:32] [INFO ] Deduced a trap composed of 50 places in 100 ms
[2021-05-13 21:02:32] [INFO ] Deduced a trap composed of 51 places in 153 ms
[2021-05-13 21:02:32] [INFO ] Deduced a trap composed of 20 places in 38 ms
[2021-05-13 21:02:33] [INFO ] Deduced a trap composed of 5 places in 937 ms
[2021-05-13 21:02:34] [INFO ] Deduced a trap composed of 51 places in 121 ms
[2021-05-13 21:02:34] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2021-05-13 21:02:34] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2021-05-13 21:02:34] [INFO ] Deduced a trap composed of 49 places in 162 ms
[2021-05-13 21:02:34] [INFO ] Deduced a trap composed of 53 places in 347 ms
[2021-05-13 21:02:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2673 ms
[2021-05-13 21:02:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:34] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2021-05-13 21:02:34] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 20 ms returned sat
[2021-05-13 21:02:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:35] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2021-05-13 21:02:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 6 places in 62 ms
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 10 places in 36 ms
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 14 places in 33 ms
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 16 places in 25 ms
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 23 places in 25 ms
[2021-05-13 21:02:35] [INFO ] Deduced a trap composed of 17 places in 25 ms
[2021-05-13 21:02:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 305 ms
[2021-05-13 21:02:35] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 15 ms.
[2021-05-13 21:02:36] [INFO ] Added : 108 causal constraints over 23 iterations in 673 ms. Result :sat
[2021-05-13 21:02:36] [INFO ] Deduced a trap composed of 48 places in 111 ms
[2021-05-13 21:02:36] [INFO ] Deduced a trap composed of 51 places in 110 ms
[2021-05-13 21:02:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
Attempting to minimize the solution found.
Minimization took 22 ms.
[2021-05-13 21:02:36] [INFO ] [Real]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-13 21:02:36] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 21:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:36] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-13 21:02:36] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:36] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 24 places in 59 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 20 places in 34 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 16 places in 35 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 27 places in 32 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 22 places in 22 ms
[2021-05-13 21:02:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 280 ms
[2021-05-13 21:02:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:37] [INFO ] [Nat]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-13 21:02:37] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 21:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:37] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2021-05-13 21:02:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 50 places in 94 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 54 places in 71 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 16 places in 28 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 24 places in 27 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 50 places in 65 ms
[2021-05-13 21:02:37] [INFO ] Deduced a trap composed of 25 places in 20 ms
[2021-05-13 21:02:38] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2021-05-13 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 555 ms
[2021-05-13 21:02:38] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 18 ms.
[2021-05-13 21:02:38] [INFO ] Added : 99 causal constraints over 20 iterations in 550 ms. Result :sat
[2021-05-13 21:02:38] [INFO ] Deduced a trap composed of 53 places in 152 ms
[2021-05-13 21:02:38] [INFO ] Deduced a trap composed of 52 places in 214 ms
[2021-05-13 21:02:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 477 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-13 21:02:39] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:39] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:39] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2021-05-13 21:02:39] [INFO ] Deduced a trap composed of 5 places in 25 ms
[2021-05-13 21:02:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2021-05-13 21:02:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 28 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 12 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:39] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2021-05-13 21:02:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2021-05-13 21:02:40] [INFO ] Deduced a trap composed of 10 places in 367 ms
[2021-05-13 21:02:40] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2021-05-13 21:02:40] [INFO ] Deduced a trap composed of 5 places in 53 ms
[2021-05-13 21:02:40] [INFO ] Deduced a trap composed of 20 places in 57 ms
[2021-05-13 21:02:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 732 ms
[2021-05-13 21:02:40] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 15 ms.
[2021-05-13 21:02:41] [INFO ] Added : 108 causal constraints over 22 iterations in 488 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 21:02:41] [INFO ] [Real]Absence check using 60 positive place invariants in 39 ms returned sat
[2021-05-13 21:02:41] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 25 ms returned sat
[2021-05-13 21:02:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:41] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2021-05-13 21:02:41] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:41] [INFO ] Deduced a trap composed of 6 places in 127 ms
[2021-05-13 21:02:41] [INFO ] Deduced a trap composed of 14 places in 95 ms
[2021-05-13 21:02:41] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2021-05-13 21:02:41] [INFO ] Deduced a trap composed of 21 places in 50 ms
[2021-05-13 21:02:41] [INFO ] Deduced a trap composed of 25 places in 58 ms
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 25 places in 44 ms
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2021-05-13 21:02:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 574 ms
[2021-05-13 21:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:42] [INFO ] [Nat]Absence check using 60 positive place invariants in 27 ms returned sat
[2021-05-13 21:02:42] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 13 ms returned sat
[2021-05-13 21:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:42] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-13 21:02:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 49 places in 84 ms
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 22 places in 135 ms
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 49 places in 129 ms
[2021-05-13 21:02:42] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-13 21:02:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2021-05-13 21:02:43] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 33 ms.
[2021-05-13 21:02:43] [INFO ] Added : 89 causal constraints over 19 iterations in 628 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-13 21:02:43] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2021-05-13 21:02:43] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 17 ms returned sat
[2021-05-13 21:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:44] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-13 21:02:44] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:44] [INFO ] Deduced a trap composed of 22 places in 37 ms
[2021-05-13 21:02:44] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2021-05-13 21:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2021-05-13 21:02:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:44] [INFO ] [Nat]Absence check using 60 positive place invariants in 47 ms returned sat
[2021-05-13 21:02:44] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 24 ms returned sat
[2021-05-13 21:02:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:44] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2021-05-13 21:02:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2021-05-13 21:02:44] [INFO ] Deduced a trap composed of 24 places in 29 ms
[2021-05-13 21:02:44] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2021-05-13 21:02:44] [INFO ] Deduced a trap composed of 16 places in 32 ms
[2021-05-13 21:02:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 143 ms
[2021-05-13 21:02:44] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 14 ms.
[2021-05-13 21:02:45] [INFO ] Added : 108 causal constraints over 23 iterations in 732 ms. Result :sat
[2021-05-13 21:02:45] [INFO ] Deduced a trap composed of 52 places in 118 ms
[2021-05-13 21:02:46] [INFO ] Deduced a trap composed of 55 places in 928 ms
[2021-05-13 21:02:46] [INFO ] Deduced a trap composed of 52 places in 104 ms
[2021-05-13 21:02:46] [INFO ] Deduced a trap composed of 52 places in 102 ms
[2021-05-13 21:02:47] [INFO ] Deduced a trap composed of 53 places in 107 ms
[2021-05-13 21:02:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1627 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-13 21:02:47] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2021-05-13 21:02:47] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 15 ms returned sat
[2021-05-13 21:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:47] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-13 21:02:47] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2021-05-13 21:02:47] [INFO ] Deduced a trap composed of 10 places in 41 ms
[2021-05-13 21:02:47] [INFO ] Deduced a trap composed of 22 places in 172 ms
[2021-05-13 21:02:47] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2021-05-13 21:02:47] [INFO ] Deduced a trap composed of 6 places in 20 ms
[2021-05-13 21:02:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 389 ms
[2021-05-13 21:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:47] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2021-05-13 21:02:47] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 23 ms returned sat
[2021-05-13 21:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:48] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2021-05-13 21:02:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-13 21:02:48] [INFO ] Deduced a trap composed of 10 places in 27 ms
[2021-05-13 21:02:48] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-13 21:02:48] [INFO ] Deduced a trap composed of 5 places in 18 ms
[2021-05-13 21:02:48] [INFO ] Deduced a trap composed of 14 places in 22 ms
[2021-05-13 21:02:48] [INFO ] Deduced a trap composed of 16 places in 23 ms
[2021-05-13 21:02:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 181 ms
[2021-05-13 21:02:48] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 21 ms.
[2021-05-13 21:02:48] [INFO ] Added : 102 causal constraints over 21 iterations in 525 ms. Result :sat
[2021-05-13 21:02:49] [INFO ] Deduced a trap composed of 53 places in 66 ms
[2021-05-13 21:02:49] [INFO ] Deduced a trap composed of 51 places in 55 ms
[2021-05-13 21:02:49] [INFO ] Deduced a trap composed of 53 places in 107 ms
[2021-05-13 21:02:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-13 21:02:49] [INFO ] [Real]Absence check using 60 positive place invariants in 25 ms returned sat
[2021-05-13 21:02:49] [INFO ] [Real]Absence check using 60 positive and 29 generalized place invariants in 11 ms returned sat
[2021-05-13 21:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:49] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 21:02:49] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2021-05-13 21:02:49] [INFO ] Deduced a trap composed of 48 places in 192 ms
[2021-05-13 21:02:50] [INFO ] Deduced a trap composed of 50 places in 495 ms
[2021-05-13 21:02:50] [INFO ] Deduced a trap composed of 17 places in 200 ms
[2021-05-13 21:02:51] [INFO ] Deduced a trap composed of 23 places in 525 ms
[2021-05-13 21:02:51] [INFO ] Deduced a trap composed of 24 places in 29 ms
[2021-05-13 21:02:51] [INFO ] Deduced a trap composed of 23 places in 73 ms
[2021-05-13 21:02:51] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1623 ms
[2021-05-13 21:02:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:02:51] [INFO ] [Nat]Absence check using 60 positive place invariants in 91 ms returned sat
[2021-05-13 21:02:51] [INFO ] [Nat]Absence check using 60 positive and 29 generalized place invariants in 22 ms returned sat
[2021-05-13 21:02:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:02:51] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2021-05-13 21:02:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-13 21:02:51] [INFO ] Deduced a trap composed of 48 places in 73 ms
[2021-05-13 21:02:51] [INFO ] Deduced a trap composed of 54 places in 119 ms
[2021-05-13 21:02:52] [INFO ] Deduced a trap composed of 17 places in 64 ms
[2021-05-13 21:02:52] [INFO ] Deduced a trap composed of 23 places in 71 ms
[2021-05-13 21:02:52] [INFO ] Deduced a trap composed of 24 places in 500 ms
[2021-05-13 21:02:52] [INFO ] Deduced a trap composed of 25 places in 72 ms
[2021-05-13 21:02:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 991 ms
[2021-05-13 21:02:52] [INFO ] Computed and/alt/rep : 188/851/188 causal constraints in 17 ms.
[2021-05-13 21:02:53] [INFO ] Added : 97 causal constraints over 20 iterations in 385 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 17200 steps, including 259 resets, run finished after 77 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10200 steps, including 183 resets, run finished after 45 ms. (steps per millisecond=226 ) properties seen :[0, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 18000 steps, including 323 resets, run finished after 66 ms. (steps per millisecond=272 ) properties seen :[1, 1, 1, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 9900 steps, including 181 resets, run finished after 32 ms. (steps per millisecond=309 ) properties seen :[0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 15736 steps, including 235 resets, run visited all 1 properties in 51 ms. (steps per millisecond=308 )
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 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-17"
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-17, 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-162038177100228"
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 [ "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 ;