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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.2K Apr 29 23:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 23:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 29 23:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:58 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.3K May 9 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 29 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 29 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:59 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 161K 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-17-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-17-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655083379058

Running Version 0
[2022-06-13 01:23:00] [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:23:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 01:23:00] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-06-13 01:23:00] [INFO ] Transformed 650 places.
[2022-06-13 01:23:00] [INFO ] Transformed 580 transitions.
[2022-06-13 01:23:00] [INFO ] Found NUPN structural information;
[2022-06-13 01:23:00] [INFO ] Parsed PT model containing 650 places and 580 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :3
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :1
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 11 properties.
// Phase 1: matrix 576 rows 646 cols
[2022-06-13 01:23:01] [INFO ] Computed 108 place invariants in 35 ms
[2022-06-13 01:23:01] [INFO ] [Real]Absence check using 62 positive place invariants in 41 ms returned sat
[2022-06-13 01:23:01] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 35 ms returned sat
[2022-06-13 01:23:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:02] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2022-06-13 01:23:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:02] [INFO ] [Nat]Absence check using 62 positive place invariants in 39 ms returned sat
[2022-06-13 01:23:02] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2022-06-13 01:23:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:03] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 4 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 1 ms to minimize.
[2022-06-13 01:23:03] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 1 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 0 ms to minimize.
[2022-06-13 01:23:04] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:05] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 127 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 0 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 125 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:06] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 145 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 129 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 0 ms to minimize.
[2022-06-13 01:23:07] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2022-06-13 01:23:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using 62 positive place invariants in 31 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:08] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-06-13 01:23:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:08] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:23:08] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 16 ms returned sat
[2022-06-13 01:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:09] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 0 ms to minimize.
[2022-06-13 01:23:09] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 1 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 4 ms to minimize.
[2022-06-13 01:23:10] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:11] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:12] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 129 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:13] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 1 ms to minimize.
[2022-06-13 01:23:13] [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:23:14] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:14] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:14] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 1 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 9 ms to minimize.
[2022-06-13 01:23:14] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:15] [INFO ] Deduced a trap composed of 136 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 3 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 3 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:16] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2975 ms
[2022-06-13 01:23:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using 62 positive place invariants in 29 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2022-06-13 01:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:17] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 0 ms to minimize.
[2022-06-13 01:23:17] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2022-06-13 01:23:18] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:19] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:20] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 137 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 130 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:21] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:22] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:23:22] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:22] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:23:22] [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:23:22] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:22] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2022-06-13 01:23:22] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:22] [INFO ] Deduced a trap composed of 138 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:23] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2022-06-13 01:23:24] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1822 ms
[2022-06-13 01:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 62 positive place invariants in 34 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2022-06-13 01:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:24] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:25] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2022-06-13 01:23:26] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1847 ms
[2022-06-13 01:23:26] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 43 ms.
[2022-06-13 01:23:29] [INFO ] Added : 337 causal constraints over 68 iterations in 2807 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-13 01:23:29] [INFO ] [Real]Absence check using 62 positive place invariants in 26 ms returned sat
[2022-06-13 01:23:29] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 17 ms returned sat
[2022-06-13 01:23:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:30] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2022-06-13 01:23:30] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2022-06-13 01:23:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 222 ms
[2022-06-13 01:23:30] [INFO ] [Real]Absence check using 62 positive place invariants in 32 ms returned sat
[2022-06-13 01:23:30] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 37 ms returned sat
[2022-06-13 01:23:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:32] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2022-06-13 01:23:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:32] [INFO ] [Nat]Absence check using 62 positive place invariants in 33 ms returned sat
[2022-06-13 01:23:32] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 31 ms returned sat
[2022-06-13 01:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:33] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2022-06-13 01:23:33] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2022-06-13 01:23:34] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2022-06-13 01:23:35] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2375 ms
[2022-06-13 01:23:35] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 33 ms.
[2022-06-13 01:23:37] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2022-06-13 01:23:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-13 01:23:37] [INFO ] [Real]Absence check using 62 positive place invariants in 34 ms returned sat
[2022-06-13 01:23:37] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 27 ms returned sat
[2022-06-13 01:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:38] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2022-06-13 01:23:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:38] [INFO ] [Nat]Absence check using 62 positive place invariants in 31 ms returned sat
[2022-06-13 01:23:38] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 20 ms returned sat
[2022-06-13 01:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:39] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-06-13 01:23:39] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2022-06-13 01:23:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 0 ms to minimize.
[2022-06-13 01:23:39] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2022-06-13 01:23:39] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 0 ms to minimize.
[2022-06-13 01:23:39] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2022-06-13 01:23:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1127 ms
[2022-06-13 01:23:40] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 36 ms.
[2022-06-13 01:23:43] [INFO ] Added : 349 causal constraints over 70 iterations in 2906 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-13 01:23:43] [INFO ] [Real]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:23:43] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2022-06-13 01:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:43] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 1 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 1 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:44] [INFO ] Deduced a trap composed of 21 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 1 ms to minimize.
[2022-06-13 01:23:45] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 9 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 120 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:46] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 1 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:47] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 1 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2022-06-13 01:23:48] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2022-06-13 01:23:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2022-06-13 01:23:48] [INFO ] [Real]Absence check using 62 positive place invariants in 12 ms returned unsat
[2022-06-13 01:23:48] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2022-06-13 01:23:48] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 11 ms returned sat
[2022-06-13 01:23:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:49] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:49] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 0 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 1 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:23:50] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 126 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 2 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 1 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Deduced a trap composed of 142 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:23:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2859 ms
[2022-06-13 01:23:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:52] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 10 ms returned sat
[2022-06-13 01:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:52] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-06-13 01:23:52] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:23:52] [INFO ] Deduced a trap composed of 137 places in 122 ms of which 1 ms to minimize.
[2022-06-13 01:23:52] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 1 ms to minimize.
[2022-06-13 01:23:52] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 1 ms to minimize.
[2022-06-13 01:23:52] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 0 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 139 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 136 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:23:53] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 2 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 130 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:23:54] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:23:55] [INFO ] Deduced a trap composed of 142 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:23:55] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2832 ms
[2022-06-13 01:23:55] [INFO ] Computed and/alt/rep : 540/880/540 causal constraints (skipped 35 transitions) in 32 ms.
[2022-06-13 01:23:57] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 3 ms to minimize.
[2022-06-13 01:23:57] [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 9
[2022-06-13 01:23:57] [INFO ] [Real]Absence check using 62 positive place invariants in 25 ms returned sat
[2022-06-13 01:23:57] [INFO ] [Real]Absence check using 62 positive and 46 generalized place invariants in 14 ms returned sat
[2022-06-13 01:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:57] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2022-06-13 01:23:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 01:23:57] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2022-06-13 01:23:57] [INFO ] [Nat]Absence check using 62 positive and 46 generalized place invariants in 12 ms returned sat
[2022-06-13 01:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 01:23:58] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-13 01:23:58] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2022-06-13 01:23:58] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2022-06-13 01:23:58] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:23:58] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2022-06-13 01:23:58] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 1 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 131 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:23:59] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 1 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 139 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 0 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 0 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 124 places in 117 ms of which 1 ms to minimize.
[2022-06-13 01:24:00] [INFO ] Deduced a trap composed of 126 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 141 places in 114 ms of which 0 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 0 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 1 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:24:01] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 0 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 0 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 127 places in 109 ms of which 0 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 1 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 143 places in 110 ms of which 1 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 0 ms to minimize.
[2022-06-13 01:24:02] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 1 ms to minimize.
[2022-06-13 01:24:02] [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-17-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 44200 steps, including 325 resets, run finished after 126 ms. (steps per millisecond=350 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 118 out of 646 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 646/646 places, 576/576 transitions.
Graph (complete) has 1312 edges and 646 vertex of which 642 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 642 transition count 516
Reduce places removed 59 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 71 rules applied. Total rules applied 131 place count 583 transition count 504
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 143 place count 571 transition count 504
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 143 place count 571 transition count 390
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 380 place count 448 transition count 390
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 444 place count 384 transition count 326
Iterating global reduction 3 with 64 rules applied. Total rules applied 508 place count 384 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 508 place count 384 transition count 325
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 510 place count 383 transition count 325
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 630 place count 323 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 631 place count 323 transition count 264
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 636 place count 323 transition count 264
Applied a total of 636 rules in 137 ms. Remains 323 /646 variables (removed 323) and now considering 264/576 (removed 312) transitions.
Finished structural reductions, in 1 iterations. Remains : 323/646 places, 264/576 transitions.
[2022-06-13 01:24:03] [INFO ] Flatten gal took : 58 ms
[2022-06-13 01:24:03] [INFO ] Flatten gal took : 25 ms
[2022-06-13 01:24:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4708715478541625207.gal : 14 ms
[2022-06-13 01:24:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8071447139656159421.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/ReachabilityCardinality4708715478541625207.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8071447139656159421.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/ReachabilityCardinality4708715478541625207.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8071447139656159421.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8071447139656159421.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :9 after 28
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :28 after 29
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :29 after 41
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :41 after 160
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :160 after 233
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :233 after 703
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :703 after 4023
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :4023 after 580560
Detected timeout of ITS tools.
[2022-06-13 01:24:18] [INFO ] Flatten gal took : 29 ms
[2022-06-13 01:24:18] [INFO ] Applying decomposition
[2022-06-13 01:24:18] [INFO ] Flatten gal took : 22 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/graph6869155868211798815.txt, -o, /tmp/graph6869155868211798815.bin, -w, /tmp/graph6869155868211798815.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/graph6869155868211798815.bin, -l, -1, -v, -w, /tmp/graph6869155868211798815.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 01:24:18] [INFO ] Decomposing Gal with order
[2022-06-13 01:24:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 01:24:18] [INFO ] Removed a total of 108 redundant transitions.
[2022-06-13 01:24:18] [INFO ] Flatten gal took : 62 ms
[2022-06-13 01:24:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 15 ms.
[2022-06-13 01:24:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16600160588387198779.gal : 11 ms
[2022-06-13 01:24:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7678587331016822577.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/ReachabilityCardinality16600160588387198779.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7678587331016822577.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/ReachabilityCardinality16600160588387198779.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7678587331016822577.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7678587331016822577.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :5 after 9
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :9 after 47
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :2.58066e+07 after 3.10758e+08
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-15 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-10 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :3.10758e+08 after 1.40521e+10
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-05 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1.40521e+10 after 1.79925e+10
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-14 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-12 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-11 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-03 is true.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-01 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-00 does not hold.
FORMULA BusinessProcesses-PT-17-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
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,7.56907e+10,0.894142,23280,2111,373,38353,4219,1050,57192,229,8944,0
Total reachable state count : 75690711111

Verifying 9 reachability properties.
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-00 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-17-ReachabilityFireability-00,1.19439e+08,0.909086,23544,168,103,38353,4219,1301,57192,282,8944,0
Invariant property BusinessProcesses-PT-17-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-17-ReachabilityFireability-01,2.98598e+08,0.950912,23544,188,104,38353,4219,1377,57192,296,8944,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-03 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-17-ReachabilityFireability-03,1.99066e+07,0.951686,23544,155,101,38353,4219,1379,57192,296,8944,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-05 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-17-ReachabilityFireability-05,8.95795e+07,0.952112,23544,169,102,38353,4219,1392,57192,296,8944,0
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-10 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-17-ReachabilityFireability-10,1.52617e+08,0.994809,23544,266,106,38353,4219,1557,57192,316,8944,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-11 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-17-ReachabilityFireability-11,1.99066e+07,1.0415,23544,169,94,38353,4219,1730,57192,329,8944,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-12 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-17-ReachabilityFireability-12,2.98598e+08,1.04205,23544,189,90,38353,4219,1730,57192,329,8944,0
Reachability property BusinessProcesses-PT-17-ReachabilityFireability-14 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-17-ReachabilityFireability-14,4.97664e+06,1.04274,23544,157,102,38353,4219,1731,57192,329,8944,0
Invariant property BusinessProcesses-PT-17-ReachabilityFireability-15 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-17-ReachabilityFireability-15,4.72781e+08,1.06017,23544,304,119,38353,4219,1752,57192,329,8944,0
All properties solved without resorting to model-checking.

BK_STOP 1655083460820

--------------------
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-17"
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-17, 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-165251936100171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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