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

--------------------
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 1655083443607

Running Version 0
[2022-06-13 01:24:05] [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:24:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:24:05] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-06-13 01:24:05] [INFO ] Transformed 772 places.
[2022-06-13 01:24:05] [INFO ] Transformed 685 transitions.
[2022-06-13 01:24:05] [INFO ] Found NUPN structural information;
[2022-06-13 01:24:05] [INFO ] Parsed PT model containing 772 places and 685 transitions in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 15 places in 15 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 61 ms. (steps per millisecond=163 ) 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 10000 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 670 rows 757 cols
[2022-06-13 01:24:05] [INFO ] Computed 125 place invariants in 50 ms
[2022-06-13 01:24:06] [INFO ] [Real]Absence check using 78 positive place invariants in 33 ms returned sat
[2022-06-13 01:24:06] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:06] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-06-13 01:24:06] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 5 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 4 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 0 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2022-06-13 01:24:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1398 ms
[2022-06-13 01:24:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 13 ms returned sat
[2022-06-13 01:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:08] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 0 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 0 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:24:08] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:24:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1029 ms
[2022-06-13 01:24:09] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 46 ms.
[2022-06-13 01:24:12] [INFO ] Added : 300 causal constraints over 60 iterations in 2846 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-13 01:24:12] [INFO ] [Real]Absence check using 78 positive place invariants in 35 ms returned sat
[2022-06-13 01:24:12] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:12] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-06-13 01:24:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:12] [INFO ] [Nat]Absence check using 78 positive place invariants in 30 ms returned sat
[2022-06-13 01:24:12] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2022-06-13 01:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:13] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 148 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:13] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 154 places in 168 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 152 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:24:14] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 1 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 0 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:15] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 0 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 0 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 0 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:24:16] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 0 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 154 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 1 ms to minimize.
[2022-06-13 01:24:17] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2022-06-13 01:24:17] [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 1
[2022-06-13 01:24:18] [INFO ] [Real]Absence check using 78 positive place invariants in 52 ms returned sat
[2022-06-13 01:24:18] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 40 ms returned sat
[2022-06-13 01:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:21] [INFO ] [Real]Absence check using state equation in 3084 ms returned sat
[2022-06-13 01:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:21] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2022-06-13 01:24:21] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 27 ms returned sat
[2022-06-13 01:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:22] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 0 ms to minimize.
[2022-06-13 01:24:22] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 183 places in 162 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 0 ms to minimize.
[2022-06-13 01:24:23] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 9 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:24:24] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 1 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 167 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:24:25] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:24:26] [INFO ] Deduced a trap composed of 165 places in 166 ms of which 4 ms to minimize.
[2022-06-13 01:24:26] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24: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 2
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using 78 positive place invariants in 29 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:26] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-06-13 01:24:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:26] [INFO ] [Nat]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 14 ms returned sat
[2022-06-13 01:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:27] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:24:27] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 1 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 176 places in 154 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 154 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:24:28] [INFO ] Deduced a trap composed of 170 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 0 ms to minimize.
[2022-06-13 01:24:29] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:24:30] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 150 places in 148 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:24:31] [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 3
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 19 ms returned sat
[2022-06-13 01:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:32] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-06-13 01:24:32] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:24:32] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 0 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 1 ms to minimize.
[2022-06-13 01:24:33] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 0 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 42 places in 86 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2022-06-13 01:24:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2115 ms
[2022-06-13 01:24:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:34] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2022-06-13 01:24:34] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2022-06-13 01:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:35] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2022-06-13 01:24:35] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:24:36] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:24:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1911 ms
[2022-06-13 01:24:37] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 37 ms.
[2022-06-13 01:24:39] [INFO ] Added : 245 causal constraints over 49 iterations in 2116 ms. Result :unknown
[2022-06-13 01:24:39] [INFO ] [Real]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-13 01:24:39] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:40] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:24:40] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 156 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 160 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 0 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 0 ms to minimize.
[2022-06-13 01:24:41] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 0 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 1 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 20 places in 156 ms of which 1 ms to minimize.
[2022-06-13 01:24:42] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 151 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:24:43] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 154 places in 139 ms of which 1 ms to minimize.
[2022-06-13 01:24:44] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:24:44] [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:24:44] [INFO ] [Real]Absence check using 78 positive place invariants in 30 ms returned sat
[2022-06-13 01:24:44] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 16 ms returned sat
[2022-06-13 01:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:45] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-06-13 01:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:45] [INFO ] [Nat]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-13 01:24:45] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:45] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-13 01:24:45] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 33 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 190 places in 162 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:24:46] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 0 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 162 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:47] [INFO ] Deduced a trap composed of 163 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:48] [INFO ] Deduced a trap composed of 175 places in 161 ms of which 1 ms to minimize.
[2022-06-13 01:24:48] [INFO ] Deduced a trap composed of 169 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:24:48] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2022-06-13 01:24:48] [INFO ] Deduced a trap composed of 163 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:24:48] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:24:49] [INFO ] Deduced a trap composed of 171 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:24:49] [INFO ] Deduced a trap composed of 184 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:49] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:24:49] [INFO ] Deduced a trap composed of 193 places in 166 ms of which 1 ms to minimize.
[2022-06-13 01:24:49] [INFO ] Deduced a trap composed of 178 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:24:50] [INFO ] Deduced a trap composed of 180 places in 157 ms of which 1 ms to minimize.
[2022-06-13 01:24:50] [INFO ] Deduced a trap composed of 164 places in 165 ms of which 0 ms to minimize.
[2022-06-13 01:24:50] [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 6
[2022-06-13 01:24:50] [INFO ] [Real]Absence check using 78 positive place invariants in 37 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 31 ms returned sat
[2022-06-13 01:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:51] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2022-06-13 01:24:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:51] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2022-06-13 01:24:51] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 21 ms returned sat
[2022-06-13 01:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:51] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2022-06-13 01:24:51] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:24:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 767 ms
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using 78 positive place invariants in 18 ms returned unsat
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using 78 positive place invariants in 32 ms returned sat
[2022-06-13 01:24:52] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2022-06-13 01:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:53] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:24:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 707 ms
[2022-06-13 01:24:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:53] [INFO ] [Nat]Absence check using 78 positive place invariants in 31 ms returned sat
[2022-06-13 01:24:54] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 15 ms returned sat
[2022-06-13 01:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:54] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:24:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 606 ms
[2022-06-13 01:24:54] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 46 ms.
[2022-06-13 01:24:57] [INFO ] Added : 242 causal constraints over 49 iterations in 2296 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-13 01:24:57] [INFO ] [Real]Absence check using 78 positive place invariants in 39 ms returned sat
[2022-06-13 01:24:57] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2022-06-13 01:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:24:57] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 16 places in 199 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:24:58] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 0 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2022-06-13 01:24:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1422 ms
[2022-06-13 01:24:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:24:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 39 ms returned sat
[2022-06-13 01:24:59] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 22 ms returned sat
[2022-06-13 01:24:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:25:00] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 0 ms to minimize.
[2022-06-13 01:25:00] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 1 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 0 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 0 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:25:01] [INFO ] Deduced a trap composed of 144 places in 163 ms of which 0 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 1 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 145 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 1 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 33 places in 170 ms of which 0 ms to minimize.
[2022-06-13 01:25:02] [INFO ] Deduced a trap composed of 137 places in 192 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 134 places in 159 ms of which 0 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 0 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 142 places in 169 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 1 ms to minimize.
[2022-06-13 01:25:03] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 1 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 0 ms to minimize.
[2022-06-13 01:25:04] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4022 ms
[2022-06-13 01:25:04] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 41 ms.
[2022-06-13 01:25:04] [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 10
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 25500 steps, including 157 resets, run finished after 86 ms. (steps per millisecond=296 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 31700 steps, including 200 resets, run finished after 93 ms. (steps per millisecond=340 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22800 steps, including 132 resets, run finished after 64 ms. (steps per millisecond=356 ) properties (out of 9) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 100 out of 757 places. Attempting structural reductions.
Starting structural reductions, 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.6 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 748 transition count 586
Reduce places removed 83 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 93 rules applied. Total rules applied 177 place count 665 transition count 576
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 187 place count 655 transition count 576
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 148 Pre rules applied. Total rules applied 187 place count 655 transition count 428
Deduced a syphon composed of 148 places in 3 ms
Ensure Unique test removed 17 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 3 with 313 rules applied. Total rules applied 500 place count 490 transition count 428
Discarding 87 places :
Symmetric choice reduction at 3 with 87 rule applications. Total rules 587 place count 403 transition count 341
Iterating global reduction 3 with 87 rules applied. Total rules applied 674 place count 403 transition count 341
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 674 place count 403 transition count 338
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 681 place count 399 transition count 338
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 863 place count 307 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 864 place count 307 transition count 247
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 865 place count 307 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 866 place count 306 transition count 246
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 867 place count 306 transition count 246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 868 place count 305 transition count 245
Applied a total of 868 rules in 178 ms. Remains 305 /757 variables (removed 452) and now considering 245/670 (removed 425) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/757 places, 245/670 transitions.
[2022-06-13 01:25:05] [INFO ] Flatten gal took : 56 ms
[2022-06-13 01:25:05] [INFO ] Flatten gal took : 37 ms
[2022-06-13 01:25:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16633896690402871551.gal : 16 ms
[2022-06-13 01:25:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9178270235266539724.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/ReachabilityCardinality16633896690402871551.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9178270235266539724.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/ReachabilityCardinality16633896690402871551.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9178270235266539724.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9178270235266539724.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 28
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :28 after 336
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :336 after 420
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :420 after 706
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :706 after 55828
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :55828 after 8.3614e+06
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :8.3614e+06 after 8.47969e+06
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :8.47969e+06 after 8.80197e+06
Detected timeout of ITS tools.
[2022-06-13 01:25:20] [INFO ] Flatten gal took : 22 ms
[2022-06-13 01:25:20] [INFO ] Applying decomposition
[2022-06-13 01:25:20] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7518818168065325565.txt, -o, /tmp/graph7518818168065325565.bin, -w, /tmp/graph7518818168065325565.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7518818168065325565.bin, -l, -1, -v, -w, /tmp/graph7518818168065325565.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:25:20] [INFO ] Decomposing Gal with order
[2022-06-13 01:25:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:25:20] [INFO ] Removed a total of 242 redundant transitions.
[2022-06-13 01:25:20] [INFO ] Flatten gal took : 59 ms
[2022-06-13 01:25:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 15 ms.
[2022-06-13 01:25:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11678372434726003475.gal : 9 ms
[2022-06-13 01:25:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16300794875983277390.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/ReachabilityCardinality11678372434726003475.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16300794875983277390.prop, --nowitness], 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/ReachabilityCardinality11678372434726003475.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16300794875983277390.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16300794875983277390.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :4 after 8
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :8 after 84
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :496 after 1.86717e+06
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-00 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :1.86717e+06 after 5.25808e+07
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-15 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :5.25808e+07 after 8.79599e+07
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-08 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-07 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-03 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-01 does not hold.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :8.79599e+07 after 9.85747e+11
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-06 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.44251e+12 after 8.45658e+12
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\_mod\_flat,2.00616e+13,1.90086,40636,1833,147,64258,4260,1231,111879,138,8955,0
Total reachable state count : 20061636674080

Verifying 8 reachability properties.
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-00 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-00,7.83821e+07,1.90488,40900,153,44,64258,4260,1242,111879,142,8955,181
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-01 does not hold.

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-01,3.35923e+06,1.90532,40900,141,36,64258,4260,1246,111879,143,8955,181
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-02 is true.
FORMULA BusinessProcesses-PT-19-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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,1.93833,40900,1,0,64258,4260,1420,111879,155,8955,9171
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-03 does not hold.

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-03,2.8233e+09,1.93895,40900,181,53,64258,4260,1424,111879,155,8955,9171
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-06 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-06,1.34369e+07,1.93986,40900,142,40,64258,4260,1485,111879,155,8955,9221
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-07 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-07,3.52719e+08,1.94059,40900,154,43,64258,4260,1516,111879,157,8955,9317
Invariant property BusinessProcesses-PT-19-ReachabilityFireability-08 does not hold.

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-08,4.80673e+10,1.94328,40900,548,81,64258,4260,1529,111879,157,8955,9693
Reachability property BusinessProcesses-PT-19-ReachabilityFireability-15 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-15,25920,1.94873,40900,139,37,64258,4260,1625,111879,157,8955,12105
All properties solved without resorting to model-checking.

BK_STOP 1655083523659

--------------------
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-19"
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-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 r028-tall-165251936200177"
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 ;