Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900557.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900557
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716391133052

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 15:18:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 15:18:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:18:54] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-22 15:18:54] [INFO ] Transformed 534 places.
[2024-05-22 15:18:54] [INFO ] Transformed 498 transitions.
[2024-05-22 15:18:54] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 498 rows 534 cols
[2024-05-22 15:18:54] [INFO ] Computed 54 invariants in 84 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, 1, +inf, +inf, 1, 3, 1, 1, 1, 3, 2, +inf]
RANDOM walk for 10000 steps (323 resets) in 41 ms. (238 steps per ms)
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150004 steps (4295 resets) in 231 ms. (646 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 3, 1, 1, 1, 3, 2, +inf]
[2024-05-22 15:18:55] [INFO ] Invariant cache hit.
[2024-05-22 15:18:55] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-22 15:18:55] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 40 ms returned sat
[2024-05-22 15:18:55] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-22 15:18:56] [INFO ] Deduced a trap composed of 205 places in 298 ms of which 20 ms to minimize.
[2024-05-22 15:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:18:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:18:56] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-22 15:18:56] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2024-05-22 15:18:56] [INFO ] Deduced a trap composed of 187 places in 187 ms of which 24 ms to minimize.
[2024-05-22 15:18:56] [INFO ] Deduced a trap composed of 194 places in 225 ms of which 5 ms to minimize.
[2024-05-22 15:18:57] [INFO ] Deduced a trap composed of 195 places in 165 ms of which 3 ms to minimize.
[2024-05-22 15:18:57] [INFO ] Deduced a trap composed of 186 places in 167 ms of which 3 ms to minimize.
[2024-05-22 15:18:57] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 3 ms to minimize.
[2024-05-22 15:18:57] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-22 15:18:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1173 ms
[2024-05-22 15:18:57] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-22 15:19:01] [INFO ] Added : 325 causal constraints over 65 iterations in 3549 ms. Result :unknown
[2024-05-22 15:19:01] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-22 15:19:01] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-22 15:19:01] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-05-22 15:19:01] [INFO ] Deduced a trap composed of 193 places in 149 ms of which 4 ms to minimize.
[2024-05-22 15:19:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:01] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-22 15:19:02] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2024-05-22 15:19:02] [INFO ] Deduced a trap composed of 193 places in 154 ms of which 3 ms to minimize.
[2024-05-22 15:19:02] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 4 ms to minimize.
[2024-05-22 15:19:02] [INFO ] Deduced a trap composed of 221 places in 205 ms of which 3 ms to minimize.
[2024-05-22 15:19:02] [INFO ] Deduced a trap composed of 229 places in 149 ms of which 4 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 3 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 183 places in 153 ms of which 3 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 4 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-22 15:19:03] [INFO ] Deduced a trap composed of 188 places in 142 ms of which 4 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 3 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 204 places in 146 ms of which 4 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 193 places in 142 ms of which 4 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 207 places in 141 ms of which 3 ms to minimize.
[2024-05-22 15:19:04] [INFO ] Deduced a trap composed of 206 places in 140 ms of which 3 ms to minimize.
[2024-05-22 15:19:05] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 3671 ms
[2024-05-22 15:19:05] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:05] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-22 15:19:06] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-22 15:19:06] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 3 ms to minimize.
[2024-05-22 15:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:06] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-22 15:19:06] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2024-05-22 15:19:06] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 3 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 4 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 3 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 2 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 15:19:07] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 15:19:08] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 15:19:08] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 4 ms to minimize.
[2024-05-22 15:19:08] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-22 15:19:08] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-22 15:19:08] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1739 ms
[2024-05-22 15:19:08] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 34 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 15:19:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:11] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2024-05-22 15:19:11] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-05-22 15:19:11] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 2 ms to minimize.
[2024-05-22 15:19:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:12] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-22 15:19:12] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2024-05-22 15:19:12] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 3 ms to minimize.
[2024-05-22 15:19:12] [INFO ] Deduced a trap composed of 151 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:19:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2024-05-22 15:19:12] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-22 15:19:17] [INFO ] Added : 405 causal constraints over 81 iterations in 4259 ms. Result :unknown
[2024-05-22 15:19:17] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:17] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2024-05-22 15:19:17] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-05-22 15:19:17] [INFO ] Deduced a trap composed of 216 places in 159 ms of which 3 ms to minimize.
[2024-05-22 15:19:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:17] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-22 15:19:17] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 216 places in 148 ms of which 3 ms to minimize.
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 215 places in 149 ms of which 3 ms to minimize.
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 4 ms to minimize.
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 3 ms to minimize.
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 208 places in 134 ms of which 3 ms to minimize.
[2024-05-22 15:19:18] [INFO ] Deduced a trap composed of 206 places in 143 ms of which 3 ms to minimize.
[2024-05-22 15:19:19] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 3 ms to minimize.
[2024-05-22 15:19:19] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-22 15:19:19] [INFO ] Deduced a trap composed of 53 places in 134 ms of which 3 ms to minimize.
[2024-05-22 15:19:19] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 4 ms to minimize.
[2024-05-22 15:19:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1701 ms
[2024-05-22 15:19:19] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-22 15:19:22] [INFO ] Added : 325 causal constraints over 65 iterations in 2973 ms. Result :unknown
[2024-05-22 15:19:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:22] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:23] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-22 15:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:23] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2024-05-22 15:19:23] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-05-22 15:19:23] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 3 ms to minimize.
[2024-05-22 15:19:23] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 2 ms to minimize.
[2024-05-22 15:19:24] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 3 ms to minimize.
[2024-05-22 15:19:24] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-05-22 15:19:24] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 7 ms to minimize.
[2024-05-22 15:19:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 762 ms
[2024-05-22 15:19:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-22 15:19:25] [INFO ] Added : 20 causal constraints over 4 iterations in 791 ms. Result :sat
Minimization took 748 ms.
[2024-05-22 15:19:26] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:26] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-22 15:19:26] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-05-22 15:19:26] [INFO ] Deduced a trap composed of 204 places in 145 ms of which 3 ms to minimize.
[2024-05-22 15:19:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2024-05-22 15:19:26] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-22 15:19:26] [INFO ] Deduced a trap composed of 204 places in 148 ms of which 3 ms to minimize.
[2024-05-22 15:19:27] [INFO ] Deduced a trap composed of 189 places in 153 ms of which 3 ms to minimize.
[2024-05-22 15:19:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 378 ms
[2024-05-22 15:19:27] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-22 15:19:30] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-22 15:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2024-05-22 15:19:30] [INFO ] Added : 304 causal constraints over 61 iterations in 3533 ms. Result :sat
Minimization took 715 ms.
[2024-05-22 15:19:31] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:31] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:31] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-22 15:19:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-22 15:19:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:31] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:32] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-22 15:19:32] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-22 15:19:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 15:19:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:36] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned unsat
[2024-05-22 15:19:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:37] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-22 15:19:37] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-22 15:19:37] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 15:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:37] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2024-05-22 15:19:37] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2024-05-22 15:19:37] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 15:19:37] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-05-22 15:19:38] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-22 15:19:38] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:19:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 523 ms
[2024-05-22 15:19:38] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-22 15:19:42] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 15:19:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:42] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 21 ms returned sat
[2024-05-22 15:19:42] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2024-05-22 15:19:42] [INFO ] Deduced a trap composed of 208 places in 158 ms of which 4 ms to minimize.
[2024-05-22 15:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:43] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-22 15:19:43] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-22 15:19:43] [INFO ] Deduced a trap composed of 208 places in 152 ms of which 3 ms to minimize.
[2024-05-22 15:19:43] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 3 ms to minimize.
[2024-05-22 15:19:43] [INFO ] Deduced a trap composed of 193 places in 147 ms of which 3 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 184 places in 142 ms of which 3 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 101 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 4 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 41 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 222 places in 146 ms of which 3 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:19:44] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-22 15:19:45] [INFO ] Deduced a trap composed of 216 places in 145 ms of which 3 ms to minimize.
[2024-05-22 15:19:45] [INFO ] Deduced a trap composed of 211 places in 143 ms of which 3 ms to minimize.
[2024-05-22 15:19:45] [INFO ] Deduced a trap composed of 152 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:19:45] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 3 ms to minimize.
[2024-05-22 15:19:45] [INFO ] Deduced a trap composed of 209 places in 136 ms of which 3 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 218 places in 142 ms of which 3 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 181 places in 137 ms of which 3 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 223 places in 137 ms of which 3 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 211 places in 141 ms of which 3 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 219 places in 136 ms of which 4 ms to minimize.
[2024-05-22 15:19:46] [INFO ] Deduced a trap composed of 174 places in 137 ms of which 3 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 143 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 193 places in 143 ms of which 4 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-22 15:19:47] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4337 ms
[2024-05-22 15:19:47] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-22 15:19:48] [INFO ] Added : 20 causal constraints over 4 iterations in 340 ms. Result :unknown
[2024-05-22 15:19:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:48] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:48] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2024-05-22 15:19:48] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-05-22 15:19:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:48] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2024-05-22 15:19:49] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-22 15:19:49] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 2 ms to minimize.
[2024-05-22 15:19:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2024-05-22 15:19:49] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-22 15:19:52] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 3 ms to minimize.
[2024-05-22 15:19:52] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-05-22 15:19:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 375 ms
[2024-05-22 15:19:52] [INFO ] Added : 328 causal constraints over 67 iterations in 3578 ms. Result :sat
Minimization took 744 ms.
[2024-05-22 15:19:53] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 11 ms returned unsat
[2024-05-22 15:19:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 19 ms returned sat
[2024-05-22 15:19:53] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-22 15:19:54] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 4 ms to minimize.
[2024-05-22 15:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-22 15:19:54] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-22 15:19:54] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 3 ms to minimize.
[2024-05-22 15:19:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-22 15:19:54] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-22 15:19:57] [INFO ] Added : 219 causal constraints over 44 iterations in 2938 ms. Result :sat
Minimization took 716 ms.
[2024-05-22 15:19:58] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:19:58] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:59] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2024-05-22 15:19:59] [INFO ] Deduced a trap composed of 200 places in 138 ms of which 3 ms to minimize.
[2024-05-22 15:19:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:19:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 15:19:59] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-22 15:19:59] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2024-05-22 15:20:00] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-22 15:20:04] [INFO ] Added : 410 causal constraints over 82 iterations in 4248 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 1, 2, +inf]
FORMULA DoubleExponent-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 527 transition count 388
Reduce places removed 108 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 419 transition count 385
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 226 place count 416 transition count 385
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 226 place count 416 transition count 363
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 270 place count 394 transition count 363
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 446 place count 306 transition count 275
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 480 place count 289 transition count 275
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 516 place count 289 transition count 239
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 552 place count 253 transition count 239
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 592 place count 253 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 252 transition count 238
Applied a total of 593 rules in 162 ms. Remains 252 /534 variables (removed 282) and now considering 238/498 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 252/534 places, 238/498 transitions.
Found an invariant !
This invariant on transitions {33=1, 49=1, 53=1, 86=1, 89=1, 125=1, 171=1, 212=1, 228=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {33=1, 49=1, 53=1, 86=1, 89=1, 125=1, 171=1, 212=1, 228=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1310 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
// Phase 1: matrix 238 rows 252 cols
[2024-05-22 15:20:26] [INFO ] Computed 50 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
RANDOM walk for 1000000 steps (128484 resets) in 1115 ms. (896 steps per ms)
BEST_FIRST walk for 13000004 steps (1101493 resets) in 8076 ms. (1609 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
[2024-05-22 15:20:36] [INFO ] Invariant cache hit.
[2024-05-22 15:20:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:36] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 15 ms returned sat
[2024-05-22 15:20:36] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-22 15:20:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:20:36] [INFO ] [Real]Added 33 Read/Feed constraints in 127 ms returned sat
[2024-05-22 15:20:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:36] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:36] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-22 15:20:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 141 ms returned sat
[2024-05-22 15:20:36] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:20:37] [INFO ] Added : 116 causal constraints over 24 iterations in 890 ms. Result :sat
Minimization took 546 ms.
[2024-05-22 15:20:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Real]Added 33 Read/Feed constraints in 93 ms returned sat
[2024-05-22 15:20:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-22 15:20:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 154 ms returned sat
[2024-05-22 15:20:38] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 17 ms.
[2024-05-22 15:20:40] [INFO ] Added : 178 causal constraints over 37 iterations in 1588 ms. Result :sat
Minimization took 701 ms.
[2024-05-22 15:20:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 15 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Real]Added 33 Read/Feed constraints in 141 ms returned sat
[2024-05-22 15:20:41] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-22 15:20:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-22 15:20:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 188 ms returned sat
[2024-05-22 15:20:41] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:20:43] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2024-05-22 15:20:43] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:20:43] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 80 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:20:44] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:20:45] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:20:45] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:20:45] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:20:45] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:20:45] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1840 ms
[2024-05-22 15:20:45] [INFO ] Added : 183 causal constraints over 37 iterations in 3689 ms. Result :sat
Minimization took 754 ms.
[2024-05-22 15:20:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Real]Added 33 Read/Feed constraints in 124 ms returned sat
[2024-05-22 15:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-22 15:20:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2024-05-22 15:20:46] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 20 ms.
[2024-05-22 15:20:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:20:48] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:20:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2024-05-22 15:20:48] [INFO ] Added : 123 causal constraints over 25 iterations in 1388 ms. Result :sat
Minimization took 685 ms.
[2024-05-22 15:20:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:49] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-22 15:20:49] [INFO ] [Real]Added 33 Read/Feed constraints in 50 ms returned sat
[2024-05-22 15:20:49] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 21 ms.
[2024-05-22 15:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:49] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:49] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-22 15:20:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 68 ms returned sat
[2024-05-22 15:20:49] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:20:50] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:20:50] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:20:51] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:20:52] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:20:53] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:20:53] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:20:53] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:20:53] [INFO ] Deduced a trap composed of 92 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:20:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2677 ms
[2024-05-22 15:20:53] [INFO ] Added : 162 causal constraints over 33 iterations in 4036 ms. Result :sat
Minimization took 753 ms.
[2024-05-22 15:20:54] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 15:20:54] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-22 15:20:54] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-22 15:20:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:54] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:54] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-22 15:20:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 179 ms returned sat
[2024-05-22 15:20:54] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-22 15:20:56] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:20:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-22 15:20:56] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 3 ms to minimize.
[2024-05-22 15:20:56] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:20:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 461 ms
[2024-05-22 15:20:56] [INFO ] Added : 171 causal constraints over 36 iterations in 2010 ms. Result :sat
Minimization took 598 ms.
[2024-05-22 15:20:57] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:57] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:57] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-22 15:20:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:20:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:20:57] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:20:57] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-22 15:20:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 152 ms returned sat
[2024-05-22 15:20:58] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:20:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2024-05-22 15:20:58] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:20:59] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:20:59] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:20:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-05-22 15:20:59] [INFO ] Added : 112 causal constraints over 23 iterations in 1601 ms. Result :sat
Minimization took 470 ms.
[2024-05-22 15:21:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 24 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Real]Added 33 Read/Feed constraints in 90 ms returned sat
[2024-05-22 15:21:00] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-22 15:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-22 15:21:00] [INFO ] [Nat]Added 33 Read/Feed constraints in 160 ms returned sat
[2024-05-22 15:21:00] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:21:02] [INFO ] Added : 203 causal constraints over 41 iterations in 1795 ms. Result :sat
Minimization took 764 ms.
[2024-05-22 15:21:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:03] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-22 15:21:03] [INFO ] [Real]Added 33 Read/Feed constraints in 166 ms returned sat
[2024-05-22 15:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:03] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-22 15:21:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 164 ms returned sat
[2024-05-22 15:21:04] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-22 15:21:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 313 ms
[2024-05-22 15:21:05] [INFO ] Added : 134 causal constraints over 27 iterations in 1290 ms. Result :sat
Minimization took 529 ms.
[2024-05-22 15:21:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:05] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:06] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-22 15:21:06] [INFO ] [Real]Added 33 Read/Feed constraints in 222 ms returned sat
[2024-05-22 15:21:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:06] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:06] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-22 15:21:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 264 ms returned sat
[2024-05-22 15:21:06] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-22 15:21:08] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-22 15:21:08] [INFO ] Added : 179 causal constraints over 36 iterations in 1620 ms. Result :sat
Minimization took 659 ms.
[2024-05-22 15:21:09] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Real]Added 33 Read/Feed constraints in 54 ms returned sat
[2024-05-22 15:21:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-22 15:21:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 117 ms returned sat
[2024-05-22 15:21:09] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-22 15:21:10] [INFO ] Added : 123 causal constraints over 25 iterations in 1003 ms. Result :sat
Minimization took 620 ms.
[2024-05-22 15:21:11] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Real]Added 33 Read/Feed constraints in 73 ms returned sat
[2024-05-22 15:21:11] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-22 15:21:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-22 15:21:11] [INFO ] [Nat]Added 33 Read/Feed constraints in 81 ms returned sat
[2024-05-22 15:21:11] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 15 ms.
[2024-05-22 15:21:12] [INFO ] Added : 36 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 394 ms.
[2024-05-22 15:21:12] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:12] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-22 15:21:12] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-22 15:21:12] [INFO ] [Real]Added 33 Read/Feed constraints in 109 ms returned sat
[2024-05-22 15:21:12] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-22 15:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:21:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-22 15:21:12] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-22 15:21:13] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-22 15:21:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 116 ms returned sat
[2024-05-22 15:21:13] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-22 15:21:15] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:21:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2024-05-22 15:21:15] [INFO ] Added : 153 causal constraints over 31 iterations in 1905 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
Support contains 13 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 18 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 252/252 places, 238/238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 11 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-22 15:21:56] [INFO ] Invariant cache hit.
[2024-05-22 15:21:56] [INFO ] Implicit Places using invariants in 275 ms returned [21, 27, 48, 53, 75, 81, 102, 108, 130, 136, 137, 164, 188, 196, 203, 211, 217, 242]
[2024-05-22 15:21:56] [INFO ] Actually due to overlaps returned [27, 203, 21, 136]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 278 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 248/252 places, 238/238 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 248 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 246 transition count 236
Applied a total of 4 rules in 20 ms. Remains 246 /248 variables (removed 2) and now considering 236/238 (removed 2) transitions.
// Phase 1: matrix 236 rows 246 cols
[2024-05-22 15:21:56] [INFO ] Computed 46 invariants in 20 ms
[2024-05-22 15:21:57] [INFO ] Implicit Places using invariants in 243 ms returned [45, 50, 72, 78, 99, 105, 127, 133, 160, 184, 192, 206, 211, 236]
[2024-05-22 15:21:57] [INFO ] Actually due to overlaps returned [50, 45, 236]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 245 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 243/252 places, 236/238 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 235
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 242 transition count 235
Applied a total of 3 rules in 37 ms. Remains 242 /243 variables (removed 1) and now considering 235/236 (removed 1) transitions.
// Phase 1: matrix 235 rows 242 cols
[2024-05-22 15:21:57] [INFO ] Computed 43 invariants in 15 ms
[2024-05-22 15:21:57] [INFO ] Implicit Places using invariants in 307 ms returned [69, 75, 96, 102, 124, 130, 157, 181, 189, 203, 208]
[2024-05-22 15:21:57] [INFO ] Actually due to overlaps returned [75, 69]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 309 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 240/252 places, 235/238 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 240 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 239 transition count 234
Applied a total of 2 rules in 15 ms. Remains 239 /240 variables (removed 1) and now considering 234/235 (removed 1) transitions.
// Phase 1: matrix 234 rows 239 cols
[2024-05-22 15:21:57] [INFO ] Computed 41 invariants in 13 ms
[2024-05-22 15:21:57] [INFO ] Implicit Places using invariants in 183 ms returned [93, 99, 121, 127, 154, 178, 186, 200, 205]
[2024-05-22 15:21:57] [INFO ] Actually due to overlaps returned [99, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 185 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 237/252 places, 234/238 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 1112 ms. Remains : 237/252 places, 234/238 transitions.
Found an invariant !
This invariant on transitions {30=1, 49=1, 76=1, 112=1, 158=1, 199=1, 215=1, 227=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {30=1, 49=1, 76=1, 112=1, 158=1, 199=1, 215=1, 227=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 2, +inf]
// Phase 1: matrix 234 rows 237 cols
[2024-05-22 15:22:28] [INFO ] Computed 39 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (144190 resets) in 816 ms. (1223 steps per ms)
BEST_FIRST walk for 13000006 steps (1188075 resets) in 7322 ms. (1775 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-22 15:22:36] [INFO ] Invariant cache hit.
[2024-05-22 15:22:36] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:36] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-22 15:22:36] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-22 15:22:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:22:36] [INFO ] [Real]Added 33 Read/Feed constraints in 79 ms returned sat
[2024-05-22 15:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:36] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-22 15:22:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 137 ms returned sat
[2024-05-22 15:22:36] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:22:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-22 15:22:37] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 15 ms.
[2024-05-22 15:22:38] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:22:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:22:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2024-05-22 15:22:38] [INFO ] Added : 146 causal constraints over 31 iterations in 1924 ms. Result :sat
Minimization took 844 ms.
[2024-05-22 15:22:39] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:39] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:39] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-22 15:22:40] [INFO ] [Real]Added 33 Read/Feed constraints in 65 ms returned sat
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:22:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:22:40] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:22:40] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-22 15:22:40] [INFO ] [Nat]Added 33 Read/Feed constraints in 143 ms returned sat
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:22:40] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:22:41] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:22:41] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:22:41] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:22:41] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:22:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1013 ms
[2024-05-22 15:22:41] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 11 ms.
[2024-05-22 15:22:44] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:22:44] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:22:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2024-05-22 15:22:44] [INFO ] Added : 210 causal constraints over 44 iterations in 3056 ms. Result :sat
Minimization took 1177 ms.
[2024-05-22 15:22:45] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:22:45] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:45] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-22 15:22:45] [INFO ] [Real]Added 33 Read/Feed constraints in 137 ms returned sat
[2024-05-22 15:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:22:46] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:46] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 15:22:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 115 ms returned sat
[2024-05-22 15:22:46] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 18 ms.
[2024-05-22 15:22:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:22:47] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:22:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 866 ms
[2024-05-22 15:22:48] [INFO ] Added : 161 causal constraints over 33 iterations in 2293 ms. Result :sat
Minimization took 526 ms.
[2024-05-22 15:22:49] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Real]Added 33 Read/Feed constraints in 37 ms returned sat
[2024-05-22 15:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-22 15:22:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 112 ms returned sat
[2024-05-22 15:22:49] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-22 15:22:51] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:22:51] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:22:51] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:22:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 323 ms
[2024-05-22 15:22:51] [INFO ] Added : 137 causal constraints over 29 iterations in 1881 ms. Result :sat
Minimization took 599 ms.
[2024-05-22 15:22:52] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Real]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-22 15:22:52] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 14 ms.
[2024-05-22 15:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-22 15:22:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 110 ms returned sat
[2024-05-22 15:22:52] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:22:52] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:22:53] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:22:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 324 ms
[2024-05-22 15:22:53] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 15 ms.
[2024-05-22 15:22:54] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:22:54] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:22:54] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:22:54] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:22:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 414 ms
[2024-05-22 15:22:54] [INFO ] Added : 151 causal constraints over 31 iterations in 1814 ms. Result :sat
Minimization took 466 ms.
[2024-05-22 15:22:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:22:55] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:55] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-22 15:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:22:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:22:55] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:22:55] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-22 15:22:56] [INFO ] [Nat]Added 33 Read/Feed constraints in 399 ms returned sat
[2024-05-22 15:22:56] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-22 15:22:56] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:23:00] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:23:01] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:23:01] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:23:01] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:23:01] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:23:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1136 ms
[2024-05-22 15:23:01] [INFO ] Added : 207 causal constraints over 42 iterations in 5043 ms. Result :sat
Minimization took 746 ms.
[2024-05-22 15:23:02] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:02] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:02] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-22 15:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:02] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:02] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-22 15:23:02] [INFO ] [Nat]Added 33 Read/Feed constraints in 197 ms returned sat
[2024-05-22 15:23:02] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 18 ms.
[2024-05-22 15:23:03] [INFO ] Added : 82 causal constraints over 17 iterations in 616 ms. Result :sat
Minimization took 390 ms.
[2024-05-22 15:23:03] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:03] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-22 15:23:03] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-22 15:23:04] [INFO ] [Real]Added 33 Read/Feed constraints in 94 ms returned sat
[2024-05-22 15:23:04] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 15 ms.
[2024-05-22 15:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:04] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:04] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-22 15:23:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2024-05-22 15:23:04] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-22 15:23:07] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-22 15:23:07] [INFO ] Added : 211 causal constraints over 43 iterations in 2754 ms. Result :sat
Minimization took 1001 ms.
[2024-05-22 15:23:08] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Real]Added 33 Read/Feed constraints in 85 ms returned sat
[2024-05-22 15:23:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-22 15:23:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 177 ms returned sat
[2024-05-22 15:23:08] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:23:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 15:23:08] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-22 15:23:11] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:23:11] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:23:11] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:23:11] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:23:11] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:23:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 507 ms
[2024-05-22 15:23:11] [INFO ] Added : 207 causal constraints over 43 iterations in 3064 ms. Result :sat
Minimization took 960 ms.
[2024-05-22 15:23:12] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:12] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:23:13] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-22 15:23:13] [INFO ] [Real]Added 33 Read/Feed constraints in 79 ms returned sat
[2024-05-22 15:23:13] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:23:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:13] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:23:13] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-22 15:23:13] [INFO ] [Nat]Added 33 Read/Feed constraints in 210 ms returned sat
[2024-05-22 15:23:13] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:23:13] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 3 ms to minimize.
[2024-05-22 15:23:13] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:23:13] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:23:14] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 3 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:23:15] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2088 ms
[2024-05-22 15:23:15] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 11 ms.
[2024-05-22 15:23:16] [INFO ] Added : 104 causal constraints over 21 iterations in 726 ms. Result :sat
Minimization took 434 ms.
[2024-05-22 15:23:16] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:16] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:17] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-22 15:23:17] [INFO ] [Real]Added 33 Read/Feed constraints in 46 ms returned sat
[2024-05-22 15:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:17] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:17] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-22 15:23:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 75 ms returned sat
[2024-05-22 15:23:17] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-22 15:23:18] [INFO ] Added : 94 causal constraints over 20 iterations in 804 ms. Result :sat
Minimization took 555 ms.
[2024-05-22 15:23:18] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:18] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:18] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-22 15:23:18] [INFO ] [Real]Added 33 Read/Feed constraints in 38 ms returned sat
[2024-05-22 15:23:18] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 14 ms.
[2024-05-22 15:23:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:23:18] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 4 ms returned sat
[2024-05-22 15:23:19] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-22 15:23:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 53 ms returned sat
[2024-05-22 15:23:19] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 12 ms.
[2024-05-22 15:23:19] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:23:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-22 15:23:19] [INFO ] Added : 32 causal constraints over 7 iterations in 338 ms. Result :sat
Minimization took 329 ms.
[2024-05-22 15:23:19] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:19] [INFO ] [Real]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:19] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-22 15:23:20] [INFO ] [Real]Added 33 Read/Feed constraints in 86 ms returned sat
[2024-05-22 15:23:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:23:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:23:20] [INFO ] [Nat]Absence check using 13 positive and 26 generalized place invariants in 5 ms returned sat
[2024-05-22 15:23:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-22 15:23:20] [INFO ] [Nat]Added 33 Read/Feed constraints in 210 ms returned sat
[2024-05-22 15:23:20] [INFO ] Computed and/alt/rep : 216/1171/216 causal constraints (skipped 17 transitions) in 13 ms.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:23:21] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:23:22] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:23:22] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:23:22] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:23:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1058 ms
[2024-05-22 15:23:22] [INFO ] Added : 125 causal constraints over 25 iterations in 1932 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Support contains 13 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 234/234 transitions.
Applied a total of 0 rules in 26 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 237/237 places, 234/234 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 234/234 transitions.
Applied a total of 0 rules in 17 ms. Remains 237 /237 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-22 15:23:58] [INFO ] Invariant cache hit.
[2024-05-22 15:23:59] [INFO ] Implicit Places using invariants in 194 ms returned [119, 125, 152, 176, 184, 198, 203]
[2024-05-22 15:23:59] [INFO ] Actually due to overlaps returned [125, 119]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 206 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 235/237 places, 234/234 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 234 transition count 233
Applied a total of 2 rules in 13 ms. Remains 234 /235 variables (removed 1) and now considering 233/234 (removed 1) transitions.
// Phase 1: matrix 233 rows 234 cols
[2024-05-22 15:23:59] [INFO ] Computed 37 invariants in 12 ms
[2024-05-22 15:23:59] [INFO ] Implicit Places using invariants in 293 ms returned [149, 173, 181, 195, 200]
[2024-05-22 15:23:59] [INFO ] Actually due to overlaps returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 294 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 233/237 places, 233/234 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 233 transition count 233
Applied a total of 1 rules in 11 ms. Remains 233 /233 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 233 cols
[2024-05-22 15:23:59] [INFO ] Computed 36 invariants in 9 ms
[2024-05-22 15:23:59] [INFO ] Implicit Places using invariants in 186 ms returned [172, 180, 194, 199]
[2024-05-22 15:23:59] [INFO ] Actually due to overlaps returned [172, 180]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 188 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 231/237 places, 233/234 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 231 transition count 233
Applied a total of 1 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 233/233 (removed 0) transitions.
// Phase 1: matrix 233 rows 231 cols
[2024-05-22 15:23:59] [INFO ] Computed 34 invariants in 12 ms
[2024-05-22 15:23:59] [INFO ] Implicit Places using invariants in 225 ms returned [192, 197]
[2024-05-22 15:23:59] [INFO ] Actually due to overlaps returned [192]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 230/237 places, 233/234 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 232
Applied a total of 2 rules in 7 ms. Remains 229 /230 variables (removed 1) and now considering 232/233 (removed 1) transitions.
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:23:59] [INFO ] Computed 33 invariants in 11 ms
[2024-05-22 15:23:59] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 15:23:59] [INFO ] Invariant cache hit.
[2024-05-22 15:24:00] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:24:01] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1375 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 229/237 places, 232/234 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 2347 ms. Remains : 229/237 places, 232/234 transitions.
Found an invariant !
This invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-22 15:28:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 1000000 steps (144220 resets) in 823 ms. (1213 steps per ms)
BEST_FIRST walk for 13000004 steps (1188854 resets) in 7394 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
[2024-05-22 15:28:42] [INFO ] Invariant cache hit.
[2024-05-22 15:28:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:42] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:28:42] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-22 15:28:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:28:42] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-22 15:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:28:43] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:43] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-22 15:28:43] [INFO ] [Nat]Added 33 Read/Feed constraints in 130 ms returned sat
[2024-05-22 15:28:43] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-22 15:28:43] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:28:43] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2024-05-22 15:28:44] [INFO ] Added : 100 causal constraints over 20 iterations in 700 ms. Result :sat
Minimization took 338 ms.
[2024-05-22 15:28:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:28:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:44] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-22 15:28:44] [INFO ] [Real]Added 33 Read/Feed constraints in 123 ms returned sat
[2024-05-22 15:28:44] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:44] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-22 15:28:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 179 ms returned sat
[2024-05-22 15:28:45] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2024-05-22 15:28:45] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-22 15:28:46] [INFO ] Added : 139 causal constraints over 28 iterations in 1308 ms. Result :sat
Minimization took 398 ms.
[2024-05-22 15:28:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Real]Added 33 Read/Feed constraints in 77 ms returned sat
[2024-05-22 15:28:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 15:28:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 135 ms returned sat
[2024-05-22 15:28:47] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-22 15:28:47] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 17 ms.
[2024-05-22 15:28:48] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:28:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-22 15:28:48] [INFO ] Added : 135 causal constraints over 28 iterations in 1185 ms. Result :sat
Minimization took 400 ms.
[2024-05-22 15:28:49] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Real]Added 33 Read/Feed constraints in 116 ms returned sat
[2024-05-22 15:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-22 15:28:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 111 ms returned sat
[2024-05-22 15:28:49] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:28:51] [INFO ] Deduced a trap composed of 77 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:28:52] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:28:52] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2024-05-22 15:28:52] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:28:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1297 ms
[2024-05-22 15:28:52] [INFO ] Added : 139 causal constraints over 29 iterations in 2556 ms. Result :sat
Minimization took 362 ms.
[2024-05-22 15:28:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:52] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-22 15:28:53] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-22 15:28:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-22 15:28:53] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 15:28:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 136 ms returned sat
[2024-05-22 15:28:53] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 6 ms to minimize.
[2024-05-22 15:28:53] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:28:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2024-05-22 15:28:53] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-22 15:28:54] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:28:54] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 3 ms to minimize.
[2024-05-22 15:28:54] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:28:54] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:28:54] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:28:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 576 ms
[2024-05-22 15:28:54] [INFO ] Added : 119 causal constraints over 25 iterations in 1356 ms. Result :sat
Minimization took 365 ms.
[2024-05-22 15:28:55] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:55] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:28:55] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 15:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:28:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:28:55] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-22 15:28:55] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-22 15:28:56] [INFO ] [Nat]Added 33 Read/Feed constraints in 541 ms returned sat
[2024-05-22 15:28:56] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-22 15:29:00] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:00] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:29:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
[2024-05-22 15:29:00] [INFO ] Added : 207 causal constraints over 43 iterations in 4531 ms. Result :sat
Minimization took 1396 ms.
[2024-05-22 15:29:02] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:02] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:02] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-22 15:29:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:02] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:02] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-22 15:29:02] [INFO ] [Nat]Added 33 Read/Feed constraints in 231 ms returned sat
[2024-05-22 15:29:02] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:29:02] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:29:03] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:29:03] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-22 15:29:03] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:29:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 696 ms
[2024-05-22 15:29:03] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 16 ms.
[2024-05-22 15:29:04] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 1 ms to minimize.
[2024-05-22 15:29:04] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 57 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:29:05] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:29:06] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:29:07] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:29:08] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:29:09] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:29:09] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:29:09] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 4613 ms
[2024-05-22 15:29:09] [INFO ] Added : 146 causal constraints over 30 iterations in 6099 ms. Result :sat
Minimization took 519 ms.
[2024-05-22 15:29:10] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Real]Added 33 Read/Feed constraints in 102 ms returned sat
[2024-05-22 15:29:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-22 15:29:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 123 ms returned sat
[2024-05-22 15:29:10] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-22 15:29:13] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:29:13] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:29:13] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:29:13] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:29:14] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:29:15] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:29:16] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:29:16] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:29:16] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:29:16] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2834 ms
[2024-05-22 15:29:16] [INFO ] Added : 201 causal constraints over 41 iterations in 5689 ms. Result :sat
Minimization took 720 ms.
[2024-05-22 15:29:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Real]Added 33 Read/Feed constraints in 101 ms returned sat
[2024-05-22 15:29:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-22 15:29:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 162 ms returned sat
[2024-05-22 15:29:17] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:29:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-22 15:29:17] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-22 15:29:20] [INFO ] Added : 205 causal constraints over 41 iterations in 2666 ms. Result :sat
Minimization took 602 ms.
[2024-05-22 15:29:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Real]Added 33 Read/Feed constraints in 62 ms returned sat
[2024-05-22 15:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:29:21] [INFO ] [Nat]Added 33 Read/Feed constraints in 103 ms returned sat
[2024-05-22 15:29:21] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:29:21] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:29:21] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:29:21] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 5 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:29:22] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:29:23] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:29:23] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:29:23] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:29:23] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1738 ms
[2024-05-22 15:29:23] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-22 15:29:24] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:29:24] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:29:25] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:29:26] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:29:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1346 ms
[2024-05-22 15:29:26] [INFO ] Added : 127 causal constraints over 27 iterations in 2865 ms. Result :sat
Minimization took 497 ms.
[2024-05-22 15:29:26] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:26] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 15:29:26] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-05-22 15:29:26] [INFO ] [Real]Added 33 Read/Feed constraints in 74 ms returned sat
[2024-05-22 15:29:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:27] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:27] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-22 15:29:27] [INFO ] [Nat]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-22 15:29:27] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:29:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-22 15:29:27] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-22 15:29:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:29:28] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:29:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2024-05-22 15:29:28] [INFO ] Added : 98 causal constraints over 21 iterations in 844 ms. Result :sat
Minimization took 275 ms.
[2024-05-22 15:29:28] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Real]Added 33 Read/Feed constraints in 52 ms returned sat
[2024-05-22 15:29:28] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:29:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-22 15:29:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 39 ms returned sat
[2024-05-22 15:29:29] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-22 15:29:29] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:29:29] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:29:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-22 15:29:29] [INFO ] Added : 31 causal constraints over 7 iterations in 314 ms. Result :sat
Minimization took 214 ms.
[2024-05-22 15:29:29] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:29] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-22 15:29:29] [INFO ] [Real]Added 33 Read/Feed constraints in 174 ms returned sat
[2024-05-22 15:29:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:29:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:29:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:29:30] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-22 15:29:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 162 ms returned sat
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:29:30] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:29:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1593 ms
[2024-05-22 15:29:31] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 16 ms.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:29:33] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1166 ms
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:29:34] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:29:35] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:29:35] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:29:35] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:29:35] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:29:36] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:29:36] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:29:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1800 ms
[2024-05-22 15:29:36] [INFO ] Added : 146 causal constraints over 30 iterations in 4553 ms. Result :sat
Minimization took 573 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
Support contains 13 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Applied a total of 0 rules in 6 ms. Remains 229 /229 variables (removed 0) and now considering 232/232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 229/229 places, 232/232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 232/232 (removed 0) transitions.
[2024-05-22 15:30:24] [INFO ] Invariant cache hit.
[2024-05-22 15:30:24] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 15:30:24] [INFO ] Invariant cache hit.
[2024-05-22 15:30:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:30:25] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2024-05-22 15:30:25] [INFO ] Redundant transitions in 8 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-22 15:30:25] [INFO ] Invariant cache hit.
[2024-05-22 15:30:26] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 105 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:30:29] [INFO ] Deduced a trap composed of 95 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 89 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 108 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 101 places in 66 ms of which 2 ms to minimize.
[2024-05-22 15:30:30] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:30:31] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:30:32] [INFO ] Deduced a trap composed of 111 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:32] [INFO ] Deduced a trap composed of 103 places in 59 ms of which 2 ms to minimize.
[2024-05-22 15:30:32] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:33] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:30:33] [INFO ] Deduced a trap composed of 119 places in 61 ms of which 2 ms to minimize.
[2024-05-22 15:30:33] [INFO ] Deduced a trap composed of 112 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:34] [INFO ] Deduced a trap composed of 112 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:35] [INFO ] Deduced a trap composed of 110 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:30:35] [INFO ] Deduced a trap composed of 114 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:35] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (OVERLAPS) 232/461 variables, 229/296 constraints. Problems are: Problem set: 0 solved, 231 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 33/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 0/461 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 329 constraints, problems are : Problem set: 0 solved, 231 unsolved in 19802 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 229/229 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 1/229 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:47] [INFO ] Deduced a trap composed of 105 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:30:47] [INFO ] Deduced a trap composed of 106 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:30:47] [INFO ] Deduced a trap composed of 112 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:49] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:30:49] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:30:50] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:30:50] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:30:50] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:30:50] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 2 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 109 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 105 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:30:51] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:30:52] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:30:52] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:30:52] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:30:52] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (OVERLAPS) 232/461 variables, 229/321 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 33/354 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 231/585 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 15:31:04] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:31:04] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:31:05] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:31:06] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:31:06] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:31:06] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:31:06] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:31:06] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:31:07] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:31:07] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:31:07] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 20/605 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/461 variables, and 605 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 229/229 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 79/79 constraints]
After SMT, in 49933ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 49951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51373 ms. Remains : 229/229 places, 232/232 transitions.
Found an invariant !
This invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 46=1, 73=1, 105=1, 151=1, 192=1, 208=1, 220=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1427 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 1, 6]
RANDOM walk for 40000 steps (5758 resets) in 1167 ms. (34 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (355 resets) in 104 ms. (38 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (357 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (372 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
[2024-05-22 15:35:50] [INFO ] Flatten gal took : 126 ms
BEST_FIRST walk for 4001 steps (362 resets) in 76 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (367 resets) in 78 ms. (50 steps per ms) remains 24/24 properties
[2024-05-22 15:35:50] [INFO ] Flatten gal took : 68 ms
BEST_FIRST walk for 4001 steps (367 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (376 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
[2024-05-22 15:35:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8670892334736039480.gal : 19 ms
BEST_FIRST walk for 4001 steps (381 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
[2024-05-22 15:35:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10499896655279945494.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8670892334736039480.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10499896655279945494.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (358 resets) in 56 ms. (70 steps per ms) remains 24/24 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4002 steps (367 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (356 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (365 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (364 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
Loading property file /tmp/ReachabilityCardinality10499896655279945494.prop.
BEST_FIRST walk for 4000 steps (378 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (385 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (357 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,24 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,24 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,24 properties remain. new max is 32
SDD size :8 after 14
BEST_FIRST walk for 4002 steps (374 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 64
SDD size :14 after 27
BEST_FIRST walk for 4004 steps (358 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
SDD proceeding with computation,24 properties remain. new max is 128
SDD size :27 after 50
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :50 after 146
SDD proceeding with computation,24 properties remain. new max is 512
SDD size :146 after 547
BEST_FIRST walk for 4002 steps (378 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
Invariant property MIN11 does not hold.
Reachability property MAX11 is true.
SDD proceeding with computation,22 properties remain. new max is 512
SDD size :547 after 3235
BEST_FIRST walk for 4002 steps (361 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
SDD proceeding with computation,22 properties remain. new max is 1024
SDD size :3235 after 16275
BEST_FIRST walk for 4000 steps (350 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (367 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (365 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (351 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
SDD proceeding with computation,22 properties remain. new max is 2048
SDD size :16275 after 69200
SDD proceeding with computation,22 properties remain. new max is 4096
SDD size :69200 after 246574
SDD proceeding with computation,22 properties remain. new max is 8192
SDD size :246574 after 599466
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :599466 after 2.15486e+06
SDD proceeding with computation,22 properties remain. new max is 32768
SDD size :2.15486e+06 after 9.78748e+06
SDD proceeding with computation,22 properties remain. new max is 65536
SDD size :9.78748e+06 after 2.7607e+07
Interrupted probabilistic random walk after 138782 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :2 out of 24
Probabilistic random walk after 138782 steps, saw 69401 distinct states, run finished after 3005 ms. (steps per millisecond=46 ) properties seen :2
[2024-05-22 15:35:54] [INFO ] Invariant cache hit.
[2024-05-22 15:35:54] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 126/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem MAX12 is UNSAT
At refinement iteration 3 (OVERLAPS) 86/224 variables, 29/31 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 232/456 variables, 224/255 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 33/288 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/461 variables, 5/293 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 2/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/461 variables, 0/295 constraints. Problems are: Problem set: 1 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 295 constraints, problems are : Problem set: 1 solved, 21 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 229/229 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 126/138 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 111 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 113 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 86/224 variables, 29/33 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:35:55] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 1 ms to minimize.
SDD proceeding with computation,22 properties remain. new max is 131072
SDD size :2.7607e+07 after 6.5356e+07
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 2 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:35:56] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:35:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 2 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:35:58] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:35:59] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:36:00] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:00] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
SMT process timed out in 6063ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 229 transition count 229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 226 transition count 229
Applied a total of 6 rules in 26 ms. Remains 226 /229 variables (removed 3) and now considering 229/232 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 226/229 places, 229/232 transitions.
RANDOM walk for 40000 steps (5825 resets) in 328 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (367 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (361 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (363 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (371 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (359 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (365 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (367 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (362 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (366 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (368 resets) in 59 ms. (66 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (354 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (358 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (366 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (359 resets) in 40 ms. (97 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (363 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (376 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (364 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (370 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (366 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (356 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (351 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
SDD proceeding with computation,22 properties remain. new max is 262144
SDD size :6.5356e+07 after 1.4419e+08
Interrupted probabilistic random walk after 154517 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 21
Probabilistic random walk after 154517 steps, saw 77264 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
// Phase 1: matrix 229 rows 226 cols
[2024-05-22 15:36:03] [INFO ] Computed 33 invariants in 10 ms
[2024-05-22 15:36:03] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 157/169 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 52/221 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 229/450 variables, 221/252 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 33/285 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/455 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/455 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 292 constraints, problems are : Problem set: 0 solved, 21 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 226/226 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 157/169 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:36:04] [INFO ] Deduced a trap composed of 101 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 52/221 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:36:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:36:06] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:07] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 3 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:36:08] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:36:09] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:10] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 16/112 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:11] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:12] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 229/450 variables, 221/340 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/450 variables, 33/373 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/450 variables, 21/394 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:13] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:36:13] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 21 unsolved
SDD proceeding with computation,22 properties remain. new max is 524288
SDD size :1.4419e+08 after 3.05415e+08
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 5/455 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/455 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/455 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (OVERLAPS) 0/455 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 403 constraints, problems are : Problem set: 0 solved, 21 unsolved in 11130 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 226/226 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 90/90 constraints]
After SMT, in 12161ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 12 different solutions.
SDD proceeding with computation,22 properties remain. new max is 1048576
SDD size :3.05415e+08 after 6.33122e+08
Detected timeout of ITS tools.
[2024-05-22 15:36:40] [INFO ] Flatten gal took : 21 ms
[2024-05-22 15:36:40] [INFO ] Applying decomposition
[2024-05-22 15:36:40] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3056850596832431179.txt' '-o' '/tmp/graph3056850596832431179.bin' '-w' '/tmp/graph3056850596832431179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3056850596832431179.bin' '-l' '-1' '-v' '-w' '/tmp/graph3056850596832431179.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:36:41] [INFO ] Decomposing Gal with order
[2024-05-22 15:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:36:41] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-22 15:36:41] [INFO ] Flatten gal took : 80 ms
[2024-05-22 15:36:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 32 ms.
[2024-05-22 15:36:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5079535884351553000.gal : 17 ms
[2024-05-22 15:36:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality904651435090975368.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5079535884351553000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality904651435090975368.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality904651435090975368.prop.
SDD proceeding with computation,21 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,21 properties remain. new max is 8
SDD size :8 after 40
SDD proceeding with computation,21 properties remain. new max is 16
SDD size :40 after 55
SDD proceeding with computation,21 properties remain. new max is 32
SDD size :55 after 57
SDD proceeding with computation,21 properties remain. new max is 64
SDD size :57 after 93
SDD proceeding with computation,21 properties remain. new max is 128
SDD size :93 after 276
SDD proceeding with computation,21 properties remain. new max is 256
SDD size :276 after 289
SDD proceeding with computation,21 properties remain. new max is 512
SDD size :289 after 390
Parikh walk visited 0 properties in 33665 ms.
Support contains 12 out of 226 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 229/229 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 226/226 places, 229/229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 226/226 places, 229/229 transitions.
Applied a total of 0 rules in 5 ms. Remains 226 /226 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2024-05-22 15:36:49] [INFO ] Invariant cache hit.
[2024-05-22 15:36:49] [INFO ] Implicit Places using invariants in 181 ms returned [223]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 225/226 places, 229/229 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 224 transition count 228
Applied a total of 2 rules in 9 ms. Remains 224 /225 variables (removed 1) and now considering 228/229 (removed 1) transitions.
// Phase 1: matrix 228 rows 224 cols
[2024-05-22 15:36:49] [INFO ] Computed 32 invariants in 12 ms
[2024-05-22 15:36:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 15:36:49] [INFO ] Invariant cache hit.
[2024-05-22 15:36:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:36:51] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 1484 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 224/226 places, 228/229 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1684 ms. Remains : 224/226 places, 228/229 transitions.
RANDOM walk for 40000 steps (5718 resets) in 317 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (349 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (364 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (382 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (348 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (377 resets) in 37 ms. (105 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (363 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (370 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (362 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (370 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (392 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (366 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (387 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (373 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (373 resets) in 22 ms. (173 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (378 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (369 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (378 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (367 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (378 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (354 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (364 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 174023 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 21
Probabilistic random walk after 174023 steps, saw 87029 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-22 15:36:54] [INFO ] Invariant cache hit.
[2024-05-22 15:36:54] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 155/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 52/219 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 228/447 variables, 219/249 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 33/282 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 5/452 variables, 5/287 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 289 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 155/167 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:55] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 10 ms to minimize.
[2024-05-22 15:36:55] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:55] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:36:55] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 2 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 108 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 52/219 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 15:36:56] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:36:57] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:58] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:36:59] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:37:00] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:01] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 6 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:02] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:37:03] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:04] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:05] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:06] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:37:07] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/219 variables, 17/178 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:08] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/219 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 2 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 3 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 1 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:09] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/219 variables, 11/197 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/219 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:37:10] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:37:11] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/219 variables, 14/213 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 2 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:37:12] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:37:13] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/219 variables, 20/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 228/447 variables, 219/452 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/447 variables, 33/485 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/447 variables, 21/506 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/447 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 5/452 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/452 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:18] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/452 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/452 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 15:37:19] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/452 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/452 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 29 (OVERLAPS) 0/452 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 452/452 variables, and 515 constraints, problems are : Problem set: 0 solved, 21 unsolved in 26328 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 205/205 constraints]
After SMT, in 27361ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 12 different solutions.
Detected timeout of ITS tools.
Parikh walk visited 0 properties in 32180 ms.
Support contains 12 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 228/228 transitions.
Applied a total of 0 rules in 6 ms. Remains 224 /224 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 224/224 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 228/228 transitions.
Applied a total of 0 rules in 17 ms. Remains 224 /224 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2024-05-22 15:37:54] [INFO ] Invariant cache hit.
[2024-05-22 15:37:54] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 15:37:54] [INFO ] Invariant cache hit.
[2024-05-22 15:37:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:37:55] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2024-05-22 15:37:55] [INFO ] Redundant transitions in 17 ms returned []
Running 227 sub problems to find dead transitions.
[2024-05-22 15:37:55] [INFO ] Invariant cache hit.
[2024-05-22 15:37:55] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/224 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 15:37:58] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:37:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/452 variables, 224/258 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 33/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/452 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 291 constraints, problems are : Problem set: 0 solved, 227 unsolved in 15557 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 227 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 3 (OVERLAPS) 1/224 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 6 (OVERLAPS) 228/452 variables, 224/258 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 33/291 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 227/518 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 15:38:19] [INFO ] Deduced a trap composed of 93 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:38:20] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:38:21] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:38:21] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:38:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:38:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:38:22] [INFO ] Deduced a trap composed of 83 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:38:23] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:38:23] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 2 ms to minimize.
[2024-05-22 15:38:23] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 20/538 constraints. Problems are: Problem set: 0 solved, 227 unsolved
[2024-05-22 15:38:27] [INFO ] Deduced a trap composed of 99 places in 71 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 227 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 227 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 539 constraints, problems are : Problem set: 0 solved, 227 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 224/224 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 227/227 constraints, Known Traps: 23/23 constraints]
After SMT, in 45681ms problems are : Problem set: 0 solved, 227 unsolved
Search for dead transitions found 0 dead transitions in 45686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47232 ms. Remains : 224/224 places, 228/228 transitions.
FORMULA DoubleExponent-PT-010-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1, 6]
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:38:41] [INFO ] Computed 33 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1446 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (911 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:38:41] [INFO ] Invariant cache hit.
[2024-05-22 15:38:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:38:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 15:38:41] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-22 15:38:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:38:41] [INFO ] [Real]Added 33 Read/Feed constraints in 83 ms returned sat
[2024-05-22 15:38:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:38:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:38:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:38:41] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 15:38:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 134 ms returned sat
[2024-05-22 15:38:41] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:38:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-05-22 15:38:41] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-22 15:38:42] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:38:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-05-22 15:38:42] [INFO ] Added : 100 causal constraints over 20 iterations in 706 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p283) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 227 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 225 transition count 226
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 225 transition count 224
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 93 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 98 place count 135 transition count 131
Reduce places removed 4 places and 0 transitions.
Graph (complete) has 508 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 103 place count 130 transition count 131
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 130 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 106 place count 129 transition count 130
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 129 transition count 126
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 114 place count 125 transition count 126
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 125 transition count 126
Applied a total of 116 rules in 15 ms. Remains 125 /229 variables (removed 104) and now considering 126/230 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 125/229 places, 126/230 transitions.
// Phase 1: matrix 126 rows 125 cols
[2024-05-22 15:38:43] [INFO ] Computed 20 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144130 resets) in 603 ms. (1655 steps per ms)
BEST_FIRST walk for 1000000 steps (91061 resets) in 434 ms. (2298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:38:44] [INFO ] Invariant cache hit.
[2024-05-22 15:38:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 15:38:44] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-22 15:38:44] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-22 15:38:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:38:44] [INFO ] [Real]Added 23 Read/Feed constraints in 31 ms returned sat
[2024-05-22 15:38:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:38:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 15:38:44] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-22 15:38:44] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-22 15:38:44] [INFO ] [Nat]Added 23 Read/Feed constraints in 27 ms returned sat
[2024-05-22 15:38:44] [INFO ] Computed and/alt/rep : 104/629/104 causal constraints (skipped 21 transitions) in 9 ms.
[2024-05-22 15:38:45] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:38:45] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:38:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 133 ms
[2024-05-22 15:38:45] [INFO ] Added : 81 causal constraints over 18 iterations in 520 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 125/125 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 125 /125 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2024-05-22 15:38:45] [INFO ] Invariant cache hit.
[2024-05-22 15:38:45] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 15:38:45] [INFO ] Invariant cache hit.
[2024-05-22 15:38:45] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:38:46] [INFO ] Implicit Places using invariants and state equation in 507 ms returned [74, 122]
[2024-05-22 15:38:46] [INFO ] Actually due to overlaps returned [122]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 598 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/125 places, 126/126 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 124 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 123 transition count 125
Applied a total of 2 rules in 6 ms. Remains 123 /124 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 123 cols
[2024-05-22 15:38:46] [INFO ] Computed 19 invariants in 8 ms
[2024-05-22 15:38:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 15:38:46] [INFO ] Invariant cache hit.
[2024-05-22 15:38:46] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:38:46] [INFO ] Implicit Places using invariants and state equation in 548 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 634 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 122/125 places, 125/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1244 ms. Remains : 122/125 places, 125/126 transitions.
// Phase 1: matrix 125 rows 122 cols
[2024-05-22 15:38:46] [INFO ] Computed 18 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143998 resets) in 599 ms. (1666 steps per ms)
BEST_FIRST walk for 1000001 steps (91627 resets) in 432 ms. (2309 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:38:47] [INFO ] Invariant cache hit.
[2024-05-22 15:38:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 15:38:47] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-22 15:38:47] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-22 15:38:47] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:38:48] [INFO ] [Real]Added 23 Read/Feed constraints in 26 ms returned sat
[2024-05-22 15:38:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:38:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 15:38:48] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:38:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-22 15:38:48] [INFO ] [Nat]Added 23 Read/Feed constraints in 15 ms returned sat
[2024-05-22 15:38:48] [INFO ] Computed and/alt/rep : 108/669/108 causal constraints (skipped 16 transitions) in 8 ms.
[2024-05-22 15:38:48] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:38:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 15:38:48] [INFO ] Added : 104 causal constraints over 21 iterations in 613 ms. Result :sat
Minimization took 283 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 122/122 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-22 15:38:49] [INFO ] Invariant cache hit.
[2024-05-22 15:38:49] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 15:38:49] [INFO ] Invariant cache hit.
[2024-05-22 15:38:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-22 15:38:49] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-22 15:38:49] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-05-22 15:38:49] [INFO ] Invariant cache hit.
[2024-05-22 15:38:49] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD123 is UNSAT
At refinement iteration 6 (OVERLAPS) 125/247 variables, 122/140 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 163 constraints, problems are : Problem set: 1 solved, 123 unsolved in 3895 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 122/122 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/122 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 5/18 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 125/247 variables, 122/140 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 23/163 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 123/286 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 123 unsolved
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 51 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:38:58] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:38:59] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:38:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/247 variables, 15/301 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 123 unsolved
[2024-05-22 15:39:02] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 1/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
At refinement iteration 14 (OVERLAPS) 0/247 variables, 0/302 constraints. Problems are: Problem set: 1 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 302 constraints, problems are : Problem set: 1 solved, 123 unsolved in 15107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 122/122 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 123/124 constraints, Known Traps: 16/16 constraints]
After SMT, in 19043ms problems are : Problem set: 1 solved, 123 unsolved
Search for dead transitions found 1 dead transitions in 19046ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/122 places, 124/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-22 15:39:08] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19577 ms. Remains : 122/122 places, 124/125 transitions.
// Phase 1: matrix 124 rows 122 cols
[2024-05-22 15:39:08] [INFO ] Computed 19 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144516 resets) in 637 ms. (1567 steps per ms)
BEST_FIRST walk for 1000001 steps (91645 resets) in 441 ms. (2262 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:39:09] [INFO ] Invariant cache hit.
[2024-05-22 15:39:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 15:39:09] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-22 15:39:09] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-22 15:39:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-22 15:39:09] [INFO ] [Real]Added 22 Read/Feed constraints in 27 ms returned sat
[2024-05-22 15:39:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:39:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 15:39:09] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-22 15:39:10] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-22 15:39:10] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2024-05-22 15:39:10] [INFO ] Computed and/alt/rep : 107/659/107 causal constraints (skipped 16 transitions) in 9 ms.
[2024-05-22 15:39:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:39:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-22 15:39:10] [INFO ] Added : 79 causal constraints over 17 iterations in 418 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 122/122 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-22 15:39:10] [INFO ] Invariant cache hit.
[2024-05-22 15:39:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 15:39:11] [INFO ] Invariant cache hit.
[2024-05-22 15:39:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-22 15:39:11] [INFO ] Implicit Places using invariants and state equation in 388 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 486 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 121/122 places, 124/124 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 123
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 120 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 119 transition count 123
Applied a total of 4 rules in 6 ms. Remains 119 /121 variables (removed 2) and now considering 123/124 (removed 1) transitions.
// Phase 1: matrix 123 rows 119 cols
[2024-05-22 15:39:11] [INFO ] Computed 18 invariants in 3 ms
[2024-05-22 15:39:11] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 15:39:11] [INFO ] Invariant cache hit.
[2024-05-22 15:39:11] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 15:39:11] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 119/122 places, 123/124 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 944 ms. Remains : 119/122 places, 123/124 transitions.
[2024-05-22 15:39:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144064 resets) in 606 ms. (1647 steps per ms)
BEST_FIRST walk for 1000000 steps (91624 resets) in 429 ms. (2325 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:39:12] [INFO ] Invariant cache hit.
[2024-05-22 15:39:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 15:39:12] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:39:12] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-22 15:39:13] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 15:39:13] [INFO ] [Real]Added 24 Read/Feed constraints in 19 ms returned sat
[2024-05-22 15:39:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:39:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 15:39:13] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:39:13] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-22 15:39:13] [INFO ] [Nat]Added 24 Read/Feed constraints in 13 ms returned sat
[2024-05-22 15:39:13] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:39:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 15:39:13] [INFO ] Computed and/alt/rep : 104/651/104 causal constraints (skipped 18 transitions) in 10 ms.
[2024-05-22 15:39:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:39:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-22 15:39:13] [INFO ] Added : 90 causal constraints over 18 iterations in 507 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 119/119 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-22 15:39:14] [INFO ] Invariant cache hit.
[2024-05-22 15:39:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 15:39:14] [INFO ] Invariant cache hit.
[2024-05-22 15:39:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 15:39:14] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-22 15:39:14] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-22 15:39:14] [INFO ] Invariant cache hit.
[2024-05-22 15:39:14] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3919 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 122/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:20] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:39:20] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:39:20] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:39:21] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:39:21] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 0 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:39:23] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:25] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:39:25] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:26] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:32] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:39:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:39:32] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:39:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-22 15:39:32] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 304 constraints, problems are : Problem set: 0 solved, 122 unsolved in 21298 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 21/21 constraints]
After SMT, in 25256ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 25258ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25723 ms. Remains : 119/119 places, 123/123 transitions.
[2024-05-22 15:39:39] [INFO ] Flatten gal took : 26 ms
[2024-05-22 15:39:39] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:39:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6088966228753145772.gal : 2 ms
[2024-05-22 15:39:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14578755550146846108.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6088966228753145772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14578755550146846108.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (5756 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3662 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality14578755550146846108.prop.
BEST_FIRST walk for 40001 steps (3688 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 142
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :142 after 261
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 743
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 2469
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2469 after 11777
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11777 after 40137
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :40137 after 105214
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :105214 after 244034
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :244034 after 523829
Interrupted probabilistic random walk after 519283 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 2
Probabilistic random walk after 519283 steps, saw 259690 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-22 15:39:42] [INFO ] Invariant cache hit.
[2024-05-22 15:39:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:42] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:39:43] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 15:39:43] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:39:43] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/241 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/242 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:43] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/241 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/242 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 981 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 119/119 places, 123/123 transitions.
RANDOM walk for 40000 steps (5753 resets) in 117 ms. (338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3707 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3631 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :523829 after 2.52503e+07
Interrupted probabilistic random walk after 526616 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 2
Probabilistic random walk after 526616 steps, saw 263365 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-22 15:39:47] [INFO ] Invariant cache hit.
[2024-05-22 15:39:47] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:47] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:39:47] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:39:47] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:39:47] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 19/241 variables, 14/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/242 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/242 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 166 constraints, problems are : Problem set: 0 solved, 2 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/80 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 24/104 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 118/222 variables, 104/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:48] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/241 variables, 14/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/241 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/241 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/241 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:39:48] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/241 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/241 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/242 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/242 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 170 constraints, problems are : Problem set: 0 solved, 2 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 711ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 951 ms.
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 119/119 places, 123/123 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 119/119 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-22 15:39:49] [INFO ] Invariant cache hit.
[2024-05-22 15:39:49] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 15:39:49] [INFO ] Invariant cache hit.
[2024-05-22 15:39:49] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-22 15:39:49] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-22 15:39:49] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-22 15:39:49] [INFO ] Invariant cache hit.
[2024-05-22 15:39:49] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.52503e+07 after 2.33765e+08
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3852 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/119 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 123/242 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 24/161 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 122/283 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:56] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:39:56] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:39:56] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:39:56] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:39:56] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 5/288 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 62 places in 38 ms of which 1 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:39:58] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 8/296 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:40:00] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:40:00] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:40:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:40:07] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/242 variables, 5/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.33765e+08 after 9.75909e+08
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 304 constraints, problems are : Problem set: 0 solved, 122 unsolved in 21476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 21/21 constraints]
After SMT, in 25371ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 25373ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25820 ms. Remains : 119/119 places, 123/123 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 119 transition count 112
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 108 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 102 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 102 transition count 106
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 102 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 101 transition count 105
Applied a total of 36 rules in 32 ms. Remains 101 /119 variables (removed 18) and now considering 105/123 (removed 18) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 105 rows 101 cols
[2024-05-22 15:40:15] [INFO ] Computed 18 invariants in 5 ms
[2024-05-22 15:40:15] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-22 15:40:15] [INFO ] [Real]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:40:15] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 15:40:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:40:15] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:40:15] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:40:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-22 15:40:15] [INFO ] [Nat]Absence check using 3 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:40:15] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 15:40:15] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:40:15] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:40:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-22 15:40:15] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-22 15:40:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
TRAPS : Iteration 1
[2024-05-22 15:40:15] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:40:15] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:40:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:40:15] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:40:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11273189214851758422.gal : 1 ms
[2024-05-22 15:40:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11498934429667996098.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11273189214851758422.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11498934429667996098.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11498934429667996098.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 165
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :165 after 295
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :295 after 1353
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1353 after 3824
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3824 after 16757
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16757 after 41397
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :41397 after 135045
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :135045 after 328943
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :328943 after 857480
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :857480 after 2.01584e+06
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.01584e+06 after 4.67105e+06
Detected timeout of ITS tools.
[2024-05-22 15:40:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:40:29] [INFO ] Applying decomposition
[2024-05-22 15:40:29] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2931201733621578132.txt' '-o' '/tmp/graph2931201733621578132.bin' '-w' '/tmp/graph2931201733621578132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2931201733621578132.bin' '-l' '-1' '-v' '-w' '/tmp/graph2931201733621578132.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:40:29] [INFO ] Decomposing Gal with order
[2024-05-22 15:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:40:29] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-22 15:40:29] [INFO ] Flatten gal took : 16 ms
[2024-05-22 15:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 3 ms.
[2024-05-22 15:40:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7383818644131621721.gal : 2 ms
[2024-05-22 15:40:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2454482407000520254.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7383818644131621721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2454482407000520254.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality2454482407000520254.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1147
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :12047 after 12047
Detected timeout of ITS tools.
[2024-05-22 15:40:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:40:30] [INFO ] Applying decomposition
[2024-05-22 15:40:30] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5448354622562882901.txt' '-o' '/tmp/graph5448354622562882901.bin' '-w' '/tmp/graph5448354622562882901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5448354622562882901.bin' '-l' '-1' '-v' '-w' '/tmp/graph5448354622562882901.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:40:30] [INFO ] Decomposing Gal with order
[2024-05-22 15:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:40:30] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-22 15:40:30] [INFO ] Flatten gal took : 32 ms
[2024-05-22 15:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2024-05-22 15:40:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15938436522671671966.gal : 19 ms
[2024-05-22 15:40:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9680769229576994079.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15938436522671671966.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9680769229576994079.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9680769229576994079.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 255
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747052 after 757883
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30678 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 124495 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:40:45] [INFO ] Computed 33 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1427 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (916 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:40:45] [INFO ] Invariant cache hit.
[2024-05-22 15:40:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:40:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:40:45] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-22 15:40:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:40:46] [INFO ] [Real]Added 33 Read/Feed constraints in 126 ms returned sat
[2024-05-22 15:40:46] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:40:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:40:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:40:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:40:46] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-22 15:40:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 179 ms returned sat
[2024-05-22 15:40:46] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:40:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2024-05-22 15:40:46] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:40:47] [INFO ] Added : 139 causal constraints over 28 iterations in 1290 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p513) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 227 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 227 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 226 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 15 place count 221 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 219 transition count 223
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 28 place count 219 transition count 214
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 37 place count 210 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 210 transition count 214
Applied a total of 41 rules in 26 ms. Remains 210 /229 variables (removed 19) and now considering 214/231 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 210/229 places, 214/231 transitions.
// Phase 1: matrix 214 rows 210 cols
[2024-05-22 15:40:59] [INFO ] Computed 33 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144108 resets) in 754 ms. (1324 steps per ms)
BEST_FIRST walk for 1000001 steps (91221 resets) in 532 ms. (1876 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:41:01] [INFO ] Invariant cache hit.
[2024-05-22 15:41:01] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:41:01] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:41:01] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-22 15:41:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:41:01] [INFO ] [Real]Added 40 Read/Feed constraints in 53 ms returned sat
[2024-05-22 15:41:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:41:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:41:01] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 12 ms returned sat
[2024-05-22 15:41:01] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-22 15:41:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 87 ms returned sat
[2024-05-22 15:41:01] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:41:01] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:02] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:41:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:41:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:41:05] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:41:05] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3397 ms
[2024-05-22 15:41:05] [INFO ] Computed and/alt/rep : 165/1041/165 causal constraints (skipped 48 transitions) in 16 ms.
[2024-05-22 15:41:06] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:41:06] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:41:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-05-22 15:41:06] [INFO ] Added : 127 causal constraints over 27 iterations in 1725 ms. Result :sat
Minimization took 387 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:41:10] [INFO ] Invariant cache hit.
[2024-05-22 15:41:10] [INFO ] Implicit Places using invariants in 165 ms returned [134, 207]
[2024-05-22 15:41:10] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 166 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 213
Applied a total of 2 rules in 8 ms. Remains 208 /209 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 208 cols
[2024-05-22 15:41:10] [INFO ] Computed 32 invariants in 12 ms
[2024-05-22 15:41:10] [INFO ] Implicit Places using invariants in 157 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 213/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 212
Applied a total of 2 rules in 8 ms. Remains 206 /207 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 206 cols
[2024-05-22 15:41:10] [INFO ] Computed 31 invariants in 13 ms
[2024-05-22 15:41:11] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 15:41:11] [INFO ] Invariant cache hit.
[2024-05-22 15:41:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:41:12] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1445 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1788 ms. Remains : 206/210 places, 212/214 transitions.
[2024-05-22 15:41:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144121 resets) in 753 ms. (1326 steps per ms)
BEST_FIRST walk for 1000001 steps (91421 resets) in 531 ms. (1879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:41:13] [INFO ] Invariant cache hit.
[2024-05-22 15:41:13] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 15:41:13] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:41:13] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-22 15:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:41:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:41:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:41:13] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-22 15:41:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:41:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 140 ms returned sat
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:41:14] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:41:15] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:41:16] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:41:16] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1913 ms
[2024-05-22 15:41:16] [INFO ] Computed and/alt/rep : 168/1080/168 causal constraints (skipped 43 transitions) in 14 ms.
[2024-05-22 15:41:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:41:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-22 15:41:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-05-22 15:41:18] [INFO ] Added : 150 causal constraints over 31 iterations in 2229 ms. Result :sat
Minimization took 665 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 212/212 transitions.
Applied a total of 0 rules in 12 ms. Remains 206 /206 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-22 15:41:34] [INFO ] Invariant cache hit.
[2024-05-22 15:41:34] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:41:34] [INFO ] Invariant cache hit.
[2024-05-22 15:41:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:41:35] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2024-05-22 15:41:35] [INFO ] Redundant transitions in 2 ms returned []
Running 211 sub problems to find dead transitions.
[2024-05-22 15:41:35] [INFO ] Invariant cache hit.
[2024-05-22 15:41:36] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Problem TDEAD97 is UNSAT
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 0/418 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 277 constraints, problems are : Problem set: 1 solved, 210 unsolved in 9333 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/31 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 212/418 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/418 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 210/487 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-22 15:41:54] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:41:54] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:41:54] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:41:54] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:55] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-22 15:41:56] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:41:57] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:41:57] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:41:57] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:41:57] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 20/507 constraints. Problems are: Problem set: 1 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/507 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-22 15:42:08] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:42:08] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:42:08] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:42:09] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:42:10] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/418 variables, 5/512 constraints. Problems are: Problem set: 1 solved, 210 unsolved
[2024-05-22 15:42:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 513 constraints, problems are : Problem set: 1 solved, 210 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 210/211 constraints, Known Traps: 26/26 constraints]
After SMT, in 39448ms problems are : Problem set: 1 solved, 210 unsolved
Search for dead transitions found 1 dead transitions in 39452ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 211/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 15:42:15] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40959 ms. Remains : 206/206 places, 211/212 transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-22 15:42:15] [INFO ] Computed 32 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144491 resets) in 737 ms. (1355 steps per ms)
BEST_FIRST walk for 1000000 steps (91418 resets) in 523 ms. (1908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:42:16] [INFO ] Invariant cache hit.
[2024-05-22 15:42:16] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:42:16] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 14 ms returned sat
[2024-05-22 15:42:16] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-22 15:42:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:42:16] [INFO ] [Real]Added 39 Read/Feed constraints in 87 ms returned sat
[2024-05-22 15:42:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:42:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 15:42:17] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 15:42:17] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-22 15:42:17] [INFO ] [Nat]Added 39 Read/Feed constraints in 89 ms returned sat
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:42:17] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:42:18] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:42:19] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2281 ms
[2024-05-22 15:42:19] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 16 ms.
[2024-05-22 15:42:21] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:42:21] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:42:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2024-05-22 15:42:21] [INFO ] Added : 143 causal constraints over 29 iterations in 2166 ms. Result :sat
Minimization took 424 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 15:42:32] [INFO ] Invariant cache hit.
[2024-05-22 15:42:32] [INFO ] Implicit Places using invariants in 146 ms returned [169]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 153 ms. Remains : 205/206 places, 211/211 transitions.
// Phase 1: matrix 211 rows 205 cols
[2024-05-22 15:42:32] [INFO ] Computed 31 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144448 resets) in 749 ms. (1333 steps per ms)
BEST_FIRST walk for 1000000 steps (91486 resets) in 531 ms. (1879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:42:33] [INFO ] Invariant cache hit.
[2024-05-22 15:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 15:42:33] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:42:34] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-22 15:42:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:42:34] [INFO ] [Real]Added 39 Read/Feed constraints in 69 ms returned sat
[2024-05-22 15:42:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:42:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:42:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:42:34] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-22 15:42:34] [INFO ] [Nat]Added 39 Read/Feed constraints in 125 ms returned sat
[2024-05-22 15:42:34] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:42:34] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:42:34] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:42:34] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:42:34] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:42:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 509 ms
[2024-05-22 15:42:34] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-22 15:42:37] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:42:37] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:42:37] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:42:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 286 ms
[2024-05-22 15:42:37] [INFO ] Added : 150 causal constraints over 31 iterations in 2487 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 15:42:43] [INFO ] Invariant cache hit.
[2024-05-22 15:42:43] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 15:42:43] [INFO ] Invariant cache hit.
[2024-05-22 15:42:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:42:44] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2024-05-22 15:42:44] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 15:42:44] [INFO ] Invariant cache hit.
[2024-05-22 15:42:44] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 12344 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 210/485 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 15:43:04] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:43:06] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:43:06] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:43:07] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:43:07] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:43:07] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:43:08] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 86 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:43:09] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 15:43:13] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:43:13] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:43:17] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-22 15:43:17] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 509 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 24/24 constraints]
After SMT, in 42466ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42471ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43957 ms. Remains : 205/205 places, 211/211 transitions.
[2024-05-22 15:43:27] [INFO ] Flatten gal took : 38 ms
RANDOM walk for 40000 steps (5727 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3653 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-22 15:43:27] [INFO ] Flatten gal took : 34 ms
[2024-05-22 15:43:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8666423137419558118.gal : 2 ms
[2024-05-22 15:43:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3475575598260908231.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8666423137419558118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3475575598260908231.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40000 steps (3634 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3475575598260908231.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 236
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :236 after 494
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :494 after 1092
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1092 after 21806
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :21806 after 38846
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :38846 after 100170
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :100170 after 235452
Interrupted probabilistic random walk after 415914 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 2
Probabilistic random walk after 415914 steps, saw 207998 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2024-05-22 15:43:30] [INFO ] Invariant cache hit.
[2024-05-22 15:43:30] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:43:30] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2024-05-22 15:43:30] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :235452 after 495804
[2024-05-22 15:43:30] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 1 ms to minimize.
[2024-05-22 15:43:31] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/416 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:43:31] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:43:31] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 28 places in 565 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:43:32] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 10/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/416 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1739 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 2618ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :495804 after 2.50631e+07
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.50631e+07 after 2.31939e+08
Parikh walk visited 0 properties in 17634 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 211/211 transitions.
RANDOM walk for 40000 steps (5748 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3612 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3666 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 397697 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 397697 steps, saw 198886 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-22 15:43:53] [INFO ] Invariant cache hit.
[2024-05-22 15:43:53] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:43:53] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/416 variables, 4/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/416 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/147 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 211/412 variables, 201/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 39/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:43:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
[2024-05-22 15:43:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 10/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/416 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/416 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 291 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1663ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17592 ms.
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 15:44:13] [INFO ] Invariant cache hit.
[2024-05-22 15:44:13] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 15:44:13] [INFO ] Invariant cache hit.
[2024-05-22 15:44:13] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:44:14] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1457 ms to find 0 implicit places.
[2024-05-22 15:44:14] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 15:44:14] [INFO ] Invariant cache hit.
[2024-05-22 15:44:14] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Detected timeout of ITS tools.
[2024-05-22 15:44:17] [INFO ] Flatten gal took : 27 ms
[2024-05-22 15:44:17] [INFO ] Applying decomposition
[2024-05-22 15:44:17] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6061551358052034056.txt' '-o' '/tmp/graph6061551358052034056.bin' '-w' '/tmp/graph6061551358052034056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6061551358052034056.bin' '-l' '-1' '-v' '-w' '/tmp/graph6061551358052034056.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:44:17] [INFO ] Decomposing Gal with order
[2024-05-22 15:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:44:17] [INFO ] Removed a total of 128 redundant transitions.
[2024-05-22 15:44:17] [INFO ] Flatten gal took : 31 ms
[2024-05-22 15:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 106 labels/synchronizations in 13 ms.
[2024-05-22 15:44:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2932421201843446407.gal : 8 ms
[2024-05-22 15:44:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9223284542321130020.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2932421201843446407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9223284542321130020.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9223284542321130020.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 34
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :34 after 53
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :53 after 1147
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1147 after 2530
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 275 constraints, problems are : Problem set: 0 solved, 210 unsolved in 12099 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/203 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2530 after 747204
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747204 after 764589
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :764589 after 944086
At refinement iteration 3 (OVERLAPS) 2/205 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :944086 after 2.3569e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/416 variables, 205/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 39/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.3569e+06 after 8.34701e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 210/485 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 15:44:33] [INFO ] Deduced a trap composed of 95 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:44:35] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:44:36] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:44:36] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:44:36] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:44:36] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:44:37] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:44:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:44:37] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:44:37] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:44:37] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.34701e+06 after 2.93828e+07
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:44:38] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 15:44:42] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:44:43] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-22 15:44:46] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:44:46] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/416 variables, and 509 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 205/205 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 24/24 constraints]
After SMT, in 42217ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42220ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43686 ms. Remains : 205/205 places, 211/211 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 205 transition count 193
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 193
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 178 transition count 184
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 178 transition count 184
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 177 transition count 183
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 177 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 176 transition count 182
Applied a total of 58 rules in 15 ms. Remains 176 /205 variables (removed 29) and now considering 182/211 (removed 29) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 182 rows 176 cols
[2024-05-22 15:44:56] [INFO ] Computed 31 invariants in 8 ms
[2024-05-22 15:44:56] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:44:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:44:56] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 15:44:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:44:56] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:44:57] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
TRAPS : Iteration 1
[2024-05-22 15:44:57] [INFO ] After 111ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:44:57] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:44:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:44:57] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:44:57] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 15:44:57] [INFO ] After 14ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:44:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:44:57] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:44:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
TRAPS : Iteration 1
[2024-05-22 15:44:57] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:44:57] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:44:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:44:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:44:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9554858344439268066.gal : 2 ms
[2024-05-22 15:44:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3993709067262997699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9554858344439268066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3993709067262997699.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3993709067262997699.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10402 after 23043
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23043 after 50349
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :50349 after 106795
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :106795 after 224170
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :224170 after 461332
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :461332 after 942906
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.93828e+07 after 9.36991e+07
Detected timeout of ITS tools.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :942906 after 1.91211e+06
Detected timeout of ITS tools.
[2024-05-22 15:45:12] [INFO ] Flatten gal took : 18 ms
[2024-05-22 15:45:12] [INFO ] Applying decomposition
[2024-05-22 15:45:12] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4725203595897036322.txt' '-o' '/tmp/graph4725203595897036322.bin' '-w' '/tmp/graph4725203595897036322.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4725203595897036322.bin' '-l' '-1' '-v' '-w' '/tmp/graph4725203595897036322.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:45:12] [INFO ] Decomposing Gal with order
[2024-05-22 15:45:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:45:12] [INFO ] Removed a total of 109 redundant transitions.
[2024-05-22 15:45:12] [INFO ] Flatten gal took : 21 ms
[2024-05-22 15:45:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2024-05-22 15:45:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1423783870550713413.gal : 4 ms
[2024-05-22 15:45:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8078093604909050594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1423783870550713413.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8078093604909050594.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8078093604909050594.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 25736
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30936 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 281875 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:45:27] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1428 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (895 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:45:27] [INFO ] Invariant cache hit.
[2024-05-22 15:45:27] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:45:27] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 15:45:27] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-22 15:45:27] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:45:27] [INFO ] [Real]Added 33 Read/Feed constraints in 72 ms returned sat
[2024-05-22 15:45:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:45:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:45:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:45:28] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-22 15:45:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 134 ms returned sat
[2024-05-22 15:45:28] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:45:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-22 15:45:28] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-22 15:45:29] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:45:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-22 15:45:29] [INFO ] Added : 135 causal constraints over 28 iterations in 1183 ms. Result :sat
Minimization took 388 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p465) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 226 transition count 227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 226 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 224 transition count 225
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 218 transition count 221
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 28 place count 218 transition count 214
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 35 place count 211 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 211 transition count 214
Applied a total of 38 rules in 18 ms. Remains 211 /229 variables (removed 18) and now considering 214/230 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 211/229 places, 214/230 transitions.
// Phase 1: matrix 214 rows 211 cols
[2024-05-22 15:45:36] [INFO ] Computed 33 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144197 resets) in 693 ms. (1440 steps per ms)
BEST_FIRST walk for 1000000 steps (91067 resets) in 486 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:45:37] [INFO ] Invariant cache hit.
[2024-05-22 15:45:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:45:37] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:45:37] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-22 15:45:37] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:45:37] [INFO ] [Real]Added 39 Read/Feed constraints in 84 ms returned sat
[2024-05-22 15:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:45:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:45:38] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:45:38] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-22 15:45:38] [INFO ] [Nat]Added 39 Read/Feed constraints in 197 ms returned sat
[2024-05-22 15:45:38] [INFO ] Computed and/alt/rep : 167/1045/167 causal constraints (skipped 46 transitions) in 16 ms.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-22 15:45:39] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:45:40] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1717 ms
[2024-05-22 15:45:40] [INFO ] Added : 94 causal constraints over 19 iterations in 2522 ms. Result :sat
Minimization took 308 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 211 /211 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:45:45] [INFO ] Invariant cache hit.
[2024-05-22 15:45:45] [INFO ] Implicit Places using invariants in 164 ms returned [134, 208]
[2024-05-22 15:45:45] [INFO ] Actually due to overlaps returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 213
Applied a total of 2 rules in 7 ms. Remains 209 /210 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 209 cols
[2024-05-22 15:45:45] [INFO ] Computed 32 invariants in 10 ms
[2024-05-22 15:45:45] [INFO ] Implicit Places using invariants in 149 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/211 places, 213/214 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 212
Applied a total of 2 rules in 7 ms. Remains 207 /208 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 207 cols
[2024-05-22 15:45:45] [INFO ] Computed 31 invariants in 11 ms
[2024-05-22 15:45:45] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 15:45:45] [INFO ] Invariant cache hit.
[2024-05-22 15:45:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:45:47] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned [146, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1621 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 205/211 places, 212/214 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 211
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 204 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 202 transition count 211
Applied a total of 6 rules in 10 ms. Remains 202 /205 variables (removed 3) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 202 cols
[2024-05-22 15:45:47] [INFO ] Computed 29 invariants in 17 ms
[2024-05-22 15:45:47] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 15:45:47] [INFO ] Invariant cache hit.
[2024-05-22 15:45:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:45:48] [INFO ] Implicit Places using invariants and state equation in 1209 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/211 places, 211/214 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3383 ms. Remains : 202/211 places, 211/214 transitions.
[2024-05-22 15:45:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144408 resets) in 794 ms. (1257 steps per ms)
BEST_FIRST walk for 1000000 steps (91342 resets) in 551 ms. (1811 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:45:50] [INFO ] Invariant cache hit.
[2024-05-22 15:45:50] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 15:45:50] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-22 15:45:50] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-22 15:45:50] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:45:50] [INFO ] [Real]Added 39 Read/Feed constraints in 79 ms returned sat
[2024-05-22 15:45:50] [INFO ] Computed and/alt/rep : 158/1027/158 causal constraints (skipped 52 transitions) in 14 ms.
[2024-05-22 15:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:45:50] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 15:45:50] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-22 15:45:50] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-22 15:45:50] [INFO ] [Nat]Added 39 Read/Feed constraints in 95 ms returned sat
[2024-05-22 15:45:50] [INFO ] Computed and/alt/rep : 158/1027/158 causal constraints (skipped 52 transitions) in 12 ms.
[2024-05-22 15:45:51] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:45:51] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:45:52] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:45:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1720 ms
[2024-05-22 15:45:53] [INFO ] Added : 134 causal constraints over 28 iterations in 3026 ms. Result :sat
Minimization took 550 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 202/202 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 13 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 15:45:56] [INFO ] Invariant cache hit.
[2024-05-22 15:45:56] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 15:45:56] [INFO ] Invariant cache hit.
[2024-05-22 15:45:56] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:45:57] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1325 ms to find 0 implicit places.
[2024-05-22 15:45:57] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 15:45:57] [INFO ] Invariant cache hit.
[2024-05-22 15:45:57] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/202 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 15:46:00] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 6 (OVERLAPS) 211/413 variables, 202/232 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 39/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 0/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/413 variables, 0/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 271 constraints, problems are : Problem set: 19 solved, 191 unsolved in 12039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 202/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 19 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 15/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 10/193 variables, 10/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 1/28 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/28 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 6 (OVERLAPS) 6/199 variables, 2/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 15:46:11] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-22 15:46:11] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-22 15:46:11] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 3/33 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/33 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 9 (OVERLAPS) 211/410 variables, 199/232 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 39/271 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 132/403 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:46:19] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 4/407 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:46:23] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:46:24] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:46:25] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:46:26] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:46:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 17/424 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 15:46:34] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:46:34] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:46:35] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:46:35] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 4/428 constraints. Problems are: Problem set: 19 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/413 variables, and 428 constraints, problems are : Problem set: 19 solved, 191 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 199/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 132/210 constraints, Known Traps: 29/29 constraints]
After SMT, in 42151ms problems are : Problem set: 19 solved, 191 unsolved
Search for dead transitions found 19 dead transitions in 42155ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/202 places, 192/211 transitions.
Graph (complete) has 984 edges and 202 vertex of which 185 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 185 /202 variables (removed 17) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 185 cols
[2024-05-22 15:46:40] [INFO ] Computed 28 invariants in 13 ms
[2024-05-22 15:46:40] [INFO ] Implicit Places using invariants in 152 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 152 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 184/202 places, 192/211 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 184 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 183 transition count 191
Applied a total of 2 rules in 6 ms. Remains 183 /184 variables (removed 1) and now considering 191/192 (removed 1) transitions.
// Phase 1: matrix 191 rows 183 cols
[2024-05-22 15:46:40] [INFO ] Computed 27 invariants in 6 ms
[2024-05-22 15:46:40] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:46:40] [INFO ] Invariant cache hit.
[2024-05-22 15:46:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 15:46:41] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 183/202 places, 191/211 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 44897 ms. Remains : 183/202 places, 191/211 transitions.
[2024-05-22 15:46:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144722 resets) in 700 ms. (1426 steps per ms)
BEST_FIRST walk for 1000000 steps (91419 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:46:42] [INFO ] Invariant cache hit.
[2024-05-22 15:46:42] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-22 15:46:42] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:46:42] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:46:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 15:46:42] [INFO ] [Real]Added 35 Read/Feed constraints in 58 ms returned sat
[2024-05-22 15:46:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:46:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-22 15:46:42] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:46:43] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-22 15:46:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 105 ms returned sat
[2024-05-22 15:46:43] [INFO ] Computed and/alt/rep : 152/980/152 causal constraints (skipped 38 transitions) in 17 ms.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:46:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 963 ms
[2024-05-22 15:46:45] [INFO ] Added : 146 causal constraints over 31 iterations in 2818 ms. Result :sat
Minimization took 692 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 183/183 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 2 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-22 15:46:50] [INFO ] Invariant cache hit.
[2024-05-22 15:46:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 15:46:50] [INFO ] Invariant cache hit.
[2024-05-22 15:46:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 15:46:51] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2024-05-22 15:46:51] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 15:46:51] [INFO ] Invariant cache hit.
[2024-05-22 15:46:51] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/374 variables, 183/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 35/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 245 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7034 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 15:46:59] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/374 variables, 183/211 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 35/246 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 190/436 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 15:47:06] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:47:06] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:47:07] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 439 constraints, problems are : Problem set: 0 solved, 190 unsolved in 24619 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 31721ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 31723ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32886 ms. Remains : 183/183 places, 191/191 transitions.
[2024-05-22 15:47:23] [INFO ] Flatten gal took : 16 ms
RANDOM walk for 40000 steps (5873 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
[2024-05-22 15:47:23] [INFO ] Flatten gal took : 41 ms
[2024-05-22 15:47:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11412400529064368375.gal : 4 ms
[2024-05-22 15:47:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9855421537365200221.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11412400529064368375.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9855421537365200221.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (3678 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9855421537365200221.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
BEST_FIRST walk for 40002 steps (3638 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 241
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :241 after 523
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :523 after 1160
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1160 after 23444
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23444 after 42531
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42531 after 111290
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :111290 after 244806
Interrupted probabilistic random walk after 468604 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :0 out of 2
Probabilistic random walk after 468604 steps, saw 234348 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
[2024-05-22 15:47:26] [INFO ] Invariant cache hit.
[2024-05-22 15:47:26] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:47:26] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/374 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/374 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD size :244806 after 519329
After SMT solving in domain Int declared 374/374 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :519329 after 3.61605e+06
Parikh walk visited 0 properties in 7058 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 183/183 places, 191/191 transitions.
RANDOM walk for 40000 steps (5805 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3628 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3642 resets) in 122 ms. (325 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 405035 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 2
Probabilistic random walk after 405035 steps, saw 202552 distinct states, run finished after 3002 ms. (steps per millisecond=134 ) properties seen :0
[2024-05-22 15:47:37] [INFO ] Invariant cache hit.
[2024-05-22 15:47:37] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:47:37] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/374 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/374 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 246 constraints, problems are : Problem set: 0 solved, 2 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/178 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 191/369 variables, 178/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 35/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/374 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/374 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 248 constraints, problems are : Problem set: 0 solved, 2 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 637ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.61605e+06 after 2.15402e+07
Parikh walk visited 0 properties in 7669 ms.
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 12 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 183/183 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 191/191 transitions.
Applied a total of 0 rules in 3 ms. Remains 183 /183 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2024-05-22 15:47:45] [INFO ] Invariant cache hit.
[2024-05-22 15:47:45] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 15:47:45] [INFO ] Invariant cache hit.
[2024-05-22 15:47:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 15:47:46] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2024-05-22 15:47:46] [INFO ] Redundant transitions in 1 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-22 15:47:46] [INFO ] Invariant cache hit.
[2024-05-22 15:47:46] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 191/374 variables, 183/210 constraints. Problems are: Problem set: 0 solved, 190 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 35/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (OVERLAPS) 0/374 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 245 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 2/183 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 190 unsolved
SDD size :2.15402e+07 after 6.56965e+07
[2024-05-22 15:47:55] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 191/374 variables, 183/211 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 35/246 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/374 variables, 190/436 constraints. Problems are: Problem set: 0 solved, 190 unsolved
[2024-05-22 15:48:01] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:48:01] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:48:02] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Detected timeout of ITS tools.
[2024-05-22 15:48:13] [INFO ] Flatten gal took : 15 ms
[2024-05-22 15:48:13] [INFO ] Applying decomposition
[2024-05-22 15:48:13] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10634174991015101450.txt' '-o' '/tmp/graph10634174991015101450.bin' '-w' '/tmp/graph10634174991015101450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10634174991015101450.bin' '-l' '-1' '-v' '-w' '/tmp/graph10634174991015101450.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:48:13] [INFO ] Decomposing Gal with order
[2024-05-22 15:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:48:13] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 15:48:13] [INFO ] Flatten gal took : 15 ms
[2024-05-22 15:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 4 ms.
[2024-05-22 15:48:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7554894958085342222.gal : 3 ms
[2024-05-22 15:48:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality851716827807902659.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7554894958085342222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality851716827807902659.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality851716827807902659.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 21
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21 after 46
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :46 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 1146
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1146 after 1332
At refinement iteration 11 (OVERLAPS) 0/374 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 439 constraints, problems are : Problem set: 0 solved, 190 unsolved in 24260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 183/183 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 4/4 constraints]
After SMT, in 31461ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 31465ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32671 ms. Remains : 183/183 places, 191/191 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 0 place count 183 transition count 174
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 166 transition count 174
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 42 place count 158 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 50 place count 158 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 158 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 156 transition count 164
Applied a total of 54 rules in 20 ms. Remains 156 /183 variables (removed 27) and now considering 164/191 (removed 27) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 164 rows 156 cols
[2024-05-22 15:48:18] [INFO ] Computed 27 invariants in 7 ms
[2024-05-22 15:48:18] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 15:48:18] [INFO ] [Real]Absence check using 12 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-22 15:48:18] [INFO ] After 110ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 15:48:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:48:18] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:48:18] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:48:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 15:48:18] [INFO ] [Nat]Absence check using 12 positive and 15 generalized place invariants in 2 ms returned sat
[2024-05-22 15:48:18] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 15:48:18] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:48:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
TRAPS : Iteration 1
[2024-05-22 15:48:18] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:48:18] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:48:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 15:48:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:48:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7014631274796176596.gal : 2 ms
[2024-05-22 15:48:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7244619209052975221.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7014631274796176596.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7244619209052975221.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7244619209052975221.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 171
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :171 after 295
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :295 after 1069
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1069 after 3495
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3495 after 11771
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :11771 after 27815
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :27815 after 62071
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :62071 after 142133
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :142133 after 318807
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :318807 after 688405
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :688405 after 1.45201e+06
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :1.45201e+06 after 3.04772e+06
Detected timeout of ITS tools.
[2024-05-22 15:48:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:48:34] [INFO ] Applying decomposition
[2024-05-22 15:48:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11432569978252762986.txt' '-o' '/tmp/graph11432569978252762986.bin' '-w' '/tmp/graph11432569978252762986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11432569978252762986.bin' '-l' '-1' '-v' '-w' '/tmp/graph11432569978252762986.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:48:34] [INFO ] Decomposing Gal with order
[2024-05-22 15:48:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:48:34] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 15:48:34] [INFO ] Flatten gal took : 30 ms
[2024-05-22 15:48:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2024-05-22 15:48:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality341478571242587220.gal : 2 ms
[2024-05-22 15:48:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13344035351392785822.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality341478571242587220.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13344035351392785822.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality13344035351392785822.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4640
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30756 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 201539 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:48:49] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1429 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10000 steps (941 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:48:49] [INFO ] Invariant cache hit.
[2024-05-22 15:48:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:48:49] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 15:48:49] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:48:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:48:49] [INFO ] [Real]Added 33 Read/Feed constraints in 117 ms returned sat
[2024-05-22 15:48:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:48:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:48:49] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:48:49] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-22 15:48:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 113 ms returned sat
[2024-05-22 15:48:49] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-22 15:48:51] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:48:52] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:48:52] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-22 15:48:52] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:48:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1241 ms
[2024-05-22 15:48:52] [INFO ] Added : 139 causal constraints over 29 iterations in 2546 ms. Result :sat
Minimization took 379 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p350) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 2 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 227 transition count 226
Reduce places removed 4 places and 4 transitions.
Graph (complete) has 931 edges and 223 vertex of which 222 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 222 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 222 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 220 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 215 transition count 215
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 214 transition count 215
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 214 transition count 206
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 45 place count 204 transition count 206
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 49 place count 204 transition count 206
Applied a total of 49 rules in 22 ms. Remains 204 /229 variables (removed 25) and now considering 206/230 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 204/229 places, 206/230 transitions.
// Phase 1: matrix 206 rows 204 cols
[2024-05-22 15:48:53] [INFO ] Computed 33 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144558 resets) in 792 ms. (1261 steps per ms)
BEST_FIRST walk for 1000001 steps (91436 resets) in 567 ms. (1760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:48:54] [INFO ] Invariant cache hit.
[2024-05-22 15:48:54] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-22 15:48:54] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:48:54] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2024-05-22 15:48:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:48:54] [INFO ] [Real]Added 40 Read/Feed constraints in 54 ms returned sat
[2024-05-22 15:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:48:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:48:54] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:48:54] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-22 15:48:54] [INFO ] [Nat]Added 40 Read/Feed constraints in 94 ms returned sat
[2024-05-22 15:48:54] [INFO ] Computed and/alt/rep : 154/978/154 causal constraints (skipped 51 transitions) in 15 ms.
[2024-05-22 15:48:55] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-05-22 15:48:55] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:48:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:48:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 246 ms
[2024-05-22 15:48:56] [INFO ] Added : 98 causal constraints over 21 iterations in 1046 ms. Result :sat
Minimization took 304 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 204/204 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-05-22 15:48:56] [INFO ] Invariant cache hit.
[2024-05-22 15:48:57] [INFO ] Implicit Places using invariants in 320 ms returned [98, 129, 201]
[2024-05-22 15:48:57] [INFO ] Actually due to overlaps returned [201]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 321 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 203/204 places, 206/206 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 203 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 202 transition count 205
Applied a total of 2 rules in 8 ms. Remains 202 /203 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 202 cols
[2024-05-22 15:48:57] [INFO ] Computed 32 invariants in 10 ms
[2024-05-22 15:48:57] [INFO ] Implicit Places using invariants in 208 ms returned [98, 129]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 208 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 200/204 places, 205/206 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 204
Applied a total of 2 rules in 8 ms. Remains 199 /200 variables (removed 1) and now considering 204/205 (removed 1) transitions.
// Phase 1: matrix 204 rows 199 cols
[2024-05-22 15:48:57] [INFO ] Computed 30 invariants in 14 ms
[2024-05-22 15:48:57] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 15:48:57] [INFO ] Invariant cache hit.
[2024-05-22 15:48:57] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 15:48:59] [INFO ] Implicit Places using invariants and state equation in 1575 ms returned [102]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1733 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 198/204 places, 204/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2289 ms. Remains : 198/204 places, 204/206 transitions.
// Phase 1: matrix 204 rows 198 cols
[2024-05-22 15:48:59] [INFO ] Computed 29 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143938 resets) in 779 ms. (1282 steps per ms)
BEST_FIRST walk for 1000000 steps (91298 resets) in 552 ms. (1808 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:49:00] [INFO ] Invariant cache hit.
[2024-05-22 15:49:00] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-22 15:49:00] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-22 15:49:00] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:49:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:49:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 15:49:00] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 2 ms returned sat
[2024-05-22 15:49:00] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-22 15:49:00] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:49:00] [INFO ] [Nat]Added 38 Read/Feed constraints in 66 ms returned sat
[2024-05-22 15:49:00] [INFO ] Computed and/alt/rep : 156/1000/156 causal constraints (skipped 47 transitions) in 12 ms.
[2024-05-22 15:49:01] [INFO ] Added : 105 causal constraints over 22 iterations in 823 ms. Result :sat
Minimization took 359 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 198/198 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 204/204 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-22 15:49:02] [INFO ] Invariant cache hit.
[2024-05-22 15:49:02] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 15:49:02] [INFO ] Invariant cache hit.
[2024-05-22 15:49:02] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 15:49:04] [INFO ] Implicit Places using invariants and state equation in 1443 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-22 15:49:04] [INFO ] Redundant transitions in 1 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-22 15:49:04] [INFO ] Invariant cache hit.
[2024-05-22 15:49:04] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (OVERLAPS) 2/198 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 5 (OVERLAPS) 204/402 variables, 198/227 constraints. Problems are: Problem set: 61 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 38/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 265 constraints, problems are : Problem set: 61 solved, 142 unsolved in 6625 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/198 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 11/13 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/13 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 32/168 variables, 8/21 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/21 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 26/194 variables, 7/28 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-22 15:49:11] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:49:11] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 2/30 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/30 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 2/196 variables, 1/31 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/31 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 204/400 variables, 196/227 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 38/265 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 104/369 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-22 15:49:17] [INFO ] Deduced a trap composed of 78 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:49:18] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:49:18] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:49:18] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:49:18] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:18] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:49:19] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:20] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:49:20] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:49:20] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:49:20] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:49:20] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 17/386 constraints. Problems are: Problem set: 61 solved, 142 unsolved
[2024-05-22 15:49:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:49:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/400 variables, 2/388 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/388 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 16 (OVERLAPS) 2/402 variables, 2/390 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/402 variables, 38/428 constraints. Problems are: Problem set: 61 solved, 142 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/402 variables, 0/428 constraints. Problems are: Problem set: 61 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 428 constraints, problems are : Problem set: 61 solved, 142 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 198/198 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 142/203 constraints, Known Traps: 21/21 constraints]
After SMT, in 36721ms problems are : Problem set: 61 solved, 142 unsolved
Search for dead transitions found 61 dead transitions in 36725ms
Found 61 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 61 transitions
Dead transitions reduction (with SMT) removed 61 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/198 places, 143/204 transitions.
Graph (complete) has 675 edges and 198 vertex of which 138 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 138 /198 variables (removed 60) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 138 cols
[2024-05-22 15:49:40] [INFO ] Computed 21 invariants in 5 ms
[2024-05-22 15:49:40] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 15:49:40] [INFO ] Invariant cache hit.
[2024-05-22 15:49:40] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:49:41] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 138/198 places, 143/204 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39012 ms. Remains : 138/198 places, 143/204 transitions.
[2024-05-22 15:49:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144262 resets) in 680 ms. (1468 steps per ms)
BEST_FIRST walk for 1000000 steps (91411 resets) in 469 ms. (2127 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:49:42] [INFO ] Invariant cache hit.
[2024-05-22 15:49:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 15:49:42] [INFO ] [Real]Absence check using 9 positive and 12 generalized place invariants in 1 ms returned sat
[2024-05-22 15:49:42] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-22 15:49:42] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:49:42] [INFO ] [Real]Added 26 Read/Feed constraints in 21 ms returned sat
[2024-05-22 15:49:42] [INFO ] Computed and/alt/rep : 118/744/118 causal constraints (skipped 24 transitions) in 10 ms.
[2024-05-22 15:49:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:49:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 15:49:42] [INFO ] [Nat]Absence check using 9 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 15:49:42] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-22 15:49:42] [INFO ] [Nat]Added 26 Read/Feed constraints in 24 ms returned sat
[2024-05-22 15:49:42] [INFO ] Computed and/alt/rep : 118/744/118 causal constraints (skipped 24 transitions) in 10 ms.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:49:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 260 ms
[2024-05-22 15:49:43] [INFO ] Added : 110 causal constraints over 24 iterations in 938 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 138/138 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-22 15:49:44] [INFO ] Invariant cache hit.
[2024-05-22 15:49:44] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 15:49:44] [INFO ] Invariant cache hit.
[2024-05-22 15:49:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:49:44] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-22 15:49:44] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 15:49:44] [INFO ] Invariant cache hit.
[2024-05-22 15:49:44] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 185 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:49:54] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:49:54] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-22 15:49:54] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:49:54] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/281 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:49:57] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:49:57] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:50:01] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 339 constraints, problems are : Problem set: 0 solved, 142 unsolved in 19655 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
After SMT, in 23651ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 23654ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24313 ms. Remains : 138/138 places, 143/143 transitions.
[2024-05-22 15:50:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:50:08] [INFO ] Flatten gal took : 17 ms
RANDOM walk for 40000 steps (5750 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
[2024-05-22 15:50:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16372096880693460449.gal : 11 ms
[2024-05-22 15:50:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7269216375757437344.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16372096880693460449.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7269216375757437344.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (3616 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality7269216375757437344.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
BEST_FIRST walk for 40003 steps (3669 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 153
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :153 after 261
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 743
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 2228
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2228 after 10616
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :10616 after 34685
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :34685 after 94409
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :94409 after 228855
Interrupted probabilistic random walk after 363258 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 363258 steps, saw 181666 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-05-22 15:50:11] [INFO ] Invariant cache hit.
[2024-05-22 15:50:11] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :228855 after 501313
[2024-05-22 15:50:14] [INFO ] Deduced a trap composed of 3 places in 2729 ms of which 32 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:50:14] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 3 ms to minimize.
[2024-05-22 15:50:14] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:50:14] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 143/277 variables, 134/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/281 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
SDD size :501313 after 1.13809e+07
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:15] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 143/277 variables, 134/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 26/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/281 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 4236ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1457 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 138/138 places, 143/143 transitions.
RANDOM walk for 40000 steps (5708 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3652 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3729 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 303100 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 2
Probabilistic random walk after 303100 steps, saw 151581 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
[2024-05-22 15:50:20] [INFO ] Invariant cache hit.
[2024-05-22 15:50:20] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:50:20] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:50:20] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:50:20] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:50:20] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 143/277 variables, 134/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/281 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/281 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 97/98 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/134 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
SDD size :1.13809e+07 after 1.03487e+08
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:50:21] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 143/277 variables, 134/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/277 variables, 26/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/277 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 4/281 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/281 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 206 constraints, problems are : Problem set: 0 solved, 2 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 19/19 constraints]
After SMT, in 1311ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1473 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 138/138 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 143/143 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-05-22 15:50:23] [INFO ] Invariant cache hit.
[2024-05-22 15:50:23] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 15:50:23] [INFO ] Invariant cache hit.
[2024-05-22 15:50:23] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:50:24] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-22 15:50:24] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 15:50:24] [INFO ] Invariant cache hit.
[2024-05-22 15:50:24] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/281 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 185 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 143/281 variables, 138/159 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 26/185 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:50:33] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:50:33] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:50:34] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:50:34] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :1.03487e+08 after 3.79517e+08
At refinement iteration 9 (OVERLAPS) 0/281 variables, 4/331 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:50:36] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:50:36] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 12 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:50:41] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/281 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 339 constraints, problems are : Problem set: 0 solved, 142 unsolved in 19903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 138/138 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 12/12 constraints]
After SMT, in 24002ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 24003ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24657 ms. Remains : 138/138 places, 143/143 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 138 transition count 130
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 125 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 119 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 119 transition count 124
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 119 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 118 transition count 123
Applied a total of 40 rules in 6 ms. Remains 118 /138 variables (removed 20) and now considering 123/143 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 123 rows 118 cols
[2024-05-22 15:50:48] [INFO ] Computed 21 invariants in 3 ms
[2024-05-22 15:50:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:50:48] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-22 15:50:48] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 15:50:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:50:48] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:50:48] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:50:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:50:48] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-22 15:50:48] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 15:50:48] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:50:48] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
TRAPS : Iteration 1
[2024-05-22 15:50:48] [INFO ] After 97ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:50:48] [INFO ] After 188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:50:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:50:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:50:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8143742750710023763.gal : 2 ms
[2024-05-22 15:50:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7474648553377871462.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8143742750710023763.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7474648553377871462.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7474648553377871462.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 162
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :162 after 296
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :296 after 1861
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1861 after 3911
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3911 after 16992
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :16992 after 56382
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :56382 after 142809
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :142809 after 403221
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :403221 after 1.04165e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :1.04165e+06 after 2.41906e+06
Detected timeout of ITS tools.
[2024-05-22 15:50:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:50:58] [INFO ] Applying decomposition
[2024-05-22 15:50:58] [INFO ] Flatten gal took : 6 ms
SDD proceeding with computation,2 properties remain. new max is 131072
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18291540124690955439.txt' '-o' '/tmp/graph18291540124690955439.bin' '-w' '/tmp/graph18291540124690955439.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18291540124690955439.bin' '-l' '-1' '-v' '-w' '/tmp/graph18291540124690955439.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:50:58] [INFO ] Decomposing Gal with order
[2024-05-22 15:50:58] [INFO ] Rewriting arrays to variables to allow decomposition.
SDD size :2.41906e+06 after 5.58821e+06
[2024-05-22 15:50:58] [INFO ] Removed a total of 74 redundant transitions.
[2024-05-22 15:50:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 15:50:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 2 ms.
[2024-05-22 15:50:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17617077581380091294.gal : 2 ms
[2024-05-22 15:50:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13070036922358748888.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17617077581380091294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13070036922358748888.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13070036922358748888.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 27
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 63
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :63 after 1151
Detected timeout of ITS tools.
[2024-05-22 15:51:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:51:03] [INFO ] Applying decomposition
[2024-05-22 15:51:03] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7023478907533000798.txt' '-o' '/tmp/graph7023478907533000798.bin' '-w' '/tmp/graph7023478907533000798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7023478907533000798.bin' '-l' '-1' '-v' '-w' '/tmp/graph7023478907533000798.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:51:03] [INFO ] Decomposing Gal with order
[2024-05-22 15:51:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:51:03] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-22 15:51:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:51:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 1 ms.
[2024-05-22 15:51:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10556507112021961863.gal : 2 ms
[2024-05-22 15:51:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7078524624765857501.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10556507112021961863.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7078524624765857501.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7078524624765857501.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :6964 after 6995
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1151 after 747056
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747056 after 944087
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30470 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 149356 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:51:18] [INFO ] Computed 33 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1396 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (925 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:51:18] [INFO ] Invariant cache hit.
[2024-05-22 15:51:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:51:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:51:18] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-22 15:51:18] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:51:18] [INFO ] [Real]Added 33 Read/Feed constraints in 82 ms returned sat
[2024-05-22 15:51:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:51:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:51:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:51:19] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-22 15:51:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 136 ms returned sat
[2024-05-22 15:51:19] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:51:19] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:51:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2024-05-22 15:51:19] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:51:20] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:51:20] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:51:20] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:51:20] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:51:20] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:51:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 536 ms
[2024-05-22 15:51:20] [INFO ] Added : 119 causal constraints over 25 iterations in 1336 ms. Result :sat
Minimization took 376 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p367) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 225
Reduce places removed 3 places and 13 transitions.
Graph (complete) has 794 edges and 225 vertex of which 223 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 223 transition count 212
Reduce places removed 9 places and 14 transitions.
Graph (complete) has 751 edges and 214 vertex of which 210 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 19 place count 209 transition count 197
Reduce places removed 7 places and 6 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 722 edges and 202 vertex of which 200 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 9 rules applied. Total rules applied 28 place count 200 transition count 190
Reduce places removed 2 places and 4 transitions.
Graph (complete) has 705 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 31 place count 196 transition count 186
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 37 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 81 place count 151 transition count 144
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 84 place count 148 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 147 transition count 144
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 88 place count 146 transition count 144
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 94 place count 146 transition count 138
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 100 place count 140 transition count 138
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 102 place count 140 transition count 138
Applied a total of 102 rules in 24 ms. Remains 140 /229 variables (removed 89) and now considering 138/230 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 140/229 places, 138/230 transitions.
// Phase 1: matrix 138 rows 140 cols
[2024-05-22 15:51:21] [INFO ] Computed 24 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144145 resets) in 607 ms. (1644 steps per ms)
BEST_FIRST walk for 1000000 steps (91461 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:51:22] [INFO ] Invariant cache hit.
[2024-05-22 15:51:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 15:51:22] [INFO ] [Real]Absence check using 9 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:51:22] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-22 15:51:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-05-22 15:51:22] [INFO ] [Real]Added 28 Read/Feed constraints in 32 ms returned sat
[2024-05-22 15:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:51:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 15:51:22] [INFO ] [Nat]Absence check using 9 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-22 15:51:22] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-22 15:51:22] [INFO ] [Nat]Added 28 Read/Feed constraints in 30 ms returned sat
[2024-05-22 15:51:22] [INFO ] Computed and/alt/rep : 112/685/112 causal constraints (skipped 25 transitions) in 9 ms.
[2024-05-22 15:51:23] [INFO ] Added : 101 causal constraints over 21 iterations in 590 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 140/140 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 138/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 140 /140 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-22 15:51:23] [INFO ] Invariant cache hit.
[2024-05-22 15:51:23] [INFO ] Implicit Places using invariants in 108 ms returned [98, 103, 137]
[2024-05-22 15:51:23] [INFO ] Actually due to overlaps returned [137, 103]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 109 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 138/140 places, 138/138 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 138 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 137
Applied a total of 2 rules in 4 ms. Remains 137 /138 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 137 cols
[2024-05-22 15:51:23] [INFO ] Computed 22 invariants in 4 ms
[2024-05-22 15:51:23] [INFO ] Implicit Places using invariants in 98 ms returned [98]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 136/140 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 220 ms. Remains : 136/140 places, 137/138 transitions.
// Phase 1: matrix 137 rows 136 cols
[2024-05-22 15:51:23] [INFO ] Computed 21 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144401 resets) in 608 ms. (1642 steps per ms)
BEST_FIRST walk for 1000001 steps (91459 resets) in 439 ms. (2272 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:51:24] [INFO ] Invariant cache hit.
[2024-05-22 15:51:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 15:51:25] [INFO ] [Real]Absence check using 8 positive and 13 generalized place invariants in 2 ms returned sat
[2024-05-22 15:51:25] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-22 15:51:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:51:25] [INFO ] [Real]Added 26 Read/Feed constraints in 27 ms returned sat
[2024-05-22 15:51:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:51:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:51:25] [INFO ] [Nat]Absence check using 8 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-22 15:51:25] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-22 15:51:25] [INFO ] [Nat]Added 26 Read/Feed constraints in 24 ms returned sat
[2024-05-22 15:51:25] [INFO ] Computed and/alt/rep : 116/721/116 causal constraints (skipped 20 transitions) in 9 ms.
[2024-05-22 15:51:25] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:51:25] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:51:26] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:51:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2024-05-22 15:51:26] [INFO ] Added : 109 causal constraints over 22 iterations in 842 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 136/136 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 136 /136 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 15:51:26] [INFO ] Invariant cache hit.
[2024-05-22 15:51:26] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 15:51:26] [INFO ] Invariant cache hit.
[2024-05-22 15:51:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:51:27] [INFO ] Implicit Places using invariants and state equation in 469 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 566 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/136 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 570 ms. Remains : 135/136 places, 137/137 transitions.
// Phase 1: matrix 137 rows 135 cols
[2024-05-22 15:51:27] [INFO ] Computed 20 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144558 resets) in 676 ms. (1477 steps per ms)
BEST_FIRST walk for 1000000 steps (91312 resets) in 491 ms. (2032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 15:51:28] [INFO ] Invariant cache hit.
[2024-05-22 15:51:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 15:51:28] [INFO ] [Real]Absence check using 3 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-22 15:51:28] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-22 15:51:28] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:51:28] [INFO ] [Real]Added 26 Read/Feed constraints in 24 ms returned sat
[2024-05-22 15:51:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:51:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 15:51:28] [INFO ] [Nat]Absence check using 3 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-22 15:51:28] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-22 15:51:28] [INFO ] [Nat]Added 26 Read/Feed constraints in 26 ms returned sat
[2024-05-22 15:51:28] [INFO ] Computed and/alt/rep : 116/719/116 causal constraints (skipped 20 transitions) in 8 ms.
[2024-05-22 15:51:29] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-22 15:51:29] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:51:29] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:51:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 202 ms
[2024-05-22 15:51:29] [INFO ] Added : 101 causal constraints over 22 iterations in 812 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 135/135 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 15:51:29] [INFO ] Invariant cache hit.
[2024-05-22 15:51:29] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 15:51:29] [INFO ] Invariant cache hit.
[2024-05-22 15:51:29] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:51:30] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-22 15:51:30] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 15:51:30] [INFO ] Invariant cache hit.
[2024-05-22 15:51:30] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 181 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 136/317 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:51:38] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:51:38] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:51:38] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:51:38] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:51:42] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:51:42] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 0 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 0 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:51:43] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/272 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:51:45] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:51:46] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:51:50] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/272 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:51:52] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:51:53] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 342 constraints, problems are : Problem set: 0 solved, 136 unsolved in 26777 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 25/25 constraints]
After SMT, in 31870ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 31873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32309 ms. Remains : 135/135 places, 137/137 transitions.
[2024-05-22 15:52:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 15:52:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:52:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2434104481131828923.gal : 2 ms
[2024-05-22 15:52:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12073823489998354875.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2434104481131828923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12073823489998354875.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12073823489998354875.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 27
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :27 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 168
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :168 after 261
RANDOM walk for 40000 steps (5810 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :261 after 743
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :743 after 2383
BEST_FIRST walk for 40001 steps (3643 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2383 after 11603
BEST_FIRST walk for 40003 steps (3643 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11603 after 36883
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :36883 after 101232
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :101232 after 240073
Interrupted probabilistic random walk after 466207 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 466207 steps, saw 233148 distinct states, run finished after 3002 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-22 15:52:05] [INFO ] Invariant cache hit.
[2024-05-22 15:52:05] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
SDD size :240073 after 521114
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-22 15:52:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/128 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 136/264 variables, 128/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/272 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:52:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-22 15:52:06] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:52:06] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:52:06] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/128 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 136/264 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/272 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 1048ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1142 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 135/135 places, 137/137 transitions.
RANDOM walk for 40000 steps (5794 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3686 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3685 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :521114 after 1.52003e+07
Interrupted probabilistic random walk after 422950 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 2
Probabilistic random walk after 422950 steps, saw 211507 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-22 15:52:10] [INFO ] Invariant cache hit.
[2024-05-22 15:52:10] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 15:52:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/128 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 136/264 variables, 128/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 24/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/272 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 84/110 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 16/126 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:52:11] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/128 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 136/264 variables, 128/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/272 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/272 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/272 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1478 ms.
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 135/135 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-22 15:52:13] [INFO ] Invariant cache hit.
[2024-05-22 15:52:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 15:52:13] [INFO ] Invariant cache hit.
[2024-05-22 15:52:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-22 15:52:13] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-22 15:52:13] [INFO ] Redundant transitions in 0 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-22 15:52:13] [INFO ] Invariant cache hit.
[2024-05-22 15:52:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
SDD size :1.52003e+07 after 1.31098e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 181 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 2/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 137/272 variables, 135/155 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 26/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 136/317 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:52:21] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-22 15:52:21] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:52:21] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:52:22] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-22 15:52:26] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
[2024-05-22 15:52:27] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
SDD size :1.31098e+08 after 4.81976e+08
[2024-05-22 15:52:27] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:52:27] [INFO ] Deduced a trap composed of 62 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/272 variables, 11/332 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:52:29] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-22 15:52:29] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:52:34] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/272 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-22 15:52:36] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:52:36] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:52:36] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-22 15:52:36] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 15:52:37] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-22 15:52:37] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-22 15:52:37] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 7/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/272 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 342 constraints, problems are : Problem set: 0 solved, 136 unsolved in 28174 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 135/135 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 25/25 constraints]
After SMT, in 33214ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 33218ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33667 ms. Remains : 135/135 places, 137/137 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 135 transition count 124
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 122 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 116 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 116 transition count 118
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 116 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 115 transition count 117
Applied a total of 40 rules in 12 ms. Remains 115 /135 variables (removed 20) and now considering 117/137 (removed 20) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 117 rows 115 cols
[2024-05-22 15:52:46] [INFO ] Computed 20 invariants in 6 ms
[2024-05-22 15:52:46] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:52:46] [INFO ] [Real]Absence check using 8 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 15:52:46] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 15:52:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:52:46] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:52:46] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 15:52:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 15:52:46] [INFO ] [Nat]Absence check using 8 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 15:52:47] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 15:52:47] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 15:52:47] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:52:47] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 15:52:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:52:47] [INFO ] Flatten gal took : 5 ms
[2024-05-22 15:52:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality27699229263921366.gal : 2 ms
[2024-05-22 15:52:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9487518650741373605.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality27699229263921366.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9487518650741373605.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...326
Loading property file /tmp/ReachabilityCardinality9487518650741373605.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :13 after 31
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :31 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 170
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :170 after 313
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :313 after 1198
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1198 after 3539
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3539 after 12797
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12797 after 30419
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :30419 after 67335
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :67335 after 156948
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :156948 after 341623
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :341623 after 739215
Detected timeout of ITS tools.
[2024-05-22 15:52:52] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:52:52] [INFO ] Applying decomposition
[2024-05-22 15:52:52] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10386722102548709167.txt' '-o' '/tmp/graph10386722102548709167.bin' '-w' '/tmp/graph10386722102548709167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10386722102548709167.bin' '-l' '-1' '-v' '-w' '/tmp/graph10386722102548709167.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:52:52] [INFO ] Decomposing Gal with order
[2024-05-22 15:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:52:52] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-22 15:52:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 15:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 2 ms.
[2024-05-22 15:52:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4397130501998919757.gal : 2 ms
[2024-05-22 15:52:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality874126612015033205.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4397130501998919757.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality874126612015033205.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality874126612015033205.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1142 after 1147
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4007 after 4007
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :739215 after 1.55076e+06
Detected timeout of ITS tools.
[2024-05-22 15:53:02] [INFO ] Flatten gal took : 9 ms
[2024-05-22 15:53:02] [INFO ] Applying decomposition
[2024-05-22 15:53:02] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5823369011105680927.txt' '-o' '/tmp/graph5823369011105680927.bin' '-w' '/tmp/graph5823369011105680927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5823369011105680927.bin' '-l' '-1' '-v' '-w' '/tmp/graph5823369011105680927.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:53:02] [INFO ] Decomposing Gal with order
[2024-05-22 15:53:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:53:02] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-22 15:53:02] [INFO ] Flatten gal took : 24 ms
[2024-05-22 15:53:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2024-05-22 15:53:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10309026185342129391.gal : 2 ms
[2024-05-22 15:53:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15848117332956926940.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10309026185342129391.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15848117332956926940.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality15848117332956926940.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6147
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747052 after 750791
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30421 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-05 in 118695 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:53:17] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1473 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10000 steps (918 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:53:17] [INFO ] Invariant cache hit.
[2024-05-22 15:53:17] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:53:17] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:53:17] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-22 15:53:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:53:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 15:53:17] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 15:53:17] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-22 15:53:17] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:53:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 15:53:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 702 ms returned sat
[2024-05-22 15:53:18] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-22 15:53:20] [INFO ] Added : 165 causal constraints over 33 iterations in 2324 ms. Result :sat
Minimization took 497 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 229 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 228 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 228 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 226 transition count 229
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 222 transition count 225
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 220 transition count 225
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 220 transition count 217
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 212 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 212 transition count 217
Applied a total of 39 rules in 15 ms. Remains 212 /229 variables (removed 17) and now considering 217/232 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 212/229 places, 217/232 transitions.
Found an invariant !
This invariant on transitions {21=1, 30=1, 34=2, 35=2, 48=1, 75=1, 90=2, 94=1, 121=1, 136=1, 137=1, 148=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 30=1, 48=1, 75=1, 94=1, 121=1, 136=1, 148=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1468 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 217 rows 212 cols
[2024-05-22 15:53:41] [INFO ] Computed 33 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (143913 resets) in 798 ms. (1251 steps per ms)
BEST_FIRST walk for 1000001 steps (91360 resets) in 550 ms. (1814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:53:42] [INFO ] Invariant cache hit.
[2024-05-22 15:53:42] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-22 15:53:42] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 6 ms returned sat
[2024-05-22 15:53:42] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-22 15:53:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:53:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:53:42] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:53:42] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-22 15:53:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:53:43] [INFO ] [Nat]Added 39 Read/Feed constraints in 343 ms returned sat
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:53:43] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-22 15:53:44] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-05-22 15:53:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1930 ms
[2024-05-22 15:53:45] [INFO ] Computed and/alt/rep : 168/1051/168 causal constraints (skipped 48 transitions) in 12 ms.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:53:46] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:53:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 647 ms
[2024-05-22 15:53:47] [INFO ] Added : 121 causal constraints over 25 iterations in 2324 ms. Result :sat
Minimization took 433 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-22 15:53:48] [INFO ] Invariant cache hit.
[2024-05-22 15:53:49] [INFO ] Implicit Places using invariants in 173 ms returned [134, 209]
[2024-05-22 15:53:49] [INFO ] Actually due to overlaps returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 217/217 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 216
Applied a total of 2 rules in 5 ms. Remains 210 /211 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-22 15:53:49] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 15:53:49] [INFO ] Implicit Places using invariants in 141 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/212 places, 216/217 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 215
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 208 cols
[2024-05-22 15:53:49] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:53:49] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 15:53:49] [INFO ] Invariant cache hit.
[2024-05-22 15:53:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:53:50] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1338 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 208/212 places, 215/217 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1669 ms. Remains : 208/212 places, 215/217 transitions.
Found an invariant !
This invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:54:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144592 resets) in 787 ms. (1269 steps per ms)
BEST_FIRST walk for 1000001 steps (91422 resets) in 537 ms. (1858 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:55:00] [INFO ] Invariant cache hit.
[2024-05-22 15:55:00] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:55:00] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:55:00] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-22 15:55:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:55:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 15:55:00] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:55:00] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-22 15:55:00] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:55:00] [INFO ] [Nat]Added 39 Read/Feed constraints in 483 ms returned sat
[2024-05-22 15:55:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:55:01] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:55:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 15:55:01] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 15:55:01] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:55:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 502 ms
[2024-05-22 15:55:01] [INFO ] Computed and/alt/rep : 171/1090/171 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-22 15:55:02] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-22 15:55:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 15:55:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2024-05-22 15:55:02] [INFO ] Added : 105 causal constraints over 22 iterations in 1180 ms. Result :sat
Minimization took 310 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 15:55:11] [INFO ] Invariant cache hit.
[2024-05-22 15:55:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 15:55:11] [INFO ] Invariant cache hit.
[2024-05-22 15:55:11] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:55:12] [INFO ] Implicit Places using invariants and state equation in 1210 ms returned []
Implicit Place search using SMT with State Equation took 1345 ms to find 0 implicit places.
[2024-05-22 15:55:13] [INFO ] Redundant transitions in 2 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 15:55:13] [INFO ] Invariant cache hit.
[2024-05-22 15:55:13] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9501 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 214/492 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:55:31] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:55:31] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:55:32] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:55:36] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:55:45] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:55:45] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:55:45] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 499 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 7/7 constraints]
After SMT, in 39621ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 39625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40986 ms. Remains : 208/208 places, 215/215 transitions.
Found an invariant !
This invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {21=1, 29=1, 46=1, 72=1, 91=1, 117=1, 132=1, 144=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:57:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:57:00] [INFO ] Flatten gal took : 8 ms
[2024-05-22 15:57:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13785282583459653564.gal : 12 ms
[2024-05-22 15:57:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7356869000026300895.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13785282583459653564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7356869000026300895.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (5760 resets) in 69 ms. (571 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (3681 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality7356869000026300895.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :124 after 236
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :236 after 494
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :494 after 1092
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1092 after 21806
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21806 after 38846
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :38846 after 100170
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :100170 after 235452
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :235452 after 495804
Interrupted probabilistic random walk after 691103 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 691103 steps, saw 345619 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-22 15:57:04] [INFO ] Invariant cache hit.
[2024-05-22 15:57:04] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/203 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/418 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/423 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 1 ms to minimize.
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 96 places in 196 ms of which 1 ms to minimize.
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-22 15:57:04] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 13 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/203 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 2 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-22 15:57:05] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/418 variables, 203/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/423 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2067 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 2329ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 222 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 208/208 places, 215/215 transitions.
RANDOM walk for 40000 steps (5735 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3661 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :495804 after 2.50631e+07
Interrupted probabilistic random walk after 775496 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :0 out of 1
Probabilistic random walk after 775496 steps, saw 387826 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :0
[2024-05-22 15:57:09] [INFO ] Invariant cache hit.
[2024-05-22 15:57:09] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/203 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/418 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/423 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/423 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 1 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:57:10] [INFO ] Deduced a trap composed of 33 places in 758 ms of which 32 ms to minimize.
[2024-05-22 15:57:10] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 3 ms to minimize.
[2024-05-22 15:57:10] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 3 ms to minimize.
[2024-05-22 15:57:10] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 1 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 3 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 50/203 variables, 17/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 2 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-22 15:57:11] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2024-05-22 15:57:12] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2024-05-22 15:57:12] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/418 variables, 203/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/418 variables, 39/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/423 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/423 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/423 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/423 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 292 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3287 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 3546ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 766 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 15:57:13] [INFO ] Invariant cache hit.
[2024-05-22 15:57:14] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 15:57:14] [INFO ] Invariant cache hit.
[2024-05-22 15:57:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 15:57:15] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
[2024-05-22 15:57:15] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 15:57:15] [INFO ] Invariant cache hit.
[2024-05-22 15:57:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.50631e+07 after 2.31939e+08
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/423 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 278 constraints, problems are : Problem set: 0 solved, 214 unsolved in 24853 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/423 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 39/278 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/423 variables, 214/492 constraints. Problems are: Problem set: 0 solved, 214 unsolved
SDD proceeding with computation,1 properties remain. new max is 524288
[2024-05-22 15:57:49] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
SDD size :2.31939e+08 after 7.29731e+08
[2024-05-22 15:57:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2024-05-22 15:57:50] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2024-05-22 15:57:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 15:57:51] [INFO ] Applying decomposition
[2024-05-22 15:57:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9953852857034214603.txt' '-o' '/tmp/graph9953852857034214603.bin' '-w' '/tmp/graph9953852857034214603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9953852857034214603.bin' '-l' '-1' '-v' '-w' '/tmp/graph9953852857034214603.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:57:51] [INFO ] Decomposing Gal with order
[2024-05-22 15:57:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:57:51] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-22 15:57:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 15:57:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 4 ms.
[2024-05-22 15:57:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality392362884249641936.gal : 3 ms
[2024-05-22 15:57:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2160360350077303291.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality392362884249641936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2160360350077303291.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality2160360350077303291.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 182
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :182 after 1675
At refinement iteration 8 (INCLUDED_ONLY) 0/423 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:57:54] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/423 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 15:58:02] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-22 15:58:02] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:58:03] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1675 after 747084
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :747084 after 764589
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :764589 after 944086
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :944086 after 2.3569e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/423 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 214 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.3569e+06 after 8.34701e+06
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 423/423 variables, and 499 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 7/7 constraints]
After SMT, in 54948ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 54950ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56473 ms. Remains : 208/208 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 197
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 45 place count 181 transition count 188
Iterating global reduction 0 with 9 rules applied. Total rules applied 54 place count 181 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 180 transition count 187
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 180 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 58 place count 179 transition count 186
Applied a total of 58 rules in 11 ms. Remains 179 /208 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 179 cols
[2024-05-22 15:58:10] [INFO ] Computed 31 invariants in 16 ms
[2024-05-22 15:58:10] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 15:58:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 15:58:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:58:10] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 15:58:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 15:58:10] [INFO ] After 28ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 15:58:10] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-22 15:58:10] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-22 15:58:10] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:58:10] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 15:58:11] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 680 ms
TRAPS : Iteration 1
[2024-05-22 15:58:11] [INFO ] After 746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:58:11] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 15:58:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:58:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 15:58:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8634781998864233960.gal : 2 ms
[2024-05-22 15:58:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16557008954903832107.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8634781998864233960.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16557008954903832107.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16557008954903832107.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23043
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23043 after 50349
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50349 after 106795
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106795 after 224170
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224170 after 461332
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461332 after 942906
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.34701e+06 after 2.93828e+07
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942906 after 1.91211e+06
Detected timeout of ITS tools.
[2024-05-22 15:58:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 15:58:26] [INFO ] Applying decomposition
[2024-05-22 15:58:26] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph463390809616856327.txt' '-o' '/tmp/graph463390809616856327.bin' '-w' '/tmp/graph463390809616856327.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph463390809616856327.bin' '-l' '-1' '-v' '-w' '/tmp/graph463390809616856327.weights' '-q' '0' '-e' '0.001'
[2024-05-22 15:58:26] [INFO ] Decomposing Gal with order
[2024-05-22 15:58:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 15:58:26] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-22 15:58:26] [INFO ] Flatten gal took : 17 ms
[2024-05-22 15:58:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2024-05-22 15:58:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13309238373593383304.gal : 3 ms
[2024-05-22 15:58:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11369822585226441581.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13309238373593383304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11369822585226441581.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11369822585226441581.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 271614
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31143 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 324287 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 15:58:41] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (1465 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (900 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:58:41] [INFO ] Invariant cache hit.
[2024-05-22 15:58:41] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:58:41] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:58:41] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 15:58:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:58:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 15:58:41] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 15:58:41] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-22 15:58:41] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 15:58:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 230 ms returned sat
[2024-05-22 15:58:42] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-22 15:58:42] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-22 15:58:42] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:58:42] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:58:42] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:58:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 628 ms
[2024-05-22 15:58:42] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 2 ms to minimize.
[2024-05-22 15:58:44] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 1 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 1 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:58:45] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 2 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 1 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 1 ms to minimize.
[2024-05-22 15:58:46] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 2682 ms
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 219 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 219 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 212 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 212 transition count 216
Applied a total of 36 rules in 23 ms. Remains 212 /229 variables (removed 17) and now considering 216/232 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 212/229 places, 216/232 transitions.
Found an invariant !
This invariant on transitions {22=1, 31=1, 34=2, 35=2, 53=1, 82=1, 97=2, 101=1, 129=1, 144=1, 145=1, 156=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 31=1, 53=1, 82=1, 101=1, 129=1, 144=1, 156=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1411 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 216 rows 212 cols
[2024-05-22 15:58:52] [INFO ] Computed 33 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144499 resets) in 686 ms. (1455 steps per ms)
BEST_FIRST walk for 1000001 steps (91263 resets) in 487 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:58:54] [INFO ] Invariant cache hit.
[2024-05-22 15:58:54] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:58:54] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:58:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-22 15:58:54] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:58:54] [INFO ] [Real]Added 36 Read/Feed constraints in 35 ms returned sat
[2024-05-22 15:58:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:58:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 15:58:54] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 15:58:54] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 15:58:54] [INFO ] [Nat]Added 36 Read/Feed constraints in 248 ms returned sat
[2024-05-22 15:58:54] [INFO ] Computed and/alt/rep : 175/1068/175 causal constraints (skipped 40 transitions) in 13 ms.
[2024-05-22 15:58:55] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2024-05-22 15:58:55] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 1 ms to minimize.
[2024-05-22 15:58:55] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 1 ms to minimize.
[2024-05-22 15:58:55] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2024-05-22 15:58:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 497 ms
[2024-05-22 15:58:55] [INFO ] Added : 84 causal constraints over 17 iterations in 1031 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 212/212 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 15:58:56] [INFO ] Invariant cache hit.
[2024-05-22 15:58:56] [INFO ] Implicit Places using invariants in 157 ms returned [136, 209]
[2024-05-22 15:58:56] [INFO ] Actually due to overlaps returned [209]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 211/212 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 211 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 210 transition count 215
Applied a total of 2 rules in 6 ms. Remains 210 /211 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 210 cols
[2024-05-22 15:58:56] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 15:58:56] [INFO ] Implicit Places using invariants in 148 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/212 places, 215/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 214
Applied a total of 2 rules in 5 ms. Remains 208 /209 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-22 15:58:56] [INFO ] Computed 31 invariants in 10 ms
[2024-05-22 15:58:56] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 15:58:56] [INFO ] Invariant cache hit.
[2024-05-22 15:58:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:58:57] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 208/212 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1698 ms. Remains : 208/212 places, 214/216 transitions.
Found an invariant !
This invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1421 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:59:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (144465 resets) in 701 ms. (1424 steps per ms)
BEST_FIRST walk for 1000000 steps (91347 resets) in 488 ms. (2044 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 15:59:29] [INFO ] Invariant cache hit.
[2024-05-22 15:59:29] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-22 15:59:29] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:59:29] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-22 15:59:29] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:59:29] [INFO ] [Real]Added 36 Read/Feed constraints in 26 ms returned sat
[2024-05-22 15:59:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 15:59:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 15:59:29] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 15:59:29] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 15:59:29] [INFO ] [Nat]Added 36 Read/Feed constraints in 109 ms returned sat
[2024-05-22 15:59:29] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
[2024-05-22 15:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2024-05-22 15:59:29] [INFO ] Computed and/alt/rep : 178/1107/178 causal constraints (skipped 35 transitions) in 14 ms.
[2024-05-22 15:59:30] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-22 15:59:30] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:59:30] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-22 15:59:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 432 ms
[2024-05-22 15:59:30] [INFO ] Added : 84 causal constraints over 18 iterations in 1216 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 15:59:31] [INFO ] Invariant cache hit.
[2024-05-22 15:59:31] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 15:59:31] [INFO ] Invariant cache hit.
[2024-05-22 15:59:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 15:59:32] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2024-05-22 15:59:32] [INFO ] Redundant transitions in 0 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 15:59:32] [INFO ] Invariant cache hit.
[2024-05-22 15:59:32] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 213 unsolved in 8868 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/488 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 15:59:49] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 1 ms to minimize.
[2024-05-22 15:59:49] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 1 ms to minimize.
[2024-05-22 15:59:50] [INFO ] Deduced a trap composed of 95 places in 74 ms of which 1 ms to minimize.
[2024-05-22 15:59:51] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 1 ms to minimize.
[2024-05-22 15:59:51] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2024-05-22 15:59:51] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 1 ms to minimize.
[2024-05-22 15:59:52] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 15/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 503 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 15/15 constraints]
After SMT, in 38962ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 38964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40227 ms. Remains : 208/208 places, 214/214 transitions.
Found an invariant !
This invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 30=1, 51=1, 79=1, 98=1, 125=1, 140=1, 152=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 16:00:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:00:42] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:00:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6801983438486635004.gal : 2 ms
[2024-05-22 16:00:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7186176900990358594.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6801983438486635004.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7186176900990358594.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (5775 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3703 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality7186176900990358594.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :124 after 236
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :236 after 494
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :494 after 1092
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1092 after 21806
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :21806 after 38846
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :38846 after 100170
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :100170 after 235452
Interrupted probabilistic random walk after 835972 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 835972 steps, saw 418075 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-05-22 16:00:45] [INFO ] Invariant cache hit.
[2024-05-22 16:00:45] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/203 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 36/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :235452 after 495804
[2024-05-22 16:00:47] [INFO ] Deduced a trap composed of 99 places in 1743 ms of which 24 ms to minimize.
[2024-05-22 16:00:47] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:00:47] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 16:00:47] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-22 16:00:48] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:00:49] [INFO ] Deduced a trap composed of 97 places in 1700 ms of which 29 ms to minimize.
[2024-05-22 16:00:49] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 3 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :495804 after 2.50631e+07
[2024-05-22 16:00:49] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 1 ms to minimize.
[2024-05-22 16:00:51] [INFO ] Deduced a trap composed of 96 places in 1814 ms of which 32 ms to minimize.
SMT process timed out in 6747ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 208/208 places, 214/214 transitions.
RANDOM walk for 40000 steps (5751 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3641 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 812742 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 1
Probabilistic random walk after 812742 steps, saw 406460 distinct states, run finished after 3013 ms. (steps per millisecond=269 ) properties seen :0
[2024-05-22 16:00:54] [INFO ] Invariant cache hit.
[2024-05-22 16:00:54] [INFO ] State equation strengthened by 36 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 48/203 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 214/417 variables, 203/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 36/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/422 variables, 5/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 146/155 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:00:55] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:00:57] [INFO ] Deduced a trap composed of 22 places in 1862 ms of which 29 ms to minimize.
[2024-05-22 16:00:57] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 1 ms to minimize.
[2024-05-22 16:00:57] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 2 ms to minimize.
[2024-05-22 16:00:58] [INFO ] Deduced a trap composed of 98 places in 1193 ms of which 4 ms to minimize.
[2024-05-22 16:00:58] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:01:00] [INFO ] Deduced a trap composed of 98 places in 1109 ms of which 17 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :2.50631e+07 after 2.31939e+08
[2024-05-22 16:01:01] [INFO ] Deduced a trap composed of 101 places in 1125 ms of which 26 ms to minimize.
[2024-05-22 16:01:02] [INFO ] Deduced a trap composed of 96 places in 1318 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/203 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:01:02] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:01:02] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 3 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 3 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:01:03] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-22 16:01:04] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:01:04] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-22 16:01:04] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:01:04] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:01:07] [INFO ] Deduced a trap composed of 10 places in 2514 ms of which 37 ms to minimize.
[2024-05-22 16:01:07] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2024-05-22 16:01:07] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 1 ms to minimize.
[2024-05-22 16:01:09] [INFO ] Deduced a trap composed of 62 places in 2128 ms of which 5 ms to minimize.
[2024-05-22 16:01:09] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2024-05-22 16:01:12] [INFO ] Deduced a trap composed of 61 places in 2426 ms of which 4 ms to minimize.
[2024-05-22 16:01:12] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-22 16:01:12] [INFO ] Deduced a trap composed of 63 places in 150 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:01:12] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:01:14] [INFO ] Deduced a trap composed of 49 places in 1635 ms of which 5 ms to minimize.
[2024-05-22 16:01:14] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 3 ms to minimize.
[2024-05-22 16:01:14] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
[2024-05-22 16:01:14] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 3 ms to minimize.
[2024-05-22 16:01:16] [INFO ] Deduced a trap composed of 66 places in 1940 ms of which 5 ms to minimize.
[2024-05-22 16:01:16] [INFO ] Deduced a trap composed of 63 places in 152 ms of which 2 ms to minimize.
[2024-05-22 16:01:17] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 2 ms to minimize.
[2024-05-22 16:01:17] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 3 ms to minimize.
[2024-05-22 16:01:18] [INFO ] Deduced a trap composed of 58 places in 1450 ms of which 26 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 214/417 variables, 203/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 36/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/422 variables, 5/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/422 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 422/422 variables, and 315 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24340 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 39/39 constraints]
After SMT, in 24740ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 16:01:19] [INFO ] Invariant cache hit.
[2024-05-22 16:01:19] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 16:01:19] [INFO ] Invariant cache hit.
[2024-05-22 16:01:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 16:01:22] [INFO ] Implicit Places using invariants and state equation in 2316 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
[2024-05-22 16:01:22] [INFO ] Redundant transitions in 0 ms returned []
Running 213 sub problems to find dead transitions.
[2024-05-22 16:01:22] [INFO ] Invariant cache hit.
[2024-05-22 16:01:22] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :2.31939e+08 after 7.29731e+08
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Detected timeout of ITS tools.
[2024-05-22 16:01:32] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:01:32] [INFO ] Applying decomposition
[2024-05-22 16:01:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4387650541038602100.txt' '-o' '/tmp/graph4387650541038602100.bin' '-w' '/tmp/graph4387650541038602100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4387650541038602100.bin' '-l' '-1' '-v' '-w' '/tmp/graph4387650541038602100.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:01:32] [INFO ] Decomposing Gal with order
[2024-05-22 16:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:01:32] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-22 16:01:32] [INFO ] Flatten gal took : 30 ms
[2024-05-22 16:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 4 ms.
[2024-05-22 16:01:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7394757881212753936.gal : 3 ms
[2024-05-22 16:01:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14710055899314962132.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7394757881212753936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14710055899314962132.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14710055899314962132.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :17 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 40
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :63 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1142 after 2315
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/422 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 275 constraints, problems are : Problem set: 0 solved, 213 unsolved in 26635 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 208/208 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/422 variables, 208/239 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 36/275 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 213/488 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-05-22 16:02:05] [INFO ] Deduced a trap composed of 80 places in 1048 ms of which 2 ms to minimize.
[2024-05-22 16:02:10] [INFO ] Deduced a trap composed of 83 places in 3279 ms of which 28 ms to minimize.
[2024-05-22 16:02:10] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:02:11] [INFO ] Deduced a trap composed of 91 places in 1115 ms of which 28 ms to minimize.
[2024-05-22 16:02:11] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 1 ms to minimize.
[2024-05-22 16:02:11] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 1 ms to minimize.
[2024-05-22 16:02:12] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 1 ms to minimize.
[2024-05-22 16:02:12] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 2 ms to minimize.
[2024-05-22 16:02:12] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 2 ms to minimize.
[2024-05-22 16:02:16] [INFO ] Deduced a trap composed of 87 places in 3526 ms of which 26 ms to minimize.
[2024-05-22 16:02:16] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:02:16] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 1 ms to minimize.
[2024-05-22 16:02:16] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:02:16] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2024-05-22 16:02:19] [INFO ] Deduced a trap composed of 8 places in 1193 ms of which 1 ms to minimize.
SMT process timed out in 57439ms, After SMT, problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 57452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60058 ms. Remains : 208/208 places, 214/214 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 208 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 190 transition count 196
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 182 transition count 188
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 182 transition count 188
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 181 transition count 187
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 181 transition count 185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 179 transition count 185
Applied a total of 58 rules in 18 ms. Remains 179 /208 variables (removed 29) and now considering 185/214 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 185 rows 179 cols
[2024-05-22 16:02:19] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 16:02:19] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:02:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-22 16:02:19] [INFO ] [Nat]Absence check using 4 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-22 16:02:19] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:02:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 16:02:19] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:02:20] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
[2024-05-22 16:02:20] [INFO ] Deduced a trap composed of 23 places in 686 ms of which 1 ms to minimize.
[2024-05-22 16:02:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 845 ms
TRAPS : Iteration 1
[2024-05-22 16:02:20] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:02:20] [INFO ] After 1039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:02:20] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:02:20] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:02:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17023367826171713223.gal : 18 ms
[2024-05-22 16:02:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7615722880909580013.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17023367826171713223.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7615722880909580013.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7615722880909580013.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23034
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23034 after 50314
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50314 after 106695
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106695 after 224080
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224080 after 461196
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461196 after 942753
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942753 after 1.91193e+06
Detected timeout of ITS tools.
[2024-05-22 16:02:35] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:02:35] [INFO ] Applying decomposition
[2024-05-22 16:02:35] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13008389883840041507.txt' '-o' '/tmp/graph13008389883840041507.bin' '-w' '/tmp/graph13008389883840041507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13008389883840041507.bin' '-l' '-1' '-v' '-w' '/tmp/graph13008389883840041507.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:02:36] [INFO ] Decomposing Gal with order
[2024-05-22 16:02:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:02:36] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-22 16:02:36] [INFO ] Flatten gal took : 45 ms
[2024-05-22 16:02:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2024-05-22 16:02:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6186560325950727589.gal : 3 ms
[2024-05-22 16:02:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15738329878022721076.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6186560325950727589.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15738329878022721076.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality15738329878022721076.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 41060
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31433 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 249570 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 16:02:51] [INFO ] Computed 33 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1452 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (919 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:02:51] [INFO ] Invariant cache hit.
[2024-05-22 16:02:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:02:51] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:02:51] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-22 16:02:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 16:02:51] [INFO ] [Real]Added 33 Read/Feed constraints in 100 ms returned sat
[2024-05-22 16:02:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:02:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 16:02:51] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 16:02:51] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-22 16:02:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 118 ms returned sat
[2024-05-22 16:02:51] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-22 16:02:54] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-22 16:02:54] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:02:54] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:02:54] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:02:54] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:02:55] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:02:56] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:02:56] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:02:56] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 16:02:56] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:02:56] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:02:56] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p463) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 228
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 225 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 224 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 224 transition count 223
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 222 transition count 223
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 219 transition count 220
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 217 transition count 220
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 217 transition count 213
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 35 place count 210 transition count 213
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 210 transition count 213
Applied a total of 38 rules in 17 ms. Remains 210 /229 variables (removed 19) and now considering 213/231 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 210/229 places, 213/231 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-22 16:02:56] [INFO ] Computed 33 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144363 resets) in 684 ms. (1459 steps per ms)
BEST_FIRST walk for 1000001 steps (91117 resets) in 493 ms. (2024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:02:57] [INFO ] Invariant cache hit.
[2024-05-22 16:02:57] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-22 16:02:57] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:02:57] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-22 16:02:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:02:57] [INFO ] [Real]Added 39 Read/Feed constraints in 59 ms returned sat
[2024-05-22 16:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:02:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-22 16:02:58] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:02:58] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-22 16:02:58] [INFO ] [Nat]Added 39 Read/Feed constraints in 155 ms returned sat
[2024-05-22 16:02:58] [INFO ] Computed and/alt/rep : 166/1038/166 causal constraints (skipped 46 transitions) in 11 ms.
[2024-05-22 16:02:59] [INFO ] Added : 113 causal constraints over 23 iterations in 758 ms. Result :sat
Minimization took 318 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-22 16:03:03] [INFO ] Invariant cache hit.
[2024-05-22 16:03:03] [INFO ] Implicit Places using invariants in 185 ms returned [134, 207]
[2024-05-22 16:03:03] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 194 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-22 16:03:03] [INFO ] Computed 32 invariants in 9 ms
[2024-05-22 16:03:03] [INFO ] Implicit Places using invariants in 161 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 171 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-22 16:03:03] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 16:03:03] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 16:03:03] [INFO ] Invariant cache hit.
[2024-05-22 16:03:04] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:03:05] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned [146, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1507 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 204/210 places, 211/213 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 211
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 202 transition count 211
Applied a total of 4 rules in 6 ms. Remains 202 /204 variables (removed 2) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 202 cols
[2024-05-22 16:03:05] [INFO ] Computed 29 invariants in 14 ms
[2024-05-22 16:03:05] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-22 16:03:05] [INFO ] Invariant cache hit.
[2024-05-22 16:03:05] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:03:06] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1607 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 202/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 3502 ms. Remains : 202/210 places, 211/213 transitions.
[2024-05-22 16:03:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144548 resets) in 700 ms. (1426 steps per ms)
BEST_FIRST walk for 1000001 steps (91325 resets) in 507 ms. (1968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:03:08] [INFO ] Invariant cache hit.
[2024-05-22 16:03:08] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-22 16:03:08] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-22 16:03:08] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-22 16:03:08] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:03:08] [INFO ] [Real]Added 39 Read/Feed constraints in 85 ms returned sat
[2024-05-22 16:03:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-05-22 16:03:08] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-22 16:03:08] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-22 16:03:08] [INFO ] [Nat]Added 39 Read/Feed constraints in 90 ms returned sat
[2024-05-22 16:03:08] [INFO ] Computed and/alt/rep : 158/1017/158 causal constraints (skipped 52 transitions) in 15 ms.
[2024-05-22 16:03:09] [INFO ] Added : 118 causal constraints over 25 iterations in 1100 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 202/202 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 202/202 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 16:03:11] [INFO ] Invariant cache hit.
[2024-05-22 16:03:11] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-22 16:03:11] [INFO ] Invariant cache hit.
[2024-05-22 16:03:11] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:03:13] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1711 ms to find 0 implicit places.
[2024-05-22 16:03:13] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 16:03:13] [INFO ] Invariant cache hit.
[2024-05-22 16:03:13] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/202 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
At refinement iteration 5 (OVERLAPS) 211/413 variables, 202/231 constraints. Problems are: Problem set: 19 solved, 191 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 39/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 0/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 0/413 variables, 0/270 constraints. Problems are: Problem set: 19 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 413/413 variables, and 270 constraints, problems are : Problem set: 19 solved, 191 unsolved in 7959 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 202/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 15/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 10/193 variables, 10/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/27 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 6/199 variables, 2/29 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 16:03:22] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 1/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 211/410 variables, 199/229 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 39/268 constraints. Problems are: Problem set: 19 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 136/404 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 16:03:29] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 1/405 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 16:03:35] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 1/406 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 16:03:43] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/410 variables, 1/407 constraints. Problems are: Problem set: 19 solved, 191 unsolved
[2024-05-22 16:03:47] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/410 variables, 1/408 constraints. Problems are: Problem set: 19 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 410/413 variables, and 408 constraints, problems are : Problem set: 19 solved, 191 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 199/202 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 136/210 constraints, Known Traps: 5/5 constraints]
After SMT, in 38068ms problems are : Problem set: 19 solved, 191 unsolved
Search for dead transitions found 19 dead transitions in 38070ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 202/202 places, 192/211 transitions.
Graph (complete) has 966 edges and 202 vertex of which 185 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 185 /202 variables (removed 17) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 185 cols
[2024-05-22 16:03:51] [INFO ] Computed 28 invariants in 6 ms
[2024-05-22 16:03:51] [INFO ] Implicit Places using invariants in 116 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 184/202 places, 192/211 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 190
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 190
Applied a total of 4 rules in 6 ms. Remains 182 /184 variables (removed 2) and now considering 190/192 (removed 2) transitions.
// Phase 1: matrix 190 rows 182 cols
[2024-05-22 16:03:51] [INFO ] Computed 27 invariants in 6 ms
[2024-05-22 16:03:51] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 16:03:51] [INFO ] Invariant cache hit.
[2024-05-22 16:03:51] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 16:03:52] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1126 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 182/202 places, 190/211 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 41055 ms. Remains : 182/202 places, 190/211 transitions.
[2024-05-22 16:03:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144563 resets) in 649 ms. (1538 steps per ms)
BEST_FIRST walk for 1000000 steps (91365 resets) in 463 ms. (2155 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:03:53] [INFO ] Invariant cache hit.
[2024-05-22 16:03:53] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-22 16:03:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 16:03:53] [INFO ] [Real]Added 35 Read/Feed constraints in 40 ms returned sat
[2024-05-22 16:03:53] [INFO ] Computed and/alt/rep : 151/973/151 causal constraints (skipped 38 transitions) in 11 ms.
[2024-05-22 16:03:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 16:03:53] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-22 16:03:54] [INFO ] [Nat]Added 35 Read/Feed constraints in 106 ms returned sat
[2024-05-22 16:03:54] [INFO ] Computed and/alt/rep : 151/973/151 causal constraints (skipped 38 transitions) in 11 ms.
[2024-05-22 16:03:55] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-22 16:03:55] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 16:03:55] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2024-05-22 16:03:55] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-22 16:03:56] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:03:56] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-22 16:03:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 454 ms
[2024-05-22 16:03:56] [INFO ] Added : 149 causal constraints over 30 iterations in 2107 ms. Result :sat
Minimization took 312 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 182/182 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-22 16:03:58] [INFO ] Invariant cache hit.
[2024-05-22 16:03:58] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 16:03:58] [INFO ] Invariant cache hit.
[2024-05-22 16:03:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-22 16:03:59] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2024-05-22 16:03:59] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-22 16:03:59] [INFO ] Invariant cache hit.
[2024-05-22 16:03:59] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 244 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 189/433 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:04:12] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-22 16:04:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:04:22] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 16:04:22] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:04:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/372 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 438 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 5/5 constraints]
After SMT, in 37110ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 37111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38196 ms. Remains : 182/182 places, 190/190 transitions.
[2024-05-22 16:04:36] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:04:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:04:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18431289618924261542.gal : 4 ms
[2024-05-22 16:04:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality203181857782106447.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18431289618924261542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality203181857782106447.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (5767 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality203181857782106447.prop.
BEST_FIRST walk for 40000 steps (3705 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
BEST_FIRST walk for 40003 steps (3588 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 241
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :241 after 523
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :523 after 1160
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1160 after 23444
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :23444 after 42531
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :42531 after 111290
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :111290 after 244806
Interrupted probabilistic random walk after 239033 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 239033 steps, saw 119536 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-22 16:04:39] [INFO ] Invariant cache hit.
[2024-05-22 16:04:39] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/177 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 3 ms to minimize.
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 2 ms to minimize.
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :244806 after 519329
[2024-05-22 16:04:41] [INFO ] Deduced a trap composed of 17 places in 1088 ms of which 1 ms to minimize.
[2024-05-22 16:04:42] [INFO ] Deduced a trap composed of 7 places in 537 ms of which 11 ms to minimize.
[2024-05-22 16:04:43] [INFO ] Deduced a trap composed of 14 places in 976 ms of which 1 ms to minimize.
[2024-05-22 16:04:43] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 3 ms to minimize.
[2024-05-22 16:04:43] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :519329 after 3.61605e+06
[2024-05-22 16:04:45] [INFO ] Deduced a trap composed of 24 places in 2324 ms of which 1 ms to minimize.
SMT process timed out in 5807ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 182/182 places, 190/190 transitions.
RANDOM walk for 40000 steps (5772 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3657 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3653 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 222436 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 2
Probabilistic random walk after 222436 steps, saw 111235 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-22 16:04:48] [INFO ] Invariant cache hit.
[2024-05-22 16:04:48] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/177 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:04:51] [INFO ] Deduced a trap composed of 4 places in 2818 ms of which 27 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :3.61605e+06 after 2.15402e+07
[2024-05-22 16:04:54] [INFO ] Deduced a trap composed of 7 places in 3012 ms of which 16 ms to minimize.
[2024-05-22 16:04:58] [INFO ] Deduced a trap composed of 10 places in 3699 ms of which 30 ms to minimize.
[2024-05-22 16:04:58] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 4 ms to minimize.
[2024-05-22 16:05:01] [INFO ] Deduced a trap composed of 17 places in 3144 ms of which 32 ms to minimize.
[2024-05-22 16:05:02] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 14 places in 3056 ms of which 32 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2024-05-22 16:05:08] [INFO ] Deduced a trap composed of 19 places in 2500 ms of which 29 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.15402e+07 after 6.56965e+07
[2024-05-22 16:05:09] [INFO ] Deduced a trap composed of 21 places in 1877 ms of which 23 ms to minimize.
[2024-05-22 16:05:12] [INFO ] Deduced a trap composed of 22 places in 2840 ms of which 32 ms to minimize.
[2024-05-22 16:05:13] [INFO ] Deduced a trap composed of 27 places in 931 ms of which 1 ms to minimize.
[2024-05-22 16:05:13] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-22 16:05:14] [INFO ] Deduced a trap composed of 25 places in 734 ms of which 32 ms to minimize.
[2024-05-22 16:05:14] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-22 16:05:14] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 19 places in 2780 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 190/367 variables, 177/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/367 variables, 35/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/372 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29160 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 120/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 56/177 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 190/367 variables, 177/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/367 variables, 35/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/367 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/372 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/372 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 275 constraints, problems are : Problem set: 0 solved, 2 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 29839ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5093 ms.
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 3 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 182/182 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 190/190 transitions.
Applied a total of 0 rules in 2 ms. Remains 182 /182 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-22 16:05:23] [INFO ] Invariant cache hit.
Detected timeout of ITS tools.
[2024-05-22 16:05:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:05:26] [INFO ] Applying decomposition
[2024-05-22 16:05:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16308577024426097187.txt' '-o' '/tmp/graph16308577024426097187.bin' '-w' '/tmp/graph16308577024426097187.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16308577024426097187.bin' '-l' '-1' '-v' '-w' '/tmp/graph16308577024426097187.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:05:26] [INFO ] Decomposing Gal with order
[2024-05-22 16:05:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:05:26] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-22 16:05:26] [INFO ] Flatten gal took : 27 ms
[2024-05-22 16:05:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 2 ms.
[2024-05-22 16:05:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17132062816381924513.gal : 3 ms
[2024-05-22 16:05:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2882065748623329036.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17132062816381924513.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2882065748623329036.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2882065748623329036.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 27
[2024-05-22 16:05:27] [INFO ] Implicit Places using invariants in 3254 ms returned []
[2024-05-22 16:05:27] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :27 after 36
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :36 after 1147
[2024-05-22 16:05:27] [INFO ] State equation strengthened by 35 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1147 after 12243
[2024-05-22 16:05:31] [INFO ] Implicit Places using invariants and state equation in 3997 ms returned []
Implicit Place search using SMT with State Equation took 7265 ms to find 0 implicit places.
[2024-05-22 16:05:31] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2024-05-22 16:05:31] [INFO ] Invariant cache hit.
[2024-05-22 16:05:31] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :12243 after 976294
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/372 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :976294 after 7.19617e+06
After SMT solving in domain Real declared 372/372 variables, and 244 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 2/182 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/372 variables, 182/209 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 35/244 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/372 variables, 189/433 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:06:08] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-22 16:06:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 2/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Detected timeout of ITS tools.
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:06:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-22 16:06:20] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/372 variables, 2/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 189 unsolved
[2024-05-22 16:06:30] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 438 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 182/182 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 5/5 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67394 ms. Remains : 182/182 places, 190/190 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 220077 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 16:06:31] [INFO ] Computed 33 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1437 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10001 steps (936 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:06:31] [INFO ] Invariant cache hit.
[2024-05-22 16:06:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:06:31] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-22 16:06:31] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-22 16:06:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 16:06:31] [INFO ] [Real]Added 33 Read/Feed constraints in 104 ms returned sat
[2024-05-22 16:06:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:06:31] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:06:31] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-22 16:06:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 161 ms returned sat
[2024-05-22 16:06:31] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 16:06:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 16:06:31] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-22 16:06:34] [INFO ] Added : 205 causal constraints over 41 iterations in 2727 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p439) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Reduce places removed 1 places and 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 225
Reduce places removed 3 places and 2 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 225 transition count 223
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 225 transition count 221
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 37 transitions.
Iterating global reduction 2 with 35 rules applied. Total rules applied 41 place count 192 transition count 184
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 48 place count 186 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 185 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 49 place count 185 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 184 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 182 transition count 182
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 182 transition count 174
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 72 place count 173 transition count 174
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 173 transition count 174
Applied a total of 74 rules in 29 ms. Remains 173 /229 variables (removed 56) and now considering 174/230 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 173/229 places, 174/230 transitions.
// Phase 1: matrix 174 rows 173 cols
[2024-05-22 16:06:35] [INFO ] Computed 28 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (143970 resets) in 691 ms. (1445 steps per ms)
BEST_FIRST walk for 1000000 steps (91284 resets) in 497 ms. (2008 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:06:36] [INFO ] Invariant cache hit.
[2024-05-22 16:06:36] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Real]Absence check using 11 positive and 17 generalized place invariants in 2 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-22 16:06:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 16:06:36] [INFO ] [Real]Added 32 Read/Feed constraints in 16 ms returned sat
[2024-05-22 16:06:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using 11 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-22 16:06:36] [INFO ] [Nat]Added 32 Read/Feed constraints in 51 ms returned sat
[2024-05-22 16:06:36] [INFO ] Computed and/alt/rep : 136/843/136 causal constraints (skipped 37 transitions) in 10 ms.
[2024-05-22 16:06:37] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 16:06:37] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:06:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-22 16:06:37] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:06:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2024-05-22 16:06:37] [INFO ] Added : 114 causal constraints over 23 iterations in 939 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 174/174 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 173/173 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 173 /173 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-22 16:06:39] [INFO ] Invariant cache hit.
[2024-05-22 16:06:39] [INFO ] Implicit Places using invariants in 128 ms returned [127, 134, 170]
[2024-05-22 16:06:39] [INFO ] Actually due to overlaps returned [170]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/173 places, 174/174 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 172 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 173
Applied a total of 2 rules in 6 ms. Remains 171 /172 variables (removed 1) and now considering 173/174 (removed 1) transitions.
// Phase 1: matrix 173 rows 171 cols
[2024-05-22 16:06:39] [INFO ] Computed 27 invariants in 5 ms
[2024-05-22 16:06:39] [INFO ] Implicit Places using invariants in 179 ms returned [127, 134]
[2024-05-22 16:06:39] [INFO ] Actually due to overlaps returned [127]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 195 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 170/173 places, 173/174 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 169 transition count 172
Applied a total of 2 rules in 4 ms. Remains 169 /170 variables (removed 1) and now considering 172/173 (removed 1) transitions.
// Phase 1: matrix 172 rows 169 cols
[2024-05-22 16:06:39] [INFO ] Computed 26 invariants in 5 ms
[2024-05-22 16:06:39] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 16:06:39] [INFO ] Invariant cache hit.
[2024-05-22 16:06:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 16:06:40] [INFO ] Implicit Places using invariants and state equation in 902 ms returned [143]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1063 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 168/173 places, 172/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1414 ms. Remains : 168/173 places, 172/174 transitions.
// Phase 1: matrix 172 rows 168 cols
[2024-05-22 16:06:40] [INFO ] Computed 26 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144327 resets) in 624 ms. (1600 steps per ms)
BEST_FIRST walk for 1000000 steps (91515 resets) in 454 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:06:41] [INFO ] Invariant cache hit.
[2024-05-22 16:06:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 16:06:42] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:06:42] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-22 16:06:42] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 16:06:42] [INFO ] [Real]Added 32 Read/Feed constraints in 36 ms returned sat
[2024-05-22 16:06:42] [INFO ] Computed and/alt/rep : 139/880/139 causal constraints (skipped 32 transitions) in 9 ms.
[2024-05-22 16:06:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:06:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-22 16:06:42] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 16:06:42] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-22 16:06:42] [INFO ] [Nat]Added 32 Read/Feed constraints in 57 ms returned sat
[2024-05-22 16:06:42] [INFO ] Computed and/alt/rep : 139/880/139 causal constraints (skipped 32 transitions) in 8 ms.
[2024-05-22 16:06:43] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:06:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-22 16:06:43] [INFO ] Added : 125 causal constraints over 26 iterations in 863 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 168/168 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-22 16:06:48] [INFO ] Invariant cache hit.
[2024-05-22 16:06:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 16:06:48] [INFO ] Invariant cache hit.
[2024-05-22 16:06:48] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 16:06:49] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1146 ms to find 0 implicit places.
[2024-05-22 16:06:49] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-22 16:06:49] [INFO ] Invariant cache hit.
[2024-05-22 16:06:49] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 226 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5608 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 171/397 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 16:06:59] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-22 16:07:00] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:07:02] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-05-22 16:07:02] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:07:02] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 0 ms to minimize.
[2024-05-22 16:07:02] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 16:07:06] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2024-05-22 16:07:07] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-22 16:07:07] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:07:07] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/407 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 16:07:11] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 16:07:16] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:07:16] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2024-05-22 16:07:16] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:07:17] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2024-05-22 16:07:17] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-05-22 16:07:17] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:07:17] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 7/415 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 415 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 18/18 constraints]
After SMT, in 35695ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 35697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36849 ms. Remains : 168/168 places, 172/172 transitions.
[2024-05-22 16:07:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:07:25] [INFO ] Flatten gal took : 30 ms
[2024-05-22 16:07:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7157341754195980750.gal : 3 ms
[2024-05-22 16:07:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2250529726673851268.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7157341754195980750.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2250529726673851268.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (5724 resets) in 139 ms. (285 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2250529726673851268.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 13
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 118
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :118 after 236
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :236 after 494
BEST_FIRST walk for 40001 steps (3673 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :494 after 1107
BEST_FIRST walk for 40000 steps (3655 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1107 after 19970
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :19970 after 36821
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :36821 after 81033
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :81033 after 196113
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :196113 after 425281
Interrupted probabilistic random walk after 253798 steps, run timeout after 3004 ms. (steps per millisecond=84 ) properties seen :0 out of 2
Probabilistic random walk after 253798 steps, saw 126917 distinct states, run finished after 3004 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-22 16:07:28] [INFO ] Invariant cache hit.
[2024-05-22 16:07:28] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:07:31] [INFO ] Deduced a trap composed of 3 places in 2961 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :425281 after 1.91854e+06
[2024-05-22 16:07:31] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 2 ms to minimize.
[2024-05-22 16:07:33] [INFO ] Deduced a trap composed of 9 places in 2263 ms of which 8 ms to minimize.
SMT process timed out in 5526ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 168/168 places, 172/172 transitions.
RANDOM walk for 40000 steps (5823 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3695 resets) in 176 ms. (225 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3619 resets) in 278 ms. (143 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 294181 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 2
Probabilistic random walk after 294181 steps, saw 147118 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-22 16:07:37] [INFO ] Invariant cache hit.
[2024-05-22 16:07:37] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:07:37] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:07:37] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:07:37] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/340 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 229 constraints, problems are : Problem set: 0 solved, 2 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.91854e+06 after 2.32746e+07
At refinement iteration 4 (OVERLAPS) 50/164 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 172/336 variables, 164/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 32/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/340 variables, 4/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/340 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1172 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 1974ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4559 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 168/168 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 172/172 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-05-22 16:07:43] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :2.32746e+07 after 7.97622e+07
[2024-05-22 16:07:53] [INFO ] Implicit Places using invariants in 9761 ms returned []
[2024-05-22 16:07:53] [INFO ] Invariant cache hit.
[2024-05-22 16:07:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-22 16:07:54] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 11101 ms to find 0 implicit places.
[2024-05-22 16:07:54] [INFO ] Redundant transitions in 0 ms returned []
Running 171 sub problems to find dead transitions.
[2024-05-22 16:07:54] [INFO ] Invariant cache hit.
[2024-05-22 16:07:54] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/340 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 226 constraints, problems are : Problem set: 0 solved, 171 unsolved in 10198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Detected timeout of ITS tools.
[2024-05-22 16:08:15] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:08:15] [INFO ] Applying decomposition
[2024-05-22 16:08:15] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12706430205567467993.txt' '-o' '/tmp/graph12706430205567467993.bin' '-w' '/tmp/graph12706430205567467993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12706430205567467993.bin' '-l' '-1' '-v' '-w' '/tmp/graph12706430205567467993.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:08:15] [INFO ] Decomposing Gal with order
[2024-05-22 16:08:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:08:15] [INFO ] Removed a total of 87 redundant transitions.
[2024-05-22 16:08:15] [INFO ] Flatten gal took : 12 ms
[2024-05-22 16:08:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 3 ms.
[2024-05-22 16:08:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13103373954225915585.gal : 2 ms
[2024-05-22 16:08:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14076779451108611905.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13103373954225915585.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14076779451108611905.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14076779451108611905.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 132
SDD proceeding with computation,2 properties remain. new max is 64
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
SDD size :132 after 1239
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 2/168 variables, 6/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/340 variables, 168/194 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 32/226 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/340 variables, 171/397 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 16:08:23] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2024-05-22 16:08:23] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1239 after 747084
[2024-05-22 16:08:26] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :747084 after 5.97486e+06
[2024-05-22 16:08:30] [INFO ] Deduced a trap composed of 80 places in 3260 ms of which 31 ms to minimize.
[2024-05-22 16:08:30] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:08:33] [INFO ] Deduced a trap composed of 79 places in 2643 ms of which 32 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 6/403 constraints. Problems are: Problem set: 0 solved, 171 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 403 constraints, problems are : Problem set: 0 solved, 171 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 168/168 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 6/6 constraints]
After SMT, in 40298ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 40300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51414 ms. Remains : 168/168 places, 172/172 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 15 Pre rules applied. Total rules applied 0 place count 168 transition count 157
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 153 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 146 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 146 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 145 transition count 149
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 145 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 48 place count 144 transition count 148
Applied a total of 48 rules in 10 ms. Remains 144 /168 variables (removed 24) and now considering 148/172 (removed 24) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 148 rows 144 cols
[2024-05-22 16:08:35] [INFO ] Computed 26 invariants in 4 ms
[2024-05-22 16:08:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-22 16:08:35] [INFO ] [Real]Absence check using 8 positive and 18 generalized place invariants in 11 ms returned sat
[2024-05-22 16:08:35] [INFO ] After 163ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-22 16:08:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 16:08:35] [INFO ] After 206ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 16:08:35] [INFO ] After 495ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 16:08:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 20 ms returned sat
[2024-05-22 16:08:35] [INFO ] [Nat]Absence check using 8 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:08:35] [INFO ] After 168ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 16:08:35] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 16:08:35] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 16:08:35] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 16:08:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 16:08:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 16:08:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2150526624560839851.gal : 2 ms
[2024-05-22 16:08:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality444407310250336889.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2150526624560839851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality444407310250336889.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality444407310250336889.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 36
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :172 after 325
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :325 after 1534
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1534 after 3620
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3620 after 13636
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13636 after 31865
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :31865 after 70007
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :70007 after 160599
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :160599 after 346278
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :346278 after 739215
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :739215 after 1.55197e+06
Detected timeout of ITS tools.
[2024-05-22 16:08:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 16:08:51] [INFO ] Applying decomposition
[2024-05-22 16:08:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2652883154070820026.txt' '-o' '/tmp/graph2652883154070820026.bin' '-w' '/tmp/graph2652883154070820026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2652883154070820026.bin' '-l' '-1' '-v' '-w' '/tmp/graph2652883154070820026.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:08:51] [INFO ] Decomposing Gal with order
[2024-05-22 16:08:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:08:51] [INFO ] Removed a total of 92 redundant transitions.
[2024-05-22 16:08:51] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 2 ms.
[2024-05-22 16:08:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2128145289450493733.gal : 7 ms
[2024-05-22 16:08:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16526138510011538600.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2128145289450493733.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16526138510011538600.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16526138510011538600.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2105
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31054 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 154989 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 16:09:06] [INFO ] Computed 33 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1450 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (920 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:09:06] [INFO ] Invariant cache hit.
[2024-05-22 16:09:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:09:06] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-22 16:09:06] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-22 16:09:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 16:09:06] [INFO ] [Real]Added 33 Read/Feed constraints in 64 ms returned sat
[2024-05-22 16:09:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:09:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:09:06] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:09:06] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-22 16:09:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 103 ms returned sat
[2024-05-22 16:09:06] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:09:06] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-22 16:09:07] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:09:08] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1970 ms
[2024-05-22 16:09:08] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:09:10] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:09:11] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p448) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 230/230 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 228
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 226
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 218 transition count 221
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 218 transition count 213
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 210 transition count 213
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 210 transition count 213
Applied a total of 41 rules in 16 ms. Remains 210 /229 variables (removed 19) and now considering 213/230 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/229 places, 213/230 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-22 16:09:11] [INFO ] Computed 33 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144295 resets) in 693 ms. (1440 steps per ms)
BEST_FIRST walk for 1000000 steps (91358 resets) in 486 ms. (2053 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:09:12] [INFO ] Invariant cache hit.
[2024-05-22 16:09:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-22 16:09:12] [INFO ] [Real]Absence check using 3 positive and 30 generalized place invariants in 8 ms returned sat
[2024-05-22 16:09:12] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-22 16:09:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:09:13] [INFO ] [Real]Added 40 Read/Feed constraints in 72 ms returned sat
[2024-05-22 16:09:13] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:09:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:09:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:09:13] [INFO ] [Nat]Absence check using 3 positive and 30 generalized place invariants in 6 ms returned sat
[2024-05-22 16:09:13] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-22 16:09:13] [INFO ] [Nat]Added 40 Read/Feed constraints in 202 ms returned sat
[2024-05-22 16:09:13] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2024-05-22 16:09:13] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:09:13] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:09:13] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:09:14] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:09:15] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:09:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1584 ms
[2024-05-22 16:09:15] [INFO ] Computed and/alt/rep : 164/1033/164 causal constraints (skipped 48 transitions) in 11 ms.
[2024-05-22 16:09:16] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-22 16:09:16] [INFO ] Added : 93 causal constraints over 19 iterations in 1642 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-22 16:09:18] [INFO ] Invariant cache hit.
[2024-05-22 16:09:19] [INFO ] Implicit Places using invariants in 195 ms returned [134, 207]
[2024-05-22 16:09:19] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-22 16:09:19] [INFO ] Computed 32 invariants in 8 ms
[2024-05-22 16:09:19] [INFO ] Implicit Places using invariants in 139 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 5 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-22 16:09:19] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 16:09:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 16:09:19] [INFO ] Invariant cache hit.
[2024-05-22 16:09:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:09:20] [INFO ] Implicit Places using invariants and state equation in 1395 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1904 ms. Remains : 206/210 places, 211/213 transitions.
[2024-05-22 16:09:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144366 resets) in 696 ms. (1434 steps per ms)
BEST_FIRST walk for 1000000 steps (91504 resets) in 483 ms. (2066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:09:22] [INFO ] Invariant cache hit.
[2024-05-22 16:09:22] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:09:22] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 7 ms returned sat
[2024-05-22 16:09:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-22 16:09:22] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:09:22] [INFO ] [Real]Added 40 Read/Feed constraints in 70 ms returned sat
[2024-05-22 16:09:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:09:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:09:22] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-22 16:09:22] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-22 16:09:22] [INFO ] [Nat]Added 40 Read/Feed constraints in 200 ms returned sat
[2024-05-22 16:09:22] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:09:22] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-22 16:09:23] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:09:24] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:09:24] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-22 16:09:24] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1516 ms
[2024-05-22 16:09:24] [INFO ] Computed and/alt/rep : 167/1072/167 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-22 16:09:26] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:09:26] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:09:27] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:09:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 16:09:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1371 ms
[2024-05-22 16:09:28] [INFO ] Added : 151 causal constraints over 32 iterations in 3945 ms. Result :sat
Minimization took 405 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 16:09:30] [INFO ] Invariant cache hit.
[2024-05-22 16:09:30] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 16:09:30] [INFO ] Invariant cache hit.
[2024-05-22 16:09:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:09:32] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 1624 ms to find 0 implicit places.
[2024-05-22 16:09:32] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 16:09:32] [INFO ] Invariant cache hit.
[2024-05-22 16:09:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 1/205 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD138 is UNSAT
At refinement iteration 8 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 209 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 11 (OVERLAPS) 0/417 variables, 0/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 277 constraints, problems are : Problem set: 1 solved, 209 unsolved in 10505 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 18/20 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 1/205 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 9/30 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 1/206 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 40/277 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 209/486 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-22 16:09:50] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:09:51] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:09:52] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-22 16:09:52] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:09:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-22 16:09:53] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:09:54] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 15/501 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-22 16:10:00] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:10:03] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/503 constraints. Problems are: Problem set: 1 solved, 209 unsolved
[2024-05-22 16:10:10] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:10:10] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 2/505 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 505 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 206/206 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 19/19 constraints]
After SMT, in 40595ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 40597ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 210/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-22 16:10:12] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 42248 ms. Remains : 206/206 places, 210/211 transitions.
// Phase 1: matrix 210 rows 206 cols
[2024-05-22 16:10:12] [INFO ] Computed 32 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144339 resets) in 736 ms. (1356 steps per ms)
BEST_FIRST walk for 1000001 steps (91156 resets) in 480 ms. (2079 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:10:13] [INFO ] Invariant cache hit.
[2024-05-22 16:10:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-22 16:10:13] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 16:10:14] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 16:10:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:10:14] [INFO ] [Real]Added 39 Read/Feed constraints in 101 ms returned sat
[2024-05-22 16:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:10:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-22 16:10:14] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:10:14] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-22 16:10:14] [INFO ] [Nat]Added 39 Read/Feed constraints in 176 ms returned sat
[2024-05-22 16:10:14] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:10:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:10:14] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:10:15] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-22 16:10:16] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 16:10:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 16:10:17] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2569 ms
[2024-05-22 16:10:17] [INFO ] Computed and/alt/rep : 166/1058/166 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-22 16:10:17] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-22 16:10:18] [INFO ] Added : 89 causal constraints over 18 iterations in 991 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-22 16:10:20] [INFO ] Invariant cache hit.
[2024-05-22 16:10:20] [INFO ] Implicit Places using invariants in 142 ms returned [148]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 205/206 places, 210/210 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 204 transition count 209
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 204 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 203 transition count 208
Applied a total of 4 rules in 15 ms. Remains 203 /205 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 203 cols
[2024-05-22 16:10:20] [INFO ] Computed 31 invariants in 7 ms
[2024-05-22 16:10:20] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 16:10:20] [INFO ] Invariant cache hit.
[2024-05-22 16:10:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 16:10:22] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 203/206 places, 208/210 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1917 ms. Remains : 203/206 places, 208/210 transitions.
[2024-05-22 16:10:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144410 resets) in 682 ms. (1464 steps per ms)
BEST_FIRST walk for 1000001 steps (91480 resets) in 474 ms. (2105 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:10:23] [INFO ] Invariant cache hit.
[2024-05-22 16:10:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 16:10:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-22 16:10:23] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2024-05-22 16:10:23] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 16:10:23] [INFO ] [Real]Added 41 Read/Feed constraints in 82 ms returned sat
[2024-05-22 16:10:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:10:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 16:10:23] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-22 16:10:23] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2024-05-22 16:10:23] [INFO ] [Nat]Added 41 Read/Feed constraints in 123 ms returned sat
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 1 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 2 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:10:24] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:10:25] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:10:26] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 16:10:27] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 3799 ms
[2024-05-22 16:10:27] [INFO ] Computed and/alt/rep : 163/1045/163 causal constraints (skipped 44 transitions) in 14 ms.
[2024-05-22 16:10:28] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-22 16:10:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 16:10:28] [INFO ] Added : 112 causal constraints over 23 iterations in 1089 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 203/203 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-22 16:10:34] [INFO ] Invariant cache hit.
[2024-05-22 16:10:34] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 16:10:34] [INFO ] Invariant cache hit.
[2024-05-22 16:10:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 16:10:36] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 1633 ms to find 0 implicit places.
[2024-05-22 16:10:36] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-22 16:10:36] [INFO ] Invariant cache hit.
[2024-05-22 16:10:36] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 275 constraints, problems are : Problem set: 0 solved, 207 unsolved in 11700 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 207/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:10:55] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:11:03] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:11:04] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:11:16] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 506 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 24/24 constraints]
After SMT, in 41803ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 41805ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43446 ms. Remains : 203/203 places, 208/208 transitions.
[2024-05-22 16:11:18] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:11:18] [INFO ] Flatten gal took : 23 ms
[2024-05-22 16:11:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4720725159280573729.gal : 2 ms
[2024-05-22 16:11:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18166773376011935199.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4720725159280573729.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18166773376011935199.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18166773376011935199.prop.
RANDOM walk for 40000 steps (5760 resets) in 180 ms. (220 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 236
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :236 after 494
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :494 after 1092
BEST_FIRST walk for 40002 steps (3607 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3645 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1092 after 21806
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :21806 after 38846
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :38846 after 100170
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :100170 after 235452
Interrupted probabilistic random walk after 227267 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 2
Probabilistic random walk after 227267 steps, saw 113654 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-22 16:11:21] [INFO ] Invariant cache hit.
[2024-05-22 16:11:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:21] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :235452 after 495804
[2024-05-22 16:11:23] [INFO ] Deduced a trap composed of 90 places in 2032 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/406 variables, 198/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 41/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:24] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/411 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3897 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:25] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :495804 after 2.50631e+07
[2024-05-22 16:11:30] [INFO ] Deduced a trap composed of 7 places in 4863 ms of which 21 ms to minimize.
SMT process timed out in 9047ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 203/203 places, 208/208 transitions.
RANDOM walk for 40000 steps (5778 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3608 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3651 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 231573 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 2
Probabilistic random walk after 231573 steps, saw 115805 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-22 16:11:33] [INFO ] Invariant cache hit.
[2024-05-22 16:11:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:34] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:34] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/198 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/406 variables, 198/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 41/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :2.50631e+07 after 2.31939e+08
[2024-05-22 16:11:39] [INFO ] Deduced a trap composed of 58 places in 4835 ms of which 32 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 5/411 variables, 5/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/411 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/411 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 278 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5669 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 140/141 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4/145 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 51/196 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:11:39] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 3 ms to minimize.
[2024-05-22 16:11:40] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 3 ms to minimize.
[2024-05-22 16:11:44] [INFO ] Deduced a trap composed of 10 places in 4848 ms of which 29 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 10 places in 2883 ms of which 27 ms to minimize.
[2024-05-22 16:11:47] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-22 16:11:48] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 9 places in 4072 ms of which 23 ms to minimize.
[2024-05-22 16:11:52] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 3 ms to minimize.
[2024-05-22 16:11:56] [INFO ] Deduced a trap composed of 21 places in 3888 ms of which 29 ms to minimize.
[2024-05-22 16:11:56] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 3 ms to minimize.
[2024-05-22 16:11:59] [INFO ] Deduced a trap composed of 14 places in 2685 ms of which 2 ms to minimize.
[2024-05-22 16:11:59] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-22 16:12:01] [INFO ] Deduced a trap composed of 16 places in 2649 ms of which 27 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 59 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 3 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 1 ms to minimize.
[2024-05-22 16:12:02] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:12:03] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 61 places in 1979 ms of which 28 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 3 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 4 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-22 16:12:05] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 1 ms to minimize.
[2024-05-22 16:12:06] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 524288
Detected timeout of ITS tools.
[2024-05-22 16:12:08] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:12:08] [INFO ] Applying decomposition
[2024-05-22 16:12:08] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15607407533416508066.txt' '-o' '/tmp/graph15607407533416508066.bin' '-w' '/tmp/graph15607407533416508066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15607407533416508066.bin' '-l' '-1' '-v' '-w' '/tmp/graph15607407533416508066.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:12:08] [INFO ] Decomposing Gal with order
[2024-05-22 16:12:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:12:08] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 16:12:08] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:12:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 4 ms.
[2024-05-22 16:12:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10983772312666027762.gal : 3 ms
[2024-05-22 16:12:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8390065376163508904.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10983772312666027762.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8390065376163508904.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2024-05-22 16:12:08] [INFO ] Deduced a trap composed of 12 places in 2395 ms of which 1 ms to minimize.
Loading property file /tmp/ReachabilityCardinality8390065376163508904.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 1147
[2024-05-22 16:12:08] [INFO ] Deduced a trap composed of 12 places in 276 ms of which 21 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1147 after 7623
[2024-05-22 16:12:08] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 1 ms to minimize.
[2024-05-22 16:12:11] [INFO ] Deduced a trap composed of 61 places in 2553 ms of which 3 ms to minimize.
[2024-05-22 16:12:11] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 3 ms to minimize.
[2024-05-22 16:12:11] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7623 after 873017
[2024-05-22 16:12:16] [INFO ] Deduced a trap composed of 56 places in 4887 ms of which 26 ms to minimize.
[2024-05-22 16:12:16] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 2 ms to minimize.
[2024-05-22 16:12:16] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 3 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-22 16:12:17] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 4 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 2 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 6 ms to minimize.
[2024-05-22 16:12:18] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 3 ms to minimize.
[2024-05-22 16:12:22] [INFO ] Deduced a trap composed of 64 places in 3621 ms of which 33 ms to minimize.
[2024-05-22 16:12:22] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2024-05-22 16:12:22] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 3 ms to minimize.
[2024-05-22 16:12:26] [INFO ] Deduced a trap composed of 13 places in 3545 ms of which 24 ms to minimize.
SMT process timed out in 52420ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 203/203 places, 208/208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 208/208 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 208/208 (removed 0) transitions.
[2024-05-22 16:12:26] [INFO ] Invariant cache hit.
[2024-05-22 16:12:26] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 16:12:26] [INFO ] Invariant cache hit.
[2024-05-22 16:12:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 16:12:33] [INFO ] Implicit Places using invariants and state equation in 6697 ms returned []
Implicit Place search using SMT with State Equation took 6920 ms to find 0 implicit places.
[2024-05-22 16:12:33] [INFO ] Redundant transitions in 1 ms returned []
Running 207 sub problems to find dead transitions.
[2024-05-22 16:12:33] [INFO ] Invariant cache hit.
[2024-05-22 16:12:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :873017 after 6.71255e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Detected timeout of ITS tools.
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 275 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (OVERLAPS) 2/203 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (OVERLAPS) 208/411 variables, 203/234 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 41/275 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 207/482 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:13:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-05-22 16:13:13] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:13:13] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 3/485 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:13:17] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:13:17] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-22 16:13:17] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 2 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:13:18] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:13:19] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:13:20] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:13:20] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:13:20] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-22 16:13:32] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 506 constraints, problems are : Problem set: 0 solved, 207 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 203/203 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 24/24 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67044 ms. Remains : 203/203 places, 208/208 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 267263 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 16:13:33] [INFO ] Computed 33 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (1437 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (932 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:13:33] [INFO ] Invariant cache hit.
[2024-05-22 16:13:33] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 16:13:33] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:13:33] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-22 16:13:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 16:13:33] [INFO ] [Real]Added 33 Read/Feed constraints in 68 ms returned sat
[2024-05-22 16:13:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:13:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 16:13:33] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:13:33] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-22 16:13:34] [INFO ] [Nat]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-22 16:13:34] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:13:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-05-22 16:13:34] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-22 16:13:34] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 16:13:34] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:13:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2024-05-22 16:13:34] [INFO ] Added : 98 causal constraints over 21 iterations in 837 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p247) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 231/231 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 228 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 227 transition count 228
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 227 transition count 226
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 225 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 17 place count 220 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 218 transition count 221
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 29 place count 218 transition count 213
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 37 place count 210 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 210 transition count 213
Applied a total of 41 rules in 16 ms. Remains 210 /229 variables (removed 19) and now considering 213/231 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/229 places, 213/231 transitions.
// Phase 1: matrix 213 rows 210 cols
[2024-05-22 16:13:35] [INFO ] Computed 33 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144355 resets) in 706 ms. (1414 steps per ms)
BEST_FIRST walk for 1000001 steps (91571 resets) in 490 ms. (2036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:13:36] [INFO ] Invariant cache hit.
[2024-05-22 16:13:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 16:13:36] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:13:36] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-22 16:13:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:13:36] [INFO ] [Real]Added 39 Read/Feed constraints in 51 ms returned sat
[2024-05-22 16:13:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:13:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:13:36] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-22 16:13:36] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-22 16:13:37] [INFO ] [Nat]Added 39 Read/Feed constraints in 140 ms returned sat
[2024-05-22 16:13:37] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 16:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-22 16:13:37] [INFO ] Computed and/alt/rep : 165/1038/165 causal constraints (skipped 47 transitions) in 15 ms.
[2024-05-22 16:13:37] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-22 16:13:38] [INFO ] Added : 86 causal constraints over 18 iterations in 860 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 210 /210 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-22 16:13:38] [INFO ] Invariant cache hit.
[2024-05-22 16:13:38] [INFO ] Implicit Places using invariants in 167 ms returned [134, 207]
[2024-05-22 16:13:38] [INFO ] Actually due to overlaps returned [207]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 209/210 places, 213/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 209 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 208 transition count 212
Applied a total of 2 rules in 6 ms. Remains 208 /209 variables (removed 1) and now considering 212/213 (removed 1) transitions.
// Phase 1: matrix 212 rows 208 cols
[2024-05-22 16:13:38] [INFO ] Computed 32 invariants in 8 ms
[2024-05-22 16:13:39] [INFO ] Implicit Places using invariants in 160 ms returned [134]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 183 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/210 places, 212/213 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 206 transition count 211
Applied a total of 2 rules in 6 ms. Remains 206 /207 variables (removed 1) and now considering 211/212 (removed 1) transitions.
// Phase 1: matrix 211 rows 206 cols
[2024-05-22 16:13:39] [INFO ] Computed 31 invariants in 9 ms
[2024-05-22 16:13:39] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 16:13:39] [INFO ] Invariant cache hit.
[2024-05-22 16:13:39] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:13:40] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1514 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 206/210 places, 211/213 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1895 ms. Remains : 206/210 places, 211/213 transitions.
[2024-05-22 16:13:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (144153 resets) in 685 ms. (1457 steps per ms)
BEST_FIRST walk for 1000001 steps (91014 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-22 16:13:41] [INFO ] Invariant cache hit.
[2024-05-22 16:13:41] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 16:13:41] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 16:13:41] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-22 16:13:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:13:42] [INFO ] [Real]Added 39 Read/Feed constraints in 58 ms returned sat
[2024-05-22 16:13:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:13:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-22 16:13:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-22 16:13:42] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-22 16:13:42] [INFO ] [Nat]Added 39 Read/Feed constraints in 63 ms returned sat
[2024-05-22 16:13:42] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 16:13:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-22 16:13:42] [INFO ] Computed and/alt/rep : 168/1077/168 causal constraints (skipped 42 transitions) in 10 ms.
[2024-05-22 16:13:42] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:13:42] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:13:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2024-05-22 16:13:42] [INFO ] Added : 66 causal constraints over 14 iterations in 557 ms. Result :sat
Minimization took 207 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 16:13:43] [INFO ] Invariant cache hit.
[2024-05-22 16:13:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-22 16:13:43] [INFO ] Invariant cache hit.
[2024-05-22 16:13:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-22 16:13:44] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1369 ms to find 0 implicit places.
[2024-05-22 16:13:44] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 16:13:44] [INFO ] Invariant cache hit.
[2024-05-22 16:13:44] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 276 constraints, problems are : Problem set: 0 solved, 210 unsolved in 11984 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 16:14:03] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 16:14:03] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:14:03] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:14:03] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 16:14:03] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-22 16:14:04] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2024-05-22 16:14:04] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:14:04] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:14:05] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:14:06] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-22 16:14:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 16:14:09] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:14:09] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:14:09] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-22 16:14:09] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:14:09] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/417 variables, 5/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/417 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 16:14:22] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:14:22] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:14:22] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/417 variables, 3/514 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 514 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 28/28 constraints]
After SMT, in 42106ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 42110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43488 ms. Remains : 206/206 places, 211/211 transitions.
[2024-05-22 16:14:26] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:14:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:14:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12646015327026925039.gal : 2 ms
[2024-05-22 16:14:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9579690941276238966.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12646015327026925039.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9579690941276238966.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (5751 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality9579690941276238966.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 117
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :117 after 230
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :230 after 487
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :487 after 1050
BEST_FIRST walk for 40001 steps (3665 resets) in 160 ms. (248 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4096
BEST_FIRST walk for 40000 steps (3652 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
SDD size :1050 after 19970
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :19970 after 38756
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :38756 after 90526
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :90526 after 218746
Interrupted probabilistic random walk after 272234 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 2
Probabilistic random walk after 272234 steps, saw 136145 distinct states, run finished after 3012 ms. (steps per millisecond=90 ) properties seen :0
[2024-05-22 16:14:29] [INFO ] Invariant cache hit.
[2024-05-22 16:14:29] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 5 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :218746 after 471687
[2024-05-22 16:14:30] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
[2024-05-22 16:14:30] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2024-05-22 16:14:30] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 211/412 variables, 201/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 39/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/417 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:14:33] [INFO ] Deduced a trap composed of 87 places in 2663 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/201 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :471687 after 1.70538e+07
[2024-05-22 16:14:36] [INFO ] Deduced a trap composed of 12 places in 3088 ms of which 23 ms to minimize.
SMT process timed out in 6814ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
RANDOM walk for 40000 steps (5797 resets) in 376 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3598 resets) in 392 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3665 resets) in 444 ms. (89 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 214590 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 2
Probabilistic random walk after 214590 steps, saw 107312 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-22 16:14:40] [INFO ] Invariant cache hit.
[2024-05-22 16:14:40] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 54/201 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:14:41] [INFO ] Deduced a trap composed of 4 places in 1448 ms of which 2 ms to minimize.
[2024-05-22 16:14:44] [INFO ] Deduced a trap composed of 7 places in 3110 ms of which 28 ms to minimize.
[2024-05-22 16:14:45] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 211/412 variables, 201/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/412 variables, 39/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/412 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 5/417 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/417 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/417 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 279 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5097 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 262144
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 126/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1.70538e+07 after 2.16388e+08
[2024-05-22 16:14:49] [INFO ] Deduced a trap composed of 87 places in 3658 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 54/201 variables, 18/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:14:53] [INFO ] Deduced a trap composed of 12 places in 3859 ms of which 24 ms to minimize.
[2024-05-22 16:14:53] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-22 16:14:55] [INFO ] Deduced a trap composed of 13 places in 2224 ms of which 13 ms to minimize.
[2024-05-22 16:14:55] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-22 16:14:57] [INFO ] Deduced a trap composed of 18 places in 1801 ms of which 24 ms to minimize.
[2024-05-22 16:14:57] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:14:59] [INFO ] Deduced a trap composed of 22 places in 2334 ms of which 5 ms to minimize.
[2024-05-22 16:14:59] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2024-05-22 16:15:01] [INFO ] Deduced a trap composed of 24 places in 1755 ms of which 13 ms to minimize.
[2024-05-22 16:15:01] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 16:15:03] [INFO ] Deduced a trap composed of 25 places in 1674 ms of which 32 ms to minimize.
[2024-05-22 16:15:03] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-22 16:15:04] [INFO ] Deduced a trap composed of 25 places in 899 ms of which 23 ms to minimize.
[2024-05-22 16:15:04] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2024-05-22 16:15:05] [INFO ] Deduced a trap composed of 31 places in 1164 ms of which 32 ms to minimize.
[2024-05-22 16:15:05] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 0 ms to minimize.
[2024-05-22 16:15:05] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 211/412 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/412 variables, 39/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:15:07] [INFO ] Deduced a trap composed of 16 places in 1720 ms of which 33 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/412 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 5/417 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/417 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/417 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 22730 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
After SMT, in 27847ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 545 ms.
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 211/211 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-05-22 16:15:08] [INFO ] Invariant cache hit.
[2024-05-22 16:15:12] [INFO ] Implicit Places using invariants in 3544 ms returned []
[2024-05-22 16:15:12] [INFO ] Invariant cache hit.
[2024-05-22 16:15:13] [INFO ] State equation strengthened by 39 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-22 16:15:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:15:16] [INFO ] Applying decomposition
[2024-05-22 16:15:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14485614875092773280.txt' '-o' '/tmp/graph14485614875092773280.bin' '-w' '/tmp/graph14485614875092773280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14485614875092773280.bin' '-l' '-1' '-v' '-w' '/tmp/graph14485614875092773280.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:15:16] [INFO ] Decomposing Gal with order
[2024-05-22 16:15:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:15:16] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-22 16:15:16] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 2 ms.
[2024-05-22 16:15:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4870407899893796051.gal : 36 ms
[2024-05-22 16:15:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality308527172543631660.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4870407899893796051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality308527172543631660.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/ReachabilityCardinality308527172543631660.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 40
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :40 after 54
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :54 after 70
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :70 after 1156
[2024-05-22 16:15:17] [INFO ] Implicit Places using invariants and state equation in 5067 ms returned []
Implicit Place search using SMT with State Equation took 8613 ms to find 0 implicit places.
[2024-05-22 16:15:17] [INFO ] Redundant transitions in 1 ms returned []
Running 210 sub problems to find dead transitions.
[2024-05-22 16:15:17] [INFO ] Invariant cache hit.
[2024-05-22 16:15:17] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1156 after 747610
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :747610 after 879233
After SMT solving in domain Real declared 417/417 variables, and 276 constraints, problems are : Problem set: 0 solved, 210 unsolved in 22558 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (OVERLAPS) 2/206 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :879233 after 2.3569e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/417 variables, 206/237 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 39/276 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2.3569e+06 after 8.34701e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 210/486 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-05-22 16:15:52] [INFO ] Deduced a trap composed of 19 places in 1672 ms of which 22 ms to minimize.
[2024-05-22 16:15:53] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 4 ms to minimize.
[2024-05-22 16:15:56] [INFO ] Deduced a trap composed of 3 places in 3446 ms of which 32 ms to minimize.
[2024-05-22 16:15:56] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:15:58] [INFO ] Deduced a trap composed of 43 places in 1397 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8.34701e+06 after 2.93828e+07
[2024-05-22 16:16:01] [INFO ] Deduced a trap composed of 56 places in 2952 ms of which 32 ms to minimize.
[2024-05-22 16:16:05] [INFO ] Deduced a trap composed of 71 places in 3603 ms of which 28 ms to minimize.
Detected timeout of ITS tools.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 28 places in 1701 ms of which 1 ms to minimize.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 1 ms to minimize.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:16:07] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:16:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/417 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 417/417 variables, and 506 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 206/206 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 20/20 constraints]
After SMT, in 52661ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 52663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61290 ms. Remains : 206/206 places, 211/211 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 156464 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 232 rows 229 cols
[2024-05-22 16:16:09] [INFO ] Computed 33 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (1437 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10000 steps (920 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-22 16:16:09] [INFO ] Invariant cache hit.
[2024-05-22 16:16:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-22 16:16:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:16:10] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-22 16:16:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-22 16:16:10] [INFO ] [Real]Added 33 Read/Feed constraints in 172 ms returned sat
[2024-05-22 16:16:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:16:10] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-22 16:16:10] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-22 16:16:10] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-22 16:16:10] [INFO ] [Nat]Added 33 Read/Feed constraints in 159 ms returned sat
[2024-05-22 16:16:10] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:10] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:16:10] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:16:11] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:16:12] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:16:12] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-22 16:16:12] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:16:12] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1743 ms
[2024-05-22 16:16:12] [INFO ] Computed and/alt/rep : 212/1163/212 causal constraints (skipped 19 transitions) in 10 ms.
[2024-05-22 16:16:13] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:16:13] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:13] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:16:13] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 1 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:16:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1295 ms
[2024-05-22 16:16:15] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 2 ms to minimize.
[2024-05-22 16:16:15] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:16:15] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-05-22 16:16:15] [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
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 232/232 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 230
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 227 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 227 transition count 228
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 225 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 220 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 218 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 218 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 211 transition count 216
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 211 transition count 216
Applied a total of 40 rules in 15 ms. Remains 211 /229 variables (removed 18) and now considering 216/232 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 211/229 places, 216/232 transitions.
// Phase 1: matrix 216 rows 211 cols
[2024-05-22 16:16:15] [INFO ] Computed 33 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (144109 resets) in 719 ms. (1388 steps per ms)
BEST_FIRST walk for 1000000 steps (91701 resets) in 487 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-22 16:16:16] [INFO ] Invariant cache hit.
[2024-05-22 16:16:16] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 16:16:16] [INFO ] [Real]Absence check using 13 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 16:16:16] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-22 16:16:16] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:16:16] [INFO ] [Real]Added 40 Read/Feed constraints in 110 ms returned sat
[2024-05-22 16:16:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:16:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-22 16:16:16] [INFO ] [Nat]Absence check using 13 positive and 20 generalized place invariants in 2 ms returned sat
[2024-05-22 16:16:17] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-22 16:16:17] [INFO ] [Nat]Added 40 Read/Feed constraints in 127 ms returned sat
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:17] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:16:18] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2024-05-22 16:16:19] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 3574 ms
[2024-05-22 16:16:20] [INFO ] Computed and/alt/rep : 170/1061/170 causal constraints (skipped 45 transitions) in 11 ms.
[2024-05-22 16:16:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2024-05-22 16:16:21] [INFO ] Added : 114 causal constraints over 24 iterations in 1167 ms. Result :sat
Minimization took 443 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 211/211 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 211 /211 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 16:16:23] [INFO ] Invariant cache hit.
[2024-05-22 16:16:23] [INFO ] Implicit Places using invariants in 158 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 170 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 215
Applied a total of 2 rules in 5 ms. Remains 209 /210 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-22 16:16:23] [INFO ] Computed 32 invariants in 10 ms
[2024-05-22 16:16:23] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 16:16:23] [INFO ] Invariant cache hit.
[2024-05-22 16:16:24] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:16:25] [INFO ] Implicit Places using invariants and state equation in 1242 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/211 places, 215/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1589 ms. Remains : 209/211 places, 215/216 transitions.
[2024-05-22 16:16:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (144217 resets) in 690 ms. (1447 steps per ms)
BEST_FIRST walk for 1000000 steps (91328 resets) in 485 ms. (2057 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-22 16:16:26] [INFO ] Invariant cache hit.
[2024-05-22 16:16:26] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-22 16:16:26] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 16:16:26] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-22 16:16:26] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:16:26] [INFO ] [Real]Added 40 Read/Feed constraints in 167 ms returned sat
[2024-05-22 16:16:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:16:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 16:16:26] [INFO ] [Nat]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 16:16:26] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-22 16:16:26] [INFO ] [Nat]Added 40 Read/Feed constraints in 174 ms returned sat
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:16:27] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:16:28] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:16:29] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 2 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:16:30] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:16:31] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:16:31] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 4131 ms
[2024-05-22 16:16:31] [INFO ] Computed and/alt/rep : 174/1101/174 causal constraints (skipped 40 transitions) in 22 ms.
[2024-05-22 16:16:32] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-05-22 16:16:32] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 1 ms to minimize.
[2024-05-22 16:16:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2024-05-22 16:16:32] [INFO ] Added : 108 causal constraints over 22 iterations in 1099 ms. Result :sat
Minimization took 447 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 16:16:33] [INFO ] Invariant cache hit.
[2024-05-22 16:16:33] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 16:16:33] [INFO ] Invariant cache hit.
[2024-05-22 16:16:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:16:34] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2024-05-22 16:16:34] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 16:16:34] [INFO ] Invariant cache hit.
[2024-05-22 16:16:34] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 214 unsolved in 12324 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 214/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 16:16:56] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-22 16:16:57] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-05-22 16:16:57] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 16:17:02] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-22 16:17:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:17:03] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-05-22 16:17:03] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2024-05-22 16:17:03] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:17:03] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:17:03] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-22 16:17:04] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 1 ms to minimize.
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 1 ms to minimize.
[2024-05-22 16:17:05] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 518 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 23/23 constraints]
After SMT, in 42419ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 42421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43707 ms. Remains : 209/209 places, 215/215 transitions.
[2024-05-22 16:17:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 16:17:17] [INFO ] Flatten gal took : 24 ms
[2024-05-22 16:17:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11239868622731469948.gal : 1 ms
[2024-05-22 16:17:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12091756855039339159.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11239868622731469948.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12091756855039339159.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 40000 steps (5831 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12091756855039339159.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :14 after 32
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :32 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 124
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :124 after 236
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :236 after 494
BEST_FIRST walk for 40001 steps (3681 resets) in 348 ms. (114 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :494 after 1092
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1092 after 21818
BEST_FIRST walk for 40004 steps (3655 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :21818 after 38846
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :38846 after 101466
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :101466 after 240595
Interrupted probabilistic random walk after 207785 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 207785 steps, saw 103914 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-22 16:17:20] [INFO ] Invariant cache hit.
[2024-05-22 16:17:20] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 16:17:20] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 16:17:20] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 2 ms to minimize.
[2024-05-22 16:17:21] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :240595 after 514860
[2024-05-22 16:17:22] [INFO ] Deduced a trap composed of 99 places in 1324 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 55/204 variables, 19/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 215/419 variables, 204/238 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 40/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/424 variables, 5/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 2/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/424 variables, 0/285 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 285 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:17:22] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 16:17:22] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 55/204 variables, 19/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 16:17:23] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 4 ms to minimize.
[2024-05-22 16:17:23] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-05-22 16:17:23] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 3/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 215/419 variables, 204/243 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 40/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/424 variables, 5/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/291 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 291 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 3673ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
RANDOM walk for 40000 steps (5800 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3660 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :514860 after 5.888e+06
Interrupted probabilistic random walk after 822891 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :0 out of 1
Probabilistic random walk after 822891 steps, saw 411533 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :0
[2024-05-22 16:17:27] [INFO ] Invariant cache hit.
[2024-05-22 16:17:27] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/204 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/419 variables, 204/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 40/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/424 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/149 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:29] [INFO ] Deduced a trap composed of 95 places in 1374 ms of which 24 ms to minimize.
[2024-05-22 16:17:29] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 3 ms to minimize.
[2024-05-22 16:17:30] [INFO ] Deduced a trap composed of 99 places in 1323 ms of which 1 ms to minimize.
[2024-05-22 16:17:30] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/204 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:30] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-22 16:17:31] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:17:31] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 215/419 variables, 204/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:17:32] [INFO ] Deduced a trap composed of 22 places in 1140 ms of which 27 ms to minimize.
[2024-05-22 16:17:34] [INFO ] Deduced a trap composed of 19 places in 1433 ms of which 27 ms to minimize.
[2024-05-22 16:17:34] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.888e+06 after 5.80687e+07
[2024-05-22 16:17:36] [INFO ] Deduced a trap composed of 12 places in 1585 ms of which 32 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/424 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/424 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8503 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 8798ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 16:17:36] [INFO ] Invariant cache hit.
[2024-05-22 16:17:36] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-22 16:17:36] [INFO ] Invariant cache hit.
[2024-05-22 16:17:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 16:17:39] [INFO ] Implicit Places using invariants and state equation in 2420 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
[2024-05-22 16:17:39] [INFO ] Redundant transitions in 1 ms returned []
Running 214 sub problems to find dead transitions.
[2024-05-22 16:17:39] [INFO ] Invariant cache hit.
[2024-05-22 16:17:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/424 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 281 constraints, problems are : Problem set: 0 solved, 214 unsolved in 15683 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 1/209 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
SDD proceeding with computation,2 properties remain. new max is 524288
SDD size :5.80687e+07 after 2.03072e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/424 variables, 209/241 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 214/495 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 16:18:05] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-22 16:18:05] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-05-22 16:18:05] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
Detected timeout of ITS tools.
[2024-05-22 16:18:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 16:18:07] [INFO ] Applying decomposition
[2024-05-22 16:18:07] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3791119248336694018.txt' '-o' '/tmp/graph3791119248336694018.bin' '-w' '/tmp/graph3791119248336694018.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3791119248336694018.bin' '-l' '-1' '-v' '-w' '/tmp/graph3791119248336694018.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:18:07] [INFO ] Decomposing Gal with order
[2024-05-22 16:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:18:07] [INFO ] Removed a total of 116 redundant transitions.
[2024-05-22 16:18:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 3 ms.
[2024-05-22 16:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7118402199323072030.gal : 3 ms
[2024-05-22 16:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6423862210104769245.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7118402199323072030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6423862210104769245.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality6423862210104769245.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 27
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :63 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1142 after 1340
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-22 16:18:10] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 16:18:11] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 16:18:11] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-22 16:18:11] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-22 16:18:11] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-05-22 16:18:12] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-22 16:18:13] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 1 ms to minimize.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :47896 after 47896
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 518 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 209/209 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 23/23 constraints]
After SMT, in 45786ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 45788ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48580 ms. Remains : 209/209 places, 215/215 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 18 Pre rules applied. Total rules applied 0 place count 209 transition count 197
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 191 transition count 197
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 183 transition count 189
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 183 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 182 transition count 188
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 182 transition count 186
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 180 transition count 186
Applied a total of 58 rules in 11 ms. Remains 180 /209 variables (removed 29) and now considering 186/215 (removed 29) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 180 cols
[2024-05-22 16:18:25] [INFO ] Computed 32 invariants in 16 ms
[2024-05-22 16:18:25] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:18:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-22 16:18:25] [INFO ] [Nat]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2024-05-22 16:18:25] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:18:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 16:18:25] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:18:25] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:18:25] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:18:25] [INFO ] Flatten gal took : 10 ms
[2024-05-22 16:18:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 16:18:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16501782395148768795.gal : 2 ms
[2024-05-22 16:18:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14357239947658918996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16501782395148768795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14357239947658918996.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality14357239947658918996.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 172
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :172 after 370
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :370 after 1352
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1352 after 3495
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3495 after 10402
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10402 after 23043
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :23043 after 50349
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :50349 after 106795
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :106795 after 224170
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :224170 after 461332
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :461332 after 942906
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :942906 after 1.91211e+06
Detected timeout of ITS tools.
[2024-05-22 16:18:40] [INFO ] Flatten gal took : 10 ms
[2024-05-22 16:18:40] [INFO ] Applying decomposition
[2024-05-22 16:18:40] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17128474775401125073.txt' '-o' '/tmp/graph17128474775401125073.bin' '-w' '/tmp/graph17128474775401125073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17128474775401125073.bin' '-l' '-1' '-v' '-w' '/tmp/graph17128474775401125073.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:18:40] [INFO ] Decomposing Gal with order
[2024-05-22 16:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:18:40] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 16:18:40] [INFO ] Flatten gal took : 12 ms
[2024-05-22 16:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2024-05-22 16:18:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5810434487928293708.gal : 2 ms
[2024-05-22 16:18:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7945926434094252097.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5810434487928293708.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7945926434094252097.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7945926434094252097.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 118870

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600