About the Execution of 2020-gold for BusinessProcesses-PT-14
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 862.184 | 3600000.00 | 88344.00 | 112.90 | FTFTTTTTFFTTFTFF | 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-162038177000215.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038177000215
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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.4K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:00 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.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 156K 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620938881673
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:48:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 20:48:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:48:03] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2021-05-13 20:48:03] [INFO ] Transformed 624 places.
[2021-05-13 20:48:03] [INFO ] Transformed 564 transitions.
[2021-05-13 20:48:03] [INFO ] Found NUPN structural information;
[2021-05-13 20:48:03] [INFO ] Parsed PT model containing 624 places and 564 transitions in 131 ms.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 66 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_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]
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]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2021-05-13 20:48:03] [INFO ] Computed 99 place invariants in 31 ms
[2021-05-13 20:48:04] [INFO ] [Real]Absence check using 60 positive place invariants in 65 ms returned sat
[2021-05-13 20:48:04] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 30 ms returned sat
[2021-05-13 20:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:05] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2021-05-13 20:48:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:05] [INFO ] [Nat]Absence check using 60 positive place invariants in 56 ms returned sat
[2021-05-13 20:48:05] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 18 ms returned sat
[2021-05-13 20:48:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:05] [INFO ] [Nat]Absence check using state equation in 703 ms returned sat
[2021-05-13 20:48:06] [INFO ] Deduced a trap composed of 27 places in 459 ms
[2021-05-13 20:48:07] [INFO ] Deduced a trap composed of 17 places in 562 ms
[2021-05-13 20:48:07] [INFO ] Deduced a trap composed of 37 places in 346 ms
[2021-05-13 20:48:07] [INFO ] Deduced a trap composed of 142 places in 380 ms
[2021-05-13 20:48:08] [INFO ] Deduced a trap composed of 31 places in 326 ms
[2021-05-13 20:48:08] [INFO ] Deduced a trap composed of 21 places in 251 ms
[2021-05-13 20:48:08] [INFO ] Deduced a trap composed of 17 places in 242 ms
[2021-05-13 20:48:08] [INFO ] Deduced a trap composed of 45 places in 225 ms
[2021-05-13 20:48:09] [INFO ] Deduced a trap composed of 147 places in 314 ms
[2021-05-13 20:48:09] [INFO ] Deduced a trap composed of 34 places in 232 ms
[2021-05-13 20:48:09] [INFO ] Deduced a trap composed of 142 places in 239 ms
[2021-05-13 20:48:10] [INFO ] Deduced a trap composed of 46 places in 227 ms
[2021-05-13 20:48:10] [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 s33 s34 s49 s50 s51 s52 s53 s77 s78 s225 s228 s229 s230 s279 s280 s281 s318 s323 s328 s333 s338 s347 s348 s349 s418 s423 s469 s470 s471 s478 s479 s484 s485 s486 s565 s566 s569 s570) 0)") while checking expression at index 0
[2021-05-13 20:48:10] [INFO ] [Real]Absence check using 60 positive place invariants in 73 ms returned sat
[2021-05-13 20:48:10] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 26 ms returned sat
[2021-05-13 20:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:10] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2021-05-13 20:48:11] [INFO ] Deduced a trap composed of 13 places in 265 ms
[2021-05-13 20:48:11] [INFO ] Deduced a trap composed of 12 places in 242 ms
[2021-05-13 20:48:11] [INFO ] Deduced a trap composed of 20 places in 252 ms
[2021-05-13 20:48:12] [INFO ] Deduced a trap composed of 139 places in 275 ms
[2021-05-13 20:48:12] [INFO ] Deduced a trap composed of 13 places in 146 ms
[2021-05-13 20:48:12] [INFO ] Deduced a trap composed of 18 places in 173 ms
[2021-05-13 20:48:12] [INFO ] Deduced a trap composed of 130 places in 223 ms
[2021-05-13 20:48:12] [INFO ] Deduced a trap composed of 148 places in 190 ms
[2021-05-13 20:48:13] [INFO ] Deduced a trap composed of 16 places in 202 ms
[2021-05-13 20:48:13] [INFO ] Deduced a trap composed of 44 places in 510 ms
[2021-05-13 20:48:13] [INFO ] Deduced a trap composed of 21 places in 185 ms
[2021-05-13 20:48:14] [INFO ] Deduced a trap composed of 136 places in 167 ms
[2021-05-13 20:48:14] [INFO ] Deduced a trap composed of 24 places in 153 ms
[2021-05-13 20:48:14] [INFO ] Deduced a trap composed of 17 places in 170 ms
[2021-05-13 20:48:14] [INFO ] Deduced a trap composed of 133 places in 175 ms
[2021-05-13 20:48:14] [INFO ] Deduced a trap composed of 133 places in 165 ms
[2021-05-13 20:48:15] [INFO ] Deduced a trap composed of 38 places in 163 ms
[2021-05-13 20:48:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-13 20:48:15] [INFO ] Deduced a trap composed of 7 places in 304 ms
[2021-05-13 20:48:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s243 s244 s245 s246) 0)") while checking expression at index 1
[2021-05-13 20:48:15] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2021-05-13 20:48:15] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 30 ms returned sat
[2021-05-13 20:48:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:16] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2021-05-13 20:48:16] [INFO ] Deduced a trap composed of 24 places in 264 ms
[2021-05-13 20:48:16] [INFO ] Deduced a trap composed of 12 places in 231 ms
[2021-05-13 20:48:17] [INFO ] Deduced a trap composed of 13 places in 194 ms
[2021-05-13 20:48:17] [INFO ] Deduced a trap composed of 141 places in 224 ms
[2021-05-13 20:48:17] [INFO ] Deduced a trap composed of 18 places in 214 ms
[2021-05-13 20:48:17] [INFO ] Deduced a trap composed of 137 places in 171 ms
[2021-05-13 20:48:17] [INFO ] Deduced a trap composed of 38 places in 246 ms
[2021-05-13 20:48:18] [INFO ] Deduced a trap composed of 141 places in 172 ms
[2021-05-13 20:48:18] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2021-05-13 20:48:18] [INFO ] Deduced a trap composed of 140 places in 194 ms
[2021-05-13 20:48:18] [INFO ] Deduced a trap composed of 141 places in 196 ms
[2021-05-13 20:48:19] [INFO ] Deduced a trap composed of 14 places in 227 ms
[2021-05-13 20:48:19] [INFO ] Deduced a trap composed of 29 places in 187 ms
[2021-05-13 20:48:19] [INFO ] Deduced a trap composed of 38 places in 171 ms
[2021-05-13 20:48:19] [INFO ] Deduced a trap composed of 40 places in 184 ms
[2021-05-13 20:48:19] [INFO ] Deduced a trap composed of 36 places in 182 ms
[2021-05-13 20:48:20] [INFO ] Deduced a trap composed of 136 places in 185 ms
[2021-05-13 20:48:20] [INFO ] Deduced a trap composed of 128 places in 203 ms
[2021-05-13 20:48:20] [INFO ] Deduced a trap composed of 22 places in 185 ms
[2021-05-13 20:48:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s70 s71 s159 s293 s297 s298 s299 s343 s542 s543) 0)") while checking expression at index 2
[2021-05-13 20:48:20] [INFO ] [Real]Absence check using 60 positive place invariants in 51 ms returned sat
[2021-05-13 20:48:20] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 26 ms returned sat
[2021-05-13 20:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:21] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2021-05-13 20:48:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 72 ms returned sat
[2021-05-13 20:48:21] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-13 20:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:22] [INFO ] [Nat]Absence check using state equation in 860 ms returned sat
[2021-05-13 20:48:22] [INFO ] Deduced a trap composed of 17 places in 203 ms
[2021-05-13 20:48:23] [INFO ] Deduced a trap composed of 13 places in 257 ms
[2021-05-13 20:48:23] [INFO ] Deduced a trap composed of 19 places in 178 ms
[2021-05-13 20:48:23] [INFO ] Deduced a trap composed of 29 places in 191 ms
[2021-05-13 20:48:23] [INFO ] Deduced a trap composed of 12 places in 158 ms
[2021-05-13 20:48:23] [INFO ] Deduced a trap composed of 47 places in 158 ms
[2021-05-13 20:48:24] [INFO ] Deduced a trap composed of 50 places in 248 ms
[2021-05-13 20:48:24] [INFO ] Deduced a trap composed of 151 places in 224 ms
[2021-05-13 20:48:24] [INFO ] Deduced a trap composed of 11 places in 221 ms
[2021-05-13 20:48:24] [INFO ] Deduced a trap composed of 147 places in 151 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 44 places in 166 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 140 places in 167 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 29 places in 169 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 38 places in 158 ms
[2021-05-13 20:48:25] [INFO ] Deduced a trap composed of 36 places in 157 ms
[2021-05-13 20:48:26] [INFO ] Deduced a trap composed of 37 places in 189 ms
[2021-05-13 20:48:26] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2021-05-13 20:48:26] [INFO ] Deduced a trap composed of 56 places in 177 ms
[2021-05-13 20:48:26] [INFO ] Deduced a trap composed of 37 places in 179 ms
[2021-05-13 20:48:26] [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 s49 s50 s51 s54 s55 s56 s57 s222 s223 s224 s243 s246 s293 s297 s298 s299 s313 s328 s333 s338 s343 s428 s433 s484 s485 s486 s491 s492 s542 s543 s573 s574 s577 s578) 0)") while checking expression at index 3
[2021-05-13 20:48:26] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2021-05-13 20:48:26] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 19 ms returned sat
[2021-05-13 20:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:27] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2021-05-13 20:48:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 66 ms returned sat
[2021-05-13 20:48:27] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2021-05-13 20:48:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:28] [INFO ] [Nat]Absence check using state equation in 934 ms returned sat
[2021-05-13 20:48:28] [INFO ] Deduced a trap composed of 15 places in 139 ms
[2021-05-13 20:48:29] [INFO ] Deduced a trap composed of 14 places in 714 ms
[2021-05-13 20:48:29] [INFO ] Deduced a trap composed of 14 places in 250 ms
[2021-05-13 20:48:30] [INFO ] Deduced a trap composed of 13 places in 216 ms
[2021-05-13 20:48:30] [INFO ] Deduced a trap composed of 16 places in 164 ms
[2021-05-13 20:48:30] [INFO ] Deduced a trap composed of 23 places in 243 ms
[2021-05-13 20:48:30] [INFO ] Deduced a trap composed of 24 places in 220 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 36 places in 210 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 40 places in 174 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 25 places in 122 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 20 places in 93 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 17 places in 110 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 51 places in 99 ms
[2021-05-13 20:48:31] [INFO ] Deduced a trap composed of 32 places in 162 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 44 places in 97 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 35 places in 101 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 37 places in 54 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 49 places in 54 ms
[2021-05-13 20:48:32] [INFO ] Deduced a trap composed of 50 places in 124 ms
[2021-05-13 20:48:32] [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 s33 s34 s47 s48 s49 s50 s51 s52 s53 s56 s57 s77 s78 s216 s217 s218 s222 s223 s224 s228 s229 s230 s243 s246 s279 s280 s281 s307 s308 s309 s318 s323 s328 s333 s338 s348 s418 s423 s428 s433 s484 s485 s486 s538 s539 s577 s578) 0)") while checking expression at index 4
[2021-05-13 20:48:32] [INFO ] [Real]Absence check using 60 positive place invariants in 131 ms returned sat
[2021-05-13 20:48:32] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 33 ms returned sat
[2021-05-13 20:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:33] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2021-05-13 20:48:34] [INFO ] Deduced a trap composed of 13 places in 158 ms
[2021-05-13 20:48:34] [INFO ] Deduced a trap composed of 18 places in 199 ms
[2021-05-13 20:48:34] [INFO ] Deduced a trap composed of 19 places in 172 ms
[2021-05-13 20:48:34] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2021-05-13 20:48:34] [INFO ] Deduced a trap composed of 18 places in 133 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 15 places in 136 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 30 places in 131 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 19 places in 130 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 27 places in 131 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 23 places in 122 ms
[2021-05-13 20:48:35] [INFO ] Deduced a trap composed of 22 places in 127 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 24 places in 124 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 37 places in 127 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 30 places in 124 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 27 places in 121 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 35 places in 121 ms
[2021-05-13 20:48:36] [INFO ] Deduced a trap composed of 44 places in 121 ms
[2021-05-13 20:48:37] [INFO ] Deduced a trap composed of 43 places in 128 ms
[2021-05-13 20:48:37] [INFO ] Deduced a trap composed of 30 places in 132 ms
[2021-05-13 20:48:37] [INFO ] Deduced a trap composed of 22 places in 180 ms
[2021-05-13 20:48:37] [INFO ] Deduced a trap composed of 27 places in 152 ms
[2021-05-13 20:48:37] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2021-05-13 20:48:37] [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 s58 s61 s62 s234 s235 s236 s243 s246 s338 s428 s433 s480 s481 s484 s485 s486 s573 s574) 0)") while checking expression at index 5
[2021-05-13 20:48:37] [INFO ] [Real]Absence check using 60 positive place invariants in 45 ms returned sat
[2021-05-13 20:48:37] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 28 ms returned sat
[2021-05-13 20:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:39] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2021-05-13 20:48:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:39] [INFO ] [Nat]Absence check using 60 positive place invariants in 93 ms returned sat
[2021-05-13 20:48:39] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 27 ms returned sat
[2021-05-13 20:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:40] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2021-05-13 20:48:40] [INFO ] Deduced a trap composed of 8 places in 151 ms
[2021-05-13 20:48:40] [INFO ] Deduced a trap composed of 14 places in 145 ms
[2021-05-13 20:48:40] [INFO ] Deduced a trap composed of 28 places in 128 ms
[2021-05-13 20:48:40] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2021-05-13 20:48:41] [INFO ] Deduced a trap composed of 35 places in 122 ms
[2021-05-13 20:48:41] [INFO ] Deduced a trap composed of 31 places in 118 ms
[2021-05-13 20:48:41] [INFO ] Deduced a trap composed of 38 places in 135 ms
[2021-05-13 20:48:41] [INFO ] Deduced a trap composed of 59 places in 89 ms
[2021-05-13 20:48:41] [INFO ] Deduced a trap composed of 61 places in 100 ms
[2021-05-13 20:48:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1319 ms
[2021-05-13 20:48:41] [INFO ] Computed and/alt/rep : 555/2453/555 causal constraints in 46 ms.
[2021-05-13 20:48:44] [INFO ] Added : 275 causal constraints over 55 iterations in 2591 ms. Result :(error "Failed to check-sat")
Support contains 26 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 327 edges and 616 vertex of which 4 / 616 are part of one of the 1 SCC in 18 ms
Free SCC test removed 3 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1256 edges and 613 vertex of which 607 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Iterating post reduction 0 with 135 rules applied. Total rules applied 137 place count 607 transition count 420
Reduce places removed 131 places and 0 transitions.
Iterating post reduction 1 with 131 rules applied. Total rules applied 268 place count 476 transition count 420
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 268 place count 476 transition count 336
Deduced a syphon composed of 84 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 450 place count 378 transition count 336
Symmetric choice reduction at 2 with 71 rule applications. Total rules 521 place count 378 transition count 336
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 71 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 663 place count 307 transition count 265
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 663 place count 307 transition count 257
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 681 place count 297 transition count 257
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 861 place count 206 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 863 place count 205 transition count 172
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 866 place count 205 transition count 169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 869 place count 202 transition count 169
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 870 place count 202 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 871 place count 201 transition count 168
Applied a total of 871 rules in 227 ms. Remains 201 /616 variables (removed 415) and now considering 168/556 (removed 388) transitions.
Finished structural reductions, in 1 iterations. Remains : 201/616 places, 168/556 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2712 ms. (steps per millisecond=368 ) properties seen :[0, 0, 0, 0, 1, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2470 ms. (steps per millisecond=404 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1 resets, run finished after 1964 ms. (steps per millisecond=509 ) properties seen :[1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 1234 ms. (steps per millisecond=810 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1378 ms. (steps per millisecond=725 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 168 rows 201 cols
[2021-05-13 20:48:56] [INFO ] Computed 76 place invariants in 9 ms
[2021-05-13 20:48:56] [INFO ] [Real]Absence check using 55 positive place invariants in 71 ms returned sat
[2021-05-13 20:48:56] [INFO ] [Real]Absence check using 55 positive and 21 generalized place invariants in 14 ms returned sat
[2021-05-13 20:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:57] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-13 20:48:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2021-05-13 20:48:57] [INFO ] [Real]Added 6 Read/Feed constraints in 3 ms returned sat
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 42 places in 86 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 21 places in 91 ms
[2021-05-13 20:48:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2021-05-13 20:48:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:57] [INFO ] [Nat]Absence check using 55 positive place invariants in 28 ms returned sat
[2021-05-13 20:48:57] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 11 ms returned sat
[2021-05-13 20:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:57] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-13 20:48:57] [INFO ] [Nat]Added 6 Read/Feed constraints in 20 ms returned sat
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 47 places in 71 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 20 places in 27 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 44 places in 53 ms
[2021-05-13 20:48:57] [INFO ] Deduced a trap composed of 14 places in 20 ms
[2021-05-13 20:48:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2021-05-13 20:48:57] [INFO ] Computed and/alt/rep : 165/709/165 causal constraints in 8 ms.
[2021-05-13 20:48:58] [INFO ] Added : 93 causal constraints over 20 iterations in 301 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 55 positive place invariants in 14 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using 55 positive and 21 generalized place invariants in 6 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:58] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Real]Added 6 Read/Feed constraints in 2 ms returned sat
[2021-05-13 20:48:58] [INFO ] Deduced a trap composed of 43 places in 48 ms
[2021-05-13 20:48:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2021-05-13 20:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 6 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:58] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-13 20:48:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 48 ms returned sat
[2021-05-13 20:48:58] [INFO ] Deduced a trap composed of 41 places in 158 ms
[2021-05-13 20:48:58] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2021-05-13 20:48:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 279 ms
[2021-05-13 20:48:58] [INFO ] Computed and/alt/rep : 165/709/165 causal constraints in 8 ms.
[2021-05-13 20:48:59] [INFO ] Added : 56 causal constraints over 12 iterations in 186 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-13 20:48:59] [INFO ] [Real]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-13 20:48:59] [INFO ] [Real]Absence check using 55 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-13 20:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:59] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-13 20:48:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:48:59] [INFO ] [Nat]Absence check using 55 positive place invariants in 21 ms returned sat
[2021-05-13 20:48:59] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 8 ms returned sat
[2021-05-13 20:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:48:59] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-13 20:48:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 39 ms returned sat
[2021-05-13 20:48:59] [INFO ] Computed and/alt/rep : 165/709/165 causal constraints in 14 ms.
[2021-05-13 20:48:59] [INFO ] Added : 81 causal constraints over 17 iterations in 303 ms. Result :sat
[2021-05-13 20:48:59] [INFO ] Deduced a trap composed of 46 places in 50 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 43 places in 67 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 45 places in 85 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 45 places in 54 ms
[2021-05-13 20:49:00] [INFO ] Deduced a trap composed of 42 places in 51 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 46 places in 823 ms
[2021-05-13 20:49:01] [INFO ] Deduced a trap composed of 46 places in 76 ms
[2021-05-13 20:49:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1401 ms
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-13 20:49:01] [INFO ] [Real]Absence check using 55 positive place invariants in 22 ms returned sat
[2021-05-13 20:49:01] [INFO ] [Real]Absence check using 55 positive and 21 generalized place invariants in 19 ms returned sat
[2021-05-13 20:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:01] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2021-05-13 20:49:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:49:01] [INFO ] [Nat]Absence check using 55 positive place invariants in 29 ms returned sat
[2021-05-13 20:49:01] [INFO ] [Nat]Absence check using 55 positive and 21 generalized place invariants in 9 ms returned sat
[2021-05-13 20:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:49:01] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-13 20:49:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 17 ms returned sat
[2021-05-13 20:49:01] [INFO ] Computed and/alt/rep : 165/709/165 causal constraints in 12 ms.
[2021-05-13 20:49:01] [INFO ] Added : 39 causal constraints over 8 iterations in 95 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
Incomplete Parikh walk after 2600 steps, including 103 resets, run finished after 13 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 6800 steps, including 296 resets, run finished after 29 ms. (steps per millisecond=234 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4900 steps, including 141 resets, run finished after 21 ms. (steps per millisecond=233 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 410 resets, run finished after 30 ms. (steps per millisecond=260 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 201 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 201/201 places, 168/168 transitions.
Graph (trivial) has 29 edges and 201 vertex of which 2 / 201 are part of one of the 1 SCC in 1 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 200 transition count 158
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 192 transition count 158
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 19 place count 192 transition count 152
Deduced a syphon composed of 6 places in 0 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 182 transition count 152
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 182 transition count 152
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 178 transition count 148
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 77 place count 163 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 162 transition count 132
Applied a total of 78 rules in 35 ms. Remains 162 /201 variables (removed 39) and now considering 132/168 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 162/201 places, 132/168 transitions.
Incomplete random walk after 1000000 steps, including 45102 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 24844 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties seen :[0]
Finished probabilistic random walk after 3913 steps, run visited all 1 properties in 32 ms. (steps per millisecond=122 )
Probabilistic random walk after 3913 steps, saw 1312 distinct states, run finished after 32 ms. (steps per millisecond=122 ) properties seen :[1]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-14"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-162038177000215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;