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.r089-tall-165260117600075.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 DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 29 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K 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 DoubleExponent-PT-010-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068516849

Running Version 0
[2022-06-12 21:15:18] [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-12 21:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:15:18] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2022-06-12 21:15:18] [INFO ] Transformed 534 places.
[2022-06-12 21:15:18] [INFO ] Transformed 498 transitions.
[2022-06-12 21:15:18] [INFO ] Parsed PT model containing 534 places and 498 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 88 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 335 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Probabilistic random walk after 1000001 steps, saw 500065 distinct states, run finished after 6638 ms. (steps per millisecond=150 ) properties seen :{}
Running SMT prover for 16 properties.
// Phase 1: matrix 498 rows 534 cols
[2022-06-12 21:15:25] [INFO ] Computed 54 place invariants in 66 ms
[2022-06-12 21:15:25] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-12 21:15:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 21 ms returned sat
[2022-06-12 21:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:26] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2022-06-12 21:15:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-06-12 21:15:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2022-06-12 21:15:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:26] [INFO ] [Nat]Absence check using state equation in 569 ms returned sat
[2022-06-12 21:15:27] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2022-06-12 21:15:27] [INFO ] Deduced a trap composed of 108 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:15:27] [INFO ] Deduced a trap composed of 113 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:15:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2022-06-12 21:15:27] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2022-06-12 21:15: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 0
[2022-06-12 21:15:31] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2022-06-12 21:15:31] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-06-12 21:15:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:31] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-06-12 21:15:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 34 ms.
[2022-06-12 21:15:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:31] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:31] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-06-12 21:15:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 21:15:33] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-06-12 21:15:33] [INFO ] Added : 179 causal constraints over 36 iterations in 2051 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:15:33] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:33] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-06-12 21:15:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:34] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-06-12 21:15:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:34] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2022-06-12 21:15:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:34] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-06-12 21:15:34] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2022-06-12 21:15:34] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:15:34] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:15:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 527 ms
[2022-06-12 21:15:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 31 ms.
[2022-06-12 21:15:38] [INFO ] Deduced a trap composed of 227 places in 125 ms of which 1 ms to minimize.
[2022-06-12 21:15:38] [INFO ] Deduced a trap composed of 172 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:15:39] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:15:39] [INFO ] Deduced a trap composed of 201 places in 134 ms of which 0 ms to minimize.
[2022-06-12 21:15:39] [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-12 21:15:39] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:39] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2022-06-12 21:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:39] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2022-06-12 21:15:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:39] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:39] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 130 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 101 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 103 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:15:40] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Deduced a trap composed of 41 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:15:41] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1605 ms
[2022-06-12 21:15:41] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-12 21:15:44] [INFO ] Added : 175 causal constraints over 35 iterations in 3075 ms. Result :unknown
[2022-06-12 21:15:44] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:44] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2022-06-12 21:15:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:44] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 184 places in 125 ms of which 2 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2022-06-12 21:15:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:45] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:45] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 184 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 193 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:15:45] [INFO ] Deduced a trap composed of 191 places in 126 ms of which 1 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 228 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 225 places in 134 ms of which 1 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 222 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 205 places in 122 ms of which 1 ms to minimize.
[2022-06-12 21:15:46] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 233 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 209 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 208 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 194 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 238 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:15:47] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 212 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 208 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 195 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 220 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 224 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:15:48] [INFO ] Deduced a trap composed of 238 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 207 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 208 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 161 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 218 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:15:49] [INFO ] Deduced a trap composed of 242 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 215 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:15:50] [INFO ] Deduced a trap composed of 219 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:15: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 4
[2022-06-12 21:15:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2022-06-12 21:15:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:50] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:50] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-06-12 21:15:50] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-12 21:15:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:50] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:15:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:50] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-06-12 21:15:50] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:15:52] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:15:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2022-06-12 21:15:52] [INFO ] Added : 179 causal constraints over 36 iterations in 2038 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:15:53] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:15:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-06-12 21:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:53] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 215 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:15:53] [INFO ] Deduced a trap composed of 222 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 202 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 222 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 231 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 246 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 229 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Deduced a trap composed of 156 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:15:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1474 ms
[2022-06-12 21:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:15:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 25 ms returned sat
[2022-06-12 21:15:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 25 ms returned sat
[2022-06-12 21:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:15:55] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:15:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2022-06-12 21:15:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-06-12 21:15:59] [INFO ] Added : 355 causal constraints over 71 iterations in 4354 ms. Result :unknown
[2022-06-12 21:15:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:15:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2022-06-12 21:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:00] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-06-12 21:16:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:16:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:00] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:16:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:00] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-06-12 21:16:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2022-06-12 21:16:05] [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 8
[2022-06-12 21:16:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:05] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-06-12 21:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:05] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 227 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2022-06-12 21:16:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-12 21:16:05] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-06-12 21:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:06] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 227 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2022-06-12 21:16:06] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:11] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-06-12 21:16:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 214 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 189 places in 129 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 210 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 221 places in 131 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1909 ms
[2022-06-12 21:16:13] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2022-06-12 21:16:16] [INFO ] Added : 249 causal constraints over 50 iterations in 2812 ms. Result :unknown
[2022-06-12 21:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2022-06-12 21:16:16] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:16] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2022-06-12 21:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:16] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2022-06-12 21:16:16] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:16:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:16] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2022-06-12 21:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:17] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-06-12 21:16:17] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2022-06-12 21:16:21] [INFO ] Added : 390 causal constraints over 78 iterations in 4662 ms. Result :unknown
[2022-06-12 21:16:21] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-12 21:16:21] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2022-06-12 21:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-06-12 21:16:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 92 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1374 ms
[2022-06-12 21:16:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [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 14
[2022-06-12 21:16:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:27] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned unsat
FORMULA DoubleExponent-PT-010-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 16 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 120800 steps, including 4552 resets, run finished after 224 ms. (steps per millisecond=539 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5041100 steps, including 176653 resets, run finished after 8314 ms. (steps per millisecond=606 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 9954300 steps, including 351969 resets, run finished after 15114 ms. (steps per millisecond=658 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 111100 steps, including 3896 resets, run finished after 166 ms. (steps per millisecond=669 ) properties (out of 12) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12148200 steps, including 425485 resets, run finished after 19298 ms. (steps per millisecond=629 ) properties (out of 12) seen :0 could not realise parikh vector
Support contains 140 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 529 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 528 transition count 471
Reduce places removed 26 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 47 rules applied. Total rules applied 76 place count 502 transition count 450
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 97 place count 481 transition count 450
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 97 place count 481 transition count 427
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 143 place count 458 transition count 427
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 227 place count 416 transition count 385
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 237 place count 411 transition count 385
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 411 transition count 384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 410 transition count 384
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 268 place count 410 transition count 355
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 297 place count 381 transition count 355
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 319 place count 381 transition count 355
Applied a total of 319 rules in 169 ms. Remains 381 /534 variables (removed 153) and now considering 355/498 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 381/534 places, 355/498 transitions.
[2022-06-12 21:17:10] [INFO ] Flatten gal took : 57 ms
[2022-06-12 21:17:10] [INFO ] Flatten gal took : 24 ms
[2022-06-12 21:17:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18300854090589765061.gal : 14 ms
[2022-06-12 21:17:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15942066929996977611.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/ReachabilityCardinality18300854090589765061.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15942066929996977611.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/ReachabilityCardinality18300854090589765061.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15942066929996977611.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15942066929996977611.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :4 after 6
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :6 after 9
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :9 after 17
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :17 after 34
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :34 after 64
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :64 after 131
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :131 after 863
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :863 after 3184
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :3184 after 193957
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :193957 after 1.02131e+06
Reachability property DoubleExponent-PT-010-ReachabilityFireability-11 is true.
FORMULA DoubleExponent-PT-010-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property DoubleExponent-PT-010-ReachabilityFireability-06 does not hold.
FORMULA DoubleExponent-PT-010-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Detected timeout of ITS tools.
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:17:26] [INFO ] Applying decomposition
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 20 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/graph12299985481293230906.txt, -o, /tmp/graph12299985481293230906.bin, -w, /tmp/graph12299985481293230906.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/graph12299985481293230906.bin, -l, -1, -v, -w, /tmp/graph12299985481293230906.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:26] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:26] [INFO ] Removed a total of 126 redundant transitions.
[2022-06-12 21:17:26] [INFO ] Flatten gal took : 63 ms
[2022-06-12 21:17:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 17 ms.
[2022-06-12 21:17:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2286822174690078252.gal : 10 ms
[2022-06-12 21:17:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12844743142759783382.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/ReachabilityCardinality2286822174690078252.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12844743142759783382.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/ReachabilityCardinality2286822174690078252.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12844743142759783382.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12844743142759783382.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :1 after 11
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :11 after 22
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :22 after 66
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :66 after 127
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :127 after 1778
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14418236478630025774
[2022-06-12 21:17:41] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14418236478630025774
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14418236478630025774]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14418236478630025774] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14418236478630025774] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 50862 resets, run finished after 1468 ms. (steps per millisecond=681 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40469 resets, run finished after 1170 ms. (steps per millisecond=854 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40386 resets, run finished after 1047 ms. (steps per millisecond=955 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000001 steps, including 40429 resets, run finished after 1183 ms. (steps per millisecond=845 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40275 resets, run finished after 1161 ms. (steps per millisecond=861 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 48778 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40399 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40419 resets, run finished after 1053 ms. (steps per millisecond=949 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40361 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40301 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000000 steps, including 40326 resets, run finished after 1382 ms. (steps per millisecond=723 ) properties (out of 10) seen :0
Probably explored full state space saw : 1570551 states, properties seen :{}
Probabilistic random walk after 3141417 steps, saw 1570551 distinct states, run finished after 16383 ms. (steps per millisecond=191 ) properties seen :{}
Interrupted probabilistic random walk after 5245628 steps, run timeout after 30001 ms. (steps per millisecond=174 ) properties seen :{1=1}
Exhaustive walk after 5245628 steps, saw 2623203 distinct states, run finished after 30002 ms. (steps per millisecond=174 ) properties seen :{1=1}
FORMULA DoubleExponent-PT-010-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
Running SMT prover for 9 properties.
// Phase 1: matrix 355 rows 381 cols
[2022-06-12 21:18:41] [INFO ] Computed 50 place invariants in 33 ms
[2022-06-12 21:18:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:41] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:41] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-06-12 21:18:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:41] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2022-06-12 21:18:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:42] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2022-06-12 21:18:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-06-12 21:18:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 11 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 74 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 59 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 67 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 71 places in 30 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 611 ms
[2022-06-12 21:18:42] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-06-12 21:18:48] [INFO ] Added : 353 causal constraints over 72 iterations in 5345 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:18:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:48] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2022-06-12 21:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:48] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:18:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 547 ms
[2022-06-12 21:18:49] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 19 ms.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2022-06-12 21:18:51] [INFO ] Added : 240 causal constraints over 48 iterations in 2574 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 21:18:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:52] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Real]Added 11 Read/Feed constraints in 8 ms returned sat
[2022-06-12 21:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:52] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-06-12 21:18:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:18:52] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 3 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:18:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 607 ms
[2022-06-12 21:18:53] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:18:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2022-06-12 21:18:57] [INFO ] Added : 353 causal constraints over 71 iterations in 4316 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:18:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:18:57] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:57] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-06-12 21:18:57] [INFO ] [Real]Added 11 Read/Feed constraints in 16 ms returned sat
[2022-06-12 21:18:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:18:57] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:18:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:58] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:18:58] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 63 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:18:58] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:18:59] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:18:59] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 940 ms
[2022-06-12 21:18:59] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 21 ms.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2022-06-12 21:19:03] [INFO ] Added : 347 causal constraints over 70 iterations in 4561 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:19:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:03] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2022-06-12 21:19:03] [INFO ] [Real]Added 11 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:04] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2022-06-12 21:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:04] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2022-06-12 21:19:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 9 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 79 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 79 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 74 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 586 ms
[2022-06-12 21:19:04] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:19:09] [INFO ] Deduced a trap composed of 78 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1050 ms
[2022-06-12 21:19:10] [INFO ] Added : 351 causal constraints over 71 iterations in 5274 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:19:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:10] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Real]Added 11 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:19:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:10] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-12 21:19:10] [INFO ] [Nat]Added 11 Read/Feed constraints in 14 ms returned sat
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 169 ms
[2022-06-12 21:19:10] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 861 ms
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-06-12 21:19:15] [INFO ] Added : 349 causal constraints over 70 iterations in 4660 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:19:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:15] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Real]Added 11 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:19:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:15] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-06-12 21:19:15] [INFO ] [Nat]Added 11 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 79 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 78 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 74 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Deduced a trap composed of 71 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:19:16] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 435 ms
[2022-06-12 21:19:16] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 23 ms.
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-12 21:19:20] [INFO ] Added : 351 causal constraints over 71 iterations in 4056 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:20] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Real]Added 11 Read/Feed constraints in 13 ms returned sat
[2022-06-12 21:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:20] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-12 21:19:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 13 ms returned sat
[2022-06-12 21:19:20] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 9 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:19:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 617 ms
[2022-06-12 21:19:21] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:19:26] [INFO ] Added : 353 causal constraints over 72 iterations in 4693 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 135 ms.
[2022-06-12 21:19:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:19:26] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2022-06-12 21:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:26] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-06-12 21:19:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:19:26] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-06-12 21:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:27] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2022-06-12 21:19:27] [INFO ] [Nat]Added 11 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:19:27] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:19:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 663 ms
[2022-06-12 21:19:28] [INFO ] Computed and/alt/rep : 354/1005/354 causal constraints (skipped 0 transitions) in 19 ms.
[2022-06-12 21:19:32] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:19:32] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:19:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2022-06-12 21:19:32] [INFO ] Added : 337 causal constraints over 69 iterations in 4275 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 4455000 steps, including 243641 resets, run finished after 6017 ms. (steps per millisecond=740 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 293800 steps, including 16060 resets, run finished after 376 ms. (steps per millisecond=781 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12636300 steps, including 705288 resets, run finished after 16851 ms. (steps per millisecond=749 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3571000 steps, including 196616 resets, run finished after 4678 ms. (steps per millisecond=763 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11778300 steps, including 657528 resets, run finished after 15776 ms. (steps per millisecond=746 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2982100 steps, including 164124 resets, run finished after 3913 ms. (steps per millisecond=762 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6850400 steps, including 382308 resets, run finished after 9197 ms. (steps per millisecond=744 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11356500 steps, including 633877 resets, run finished after 15220 ms. (steps per millisecond=746 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 814800 steps, including 45507 resets, run finished after 1062 ms. (steps per millisecond=767 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 110 out of 381 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 381/381 places, 355/355 transitions.
Graph (complete) has 902 edges and 381 vertex of which 380 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 380 transition count 351
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 377 transition count 348
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 374 transition count 348
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 374 transition count 346
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 372 transition count 346
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 363 transition count 337
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 363 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 38 place count 362 transition count 336
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 44 place count 362 transition count 330
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 50 place count 356 transition count 330
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 54 place count 356 transition count 330
Applied a total of 54 rules in 91 ms. Remains 356 /381 variables (removed 25) and now considering 330/355 (removed 25) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/381 places, 330/355 transitions.
[2022-06-12 21:20:45] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:20:45] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:20:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8233174400171598594.gal : 2 ms
[2022-06-12 21:20:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12127076322505996035.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/ReachabilityCardinality8233174400171598594.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12127076322505996035.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/ReachabilityCardinality8233174400171598594.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12127076322505996035.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12127076322505996035.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :7 after 14
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :14 after 18
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :18 after 42
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :42 after 74
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :74 after 180
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :180 after 1036
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1036 after 2785
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :2785 after 86179
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :86179 after 269437
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :269437 after 686790
Detected timeout of ITS tools.
[2022-06-12 21:21:00] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:21:00] [INFO ] Applying decomposition
[2022-06-12 21:21:00] [INFO ] Flatten gal took : 15 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/graph14536428921817722178.txt, -o, /tmp/graph14536428921817722178.bin, -w, /tmp/graph14536428921817722178.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/graph14536428921817722178.bin, -l, -1, -v, -w, /tmp/graph14536428921817722178.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:21:00] [INFO ] Decomposing Gal with order
[2022-06-12 21:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:21:00] [INFO ] Removed a total of 115 redundant transitions.
[2022-06-12 21:21:00] [INFO ] Flatten gal took : 42 ms
[2022-06-12 21:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2022-06-12 21:21:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13041988286916717559.gal : 4 ms
[2022-06-12 21:21:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1260281053755800543.prop : 2 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/ReachabilityCardinality13041988286916717559.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1260281053755800543.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/ReachabilityCardinality13041988286916717559.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1260281053755800543.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1260281053755800543.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 18
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :18 after 30
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :30 after 71
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :71 after 122
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :122 after 363
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :363 after 814
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :814 after 1821
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14896497134013267800
[2022-06-12 21:21:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14896497134013267800
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14896497134013267800]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14896497134013267800] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14896497134013267800] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 55541 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43169 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43113 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43013 resets, run finished after 1152 ms. (steps per millisecond=868 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 57141 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43148 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43155 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43068 resets, run finished after 1000 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43030 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43160 resets, run finished after 1404 ms. (steps per millisecond=712 ) properties (out of 9) seen :0
Probably explored full state space saw : 678170 states, properties seen :{}
Probabilistic random walk after 1356381 steps, saw 678170 distinct states, run finished after 6902 ms. (steps per millisecond=196 ) properties seen :{}
Interrupted probabilistic random walk after 5488139 steps, run timeout after 30001 ms. (steps per millisecond=182 ) properties seen :{}
Exhaustive walk after 5488139 steps, saw 2744422 distinct states, run finished after 30001 ms. (steps per millisecond=182 ) properties seen :{}
Running SMT prover for 9 properties.
// Phase 1: matrix 330 rows 356 cols
[2022-06-12 21:22:05] [INFO ] Computed 50 place invariants in 33 ms
[2022-06-12 21:22:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:05] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2022-06-12 21:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:05] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-12 21:22:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:22:05] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2022-06-12 21:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:05] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2022-06-12 21:22:05] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-12 21:22:05] [INFO ] [Nat]Added 17 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:22:05] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 55 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Deduced a trap composed of 63 places in 33 ms of which 1 ms to minimize.
[2022-06-12 21:22:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 833 ms
[2022-06-12 21:22:06] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 17 ms.
[2022-06-12 21:22:10] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:22:10] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:22:10] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:22:10] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:22:11] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:22:11] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:22:11] [INFO ] Deduced a trap composed of 97 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:22:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 729 ms
[2022-06-12 21:22:11] [INFO ] Added : 325 causal constraints over 65 iterations in 4788 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:22:11] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:11] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2022-06-12 21:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:11] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-06-12 21:22:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:22:11] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2022-06-12 21:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:11] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-06-12 21:22:12] [INFO ] [Nat]Added 17 Read/Feed constraints in 26 ms returned sat
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:22:12] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:22:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 491 ms
[2022-06-12 21:22:12] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 18 ms.
[2022-06-12 21:22:16] [INFO ] Added : 325 causal constraints over 66 iterations in 3919 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:22:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:16] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Real]Added 17 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:22:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:16] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-12 21:22:16] [INFO ] [Nat]Added 17 Read/Feed constraints in 8 ms returned sat
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 70 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 80 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Deduced a trap composed of 77 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:22:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 476 ms
[2022-06-12 21:22:17] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 19 ms.
[2022-06-12 21:22:21] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:22:21] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:22:21] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:22:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 411 ms
[2022-06-12 21:22:21] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:22:21] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 369 ms
[2022-06-12 21:22:22] [INFO ] Added : 328 causal constraints over 66 iterations in 4783 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 21:22:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:22] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Real]Added 17 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:22] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-12 21:22:22] [INFO ] [Nat]Added 17 Read/Feed constraints in 16 ms returned sat
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 123 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 127 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:22] [INFO ] Deduced a trap composed of 121 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 129 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 128 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 136 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 127 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 139 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 126 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:23] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 148 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 142 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 149 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 132 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 125 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 123 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:24] [INFO ] Deduced a trap composed of 109 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 108 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 106 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 128 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 3206 ms
[2022-06-12 21:22:25] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 16 ms.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 357 ms
[2022-06-12 21:22:29] [INFO ] Added : 324 causal constraints over 67 iterations in 4075 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:22:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Real]Added 17 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:22:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:30] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-06-12 21:22:30] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 127 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:30] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:22:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 664 ms
[2022-06-12 21:22:31] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 17 ms.
[2022-06-12 21:22:34] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:22:34] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:22:34] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:22:35] [INFO ] Deduced a trap composed of 70 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:22:35] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:22:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 481 ms
[2022-06-12 21:22:35] [INFO ] Added : 324 causal constraints over 65 iterations in 4120 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:22:35] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:35] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Real]Added 17 Read/Feed constraints in 20 ms returned sat
[2022-06-12 21:22:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:35] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-06-12 21:22:35] [INFO ] [Nat]Added 17 Read/Feed constraints in 19 ms returned sat
[2022-06-12 21:22:35] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:22:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-06-12 21:22:35] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 17 ms.
[2022-06-12 21:22:39] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:39] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:39] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:39] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:39] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:22:40] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:22:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 704 ms
[2022-06-12 21:22:40] [INFO ] Added : 324 causal constraints over 65 iterations in 4362 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:22:40] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:40] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Real]Added 17 Read/Feed constraints in 12 ms returned sat
[2022-06-12 21:22:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:40] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-12 21:22:40] [INFO ] [Nat]Added 17 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:22:40] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:22:40] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:40] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:40] [INFO ] Deduced a trap composed of 126 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 126 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 118 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 113 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 120 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:22:41] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 123 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 128 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 133 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 166 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 101 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 131 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:42] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2255 ms
[2022-06-12 21:22:42] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 16 ms.
[2022-06-12 21:22:46] [INFO ] Added : 326 causal constraints over 66 iterations in 3634 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:22:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:46] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Real]Added 17 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:22:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:46] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-06-12 21:22:46] [INFO ] [Nat]Added 17 Read/Feed constraints in 16 ms returned sat
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 116 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 128 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 124 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 139 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 137 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 126 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 148 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:47] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 122 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 138 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 124 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 121 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 132 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 144 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 0 ms to minimize.
[2022-06-12 21:22:48] [INFO ] Deduced a trap composed of 129 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 135 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 138 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 121 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:22:49] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2637 ms
[2022-06-12 21:22:49] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 22 ms.
[2022-06-12 21:22:53] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:22:54] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2022-06-12 21:22:54] [INFO ] Added : 327 causal constraints over 67 iterations in 4623 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-06-12 21:22:54] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:54] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2022-06-12 21:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:54] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-12 21:22:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:22:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-12 21:22:54] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2022-06-12 21:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:22:54] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-12 21:22:54] [INFO ] [Nat]Added 17 Read/Feed constraints in 18 ms returned sat
[2022-06-12 21:22:54] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:22:54] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:22:54] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:22:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 774 ms
[2022-06-12 21:22:55] [INFO ] Computed and/alt/rep : 328/1033/328 causal constraints (skipped 1 transitions) in 15 ms.
[2022-06-12 21:22:57] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:22:57] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-06-12 21:22:57] [INFO ] Added : 220 causal constraints over 44 iterations in 2366 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
Incomplete Parikh walk after 3177900 steps, including 205139 resets, run finished after 4351 ms. (steps per millisecond=730 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1070600 steps, including 69058 resets, run finished after 1452 ms. (steps per millisecond=737 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7385200 steps, including 454121 resets, run finished after 10101 ms. (steps per millisecond=731 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2224800 steps, including 137042 resets, run finished after 2999 ms. (steps per millisecond=741 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15719900 steps, including 1014715 resets, run finished after 21282 ms. (steps per millisecond=738 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2083300 steps, including 128313 resets, run finished after 2815 ms. (steps per millisecond=740 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5887800 steps, including 379912 resets, run finished after 8012 ms. (steps per millisecond=734 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4156800 steps, including 267889 resets, run finished after 5615 ms. (steps per millisecond=740 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 935400 steps, including 60324 resets, run finished after 1258 ms. (steps per millisecond=743 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 110 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 330/330 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 330/330 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 330/330 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 330/330 transitions.
Applied a total of 0 rules in 13 ms. Remains 356 /356 variables (removed 0) and now considering 330/330 (removed 0) transitions.
// Phase 1: matrix 330 rows 356 cols
[2022-06-12 21:23:55] [INFO ] Computed 50 place invariants in 31 ms
[2022-06-12 21:23:56] [INFO ] Implicit Places using invariants in 215 ms returned [39, 65, 72, 103, 111, 141, 150, 285, 307, 346]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 217 ms to find 10 implicit places.
[2022-06-12 21:23:56] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 330 rows 346 cols
[2022-06-12 21:23:56] [INFO ] Computed 40 place invariants in 17 ms
[2022-06-12 21:23:56] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Starting structural reductions, iteration 1 : 346/356 places, 330/330 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 346 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 345 transition count 329
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 345 transition count 329
Applied a total of 5 rules in 28 ms. Remains 345 /346 variables (removed 1) and now considering 329/330 (removed 1) transitions.
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:23:56] [INFO ] Computed 40 place invariants in 14 ms
[2022-06-12 21:23:56] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:23:56] [INFO ] Computed 40 place invariants in 20 ms
[2022-06-12 21:23:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-12 21:23:57] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 345/356 places, 329/330 transitions.
[2022-06-12 21:23:57] [INFO ] Flatten gal took : 16 ms
[2022-06-12 21:23:57] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:23:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6654187987066365668.gal : 2 ms
[2022-06-12 21:23:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7304205406475260903.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/ReachabilityCardinality6654187987066365668.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7304205406475260903.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/ReachabilityCardinality6654187987066365668.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7304205406475260903.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7304205406475260903.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :7 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 30
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :30 after 55
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :55 after 99
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :99 after 308
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :308 after 1127
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1127 after 4866
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4866 after 101119
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :101119 after 684291
Detected timeout of ITS tools.
[2022-06-12 21:24:12] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:24:12] [INFO ] Applying decomposition
[2022-06-12 21:24:12] [INFO ] Flatten gal took : 13 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/graph12605696448251958291.txt, -o, /tmp/graph12605696448251958291.bin, -w, /tmp/graph12605696448251958291.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/graph12605696448251958291.bin, -l, -1, -v, -w, /tmp/graph12605696448251958291.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:24:12] [INFO ] Decomposing Gal with order
[2022-06-12 21:24:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:24:12] [INFO ] Removed a total of 106 redundant transitions.
[2022-06-12 21:24:12] [INFO ] Flatten gal took : 24 ms
[2022-06-12 21:24:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2022-06-12 21:24:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality953969844424115258.gal : 4 ms
[2022-06-12 21:24:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1016160164087676277.prop : 15 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/ReachabilityCardinality953969844424115258.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1016160164087676277.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/ReachabilityCardinality953969844424115258.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1016160164087676277.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1016160164087676277.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 5
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :5 after 14
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :14 after 18
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18 after 31
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :31 after 114
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :114 after 2253
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2253 after 254254
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7970064672949117595
[2022-06-12 21:24:27] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7970064672949117595
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7970064672949117595]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7970064672949117595] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7970064672949117595] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 55579 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43151 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43159 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43114 resets, run finished after 1146 ms. (steps per millisecond=872 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 57137 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43001 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43131 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 42980 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 43244 resets, run finished after 1040 ms. (steps per millisecond=961 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 43160 resets, run finished after 1391 ms. (steps per millisecond=718 ) properties (out of 9) seen :0
Probably explored full state space saw : 1290727 states, properties seen :{}
Probabilistic random walk after 2581652 steps, saw 1290727 distinct states, run finished after 13102 ms. (steps per millisecond=197 ) properties seen :{}
Interrupted probabilistic random walk after 5605710 steps, run timeout after 30001 ms. (steps per millisecond=186 ) properties seen :{}
Exhaustive walk after 5605710 steps, saw 2803189 distinct states, run finished after 30001 ms. (steps per millisecond=186 ) properties seen :{}
Running SMT prover for 9 properties.
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:25:22] [INFO ] Computed 40 place invariants in 16 ms
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 8 ms returned sat
[2022-06-12 21:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:23] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2022-06-12 21:25:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:25:23] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 8 ms returned sat
[2022-06-12 21:25:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:23] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-12 21:25:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-12 21:25:23] [INFO ] [Nat]Added 17 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:25:23] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:25:23] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:25:23] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 90 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 61 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 92 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 90 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 105 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 93 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 90 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 95 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:25:24] [INFO ] Deduced a trap composed of 99 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 100 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 97 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 105 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 108 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 97 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 96 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 114 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 107 places in 38 ms of which 1 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 114 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 113 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Deduced a trap composed of 82 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:25:25] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 1956 ms
[2022-06-12 21:25:25] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:25:31] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:25:31] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:25:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2022-06-12 21:25:31] [INFO ] Added : 326 causal constraints over 66 iterations in 5577 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 6 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:31] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-06-12 21:25:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 7 ms returned sat
[2022-06-12 21:25:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:32] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-06-12 21:25:32] [INFO ] [Nat]Added 17 Read/Feed constraints in 28 ms returned sat
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 116 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 127 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:32] [INFO ] Deduced a trap composed of 140 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 149 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 120 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 158 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 155 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 134 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 125 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 157 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:33] [INFO ] Deduced a trap composed of 157 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 119 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 131 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 136 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 122 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 127 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 127 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:25:34] [INFO ] Deduced a trap composed of 121 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 132 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 132 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 132 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 129 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 124 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 126 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 123 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:35] [INFO ] Deduced a trap composed of 139 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 136 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 137 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 121 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 117 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 122 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 117 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 104 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:36] [INFO ] Deduced a trap composed of 126 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 135 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 131 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 120 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 145 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 125 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:37] [INFO ] Deduced a trap composed of 117 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 137 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 118 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 148 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 129 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 129 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 130 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 126 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:38] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 136 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 130 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 132 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 126 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 138 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 113 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:39] [INFO ] Deduced a trap composed of 119 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 137 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 131 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 132 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 116 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 131 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 123 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:40] [INFO ] Deduced a trap composed of 128 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:41] [INFO ] Deduced a trap composed of 111 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:41] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:25:41] [INFO ] Deduced a trap composed of 108 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:25:41] [INFO ] Trap strengthening (SAT) tested/added 102/101 trap constraints in 9120 ms
[2022-06-12 21:25:41] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:25:46] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2022-06-12 21:25:46] [INFO ] Added : 255 causal constraints over 52 iterations in 5019 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 16 positive place invariants in 22 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:46] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-06-12 21:25:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:46] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-06-12 21:25:46] [INFO ] [Nat]Added 17 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:25:46] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:25:46] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:25:46] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:25:47] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:25:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 254 ms
[2022-06-12 21:25:47] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:25:51] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:25:51] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 2 ms to minimize.
[2022-06-12 21:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2022-06-12 21:25:51] [INFO ] Added : 327 causal constraints over 66 iterations in 4189 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:25:51] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 6 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:51] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Real]Added 17 Read/Feed constraints in 22 ms returned sat
[2022-06-12 21:25:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:25:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 20 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:25:51] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-06-12 21:25:51] [INFO ] [Nat]Added 17 Read/Feed constraints in 21 ms returned sat
[2022-06-12 21:25:51] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:25:51] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 135 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 149 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 127 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:52] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 150 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 129 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 147 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 126 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:53] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 116 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 119 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 126 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:54] [INFO ] Deduced a trap composed of 107 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 136 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 138 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 104 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 102 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 126 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 122 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 133 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:55] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 121 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 124 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 133 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 130 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 118 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 128 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 117 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 135 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 110 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:25:56] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 123 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 111 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 120 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 116 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 114 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:57] [INFO ] Deduced a trap composed of 128 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 124 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 148 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 131 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 138 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 115 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 139 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 142 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:58] [INFO ] Deduced a trap composed of 135 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 137 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 127 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 145 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 147 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 127 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 120 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 143 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:25:59] [INFO ] Deduced a trap composed of 131 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 135 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 137 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 142 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 125 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 136 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 135 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 150 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 140 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 128 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:26:00] [INFO ] Deduced a trap composed of 109 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 126 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 115 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:01] [INFO ] Trap strengthening (SAT) tested/added 111/110 trap constraints in 9663 ms
[2022-06-12 21:26:01] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:26:06] [INFO ] Added : 318 causal constraints over 64 iterations in 5098 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:26:06] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:06] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:26:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:07] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-12 21:26:07] [INFO ] [Nat]Added 17 Read/Feed constraints in 5 ms returned sat
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 137 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 127 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 134 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 127 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:26:07] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 148 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:26:08] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1329 ms
[2022-06-12 21:26:08] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 15 ms.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 70 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 64 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:26:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 607 ms
[2022-06-12 21:26:13] [INFO ] Added : 326 causal constraints over 66 iterations in 4663 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:26:13] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:13] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Real]Added 17 Read/Feed constraints in 12 ms returned sat
[2022-06-12 21:26:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:13] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:26:13] [INFO ] [Nat]Added 17 Read/Feed constraints in 19 ms returned sat
[2022-06-12 21:26:13] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:26:13] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:26:13] [INFO ] Deduced a trap composed of 82 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:26:13] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:26:13] [INFO ] Deduced a trap composed of 80 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:26:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 320 ms
[2022-06-12 21:26:13] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:26:17] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:26:17] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:26:17] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 433 ms
[2022-06-12 21:26:18] [INFO ] Added : 325 causal constraints over 65 iterations in 4229 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:26:18] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:18] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:26:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:18] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-06-12 21:26:18] [INFO ] [Nat]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 117 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:26:18] [INFO ] Deduced a trap composed of 124 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 122 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 136 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 112 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 140 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 129 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 141 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:26:19] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 113 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 104 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:20] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1997 ms
[2022-06-12 21:26:20] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:26:24] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:26:24] [INFO ] Deduced a trap composed of 149 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 145 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 124 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:26:25] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 134 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 135 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 132 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 146 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:26:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1868 ms
[2022-06-12 21:26:26] [INFO ] Added : 326 causal constraints over 66 iterations in 5914 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:26:26] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:26:26] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:27] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2022-06-12 21:26:27] [INFO ] [Real]Added 17 Read/Feed constraints in 7 ms returned sat
[2022-06-12 21:26:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:26:27] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 8 ms returned sat
[2022-06-12 21:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:27] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-06-12 21:26:27] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 129 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:26:27] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:26:28] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:26:28] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:28] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:26:28] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:26:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 769 ms
[2022-06-12 21:26:28] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 469 ms
[2022-06-12 21:26:32] [INFO ] Added : 328 causal constraints over 66 iterations in 4469 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:26:32] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:26:32] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:33] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2022-06-12 21:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:26:33] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:26:33] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:26:33] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-06-12 21:26:33] [INFO ] [Nat]Added 17 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:26:33] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:26:34] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:26:34] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:26:34] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:26:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 941 ms
[2022-06-12 21:26:34] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:26:37] [INFO ] Added : 309 causal constraints over 62 iterations in 3271 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 1330600 steps, including 81869 resets, run finished after 1798 ms. (steps per millisecond=740 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 213300 steps, including 13095 resets, run finished after 285 ms. (steps per millisecond=748 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4134600 steps, including 254356 resets, run finished after 5591 ms. (steps per millisecond=739 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6228400 steps, including 401671 resets, run finished after 8401 ms. (steps per millisecond=741 ) properties (out of 9) seen :0 could not realise parikh vector
Interrupted Parikh walk after 22220752 steps, including 1367222 resets, run timeout after 30001 ms. (steps per millisecond=740 ) properties (out of 9) seen :0
Incomplete Parikh walk after 5176600 steps, including 318480 resets, run finished after 6985 ms. (steps per millisecond=741 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8026000 steps, including 493747 resets, run finished after 10893 ms. (steps per millisecond=736 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8343000 steps, including 538220 resets, run finished after 11281 ms. (steps per millisecond=739 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 651100 steps, including 42093 resets, run finished after 878 ms. (steps per millisecond=741 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 110 out of 345 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 8 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Starting structural reductions, iteration 0 : 345/345 places, 329/329 transitions.
Applied a total of 0 rules in 8 ms. Remains 345 /345 variables (removed 0) and now considering 329/329 (removed 0) transitions.
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:27:53] [INFO ] Computed 40 place invariants in 9 ms
[2022-06-12 21:27:53] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:27:53] [INFO ] Computed 40 place invariants in 9 ms
[2022-06-12 21:27:53] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-12 21:27:54] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2022-06-12 21:27:54] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:27:54] [INFO ] Computed 40 place invariants in 14 ms
[2022-06-12 21:27:54] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 345/345 places, 329/329 transitions.
Incomplete random walk after 100000 steps, including 5536 resets, run finished after 251 ms. (steps per millisecond=398 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:27:55] [INFO ] Computed 40 place invariants in 16 ms
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 8 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:55] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-12 21:27:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:27:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 9 ms returned sat
[2022-06-12 21:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:27:56] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2022-06-12 21:27:56] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-06-12 21:27:56] [INFO ] [Nat]Added 17 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 57 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 85 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:27:56] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 90 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 95 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 99 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 105 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 108 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:27:57] [INFO ] Deduced a trap composed of 97 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 96 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 114 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 107 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 114 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 113 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Deduced a trap composed of 82 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:27:58] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2356 ms
[2022-06-12 21:27:58] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:28:03] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:28:03] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:28:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-06-12 21:28:03] [INFO ] Added : 326 causal constraints over 66 iterations in 5572 ms. Result :sat
[2022-06-12 21:28:04] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2022-06-12 21:28:04] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 7 ms returned sat
[2022-06-12 21:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:04] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2022-06-12 21:28:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:28:04] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 7 ms returned sat
[2022-06-12 21:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:04] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-06-12 21:28:04] [INFO ] [Nat]Added 17 Read/Feed constraints in 31 ms returned sat
[2022-06-12 21:28:04] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:04] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 138 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 115 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 127 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 140 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 149 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:05] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 158 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 155 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 138 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 134 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 125 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 157 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 157 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 131 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:28:06] [INFO ] Deduced a trap composed of 136 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 122 places in 80 ms of which 2 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 127 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 127 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 127 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 121 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 120 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 132 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 132 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:28:07] [INFO ] Deduced a trap composed of 132 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 124 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 114 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 126 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 123 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 139 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 136 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 137 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:08] [INFO ] Deduced a trap composed of 117 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 127 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 117 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 104 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 126 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 135 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:09] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 131 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 127 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 112 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 145 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 125 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 117 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 118 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:10] [INFO ] Deduced a trap composed of 148 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 129 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 130 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 120 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 125 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 126 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 136 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:11] [INFO ] Deduced a trap composed of 132 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 126 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 138 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 113 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 120 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 128 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 119 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 137 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 127 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:12] [INFO ] Deduced a trap composed of 121 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 131 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 132 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 116 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 131 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 128 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 111 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Deduced a trap composed of 108 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:28:13] [INFO ] Trap strengthening (SAT) tested/added 102/101 trap constraints in 9139 ms
[2022-06-12 21:28:13] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:28:18] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2022-06-12 21:28:18] [INFO ] Added : 255 causal constraints over 52 iterations in 4995 ms. Result :sat
[2022-06-12 21:28:18] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:28:18] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 10 ms returned sat
[2022-06-12 21:28:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:19] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-06-12 21:28:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:28:19] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:28:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:19] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-06-12 21:28:19] [INFO ] [Nat]Added 17 Read/Feed constraints in 16 ms returned sat
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:28:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2022-06-12 21:28:19] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:28:23] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:28:23] [INFO ] Deduced a trap composed of 63 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2022-06-12 21:28:23] [INFO ] Added : 327 causal constraints over 66 iterations in 4203 ms. Result :sat
[2022-06-12 21:28:23] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:23] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:24] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2022-06-12 21:28:24] [INFO ] [Real]Added 17 Read/Feed constraints in 21 ms returned sat
[2022-06-12 21:28:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:28:24] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 6 ms returned sat
[2022-06-12 21:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:24] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-06-12 21:28:24] [INFO ] [Nat]Added 17 Read/Feed constraints in 21 ms returned sat
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 119 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 135 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 118 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 149 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 119 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 127 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 150 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:25] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 147 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 126 places in 84 ms of which 10 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 125 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 128 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 101 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 129 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:26] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 116 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 126 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 107 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 136 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:27] [INFO ] Deduced a trap composed of 138 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 102 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 126 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 133 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 116 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 121 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 124 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 133 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:28:28] [INFO ] Deduced a trap composed of 130 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 118 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 128 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 117 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 135 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 110 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 114 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 117 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 111 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:28:29] [INFO ] Deduced a trap composed of 105 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 114 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 128 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 148 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 131 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 138 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:30] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 115 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 139 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 137 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 142 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 135 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 137 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 145 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 147 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 125 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:31] [INFO ] Deduced a trap composed of 127 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 120 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 143 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 131 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 135 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 137 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 142 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 125 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:32] [INFO ] Deduced a trap composed of 136 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 135 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 150 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 140 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 128 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 109 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 126 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 115 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 137 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:28:33] [INFO ] Trap strengthening (SAT) tested/added 111/110 trap constraints in 9536 ms
[2022-06-12 21:28:33] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:28:39] [INFO ] Added : 318 causal constraints over 64 iterations in 5059 ms. Result :sat
[2022-06-12 21:28:39] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:39] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:28:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:39] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-12 21:28:39] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 137 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 134 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:39] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 127 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 130 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 114 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 148 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:28:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1336 ms
[2022-06-12 21:28:40] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:28:44] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-06-12 21:28:44] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:28:44] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:28:45] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:28:45] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:28:45] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:28:45] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:28:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 634 ms
[2022-06-12 21:28:45] [INFO ] Added : 326 causal constraints over 66 iterations in 4631 ms. Result :sat
[2022-06-12 21:28:45] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 5 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:45] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Real]Added 17 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:28:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 9 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:45] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2022-06-12 21:28:45] [INFO ] [Nat]Added 17 Read/Feed constraints in 19 ms returned sat
[2022-06-12 21:28:46] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:28:46] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:28:46] [INFO ] Deduced a trap composed of 82 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:28:46] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:28:46] [INFO ] Deduced a trap composed of 80 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:28:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 317 ms
[2022-06-12 21:28:46] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 15 ms.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:28:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 458 ms
[2022-06-12 21:28:50] [INFO ] Added : 325 causal constraints over 65 iterations in 4266 ms. Result :sat
[2022-06-12 21:28:50] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2022-06-12 21:28:50] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 10 ms returned sat
[2022-06-12 21:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:50] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-06-12 21:28:50] [INFO ] [Real]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:28:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:50] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 3 ms returned sat
[2022-06-12 21:28:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:51] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-12 21:28:51] [INFO ] [Nat]Added 17 Read/Feed constraints in 9 ms returned sat
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 117 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 128 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 122 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 136 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 112 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 140 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:51] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 104 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 141 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 115 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 113 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 116 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 112 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:52] [INFO ] Deduced a trap composed of 104 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:53] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:28:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2028 ms
[2022-06-12 21:28:53] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 149 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 140 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 133 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 145 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 128 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:28:57] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 134 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 135 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 132 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 146 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Deduced a trap composed of 63 places in 36 ms of which 1 ms to minimize.
[2022-06-12 21:28:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1891 ms
[2022-06-12 21:28:58] [INFO ] Added : 326 causal constraints over 66 iterations in 5908 ms. Result :sat
[2022-06-12 21:28:59] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:59] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Real]Added 17 Read/Feed constraints in 8 ms returned sat
[2022-06-12 21:28:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:28:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 6 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:28:59] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2022-06-12 21:28:59] [INFO ] [Nat]Added 17 Read/Feed constraints in 6 ms returned sat
[2022-06-12 21:28:59] [INFO ] Deduced a trap composed of 129 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:29:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 771 ms
[2022-06-12 21:29:00] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 14 ms.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:29:04] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 453 ms
[2022-06-12 21:29:05] [INFO ] Added : 328 causal constraints over 66 iterations in 4491 ms. Result :sat
[2022-06-12 21:29:05] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2022-06-12 21:29:05] [INFO ] [Real]Absence check using 16 positive and 24 generalized place invariants in 4 ms returned sat
[2022-06-12 21:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-06-12 21:29:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:29:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 15 ms returned sat
[2022-06-12 21:29:05] [INFO ] [Nat]Absence check using 16 positive and 24 generalized place invariants in 6 ms returned sat
[2022-06-12 21:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:29:05] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2022-06-12 21:29:05] [INFO ] [Nat]Added 17 Read/Feed constraints in 17 ms returned sat
[2022-06-12 21:29:05] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:29:05] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2022-06-12 21:29:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 907 ms
[2022-06-12 21:29:06] [INFO ] Computed and/alt/rep : 328/1025/328 causal constraints (skipped 0 transitions) in 14 ms.
[2022-06-12 21:29:09] [INFO ] Added : 309 causal constraints over 62 iterations in 3306 ms. Result :sat
[2022-06-12 21:29:09] [INFO ] Flatten gal took : 19 ms
[2022-06-12 21:29:09] [INFO ] Flatten gal took : 12 ms
[2022-06-12 21:29:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2131632776143266812.gal : 2 ms
[2022-06-12 21:29:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17096967126897626122.prop : 0 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/ReachabilityCardinality2131632776143266812.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17096967126897626122.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/ReachabilityCardinality2131632776143266812.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17096967126897626122.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17096967126897626122.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :7 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 30
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :30 after 55
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :55 after 99
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :99 after 308
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :308 after 1127
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1127 after 4866
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :4866 after 101119
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :101119 after 684291
Detected timeout of ITS tools.
[2022-06-12 21:29:29] [INFO ] Flatten gal took : 11 ms
[2022-06-12 21:29:29] [INFO ] Applying decomposition
[2022-06-12 21:29:29] [INFO ] Flatten gal took : 11 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/graph17670538395191653419.txt, -o, /tmp/graph17670538395191653419.bin, -w, /tmp/graph17670538395191653419.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/graph17670538395191653419.bin, -l, -1, -v, -w, /tmp/graph17670538395191653419.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:29:29] [INFO ] Decomposing Gal with order
[2022-06-12 21:29:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:29:29] [INFO ] Removed a total of 105 redundant transitions.
[2022-06-12 21:29:29] [INFO ] Flatten gal took : 22 ms
[2022-06-12 21:29:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2022-06-12 21:29:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6176435160377326965.gal : 4 ms
[2022-06-12 21:29:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6131492397372224448.prop : 0 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/ReachabilityCardinality6176435160377326965.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6131492397372224448.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/ReachabilityCardinality6176435160377326965.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6131492397372224448.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6131492397372224448.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :4 after 7
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :8 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 30
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :30 after 275
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :275 after 46834
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5877536815931298912
[2022-06-12 21:29:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5877536815931298912
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5877536815931298912]
Compilation finished in 1540 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5877536815931298912]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, DoubleExponentPT010ReachabilityFireability00==true], workingDir=/tmp/ltsmin5877536815931298912]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 345 transition count 326
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 342 transition count 326
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 342 transition count 325
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 341 transition count 325
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 340 transition count 324
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 340 transition count 324
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 340 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 338 transition count 322
Applied a total of 14 rules in 47 ms. Remains 338 /345 variables (removed 7) and now considering 322/329 (removed 7) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 322 rows 338 cols
[2022-06-12 21:30:10] [INFO ] Computed 40 place invariants in 18 ms
[2022-06-12 21:30:10] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:10] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 7 ms returned sat
[2022-06-12 21:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:10] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2022-06-12 21:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:10] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 7 ms returned sat
[2022-06-12 21:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:10] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-06-12 21:30:10] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 69 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 77 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:30:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 525 ms
[2022-06-12 21:30:11] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 19 ms.
[2022-06-12 21:30:15] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:30:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2022-06-12 21:30:15] [INFO ] Added : 321 causal constraints over 65 iterations in 4324 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 21:30:15] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:15] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:15] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-12 21:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:16] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 10 ms returned sat
[2022-06-12 21:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:16] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 128 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 119 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 119 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 132 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:30:16] [INFO ] Deduced a trap composed of 127 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 129 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 131 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 125 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 131 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 131 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 136 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 131 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 121 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:30:17] [INFO ] Deduced a trap composed of 139 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 1 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 137 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 143 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 129 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 119 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 144 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 135 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 141 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:18] [INFO ] Deduced a trap composed of 137 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 133 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 123 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 141 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 135 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 128 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 131 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:30:19] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 3492 ms
[2022-06-12 21:30:19] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:30:22] [INFO ] Added : 241 causal constraints over 49 iterations in 2696 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 21:30:22] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-12 21:30:22] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 4 ms returned sat
[2022-06-12 21:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:22] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-06-12 21:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-12 21:30:22] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:23] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-06-12 21:30:23] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:30:23] [INFO ] Deduced a trap composed of 81 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:30:23] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:30:23] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:30:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2022-06-12 21:30:23] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 18 ms.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 216 ms
[2022-06-12 21:30:27] [INFO ] Added : 321 causal constraints over 65 iterations in 4194 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:30:27] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-12 21:30:27] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-12 21:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:27] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 144 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:30:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 224 ms
[2022-06-12 21:30:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-12 21:30:28] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-12 21:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:28] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 136 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Deduced a trap composed of 127 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:30:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 374 ms
[2022-06-12 21:30:28] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 15 ms.
[2022-06-12 21:30:31] [INFO ] Added : 315 causal constraints over 64 iterations in 3376 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:30:32] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-12 21:30:32] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 4 ms returned sat
[2022-06-12 21:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:32] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-12 21:30:32] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:30:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:32] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:32] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2022-06-12 21:30:32] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-06-12 21:30:32] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 145 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 149 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 147 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:35] [INFO ] Deduced a trap composed of 139 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 141 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 70 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 966 ms
[2022-06-12 21:30:36] [INFO ] Added : 320 causal constraints over 64 iterations in 3885 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:30:36] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-12 21:30:36] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:36] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-12 21:30:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:36] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-12 21:30:36] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 4 ms returned sat
[2022-06-12 21:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:36] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-06-12 21:30:36] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:37] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2022-06-12 21:30:37] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:30:40] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:30:40] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:30:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-06-12 21:30:40] [INFO ] Added : 318 causal constraints over 64 iterations in 3881 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:30:40] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-12 21:30:40] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:41] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-06-12 21:30:41] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-12 21:30:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:41] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-12 21:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:41] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-06-12 21:30:41] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-06-12 21:30:41] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:30:44] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:30:44] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:30:45] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:30:45] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:30:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 355 ms
[2022-06-12 21:30:45] [INFO ] Added : 315 causal constraints over 63 iterations in 3699 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:30:45] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2022-06-12 21:30:45] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 7 ms returned sat
[2022-06-12 21:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:45] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-06-12 21:30:45] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:30:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-06-12 21:30:45] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 4 ms returned sat
[2022-06-12 21:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2022-06-12 21:30:45] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 147 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 157 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 136 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 165 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:30:49] [INFO ] Deduced a trap composed of 152 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:50] [INFO ] Deduced a trap composed of 89 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:30:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 766 ms
[2022-06-12 21:30:50] [INFO ] Added : 321 causal constraints over 65 iterations in 4304 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-12 21:30:50] [INFO ] [Real]Absence check using 15 positive place invariants in 14 ms returned sat
[2022-06-12 21:30:50] [INFO ] [Real]Absence check using 15 positive and 25 generalized place invariants in 6 ms returned sat
[2022-06-12 21:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:50] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-06-12 21:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:30:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-06-12 21:30:50] [INFO ] [Nat]Absence check using 15 positive and 25 generalized place invariants in 5 ms returned sat
[2022-06-12 21:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:30:50] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-06-12 21:30:50] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:30:50] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:30:50] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:30:50] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:30:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 874 ms
[2022-06-12 21:30:51] [INFO ] Computed and/alt/rep : 321/982/321 causal constraints (skipped 0 transitions) in 15 ms.
[2022-06-12 21:30:55] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:30:55] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:30:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2022-06-12 21:30:55] [INFO ] Added : 303 causal constraints over 61 iterations in 3939 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-12 21:30:55] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14741489581689325985
[2022-06-12 21:30:55] [INFO ] Computing symmetric may disable matrix : 329 transitions.
[2022-06-12 21:30:55] [INFO ] Applying decomposition
[2022-06-12 21:30:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:30:55] [INFO ] Computing symmetric may enable matrix : 329 transitions.
[2022-06-12 21:30:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:30:55] [INFO ] Flatten gal took : 12 ms
[2022-06-12 21:30:55] [INFO ] Flatten gal took : 25 ms
[2022-06-12 21:30:55] [INFO ] Input system was already deterministic with 329 transitions.
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/graph6597833733209368987.txt, -o, /tmp/graph6597833733209368987.bin, -w, /tmp/graph6597833733209368987.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/graph6597833733209368987.bin, -l, -1, -v, -w, /tmp/graph6597833733209368987.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:30:55] [INFO ] Decomposing Gal with order
[2022-06-12 21:30:55] [INFO ] Computing Do-Not-Accords matrix : 329 transitions.
[2022-06-12 21:30:55] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:30:55] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14741489581689325985
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:30:55] [INFO ] Removed a total of 101 redundant transitions.
[2022-06-12 21:30:55] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2022-06-12 21:30:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability15923745084105531386.gal : 14 ms
[2022-06-12 21:30:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16871448867918137024.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/ReachabilityFireability15923745084105531386.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability16871448867918137024.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/ReachabilityFireability15923745084105531386.gal -t CGAL -reachable-file /tmp/ReachabilityFireability16871448867918137024.prop --nowitness
[2022-06-12 21:30:55] [INFO ] Ran tautology test, simplified 0 / 9 in 226 ms.
Loading property file /tmp/ReachabilityFireability16871448867918137024.prop.
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=0 took 8 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=0 took 4 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=0 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=0 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=1 took 2 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=1 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=1 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=1 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=1 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=1 took 2 ms
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 8
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :8 after 9
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=2 took 79 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=2 took 1 ms
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :9 after 18
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=2 took 2 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=2 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=2 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=2 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=2 took 0 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=2 took 3 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 329 rows 345 cols
[2022-06-12 21:30:55] [INFO ] Computed 40 place invariants in 24 ms
inv : p162 - p163 + p165 - p166 + p187 + p199 = 0
inv : p440 + p442 - p444 - p445 - p446 - p447 - p448 - p449 - p452 - p455 - p456 - p458 - p459 - p460 - p461 - p463 - p464 - p465 - p467 - p468 - p470 - p472 - p475 - p477 - p478 + p528 + p530 = 0
inv : -p442 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p466 + p467 - p530 = 0
inv : p1 + p101 + p103 + p106 + p114 + p115 + p116 + p118 + p121 + p123 + p126 + p128 + p129 + p130 + p131 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p142 + p145 + p146 + p150 + p152 + p153 + p154 + p16 + p160 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p26 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p30 + p300 + p301 + p302 + p304 + p305 + p309 + p31 + p310 + p311 + p313 + p314 + p32 + p327 + p328 + p33 + p330 + p335 + p338 + p339 + p34 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p36 + p361 + p362 + p364 + p365 + p366 + p37 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p7 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
inv : p153 + p56 - p57 + p59 - p60 + p76 + p81 + p93 = 0
inv : p373 - p375 + p376 - p378 + p399 + p406 + p411 = 0
inv : -p225 + p267 - p269 + p270 - p272 + p293 + p300 + p305 - p314 = 0
inv : -p278 + p320 - p322 + p323 - p325 + p327 + p346 + p353 + p358 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p281 + p283 + p3 + p327 + p328 + p330 + p334 + p335 + p336 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p422 + p423 + p424 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p210 + p211 + p212 + p22 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p108 - p110 + p111 - p113 + p115 + p134 + p146 - p66 - p67 = 0
inv : p109 - p110 + p112 - p113 + p129 + p134 + p146 - p67 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p123 + p124 + p126 + p128 + p129 + p130 + p131 + p133 + p134 + p135 + p136 + p137 + p14 + p16 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p212 + p22 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : 2*p1 + p3 + p4 + p41 + p8 + p9 = 2
inv : p321 - p322 + p324 - p325 + p341 + p346 + p358 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p281 + p283 + p3 + p327 + p328 + p330 + p334 + p335 + p336 + p379 + p381 + p383 + p384 + p386 + p389 + p393 + p394 + p395 + p396 + p399 + p4 + p401 + p402 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p477 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : -p389 + p405 + p406 + p407 + p408 + p411 + p413 + p414 - p477 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p281 + p283 + p3 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p369 + p371 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p281 + p283 + p3 + p327 + p328 + p330 + p334 + p335 + p336 + p379 + p381 + p383 + p384 + p386 + p387 + p389 + p4 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p475 + p477 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p260 + p263 + p264 + p265 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : 2*p1 + p10 + p11 + p3 + p32 + p4 = 2
inv : p215 - p216 + p218 - p219 + p240 + p252 = 0
inv : p268 - p269 + p271 - p272 + p276 + p288 + p291 + p293 + p305 - p314 + p365 = 0
inv : -p480 + p481 - p483 + p484 - p488 - p500 - p505 - p517 + p526 = 0
inv : p442 + p454 - p456 - p458 - p459 - p460 - p461 - p463 - p464 - p465 - p467 - p468 - p470 - p472 - p475 - p477 - p478 + p530 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p123 + p126 + p128 + p129 + p130 + p131 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p142 + p145 + p146 + p150 + p152 + p153 + p154 + p157 + p159 + p16 + p160 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p22 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : -p384 + p426 - p428 + p429 - p431 + p452 + p459 + p464 + p522 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p123 + p126 + p128 + p129 + p130 + p131 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p142 + p145 + p146 + p150 + p152 + p153 + p154 + p157 + p16 + p160 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p22 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p24 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p87 + p89 + p90 + p93 + p95 + p96 = 1
inv : -p437 + p479 - p480 + p482 - p483 - p488 - p500 = 0
inv : p374 - p375 + p377 - p378 + p394 + p399 + p411 = 0
inv : -p336 + p350 + p352 + p353 + p354 + p355 + p358 + p360 + p361 - p424 = 0
inv : p214 - p216 + p217 - p219 + p240 + p252 + p310 = 0
inv : p104 + p22 - p26 - p30 - p31 - p32 - p33 - p34 - p36 - p37 = 0
inv : -p19 + p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : 3*p1 + p101 + p103 + p114 + p115 + p116 + p118 + p12 + p121 + p123 + p126 + p128 + p129 + p13 + p130 + p131 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p142 + p145 + p146 + p150 + p152 + p153 + p154 + p16 + p160 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p26 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + 3*p3 + p30 + p300 + p301 + p302 + p304 + p305 + p309 + p31 + p310 + p311 + p313 + p314 + p32 + p327 + p328 + p33 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p37 + p372 + p379 + p38 + p381 + p383 + p384 + p386 + p39 + p393 + p394 + p395 + p396 + p399 + 2*p4 + p40 + p402 + p405 + p406 + p407 + p408 + p41 + p411 + p414 + p415 + p417 + p419 + p42 + p421 + p423 + p425 + p43 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p45 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p47 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p50 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p52 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p54 + 2*p6 + p63 + p66 + p67 + p68 + p7 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 3
inv : p427 - p428 + p430 - p431 + p447 + p452 + p464 = 0
inv : p161 - p163 + p164 - p166 + p187 + p194 + p199 = 0
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p300 + p301 + p302 + p304 + p305 + p309 + p310 + p311 + p313 + p314 + p316 + p318 + p327 + p328 + p330 + p335 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p372 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p1 + p114 + p115 + p116 + p118 + p121 + p122 + p123 + p124 + p14 + p16 + p167 + p169 + p175 + p176 + p177 + p19 + p22 + p220 + p222 + p224 + p225 + p228 + p23 + p230 + p231 + p24 + p273 + p275 + p276 + p277 + p278 + p281 + p283 + p3 + p327 + p328 + p330 + p335 + p336 + p338 + p339 + p340 + p341 + p342 + p343 + p346 + p347 + p348 + p349 + p379 + p381 + p383 + p384 + p386 + p393 + p394 + p395 + p396 + p399 + p4 + p402 + p405 + p406 + p407 + p408 + p411 + p414 + p415 + p417 + p419 + p421 + p423 + p424 + p425 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p452 + p455 + p456 + p458 + p459 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p6 + p63 + p66 + p67 + p68 + p69 + p7 + p71 = 1
inv : p1 + p101 + p103 + p114 + p115 + p116 + p118 + p121 + p123 + p126 + p128 + p129 + p130 + p131 + p133 + p134 + p135 + p137 + p138 + p139 + p14 + p142 + p145 + p146 + p150 + p152 + p153 + p154 + p16 + p160 + p167 + p169 + p176 + p179 + p180 + p181 + p183 + p184 + p187 + p19 + p191 + p193 + p194 + p195 + p199 + p205 + p207 + p209 + p211 + p220 + p222 + p224 + p225 + p23 + p231 + p232 + p233 + p234 + p236 + p237 + p240 + p241 + p244 + p245 + p246 + p248 + p249 + p252 + p253 + p256 + p258 + p26 + p260 + p264 + p266 + p273 + p275 + p276 + p277 + p278 + p285 + p287 + p288 + p289 + p290 + p291 + p293 + p294 + p299 + p3 + p30 + p300 + p301 + p302 + p304 + p305 + p309 + p31 + p310 + p311 + p313 + p314 + p32 + p327 + p328 + p33 + p330 + p335 + p338 + p339 + p34 + p340 + p341 + p342 + p343 + p346 + p347 + p349 + p350 + p352 + p353 + p354 + p355 + p358 + p361 + p362 + p364 + p365 + p366 + p37 + p372 + p379 + p38 + p381 + p383 + p384 + p386 + p39 + p393 + p394 + p395 + p396 + p399 + p4 + p40 + p402 + p405 + p406 + p407 + p408 + p41 + p411 + p414 + p415 + p417 + p419 + p42 + p421 + p423 + p425 + p43 + p434 + p436 + p437 + p439 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p45 + p452 + p455 + p456 + p458 + p459 + p46 + p460 + p461 + p463 + p464 + p465 + p467 + p468 + p47 + p470 + p472 + p478 + p485 + p487 + p488 + p489 + p490 + p492 + p494 + p497 + p498 + p499 + p50 + p500 + p501 + p502 + p505 + p509 + p510 + p511 + p514 + p517 + p518 + p52 + p521 + p522 + p523 + p525 + p526 + p527 + p529 + p531 + p54 + p6 + p63 + p66 + p67 + p68 + p7 + p75 + p76 + p77 + p78 + p81 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
Total of 40 invariants.
[2022-06-12 21:30:55] [INFO ] Computed 40 place invariants in 26 ms
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :18 after 70
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=3 took 65 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=3 took 4 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=3 took 3 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=3 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=3 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=3 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=3 took 1 ms
[2022-06-12 21:30:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=3 took 8 ms
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :70 after 269
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=4 took 95 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=4 took 33 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=4 took 32 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=4 took 17 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=4 took 15 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=4 took 18 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=4 took 14 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=4 took 18 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=4 took 21 ms
[2022-06-12 21:30:56] [INFO ] Proved 345 variables to be positive in 529 ms
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :269 after 2130
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=0 took 62 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=0 took 36 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=0 took 50 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=5 took 333 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=0 took 41 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=0 took 40 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=5 took 80 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=0 took 38 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=0 took 35 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=0 took 37 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=5 took 117 ms
[2022-06-12 21:30:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-12 21:30:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=0 took 54 ms
[2022-06-12 21:30:56] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=5 took 110 ms
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=1 took 308 ms
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=1 took 99 ms
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :2130 after 48537
[2022-06-12 21:30:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=5 took 351 ms
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=1 took 118 ms
Compilation finished in 1846 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:30:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=5 took 199 ms
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability00==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=1 took 140 ms
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=1 took 110 ms
[2022-06-12 21:30:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-12 21:30:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=1 took 160 ms
[2022-06-12 21:30:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=5 took 521 ms
[2022-06-12 21:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-12 21:30:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=1 took 296 ms
[2022-06-12 21:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-12 21:30:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=1 took 190 ms
[2022-06-12 21:30:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=5 took 328 ms
[2022-06-12 21:30:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-12 21:30:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=1 took 323 ms
[2022-06-12 21:30:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=5 took 369 ms
[2022-06-12 21:30:59] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=6 took 953 ms
[2022-06-12 21:31:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=6 took 1036 ms
[2022-06-12 21:31:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=6 took 1057 ms
[2022-06-12 21:31:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-12 21:31:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=2 took 4048 ms
[2022-06-12 21:31:03] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=6 took 1752 ms
[2022-06-12 21:31:12] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=6 took 9249 ms
[2022-06-12 21:31:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=6 took 11945 ms
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :48537 after 680726
[2022-06-12 21:31:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=6 took 4264 ms
[2022-06-12 21:31:37] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-12 21:31:37] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=2 took 34868 ms
[2022-06-12 21:31:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=6 took 11093 ms
[2022-06-12 21:31:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=6 took 5557 ms
[2022-06-12 21:32:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-12 21:32:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=2 took 30324 ms
[2022-06-12 21:32:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=7 took 42585 ms
[2022-06-12 21:32:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=7 took 10592 ms
[2022-06-12 21:32:42] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=7 took 3235 ms
[2022-06-12 21:32:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-12 21:32:45] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=2 took 37803 ms
[2022-06-12 21:32:54] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-12 21:32:54] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=2 took 8611 ms
[2022-06-12 21:33:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-12 21:33:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=2 took 22733 ms
[2022-06-12 21:33:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-12 21:33:23] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=2 took 6774 ms
[2022-06-12 21:33:24] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=7 took 42262 ms
[2022-06-12 21:33:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=7 took 5320 ms
[2022-06-12 21:33:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=7 took 8693 ms
[2022-06-12 21:34:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=7 took 27826 ms
[2022-06-12 21:34:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-12 21:34:14] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=2 took 50280 ms
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :680726 after 3.90976e+06
[2022-06-12 21:34:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=7 took 30852 ms
[2022-06-12 21:34:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=7 took 1768 ms
[2022-06-12 21:34:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-12 21:34:57] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=2 took 43268 ms
[2022-06-12 21:36:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=8 took 110362 ms
[2022-06-12 21:36:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-12 21:36:31] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=3 took 93678 ms
[2022-06-12 21:36:57] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=8 took 28037 ms
[2022-06-12 21:37:11] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-12 21:37:11] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=3 took 40105 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability00==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability02==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:37:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=8 took 52278 ms
[2022-06-12 21:38:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=8 took 11390 ms
[2022-06-12 21:38:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-12 21:38:48] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=3 took 96907 ms
[2022-06-12 21:38:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=8 took 50552 ms
[2022-06-12 21:39:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=8 took 9015 ms
[2022-06-12 21:39:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=8 took 14564 ms
[2022-06-12 21:40:18] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=8 took 63592 ms
[2022-06-12 21:40:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-12 21:40:25] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=3 took 97927 ms
[2022-06-12 21:40:37] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=8 took 18696 ms
[2022-06-12 21:41:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=9 took 39172 ms
[2022-06-12 21:42:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-12 21:42:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=3 took 101151 ms
[2022-06-12 21:42:43] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=9 took 86569 ms
[2022-06-12 21:43:11] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=9 took 28611 ms
[2022-06-12 21:43:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-12 21:43:17] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=3 took 70378 ms
[2022-06-12 21:44:10] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=9 took 59303 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability02==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:44:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=9 took 39002 ms
[2022-06-12 21:44:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-12 21:44:51] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=3 took 94210 ms
[2022-06-12 21:46:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-13
[2022-06-12 21:46:28] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-13(SAT) depth K=3 took 96510 ms
[2022-06-12 21:46:51] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=9 took 121689 ms
[2022-06-12 21:47:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=9 took 25307 ms
[2022-06-12 21:47:39] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=9 took 22806 ms
[2022-06-12 21:48:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-14
[2022-06-12 21:48:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-14(SAT) depth K=3 took 93874 ms
[2022-06-12 21:48:20] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=9 took 40522 ms
[2022-06-12 21:48:45] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=10 took 25688 ms
[2022-06-12 21:49:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=10 took 52236 ms
[2022-06-12 21:50:29] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=10 took 51611 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability03==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability04==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:51:43] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=10 took 73537 ms
[2022-06-12 21:53:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=10 took 77283 ms
[2022-06-12 21:54:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=10 took 66762 ms
[2022-06-12 21:54:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-00
[2022-06-12 21:54:44] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-00(SAT) depth K=4 took 402695 ms
Detected timeout of ITS tools.
[2022-06-12 21:56:08] [INFO ] Applying decomposition
[2022-06-12 21:56:08] [INFO ] Flatten gal took : 28 ms
[2022-06-12 21:56:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:56:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:56:08] [INFO ] Removed a total of 105 redundant transitions.
[2022-06-12 21:56:08] [INFO ] Flatten gal took : 70 ms
[2022-06-12 21:56:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2022-06-12 21:56:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8601158502877980112.gal : 3 ms
[2022-06-12 21:56:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13490891202490852222.prop : 0 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/ReachabilityFireability8601158502877980112.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability13490891202490852222.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/ReachabilityFireability8601158502877980112.gal -t CGAL -reachable-file /tmp/ReachabilityFireability13490891202490852222.prop --nowitness
Loading property file /tmp/ReachabilityFireability13490891202490852222.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :9 after 17
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :29 after 249
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :249 after 7563
[2022-06-12 21:57:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-02
[2022-06-12 21:57:03] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-02(SAT) depth K=4 took 138894 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability04==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability07==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 21:58:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-09(UNSAT) depth K=10 took 246761 ms
[2022-06-12 21:59:47] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-13(UNSAT) depth K=10 took 93530 ms
[2022-06-12 22:00:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-14(UNSAT) depth K=10 took 18351 ms
[2022-06-12 22:01:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-03
[2022-06-12 22:01:02] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-03(SAT) depth K=4 took 238658 ms
[2022-06-12 22:01:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-00(UNSAT) depth K=11 took 73295 ms
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :7563 after 3.7236e+07
[2022-06-12 22:02:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-02(UNSAT) depth K=11 took 58181 ms
[2022-06-12 22:04:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-03(UNSAT) depth K=11 took 119552 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability07==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability08==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 22:04:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-04
[2022-06-12 22:04:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-04(SAT) depth K=4 took 211457 ms
[2022-06-12 22:06:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-04(UNSAT) depth K=11 took 112751 ms
[2022-06-12 22:07:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-07(UNSAT) depth K=11 took 77798 ms
[2022-06-12 22:07:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-07
[2022-06-12 22:07:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-07(SAT) depth K=4 took 204695 ms
[2022-06-12 22:10:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-08
[2022-06-12 22:10:32] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-08(SAT) depth K=4 took 153938 ms
WARNING : LTSmin timed out (>400 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability08==true], workingDir=/tmp/ltsmin14741489581689325985]
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityFireability09==true], workingDir=/tmp/ltsmin14741489581689325985]
[2022-06-12 22:13:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityFireability-09
[2022-06-12 22:13:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityFireability-09(SAT) depth K=4 took 203753 ms
[2022-06-12 22:14:02] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityFireability-08(UNSAT) depth K=11 took 394827 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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 r089-tall-165260117600075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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