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

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

=== Now, execution of the tool begins

BK_START 1620940107127

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 21:08:28] [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:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 21:08:28] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2021-05-13 21:08:28] [INFO ] Transformed 772 places.
[2021-05-13 21:08:28] [INFO ] Transformed 685 transitions.
[2021-05-13 21:08:28] [INFO ] Found NUPN structural information;
[2021-05-13 21:08:28] [INFO ] Parsed PT model containing 772 places and 685 transitions in 143 ms.
Deduced a syphon composed of 15 places in 18 ms
Reduce places removed 15 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 81 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 56 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 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 19 ms. (steps per millisecond=526 ) properties seen :[0, 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 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) 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 31 ms. (steps per millisecond=322 ) 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 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 10000 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 670 rows 757 cols
[2021-05-13 21:08:29] [INFO ] Computed 125 place invariants in 57 ms
[2021-05-13 21:08:29] [INFO ] [Real]Absence check using 78 positive place invariants in 134 ms returned sat
[2021-05-13 21:08:29] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned unsat
[2021-05-13 21:08:30] [INFO ] [Real]Absence check using 78 positive place invariants in 56 ms returned sat
[2021-05-13 21:08:30] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 40 ms returned sat
[2021-05-13 21:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:31] [INFO ] [Real]Absence check using state equation in 1150 ms returned sat
[2021-05-13 21:08:31] [INFO ] Deduced a trap composed of 8 places in 451 ms
[2021-05-13 21:08:32] [INFO ] Deduced a trap composed of 28 places in 357 ms
[2021-05-13 21:08:32] [INFO ] Deduced a trap composed of 15 places in 234 ms
[2021-05-13 21:08:32] [INFO ] Deduced a trap composed of 31 places in 292 ms
[2021-05-13 21:08:33] [INFO ] Deduced a trap composed of 20 places in 268 ms
[2021-05-13 21:08:33] [INFO ] Deduced a trap composed of 16 places in 245 ms
[2021-05-13 21:08:33] [INFO ] Deduced a trap composed of 16 places in 241 ms
[2021-05-13 21:08:33] [INFO ] Deduced a trap composed of 146 places in 213 ms
[2021-05-13 21:08:34] [INFO ] Deduced a trap composed of 147 places in 210 ms
[2021-05-13 21:08:34] [INFO ] Deduced a trap composed of 168 places in 217 ms
[2021-05-13 21:08:34] [INFO ] Deduced a trap composed of 148 places in 207 ms
[2021-05-13 21:08:34] [INFO ] Deduced a trap composed of 146 places in 206 ms
[2021-05-13 21:08:35] [INFO ] Deduced a trap composed of 64 places in 199 ms
[2021-05-13 21:08:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s42 s43 s73 s78 s79 s82 s83 s84 s219 s220 s221 s225 s226 s227 s231 s232 s233 s266 s267 s268 s278 s279 s280 s284 s285 s286 s300 s303 s345 s350 s355 s385 s390 s395 s405 s486 s487 s488 s492 s497 s507 s512 s517 s526 s527 s528 s532 s536 s537 s538 s542 s678 s679 s680 s681 s682 s685 s694 s695 s718 s719) 0)") while checking expression at index 1
[2021-05-13 21:08:35] [INFO ] [Real]Absence check using 78 positive place invariants in 51 ms returned sat
[2021-05-13 21:08:35] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 41 ms returned sat
[2021-05-13 21:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:36] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2021-05-13 21:08:36] [INFO ] Deduced a trap composed of 12 places in 307 ms
[2021-05-13 21:08:37] [INFO ] Deduced a trap composed of 8 places in 288 ms
[2021-05-13 21:08:37] [INFO ] Deduced a trap composed of 25 places in 238 ms
[2021-05-13 21:08:37] [INFO ] Deduced a trap composed of 15 places in 226 ms
[2021-05-13 21:08:37] [INFO ] Deduced a trap composed of 28 places in 216 ms
[2021-05-13 21:08:38] [INFO ] Deduced a trap composed of 32 places in 220 ms
[2021-05-13 21:08:38] [INFO ] Deduced a trap composed of 25 places in 209 ms
[2021-05-13 21:08:38] [INFO ] Deduced a trap composed of 24 places in 224 ms
[2021-05-13 21:08:38] [INFO ] Deduced a trap composed of 32 places in 204 ms
[2021-05-13 21:08:39] [INFO ] Deduced a trap composed of 16 places in 204 ms
[2021-05-13 21:08:39] [INFO ] Deduced a trap composed of 29 places in 220 ms
[2021-05-13 21:08:39] [INFO ] Deduced a trap composed of 26 places in 240 ms
[2021-05-13 21:08:39] [INFO ] Deduced a trap composed of 30 places in 216 ms
[2021-05-13 21:08:40] [INFO ] Deduced a trap composed of 40 places in 195 ms
[2021-05-13 21:08: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 s100 s101 s102 s103 s106 s107 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s345 s426 s427 s428 s432 s435 s438 s439 s609 s610) 0)") while checking expression at index 2
[2021-05-13 21:08:40] [INFO ] [Real]Absence check using 78 positive place invariants in 59 ms returned sat
[2021-05-13 21:08:40] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 28 ms returned sat
[2021-05-13 21:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:41] [INFO ] [Real]Absence check using state equation in 1026 ms returned sat
[2021-05-13 21:08:41] [INFO ] Deduced a trap composed of 15 places in 317 ms
[2021-05-13 21:08:41] [INFO ] Deduced a trap composed of 24 places in 230 ms
[2021-05-13 21:08:42] [INFO ] Deduced a trap composed of 22 places in 294 ms
[2021-05-13 21:08:42] [INFO ] Deduced a trap composed of 24 places in 259 ms
[2021-05-13 21:08:42] [INFO ] Deduced a trap composed of 40 places in 204 ms
[2021-05-13 21:08:43] [INFO ] Deduced a trap composed of 8 places in 282 ms
[2021-05-13 21:08:43] [INFO ] Deduced a trap composed of 41 places in 202 ms
[2021-05-13 21:08:43] [INFO ] Deduced a trap composed of 158 places in 203 ms
[2021-05-13 21:08:43] [INFO ] Deduced a trap composed of 12 places in 206 ms
[2021-05-13 21:08:44] [INFO ] Deduced a trap composed of 22 places in 202 ms
[2021-05-13 21:08:44] [INFO ] Deduced a trap composed of 163 places in 214 ms
[2021-05-13 21:08:44] [INFO ] Deduced a trap composed of 26 places in 196 ms
[2021-05-13 21:08:44] [INFO ] Deduced a trap composed of 26 places in 197 ms
[2021-05-13 21:08:44] [INFO ] Deduced a trap composed of 15 places in 193 ms
[2021-05-13 21:08:45] [INFO ] Deduced a trap composed of 51 places in 197 ms
[2021-05-13 21:08:45] [INFO ] Deduced a trap composed of 6 places in 363 ms
[2021-05-13 21:08:45] [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 s295) 0)") while checking expression at index 3
[2021-05-13 21:08:45] [INFO ] [Real]Absence check using 78 positive place invariants in 46 ms returned sat
[2021-05-13 21:08:45] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2021-05-13 21:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:46] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2021-05-13 21:08:46] [INFO ] Deduced a trap composed of 8 places in 282 ms
[2021-05-13 21:08:47] [INFO ] Deduced a trap composed of 161 places in 252 ms
[2021-05-13 21:08:47] [INFO ] Deduced a trap composed of 16 places in 254 ms
[2021-05-13 21:08:47] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2021-05-13 21:08:47] [INFO ] Deduced a trap composed of 37 places in 134 ms
[2021-05-13 21:08:47] [INFO ] Deduced a trap composed of 34 places in 103 ms
[2021-05-13 21:08:48] [INFO ] Deduced a trap composed of 37 places in 106 ms
[2021-05-13 21:08:48] [INFO ] Deduced a trap composed of 42 places in 127 ms
[2021-05-13 21:08:48] [INFO ] Deduced a trap composed of 43 places in 124 ms
[2021-05-13 21:08:48] [INFO ] Deduced a trap composed of 41 places in 103 ms
[2021-05-13 21:08:48] [INFO ] Deduced a trap composed of 40 places in 99 ms
[2021-05-13 21:08:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1981 ms
[2021-05-13 21:08:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:08:48] [INFO ] [Nat]Absence check using 78 positive place invariants in 57 ms returned sat
[2021-05-13 21:08:48] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2021-05-13 21:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:49] [INFO ] [Nat]Absence check using state equation in 1029 ms returned sat
[2021-05-13 21:08:50] [INFO ] Deduced a trap composed of 8 places in 308 ms
[2021-05-13 21:08:50] [INFO ] Deduced a trap composed of 16 places in 288 ms
[2021-05-13 21:08:50] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2021-05-13 21:08:50] [INFO ] Deduced a trap composed of 33 places in 130 ms
[2021-05-13 21:08:50] [INFO ] Deduced a trap composed of 39 places in 118 ms
[2021-05-13 21:08:51] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2021-05-13 21:08:51] [INFO ] Deduced a trap composed of 35 places in 161 ms
[2021-05-13 21:08:51] [INFO ] Deduced a trap composed of 36 places in 146 ms
[2021-05-13 21:08:51] [INFO ] Deduced a trap composed of 37 places in 136 ms
[2021-05-13 21:08:51] [INFO ] Deduced a trap composed of 40 places in 132 ms
[2021-05-13 21:08:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1964 ms
[2021-05-13 21:08:51] [INFO ] Computed and/alt/rep : 669/3234/669 causal constraints in 34 ms.
[2021-05-13 21:08:53] [INFO ] Added : 235 causal constraints over 47 iterations in 1855 ms. Result :unknown
[2021-05-13 21:08:53] [INFO ] [Real]Absence check using 78 positive place invariants in 86 ms returned sat
[2021-05-13 21:08:53] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 41 ms returned sat
[2021-05-13 21:08:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:08:55] [INFO ] [Real]Absence check using state equation in 1344 ms returned sat
[2021-05-13 21:08:55] [INFO ] Deduced a trap composed of 11 places in 276 ms
[2021-05-13 21:08:55] [INFO ] Deduced a trap composed of 24 places in 329 ms
[2021-05-13 21:08:56] [INFO ] Deduced a trap composed of 25 places in 228 ms
[2021-05-13 21:08:56] [INFO ] Deduced a trap composed of 31 places in 249 ms
[2021-05-13 21:08:56] [INFO ] Deduced a trap composed of 8 places in 222 ms
[2021-05-13 21:08:56] [INFO ] Deduced a trap composed of 14 places in 225 ms
[2021-05-13 21:08:57] [INFO ] Deduced a trap composed of 159 places in 265 ms
[2021-05-13 21:08:57] [INFO ] Deduced a trap composed of 161 places in 221 ms
[2021-05-13 21:08:57] [INFO ] Deduced a trap composed of 152 places in 244 ms
[2021-05-13 21:08:58] [INFO ] Deduced a trap composed of 27 places in 263 ms
[2021-05-13 21:08:58] [INFO ] Deduced a trap composed of 47 places in 215 ms
[2021-05-13 21:08:58] [INFO ] Deduced a trap composed of 36 places in 208 ms
[2021-05-13 21:08:58] [INFO ] Deduced a trap composed of 161 places in 207 ms
[2021-05-13 21:08: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 s50 s51 s52 s56 s59 s60 s61 s62 s73 s75 s76 s82 s83 s87 s119 s120 s121 s125 s126 s127 s153 s154 s155 s174 s186 s187 s207 s225 s226 s227 s231 s232 s233 s239 s240 s242 s243 s246 s247 s255 s256 s260 s261 s262 s278 s279 s280 s284 s285 s286 s300 s303 s345 s350 s355 s365 s380 s390 s405 s418 s427 s441 s442 s443 s447 s452 s456 s458 s461 s463 s466 s467 s468 s472 s477 s482 s491 s492 s493 s497 s502 s507 s512 s522 s531 s532 s533 s537 s542 s546 s549 s550 s551 s552 s555 s556 s557 s558 s559 s560 s565 s566 s569 s570 s573 s574 s575 s576 s579 s582 s583 s586 s587 s590 s591 s592 s597 s598 s599 s600 s603 s604 s613 s614 s619 s620 s631 s632 s637 s638 s639 s640 s641 s642 s644 s646 s650 s653 s656 s659 s674 s675 s678 s688 s689 s706 s707 s712 s713 s718 s719 s722 s727 s728 s729 s730 s742 s754) 0)") while checking expression at index 5
[2021-05-13 21:08:58] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2021-05-13 21:08:58] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2021-05-13 21:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:00] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2021-05-13 21:09:00] [INFO ] Deduced a trap composed of 8 places in 312 ms
[2021-05-13 21:09:00] [INFO ] Deduced a trap composed of 19 places in 281 ms
[2021-05-13 21:09:01] [INFO ] Deduced a trap composed of 12 places in 301 ms
[2021-05-13 21:09:01] [INFO ] Deduced a trap composed of 15 places in 285 ms
[2021-05-13 21:09:01] [INFO ] Deduced a trap composed of 24 places in 216 ms
[2021-05-13 21:09:01] [INFO ] Deduced a trap composed of 15 places in 211 ms
[2021-05-13 21:09:02] [INFO ] Deduced a trap composed of 31 places in 214 ms
[2021-05-13 21:09:02] [INFO ] Deduced a trap composed of 48 places in 201 ms
[2021-05-13 21:09:02] [INFO ] Deduced a trap composed of 18 places in 190 ms
[2021-05-13 21:09:02] [INFO ] Deduced a trap composed of 24 places in 248 ms
[2021-05-13 21:09:03] [INFO ] Deduced a trap composed of 25 places in 186 ms
[2021-05-13 21:09:03] [INFO ] Deduced a trap composed of 23 places in 183 ms
[2021-05-13 21:09:03] [INFO ] Deduced a trap composed of 156 places in 182 ms
[2021-05-13 21:09:03] [INFO ] Deduced a trap composed of 156 places in 187 ms
[2021-05-13 21:09:03] [INFO ] Deduced a trap composed of 25 places in 181 ms
[2021-05-13 21:09: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 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s234 s496 s497 s498 s674 s675 s678 s679 s680) 0)") while checking expression at index 6
[2021-05-13 21:09:03] [INFO ] [Real]Absence check using 78 positive place invariants in 45 ms returned sat
[2021-05-13 21:09:03] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2021-05-13 21:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:04] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2021-05-13 21:09:05] [INFO ] Deduced a trap composed of 16 places in 333 ms
[2021-05-13 21:09:05] [INFO ] Deduced a trap composed of 15 places in 327 ms
[2021-05-13 21:09:06] [INFO ] Deduced a trap composed of 25 places in 265 ms
[2021-05-13 21:09:06] [INFO ] Deduced a trap composed of 19 places in 288 ms
[2021-05-13 21:09:06] [INFO ] Deduced a trap composed of 21 places in 213 ms
[2021-05-13 21:09:06] [INFO ] Deduced a trap composed of 12 places in 213 ms
[2021-05-13 21:09:07] [INFO ] Deduced a trap composed of 8 places in 274 ms
[2021-05-13 21:09:07] [INFO ] Deduced a trap composed of 29 places in 267 ms
[2021-05-13 21:09:07] [INFO ] Deduced a trap composed of 135 places in 225 ms
[2021-05-13 21:09:07] [INFO ] Deduced a trap composed of 15 places in 186 ms
[2021-05-13 21:09:08] [INFO ] Deduced a trap composed of 33 places in 188 ms
[2021-05-13 21:09:08] [INFO ] Deduced a trap composed of 43 places in 187 ms
[2021-05-13 21:09:08] [INFO ] Deduced a trap composed of 24 places in 185 ms
[2021-05-13 21:09:08] [INFO ] Deduced a trap composed of 25 places in 195 ms
[2021-05-13 21:09:08] [INFO ] Deduced a trap composed of 23 places in 184 ms
[2021-05-13 21:09:08] [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 s234 s501 s502 s503 s506 s507 s508) 0)") while checking expression at index 7
[2021-05-13 21:09:09] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2021-05-13 21:09:09] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 32 ms returned sat
[2021-05-13 21:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:10] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2021-05-13 21:09:10] [INFO ] Deduced a trap composed of 16 places in 217 ms
[2021-05-13 21:09:10] [INFO ] Deduced a trap composed of 14 places in 281 ms
[2021-05-13 21:09:11] [INFO ] Deduced a trap composed of 15 places in 246 ms
[2021-05-13 21:09:11] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2021-05-13 21:09:11] [INFO ] Deduced a trap composed of 8 places in 235 ms
[2021-05-13 21:09:11] [INFO ] Deduced a trap composed of 12 places in 184 ms
[2021-05-13 21:09:12] [INFO ] Deduced a trap composed of 21 places in 184 ms
[2021-05-13 21:09:12] [INFO ] Deduced a trap composed of 18 places in 191 ms
[2021-05-13 21:09:12] [INFO ] Deduced a trap composed of 15 places in 189 ms
[2021-05-13 21:09:12] [INFO ] Deduced a trap composed of 20 places in 192 ms
[2021-05-13 21:09:12] [INFO ] Deduced a trap composed of 16 places in 178 ms
[2021-05-13 21:09:13] [INFO ] Deduced a trap composed of 156 places in 172 ms
[2021-05-13 21:09:13] [INFO ] Deduced a trap composed of 34 places in 169 ms
[2021-05-13 21:09:13] [INFO ] Deduced a trap composed of 155 places in 172 ms
[2021-05-13 21:09:13] [INFO ] Deduced a trap composed of 35 places in 167 ms
[2021-05-13 21:09:13] [INFO ] Deduced a trap composed of 54 places in 176 ms
[2021-05-13 21:09:14] [INFO ] Deduced a trap composed of 42 places in 164 ms
[2021-05-13 21:09:14] [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 s73 s78 s79 s255 s256 s266 s267 s268 s300 s303 s345 s350 s355 s385 s390 s395 s405 s516 s517 s518 s526 s527 s528 s532 s536 s537 s538 s542 s565 s566 s593 s594 s710 s711 s714 s715 s718 s719 s723) 0)") while checking expression at index 8
[2021-05-13 21:09:14] [INFO ] [Real]Absence check using 78 positive place invariants in 61 ms returned unsat
[2021-05-13 21:09:14] [INFO ] [Real]Absence check using 78 positive place invariants in 27 ms returned unsat
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 27000 steps, including 175 resets, run finished after 64 ms. (steps per millisecond=421 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 53 out of 757 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 757/757 places, 670/670 transitions.
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 116 place count 748 transition count 554
Reduce places removed 115 places and 0 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 231 place count 633 transition count 554
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 143 Pre rules applied. Total rules applied 231 place count 633 transition count 411
Deduced a syphon composed of 143 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 537 place count 470 transition count 411
Symmetric choice reduction at 2 with 86 rule applications. Total rules 623 place count 470 transition count 411
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 86 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 795 place count 384 transition count 325
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 795 place count 384 transition count 319
Deduced a syphon composed of 6 places in 2 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 809 place count 376 transition count 319
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 104
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 1019 place count 270 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1020 place count 270 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1022 place count 269 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 1027 place count 269 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1028 place count 268 transition count 216
Applied a total of 1028 rules in 171 ms. Remains 268 /757 variables (removed 489) and now considering 216/670 (removed 454) transitions.
Finished structural reductions, in 1 iterations. Remains : 268/757 places, 216/670 transitions.
Incomplete random walk after 1000000 steps, including 33084 resets, run finished after 2387 ms. (steps per millisecond=418 ) properties seen :[1, 0, 0, 0, 1, 1, 0]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7725 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8126 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7688 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7740 resets, run finished after 1437 ms. (steps per millisecond=695 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 216 rows 268 cols
[2021-05-13 21:09:21] [INFO ] Computed 93 place invariants in 30 ms
[2021-05-13 21:09:21] [INFO ] [Real]Absence check using 70 positive place invariants in 27 ms returned sat
[2021-05-13 21:09:21] [INFO ] [Real]Absence check using 70 positive and 23 generalized place invariants in 9 ms returned sat
[2021-05-13 21:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:22] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2021-05-13 21:09:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 21:09:22] [INFO ] [Real]Added 4 Read/Feed constraints in 14 ms returned sat
[2021-05-13 21:09:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:09:22] [INFO ] [Nat]Absence check using 70 positive place invariants in 25 ms returned sat
[2021-05-13 21:09:22] [INFO ] [Nat]Absence check using 70 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-13 21:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:22] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-13 21:09:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 28 ms returned sat
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 67 places in 117 ms
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 61 places in 67 ms
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 65 places in 63 ms
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 60 places in 67 ms
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 20 places in 68 ms
[2021-05-13 21:09:22] [INFO ] Deduced a trap composed of 62 places in 62 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 62 places in 68 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 7 places in 68 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 61 places in 69 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 56 places in 82 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 57 places in 78 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 65 places in 79 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 63 places in 73 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 60 places in 68 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 69 places in 71 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 59 places in 80 ms
[2021-05-13 21:09:23] [INFO ] Deduced a trap composed of 59 places in 68 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 71 places in 68 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 75 places in 81 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 59 places in 76 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 68 places in 96 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 62 places in 75 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 64 places in 76 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 63 places in 53 ms
[2021-05-13 21:09:24] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2021-05-13 21:09:24] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2429 ms
[2021-05-13 21:09:24] [INFO ] Computed and/alt/rep : 213/1184/213 causal constraints in 14 ms.
[2021-05-13 21:09:26] [INFO ] Added : 133 causal constraints over 27 iterations in 1279 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2021-05-13 21:09:26] [INFO ] [Real]Absence check using 70 positive place invariants in 35 ms returned sat
[2021-05-13 21:09:26] [INFO ] [Real]Absence check using 70 positive and 23 generalized place invariants in 18 ms returned sat
[2021-05-13 21:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:26] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2021-05-13 21:09:26] [INFO ] [Real]Added 4 Read/Feed constraints in 16 ms returned sat
[2021-05-13 21:09:26] [INFO ] Computed and/alt/rep : 213/1184/213 causal constraints in 18 ms.
[2021-05-13 21:09:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:09:26] [INFO ] [Nat]Absence check using 70 positive place invariants in 41 ms returned sat
[2021-05-13 21:09:26] [INFO ] [Nat]Absence check using 70 positive and 23 generalized place invariants in 14 ms returned sat
[2021-05-13 21:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:27] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2021-05-13 21:09:27] [INFO ] [Nat]Added 4 Read/Feed constraints in 54 ms returned sat
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 60 places in 112 ms
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 60 places in 105 ms
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 61 places in 86 ms
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 64 places in 88 ms
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 58 places in 101 ms
[2021-05-13 21:09:27] [INFO ] Deduced a trap composed of 60 places in 88 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 63 places in 104 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 64 places in 80 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 64 places in 82 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 59 places in 85 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 65 places in 74 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 63 places in 76 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 61 places in 80 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 67 places in 87 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 63 places in 88 ms
[2021-05-13 21:09:28] [INFO ] Deduced a trap composed of 60 places in 77 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 65 places in 71 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 64 places in 108 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 63 places in 119 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 60 places in 84 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 60 places in 81 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 62 places in 82 ms
[2021-05-13 21:09:29] [INFO ] Deduced a trap composed of 61 places in 84 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 57 places in 84 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 7 places in 84 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 60 places in 75 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 61 places in 72 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 65 places in 73 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 63 places in 70 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 60 places in 61 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 68 places in 58 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 61 places in 70 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 68 places in 66 ms
[2021-05-13 21:09:30] [INFO ] Deduced a trap composed of 67 places in 57 ms
[2021-05-13 21:09:31] [INFO ] Deduced a trap composed of 66 places in 50 ms
[2021-05-13 21:09:31] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3832 ms
[2021-05-13 21:09:31] [INFO ] Computed and/alt/rep : 213/1184/213 causal constraints in 24 ms.
[2021-05-13 21:09:31] [INFO ] Added : 109 causal constraints over 22 iterations in 815 ms. Result :sat
[2021-05-13 21:09:32] [INFO ] Deduced a trap composed of 65 places in 104 ms
[2021-05-13 21:09:32] [INFO ] Deduced a trap composed of 66 places in 115 ms
[2021-05-13 21:09:32] [INFO ] Deduced a trap composed of 63 places in 78 ms
[2021-05-13 21:09:32] [INFO ] Deduced a trap composed of 63 places in 101 ms
[2021-05-13 21:09:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 881 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
[2021-05-13 21:09:32] [INFO ] [Real]Absence check using 70 positive place invariants in 38 ms returned sat
[2021-05-13 21:09:32] [INFO ] [Real]Absence check using 70 positive and 23 generalized place invariants in 13 ms returned sat
[2021-05-13 21:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:33] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-13 21:09:33] [INFO ] [Real]Added 4 Read/Feed constraints in 5 ms returned sat
[2021-05-13 21:09:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:09:33] [INFO ] [Nat]Absence check using 70 positive place invariants in 32 ms returned sat
[2021-05-13 21:09:33] [INFO ] [Nat]Absence check using 70 positive and 23 generalized place invariants in 11 ms returned sat
[2021-05-13 21:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:33] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2021-05-13 21:09:33] [INFO ] [Nat]Added 4 Read/Feed constraints in 39 ms returned sat
[2021-05-13 21:09:33] [INFO ] Computed and/alt/rep : 213/1184/213 causal constraints in 27 ms.
[2021-05-13 21:09:34] [INFO ] Added : 117 causal constraints over 25 iterations in 1078 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2021-05-13 21:09:34] [INFO ] [Real]Absence check using 70 positive place invariants in 47 ms returned sat
[2021-05-13 21:09:34] [INFO ] [Real]Absence check using 70 positive and 23 generalized place invariants in 17 ms returned sat
[2021-05-13 21:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:35] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-13 21:09:35] [INFO ] [Real]Added 4 Read/Feed constraints in 6 ms returned sat
[2021-05-13 21:09:35] [INFO ] Deduced a trap composed of 7 places in 25 ms
[2021-05-13 21:09:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2021-05-13 21:09:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:09:35] [INFO ] [Nat]Absence check using 70 positive place invariants in 36 ms returned sat
[2021-05-13 21:09:35] [INFO ] [Nat]Absence check using 70 positive and 23 generalized place invariants in 15 ms returned sat
[2021-05-13 21:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:09:35] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2021-05-13 21:09:35] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-13 21:09:35] [INFO ] Deduced a trap composed of 43 places in 100 ms
[2021-05-13 21:09:35] [INFO ] Deduced a trap composed of 3 places in 84 ms
[2021-05-13 21:09:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2021-05-13 21:09:35] [INFO ] Computed and/alt/rep : 213/1184/213 causal constraints in 15 ms.
[2021-05-13 21:09:36] [INFO ] Added : 91 causal constraints over 19 iterations in 446 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 15600 steps, including 583 resets, run finished after 57 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 18500 steps, including 638 resets, run finished after 58 ms. (steps per millisecond=318 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 12800 steps, including 457 resets, run finished after 42 ms. (steps per millisecond=304 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 17100 steps, including 606 resets, run finished after 54 ms. (steps per millisecond=316 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 38 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 216/216 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 268 transition count 211
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 262 transition count 211
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 262 transition count 211
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 261 transition count 210
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 36 place count 250 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 249 transition count 198
Applied a total of 37 rules in 41 ms. Remains 249 /268 variables (removed 19) and now considering 198/216 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 249/268 places, 198/216 transitions.
Incomplete random walk after 1000000 steps, including 42177 resets, run finished after 2336 ms. (steps per millisecond=428 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 7655 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 9185 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7609 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7636 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 14790317 steps, run timeout after 30001 ms. (steps per millisecond=492 ) properties seen :[1, 0, 1, 1]
Probabilistic random walk after 14790317 steps, saw 2408221 distinct states, run finished after 30003 ms. (steps per millisecond=492 ) properties seen :[1, 0, 1, 1]
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 198 rows 249 cols
[2021-05-13 21:10:13] [INFO ] Computed 92 place invariants in 3 ms
[2021-05-13 21:10:13] [INFO ] [Real]Absence check using 69 positive place invariants in 44 ms returned sat
[2021-05-13 21:10:13] [INFO ] [Real]Absence check using 69 positive and 23 generalized place invariants in 8 ms returned sat
[2021-05-13 21:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 21:10:14] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-13 21:10:14] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 21:10:14] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 21:10:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 21:10:14] [INFO ] [Nat]Absence check using 69 positive place invariants in 30 ms returned sat
[2021-05-13 21:10:14] [INFO ] [Nat]Absence check using 69 positive and 23 generalized place invariants in 13 ms returned sat
[2021-05-13 21:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 21:10:14] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2021-05-13 21:10:14] [INFO ] [Nat]Added 4 Read/Feed constraints in 8 ms returned sat
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 58 places in 66 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 59 places in 87 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 60 places in 64 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 59 places in 55 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 58 places in 64 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 57 places in 67 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 64 places in 56 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 63 places in 62 ms
[2021-05-13 21:10:14] [INFO ] Deduced a trap composed of 57 places in 45 ms
[2021-05-13 21:10:15] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2021-05-13 21:10:15] [INFO ] Deduced a trap composed of 55 places in 65 ms
[2021-05-13 21:10:15] [INFO ] Deduced a trap composed of 58 places in 46 ms
[2021-05-13 21:10:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 882 ms
[2021-05-13 21:10:15] [INFO ] Computed and/alt/rep : 192/1076/192 causal constraints in 11 ms.
[2021-05-13 21:10:15] [INFO ] Added : 62 causal constraints over 13 iterations in 303 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 5700 steps, including 319 resets, run finished after 27 ms. (steps per millisecond=211 ) properties seen :[0] could not realise parikh vector
Support contains 9 out of 249 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 249/249 places, 198/198 transitions.
Graph (trivial) has 34 edges and 249 vertex of which 2 / 249 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 248 transition count 188
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 240 transition count 188
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 19 place count 240 transition count 182
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 35 place count 230 transition count 182
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 230 transition count 182
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 225 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 225 transition count 176
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 224 transition count 176
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 209 transition count 163
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 209 transition count 163
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 83 place count 208 transition count 162
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 208 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 206 transition count 160
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 206 transition count 160
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 206 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 205 transition count 159
Applied a total of 91 rules in 89 ms. Remains 205 /249 variables (removed 44) and now considering 159/198 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/249 places, 159/198 transitions.
Incomplete random walk after 1000000 steps, including 34413 resets, run finished after 3345 ms. (steps per millisecond=298 ) properties seen :[0]
Finished Best-First random walk after 1977 steps, including 10 resets, run visited all 1 properties in 5 ms. (steps per millisecond=395 )
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_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-19"
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-19, 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-162038177100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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