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.r024-tall-165251918600471.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 itstools
Input is BusinessProcesses-PT-19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.8K Apr 30 00:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 30 00:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:59 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 26K 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 12K Apr 30 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 30 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 00:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 00:00 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 189K 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-19-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-19-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654201007716

Running Version 202205111006
[2022-06-02 20:16:48] [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-02 20:16:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 20:16:49] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2022-06-02 20:16:49] [INFO ] Transformed 772 places.
[2022-06-02 20:16:49] [INFO ] Transformed 685 transitions.
[2022-06-02 20:16:49] [INFO ] Found NUPN structural information;
[2022-06-02 20:16:49] [INFO ] Parsed PT model containing 772 places and 685 transitions in 265 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 20 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 55 resets, run finished after 573 ms. (steps per millisecond=17 ) properties (out of 15) seen :4
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 670 rows 757 cols
[2022-06-02 20:16:50] [INFO ] Computed 125 place invariants in 63 ms
[2022-06-02 20:16:51] [INFO ] [Real]Absence check using 78 positive place invariants in 41 ms returned sat
[2022-06-02 20:16:51] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 136 ms returned sat
[2022-06-02 20:16:51] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2022-06-02 20:16:52] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-02 20:16:52] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2022-06-02 20:16:53] [INFO ] After 1744ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2022-06-02 20:16:54] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 5 ms to minimize.
[2022-06-02 20:16:54] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 2 ms to minimize.
[2022-06-02 20:16:54] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 1 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 0 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2022-06-02 20:16:55] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 0 ms to minimize.
[2022-06-02 20:16:56] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:16:56] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:16:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2050 ms
[2022-06-02 20:16:56] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2022-06-02 20:16:57] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2022-06-02 20:16:57] [INFO ] Deduced a trap composed of 146 places in 176 ms of which 1 ms to minimize.
[2022-06-02 20:16:57] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2022-06-02 20:16:57] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 0 ms to minimize.
[2022-06-02 20:16:57] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 0 ms to minimize.
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2022-06-02 20:16:58] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 0 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 0 ms to minimize.
[2022-06-02 20:16:59] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:17:00] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 1 ms to minimize.
[2022-06-02 20:17:00] [INFO ] Deduced a trap composed of 181 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:17:00] [INFO ] Deduced a trap composed of 182 places in 160 ms of which 0 ms to minimize.
[2022-06-02 20:17:00] [INFO ] Deduced a trap composed of 177 places in 164 ms of which 1 ms to minimize.
[2022-06-02 20:17:00] [INFO ] Deduced a trap composed of 182 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:17:01] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:17:01] [INFO ] Deduced a trap composed of 192 places in 162 ms of which 1 ms to minimize.
[2022-06-02 20:17:01] [INFO ] Deduced a trap composed of 197 places in 163 ms of which 2 ms to minimize.
[2022-06-02 20:17:01] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 1 ms to minimize.
[2022-06-02 20:17:02] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:17:02] [INFO ] Deduced a trap composed of 172 places in 170 ms of which 0 ms to minimize.
[2022-06-02 20:17:02] [INFO ] Deduced a trap composed of 182 places in 163 ms of which 1 ms to minimize.
[2022-06-02 20:17:03] [INFO ] Deduced a trap composed of 185 places in 463 ms of which 2 ms to minimize.
[2022-06-02 20:17:03] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:17:03] [INFO ] Deduced a trap composed of 183 places in 165 ms of which 1 ms to minimize.
[2022-06-02 20:17:03] [INFO ] Deduced a trap composed of 186 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:17:03] [INFO ] Deduced a trap composed of 173 places in 159 ms of which 0 ms to minimize.
[2022-06-02 20:17:04] [INFO ] Deduced a trap composed of 169 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:17:04] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 0 ms to minimize.
[2022-06-02 20:17:04] [INFO ] Deduced a trap composed of 174 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:17:04] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 1 ms to minimize.
[2022-06-02 20:17:04] [INFO ] Deduced a trap composed of 181 places in 159 ms of which 0 ms to minimize.
[2022-06-02 20:17:05] [INFO ] Deduced a trap composed of 185 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:17:05] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:17:05] [INFO ] Deduced a trap composed of 191 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:17:05] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 1 ms to minimize.
[2022-06-02 20:17:06] [INFO ] Deduced a trap composed of 211 places in 145 ms of which 1 ms to minimize.
[2022-06-02 20:17:06] [INFO ] Deduced a trap composed of 188 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:17:06] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 2 ms to minimize.
[2022-06-02 20:17:06] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:17:06] [INFO ] Deduced a trap composed of 194 places in 142 ms of which 0 ms to minimize.
[2022-06-02 20:17:07] [INFO ] Deduced a trap composed of 192 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:17:07] [INFO ] Deduced a trap composed of 177 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:17:07] [INFO ] Deduced a trap composed of 181 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:17:07] [INFO ] Deduced a trap composed of 179 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:17:07] [INFO ] Deduced a trap composed of 187 places in 155 ms of which 1 ms to minimize.
[2022-06-02 20:17:08] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:17:08] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 0 ms to minimize.
[2022-06-02 20:17:08] [INFO ] Deduced a trap composed of 184 places in 161 ms of which 3 ms to minimize.
[2022-06-02 20:17:08] [INFO ] Deduced a trap composed of 172 places in 156 ms of which 0 ms to minimize.
[2022-06-02 20:17:09] [INFO ] Deduced a trap composed of 190 places in 159 ms of which 2 ms to minimize.
[2022-06-02 20:17:09] [INFO ] Deduced a trap composed of 172 places in 153 ms of which 4 ms to minimize.
[2022-06-02 20:17:09] [INFO ] Deduced a trap composed of 202 places in 153 ms of which 1 ms to minimize.
[2022-06-02 20:17:09] [INFO ] Deduced a trap composed of 202 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:17:09] [INFO ] Deduced a trap composed of 179 places in 160 ms of which 1 ms to minimize.
[2022-06-02 20:17:10] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 0 ms to minimize.
[2022-06-02 20:17:10] [INFO ] Deduced a trap composed of 210 places in 141 ms of which 0 ms to minimize.
[2022-06-02 20:17:10] [INFO ] Deduced a trap composed of 171 places in 159 ms of which 1 ms to minimize.
[2022-06-02 20:17:10] [INFO ] Deduced a trap composed of 171 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:17:11] [INFO ] Deduced a trap composed of 169 places in 155 ms of which 0 ms to minimize.
[2022-06-02 20:17:11] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:17:11] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 1 ms to minimize.
[2022-06-02 20:17:11] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2022-06-02 20:17:12] [INFO ] Deduced a trap composed of 180 places in 149 ms of which 5 ms to minimize.
[2022-06-02 20:17:12] [INFO ] Deduced a trap composed of 171 places in 147 ms of which 1 ms to minimize.
[2022-06-02 20:17:12] [INFO ] Deduced a trap composed of 171 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:17:12] [INFO ] Deduced a trap composed of 174 places in 140 ms of which 0 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 191 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:17:13] [INFO ] Deduced a trap composed of 190 places in 152 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 175 places in 154 ms of which 1 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 174 places in 156 ms of which 1 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 185 places in 148 ms of which 0 ms to minimize.
[2022-06-02 20:17:14] [INFO ] Deduced a trap composed of 186 places in 162 ms of which 0 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 166 places in 144 ms of which 0 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 173 places in 143 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 191 places in 149 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 174 places in 146 ms of which 1 ms to minimize.
[2022-06-02 20:17:15] [INFO ] Deduced a trap composed of 181 places in 158 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 172 places in 148 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 175 places in 150 ms of which 0 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 160 places in 144 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [INFO ] Deduced a trap composed of 170 places in 151 ms of which 1 ms to minimize.
[2022-06-02 20:17:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-02 20:17:16] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 7000 ms.
Support contains 134 out of 757 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (complete) has 1520 edges and 757 vertex of which 748 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.30 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 748 transition count 604
Reduce places removed 65 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 79 rules applied. Total rules applied 145 place count 683 transition count 590
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 159 place count 669 transition count 590
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 138 Pre rules applied. Total rules applied 159 place count 669 transition count 452
Deduced a syphon composed of 138 places in 3 ms
Ensure Unique test removed 14 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 290 rules applied. Total rules applied 449 place count 517 transition count 452
Discarding 77 places :
Symmetric choice reduction at 3 with 77 rule applications. Total rules 526 place count 440 transition count 375
Iterating global reduction 3 with 77 rules applied. Total rules applied 603 place count 440 transition count 375
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 603 place count 440 transition count 373
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 607 place count 438 transition count 373
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 771 place count 356 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 772 place count 356 transition count 290
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 773 place count 356 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 774 place count 355 transition count 289
Applied a total of 774 rules in 186 ms. Remains 355 /757 variables (removed 402) and now considering 289/670 (removed 381) transitions.
Finished structural reductions, in 1 iterations. Remains : 355/757 places, 289/670 transitions.
Incomplete random walk after 1000000 steps, including 15176 resets, run finished after 22139 ms. (steps per millisecond=45 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1721 resets, run finished after 3181 ms. (steps per millisecond=314 ) properties (out of 8) seen :0
Interrupted Best-First random walk after 835748 steps, including 2366 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2513 resets, run finished after 4627 ms. (steps per millisecond=216 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2541 resets, run finished after 4408 ms. (steps per millisecond=226 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2523 resets, run finished after 4194 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2268 resets, run finished after 4687 ms. (steps per millisecond=213 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2512 resets, run finished after 3966 ms. (steps per millisecond=252 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2437 resets, run finished after 4483 ms. (steps per millisecond=223 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 289 rows 355 cols
[2022-06-02 20:18:20] [INFO ] Computed 103 place invariants in 12 ms
[2022-06-02 20:18:20] [INFO ] [Real]Absence check using 71 positive place invariants in 14 ms returned sat
[2022-06-02 20:18:20] [INFO ] [Real]Absence check using 71 positive and 32 generalized place invariants in 6 ms returned sat
[2022-06-02 20:18:20] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-02 20:18:20] [INFO ] [Nat]Absence check using 71 positive place invariants in 16 ms returned sat
[2022-06-02 20:18:20] [INFO ] [Nat]Absence check using 71 positive and 32 generalized place invariants in 10 ms returned sat
[2022-06-02 20:18:21] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-06-02 20:18:21] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 0 ms to minimize.
[2022-06-02 20:18:21] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-06-02 20:18:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 1 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-06-02 20:18:22] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 0 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 0 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 0 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2022-06-02 20:18:23] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2000 ms
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2022-06-02 20:18:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 758 ms
[2022-06-02 20:18:24] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 0 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:18:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 752 ms
[2022-06-02 20:18:25] [INFO ] After 4752ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 435 ms.
[2022-06-02 20:18:26] [INFO ] After 5360ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 2150 ms.
Support contains 81 out of 355 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 355/355 places, 289/289 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 355 transition count 281
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 347 transition count 280
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 346 transition count 280
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 18 place count 346 transition count 263
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 58 place count 323 transition count 263
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 64 place count 317 transition count 257
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 317 transition count 257
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 124 place count 289 transition count 231
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 288 transition count 234
Applied a total of 126 rules in 50 ms. Remains 288 /355 variables (removed 67) and now considering 234/289 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 288/355 places, 234/289 transitions.
Incomplete random walk after 1000000 steps, including 22465 resets, run finished after 20159 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2956 resets, run finished after 3453 ms. (steps per millisecond=289 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 656208 steps, including 3243 resets, run timeout after 5001 ms. (steps per millisecond=131 ) properties seen 0
Incomplete Best-First random walk after 1000000 steps, including 4464 resets, run finished after 4438 ms. (steps per millisecond=225 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 837989 steps, including 3818 resets, run timeout after 5001 ms. (steps per millisecond=167 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4469 resets, run finished after 4450 ms. (steps per millisecond=224 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4474 resets, run finished after 4438 ms. (steps per millisecond=225 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 56642657 steps, run timeout after 138001 ms. (steps per millisecond=410 ) properties seen :{0=1, 2=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 56642657 steps, saw 6382905 distinct states, run finished after 138016 ms. (steps per millisecond=410 ) properties seen :5
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 234 rows 288 cols
[2022-06-02 20:21:33] [INFO ] Computed 95 place invariants in 7 ms
[2022-06-02 20:21:33] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:21:33] [INFO ] [Nat]Absence check using 70 positive place invariants in 13 ms returned sat
[2022-06-02 20:21:33] [INFO ] [Nat]Absence check using 70 positive and 25 generalized place invariants in 7 ms returned sat
[2022-06-02 20:21:33] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:21:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:21:33] [INFO ] After 122ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:21:33] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2022-06-02 20:21:34] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:21:34] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-06-02 20:21:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2022-06-02 20:21:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 336 ms
[2022-06-02 20:21:34] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-06-02 20:21:34] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 67 ms.
Support contains 59 out of 288 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 288/288 places, 234/234 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 288 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 286 transition count 232
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 286 transition count 225
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 277 transition count 225
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 47 place count 263 transition count 212
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 263 transition count 212
Applied a total of 48 rules in 29 ms. Remains 263 /288 variables (removed 25) and now considering 212/234 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 263/288 places, 212/234 transitions.
Incomplete random walk after 1000000 steps, including 29869 resets, run finished after 2293 ms. (steps per millisecond=436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7156 resets, run finished after 2681 ms. (steps per millisecond=372 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4446739 steps, run timeout after 12001 ms. (steps per millisecond=370 ) properties seen :{}
Probabilistic random walk after 4446739 steps, saw 687965 distinct states, run finished after 12001 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 263 cols
[2022-06-02 20:21:51] [INFO ] Computed 92 place invariants in 10 ms
[2022-06-02 20:21:51] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:21:51] [INFO ] [Nat]Absence check using 71 positive place invariants in 11 ms returned sat
[2022-06-02 20:21:51] [INFO ] [Nat]Absence check using 71 positive and 21 generalized place invariants in 4 ms returned sat
[2022-06-02 20:21:51] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:21:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:21:51] [INFO ] After 105ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2022-06-02 20:21:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 597 ms
[2022-06-02 20:21:52] [INFO ] After 794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 101 ms.
[2022-06-02 20:21:52] [INFO ] After 1143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 34 ms.
Support contains 59 out of 263 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 212/212 transitions.
Applied a total of 0 rules in 7 ms. Remains 263 /263 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 263/263 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 263/263 places, 212/212 transitions.
Applied a total of 0 rules in 8 ms. Remains 263 /263 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 263 cols
[2022-06-02 20:21:52] [INFO ] Computed 92 place invariants in 6 ms
[2022-06-02 20:21:52] [INFO ] Implicit Places using invariants in 148 ms returned [58, 60, 66, 68, 90, 225]
Discarding 6 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT only with invariants took 150 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 257/263 places, 211/212 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 256 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 256 transition count 207
Applied a total of 2 rules in 13 ms. Remains 256 /257 variables (removed 1) and now considering 207/211 (removed 4) transitions.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:21:52] [INFO ] Computed 87 place invariants in 3 ms
[2022-06-02 20:21:53] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:21:53] [INFO ] Computed 87 place invariants in 5 ms
[2022-06-02 20:21:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:21:53] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 256/263 places, 207/212 transitions.
Finished structural reductions, in 2 iterations. Remains : 256/263 places, 207/212 transitions.
Incomplete random walk after 1000000 steps, including 29859 resets, run finished after 2359 ms. (steps per millisecond=423 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7102 resets, run finished after 2749 ms. (steps per millisecond=363 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5188444 steps, run timeout after 15001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 5188444 steps, saw 819966 distinct states, run finished after 15001 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:13] [INFO ] Computed 87 place invariants in 1 ms
[2022-06-02 20:22:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:22:13] [INFO ] [Nat]Absence check using 69 positive place invariants in 11 ms returned sat
[2022-06-02 20:22:13] [INFO ] [Nat]Absence check using 69 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-02 20:22:13] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:22:13] [INFO ] After 102ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:13] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2022-06-02 20:22:13] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2022-06-02 20:22:14] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2022-06-02 20:22:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2022-06-02 20:22:14] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 94 ms.
[2022-06-02 20:22:14] [INFO ] After 666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 51 ms.
Support contains 59 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:14] [INFO ] Computed 87 place invariants in 2 ms
[2022-06-02 20:22:14] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:14] [INFO ] Computed 87 place invariants in 3 ms
[2022-06-02 20:22:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:22:14] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2022-06-02 20:22:14] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:14] [INFO ] Computed 87 place invariants in 2 ms
[2022-06-02 20:22:14] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 207/207 transitions.
Incomplete random walk after 1000000 steps, including 29858 resets, run finished after 2119 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7140 resets, run finished after 2593 ms. (steps per millisecond=385 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4479482 steps, run timeout after 12001 ms. (steps per millisecond=373 ) properties seen :{}
Probabilistic random walk after 4479482 steps, saw 715981 distinct states, run finished after 12001 ms. (steps per millisecond=373 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:31] [INFO ] Computed 87 place invariants in 2 ms
[2022-06-02 20:22:31] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:22:31] [INFO ] [Nat]Absence check using 69 positive place invariants in 10 ms returned sat
[2022-06-02 20:22:31] [INFO ] [Nat]Absence check using 69 positive and 18 generalized place invariants in 4 ms returned sat
[2022-06-02 20:22:31] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:22:31] [INFO ] After 103ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2022-06-02 20:22:31] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2022-06-02 20:22:32] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2022-06-02 20:22:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2022-06-02 20:22:32] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2022-06-02 20:22:32] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 59 out of 256 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 207/207 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 16 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:32] [INFO ] Computed 87 place invariants in 5 ms
[2022-06-02 20:22:32] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:32] [INFO ] Computed 87 place invariants in 2 ms
[2022-06-02 20:22:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:22:32] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2022-06-02 20:22:32] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:32] [INFO ] Computed 87 place invariants in 2 ms
[2022-06-02 20:22:32] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 207/207 transitions.
Applied a total of 0 rules in 19 ms. Remains 256 /256 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 207 rows 256 cols
[2022-06-02 20:22:32] [INFO ] Computed 87 place invariants in 3 ms
[2022-06-02 20:22:32] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:22:32] [INFO ] [Nat]Absence check using 69 positive place invariants in 15 ms returned sat
[2022-06-02 20:22:32] [INFO ] [Nat]Absence check using 69 positive and 18 generalized place invariants in 5 ms returned sat
[2022-06-02 20:22:33] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 0 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2022-06-02 20:22:33] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 0 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 1 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 0 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 0 ms to minimize.
[2022-06-02 20:22:34] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1193 ms
[2022-06-02 20:22:34] [INFO ] After 1436ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2022-06-02 20:22:34] [INFO ] After 1587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:22:34] [INFO ] Flatten gal took : 81 ms
[2022-06-02 20:22:34] [INFO ] Flatten gal took : 31 ms
[2022-06-02 20:22:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15955612353510916659.gal : 10 ms
[2022-06-02 20:22:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8980503243486068269.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15955612353510916659.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8980503243486068269.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8980503243486068269.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 54
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :54 after 84
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :84 after 1782
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1782 after 12348
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12348 after 34818
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :34818 after 43784
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :43784 after 54430
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :54430 after 96446
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :96446 after 401378
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :401378 after 1.63579e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.63579e+06 after 1.24485e+07
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,4.72541e+10,13.6039,348528,2,82317,19,1.26722e+06,7,0,1323,1.2577e+06,0
Total reachable state count : 47254132380

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-02 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-19-ReachabilityFireability-02,0,13.7149,348528,1,0,19,1.26722e+06,7,0,1389,1.2577e+06,0
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 359648 ms.

BK_STOP 1654201368676

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BusinessProcesses-PT-19, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918600471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;