Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r028-tall-165251936100162.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-tall-165251936100162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.5K Apr 30 00:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 00:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 00:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 30 00:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 00:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 30 00:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 30 00:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 156K May 10 09:33 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-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083292396

Running Version 0
[2022-06-13 01:21:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-13 01:21:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:21:34] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2022-06-13 01:21:34] [INFO ] Transformed 624 places.
[2022-06-13 01:21:34] [INFO ] Transformed 564 transitions.
[2022-06-13 01:21:34] [INFO ] Found NUPN structural information;
[2022-06-13 01:21:34] [INFO ] Parsed PT model containing 624 places and 564 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 19 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 15) seen :1
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 8531362 steps, run timeout after 30001 ms. (steps per millisecond=284 ) properties seen :{12=1, 13=1}
Probabilistic random walk after 8531362 steps, saw 1082047 distinct states, run finished after 30011 ms. (steps per millisecond=284 ) properties seen :{12=1, 13=1}
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 12 properties.
// Phase 1: matrix 556 rows 616 cols
[2022-06-13 01:22:05] [INFO ] Computed 99 place invariants in 48 ms
[2022-06-13 01:22:05] [INFO ] [Real]Absence check using 60 positive place invariants in 49 ms returned sat
[2022-06-13 01:22:05] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 11 ms returned sat
[2022-06-13 01:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:05] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:22:05] [INFO ] Deduced a trap composed of 123 places in 273 ms of which 15 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 132 places in 239 ms of which 1 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 112 places in 244 ms of which 7 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 0 ms to minimize.
[2022-06-13 01:22:06] [INFO ] Deduced a trap composed of 124 places in 182 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 133 places in 191 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 138 places in 145 ms of which 2 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 1 ms to minimize.
[2022-06-13 01:22:07] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 117 places in 224 ms of which 1 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 114 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:22:08] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 1 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 156 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 122 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:22:09] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:22: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 close... while checking expression at index 0
[2022-06-13 01:22:10] [INFO ] [Real]Absence check using 60 positive place invariants in 33 ms returned sat
[2022-06-13 01:22:10] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:10] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:22:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 365 ms
[2022-06-13 01:22:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:11] [INFO ] [Nat]Absence check using 60 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:11] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-06-13 01:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:11] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2022-06-13 01:22:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 379 ms
[2022-06-13 01:22:11] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 42 ms.
[2022-06-13 01:22:13] [INFO ] Added : 251 causal constraints over 51 iterations in 1993 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:22:13] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2022-06-13 01:22:13] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2022-06-13 01:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:14] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2022-06-13 01:22:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:14] [INFO ] [Nat]Absence check using 60 positive place invariants in 34 ms returned sat
[2022-06-13 01:22:14] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 29 ms returned sat
[2022-06-13 01:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:15] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:22:15] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 5 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:22:16] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 133 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:22:17] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2022-06-13 01:22:18] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2977 ms
[2022-06-13 01:22:18] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 31 ms.
[2022-06-13 01:22:19] [INFO ] Added : 185 causal constraints over 37 iterations in 1322 ms. Result :unknown
[2022-06-13 01:22:19] [INFO ] [Real]Absence check using 60 positive place invariants in 34 ms returned sat
[2022-06-13 01:22:19] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 25 ms returned sat
[2022-06-13 01:22:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using state equation in 1336 ms returned sat
[2022-06-13 01:22:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 30 ms returned sat
[2022-06-13 01:22:21] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 16 ms returned unsat
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:21] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:22] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 0 ms to minimize.
[2022-06-13 01:22:22] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:22:23] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 149 places in 113 ms of which 2 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 144 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 153 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:22:24] [INFO ] Deduced a trap composed of 151 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 136 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 152 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 155 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 154 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 149 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:22:25] [INFO ] Deduced a trap composed of 135 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 156 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 158 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 143 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:22:26] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2022-06-13 01:22: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 close... while checking expression at index 4
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 60 positive place invariants in 29 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 24 ms returned sat
[2022-06-13 01:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:27] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2022-06-13 01:22:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:27] [INFO ] [Nat]Absence check using 60 positive place invariants in 25 ms returned sat
[2022-06-13 01:22:27] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 16 ms returned sat
[2022-06-13 01:22:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:27] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-06-13 01:22:27] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2022-06-13 01:22:28] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:29] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2022-06-13 01:22:30] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 3123 ms
[2022-06-13 01:22:30] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 27 ms.
[2022-06-13 01:22: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 close... while checking expression at index 5
[2022-06-13 01:22:32] [INFO ] [Real]Absence check using 60 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 16 ms returned sat
[2022-06-13 01:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using state equation in 391 ms returned unsat
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 60 positive place invariants in 35 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 17 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:33] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2022-06-13 01:22:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 26 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 23 ms returned sat
[2022-06-13 01:22:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:34] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 0 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:22:34] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:22:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1823 ms
[2022-06-13 01:22:36] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 34 ms.
[2022-06-13 01:22:38] [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 close... while checking expression at index 7
[2022-06-13 01:22:38] [INFO ] [Real]Absence check using 60 positive place invariants in 25 ms returned sat
[2022-06-13 01:22:38] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2022-06-13 01:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:38] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-13 01:22:38] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2022-06-13 01:22:39] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:40] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2234 ms
[2022-06-13 01:22:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:41] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:41] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 10 ms returned sat
[2022-06-13 01:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:41] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:41] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:22:42] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:43] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-06-13 01:22:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1608 ms
[2022-06-13 01:22:43] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 27 ms.
[2022-06-13 01:22:44] [INFO ] Added : 236 causal constraints over 48 iterations in 1737 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:22:44] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:44] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 3 ms returned unsat
[2022-06-13 01:22:45] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-06-13 01:22:45] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-06-13 01:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:45] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:22:45] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 826 ms
[2022-06-13 01:22:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:46] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-06-13 01:22:46] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 9 ms returned sat
[2022-06-13 01:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:46] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:22:46] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 12 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 1 ms to minimize.
[2022-06-13 01:22:47] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1535 ms
[2022-06-13 01:22:47] [INFO ] Computed and/alt/rep : 522/857/522 causal constraints (skipped 33 transitions) in 26 ms.
[2022-06-13 01:22:49] [INFO ] Added : 249 causal constraints over 50 iterations in 1762 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-13 01:22:49] [INFO ] [Real]Absence check using 60 positive place invariants in 24 ms returned sat
[2022-06-13 01:22:49] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 12 ms returned sat
[2022-06-13 01:22:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:22:50] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-13 01:22:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:22:50] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-06-13 01:22:50] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 1 ms returned unsat
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 26400 steps, including 165 resets, run finished after 74 ms. (steps per millisecond=356 ) properties (out of 8) seen :4 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 26000 steps, including 188 resets, run finished after 58 ms. (steps per millisecond=448 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26200 steps, including 163 resets, run finished after 55 ms. (steps per millisecond=476 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 27800 steps, including 164 resets, run finished after 58 ms. (steps per millisecond=479 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 38 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 610 transition count 473
Reduce places removed 82 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 93 rules applied. Total rules applied 176 place count 528 transition count 462
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 187 place count 517 transition count 462
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 187 place count 517 transition count 338
Deduced a syphon composed of 124 places in 5 ms
Ensure Unique test removed 14 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 449 place count 379 transition count 338
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 528 place count 300 transition count 259
Iterating global reduction 3 with 79 rules applied. Total rules applied 607 place count 300 transition count 259
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 607 place count 300 transition count 253
Deduced a syphon composed of 6 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 621 place count 292 transition count 253
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 781 place count 212 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 782 place count 212 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 784 place count 211 transition count 176
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 788 place count 211 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 789 place count 210 transition count 175
Applied a total of 789 rules in 176 ms. Remains 210 /616 variables (removed 406) and now considering 175/556 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 210/616 places, 175/556 transitions.
[2022-06-13 01:22:50] [INFO ] Flatten gal took : 87 ms
[2022-06-13 01:22:50] [INFO ] Flatten gal took : 19 ms
[2022-06-13 01:22:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6461210702902617764.gal : 10 ms
[2022-06-13 01:22:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14685505231981586793.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6461210702902617764.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14685505231981586793.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6461210702902617764.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14685505231981586793.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14685505231981586793.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 30
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :30 after 240
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :240 after 3600
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3600 after 5379
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :5379 after 7982
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :7982 after 54620
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :54620 after 336936
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-04 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.29397e+06 after 2.29454e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.78501e+06,10.7331,15960,2,7553,17,47691,7,0,1069,38184,0
Total reachable state count : 2785008

Verifying 2 reachability properties.
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityFireability-04,144,10.7341,15960,2,289,17,47691,8,0,1072,38184,0
Reachability property BusinessProcesses-PT-14-ReachabilityFireability-07 is true.
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-14-ReachabilityFireability-07,2592,10.7579,16224,2,464,17,47691,8,0,1120,38184,0
All properties solved without resorting to model-checking.

BK_STOP 1655083383113

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is BusinessProcesses-PT-14, 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 r028-tall-165251936100162"
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 [ "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 ;