Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875400427.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
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 r083-tall-162048875400427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 169K May 5 16:51 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 1620588323062

Running Version 0
[2021-05-09 19:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 19:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 19:25:24] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2021-05-09 19:25:24] [INFO ] Transformed 534 places.
[2021-05-09 19:25:24] [INFO ] Transformed 498 transitions.
[2021-05-09 19:25:24] [INFO ] Parsed PT model containing 534 places and 498 transitions in 106 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 498 rows 534 cols
[2021-05-09 19:25:24] [INFO ] Computed 54 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 335 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :3
FORMULA DoubleExponent-PT-010-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 270 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :0
// Phase 1: matrix 498 rows 534 cols
[2021-05-09 19:25:25] [INFO ] Computed 54 place invariants in 42 ms
[2021-05-09 19:25:25] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2021-05-09 19:25:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2021-05-09 19:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:25] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2021-05-09 19:25:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-09 19:25:25] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:25] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 19:25:26] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 3 ms to minimize.
[2021-05-09 19:25:26] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 1 ms to minimize.
[2021-05-09 19:25:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 442 ms
[2021-05-09 19:25:26] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-09 19:25:30] [INFO ] Added : 385 causal constraints over 77 iterations in 4274 ms. Result :unknown
[2021-05-09 19:25:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:30] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:30] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-09 19:25:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:30] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:31] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 19:25:31] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-09 19:25:34] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 2 ms to minimize.
[2021-05-09 19:25:35] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 2 ms to minimize.
[2021-05-09 19:25:35] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2021-05-09 19:25:35] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 0 ms to minimize.
[2021-05-09 19:25:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 699 ms
[2021-05-09 19:25:35] [INFO ] Added : 293 causal constraints over 59 iterations in 4412 ms. Result :sat
Minimization took 342 ms.
[2021-05-09 19:25:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:35] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:36] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-09 19:25:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:36] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:36] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-09 19:25:36] [INFO ] Deduced a trap composed of 210 places in 139 ms of which 1 ms to minimize.
[2021-05-09 19:25:36] [INFO ] Deduced a trap composed of 223 places in 136 ms of which 1 ms to minimize.
[2021-05-09 19:25:36] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2021-05-09 19:25:37] [INFO ] Deduced a trap composed of 62 places in 137 ms of which 1 ms to minimize.
[2021-05-09 19:25:37] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 0 ms to minimize.
[2021-05-09 19:25:37] [INFO ] Deduced a trap composed of 196 places in 137 ms of which 0 ms to minimize.
[2021-05-09 19:25:37] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 1 ms to minimize.
[2021-05-09 19:25:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1150 ms
[2021-05-09 19:25:37] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-09 19:25:38] [INFO ] Deduced a trap composed of 221 places in 130 ms of which 0 ms to minimize.
[2021-05-09 19:25:39] [INFO ] Deduced a trap composed of 206 places in 132 ms of which 0 ms to minimize.
[2021-05-09 19:25:39] [INFO ] Deduced a trap composed of 194 places in 129 ms of which 0 ms to minimize.
[2021-05-09 19:25:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 675 ms
[2021-05-09 19:25:39] [INFO ] Added : 179 causal constraints over 36 iterations in 1881 ms. Result :sat
Minimization took 387 ms.
[2021-05-09 19:25:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:39] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:40] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-05-09 19:25:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:40] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:40] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-09 19:25:40] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-09 19:25:43] [INFO ] Deduced a trap composed of 241 places in 131 ms of which 1 ms to minimize.
[2021-05-09 19:25:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2021-05-09 19:25:43] [INFO ] Added : 298 causal constraints over 60 iterations in 2844 ms. Result :sat
Minimization took 447 ms.
[2021-05-09 19:25:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:43] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:43] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-09 19:25:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:44] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:44] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 158 places in 73 ms of which 1 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 0 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 147 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 1 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2021-05-09 19:25:44] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2021-05-09 19:25:45] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 0 ms to minimize.
[2021-05-09 19:25:45] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 0 ms to minimize.
[2021-05-09 19:25:45] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2021-05-09 19:25:45] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2021-05-09 19:25:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1151 ms
[2021-05-09 19:25:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-09 19:25:49] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2021-05-09 19:25:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:25:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:49] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:49] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-09 19:25:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:49] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned sat
[2021-05-09 19:25:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:49] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-09 19:25:49] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 26 ms.
[2021-05-09 19:25:52] [INFO ] Deduced a trap composed of 217 places in 124 ms of which 0 ms to minimize.
[2021-05-09 19:25:52] [INFO ] Deduced a trap composed of 165 places in 123 ms of which 1 ms to minimize.
[2021-05-09 19:25:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2021-05-09 19:25:52] [INFO ] Added : 308 causal constraints over 62 iterations in 3072 ms. Result :sat
Minimization took 932 ms.
[2021-05-09 19:25:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:53] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-09 19:25:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:54] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2021-05-09 19:25:54] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-09 19:25:59] [INFO ] Added : 450 causal constraints over 90 iterations in 4668 ms. Result :unknown
[2021-05-09 19:25:59] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:25:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:59] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2021-05-09 19:25:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:25:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:25:59] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:25:59] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2021-05-09 19:25:59] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-09 19:26:04] [INFO ] Deduced a trap composed of 96 places in 70 ms of which 1 ms to minimize.
[2021-05-09 19:26:04] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:26:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2021-05-09 19:26:04] [INFO ] Added : 494 causal constraints over 99 iterations in 4550 ms. Result :sat
Minimization took 10 ms.
[2021-05-09 19:26:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:04] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:04] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2021-05-09 19:26:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:04] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:04] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 0 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 193 places in 132 ms of which 0 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 199 places in 130 ms of which 0 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 197 places in 129 ms of which 1 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 235 places in 130 ms of which 1 ms to minimize.
[2021-05-09 19:26:05] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 1 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Deduced a trap composed of 222 places in 128 ms of which 1 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Deduced a trap composed of 193 places in 120 ms of which 0 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Deduced a trap composed of 223 places in 134 ms of which 1 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Deduced a trap composed of 231 places in 128 ms of which 0 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Deduced a trap composed of 203 places in 129 ms of which 0 ms to minimize.
[2021-05-09 19:26:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1817 ms
[2021-05-09 19:26:06] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-09 19:26:09] [INFO ] Deduced a trap composed of 247 places in 128 ms of which 0 ms to minimize.
[2021-05-09 19:26:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:26:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:09] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:10] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2021-05-09 19:26:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-09 19:26:10] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:26:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:10] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-09 19:26:10] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 0 ms to minimize.
[2021-05-09 19:26:10] [INFO ] Deduced a trap composed of 181 places in 125 ms of which 0 ms to minimize.
[2021-05-09 19:26:10] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:26:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2021-05-09 19:26:10] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-09 19:26:15] [INFO ] Added : 455 causal constraints over 91 iterations in 4319 ms. Result :unknown
[2021-05-09 19:26:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:15] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:15] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-09 19:26:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:15] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:26:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:15] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 19:26:15] [INFO ] Deduced a trap composed of 171 places in 123 ms of which 0 ms to minimize.
[2021-05-09 19:26:15] [INFO ] Deduced a trap composed of 198 places in 128 ms of which 0 ms to minimize.
[2021-05-09 19:26:15] [INFO ] Deduced a trap composed of 229 places in 126 ms of which 1 ms to minimize.
[2021-05-09 19:26:16] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 0 ms to minimize.
[2021-05-09 19:26:16] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2021-05-09 19:26:16] [INFO ] Deduced a trap composed of 206 places in 124 ms of which 0 ms to minimize.
[2021-05-09 19:26:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 908 ms
[2021-05-09 19:26:16] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-09 19:26:20] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 0 ms to minimize.
[2021-05-09 19:26:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2021-05-09 19:26:20] [INFO ] Added : 348 causal constraints over 71 iterations in 3789 ms. Result :sat
Minimization took 72 ms.
[2021-05-09 19:26:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:20] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 19:26:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-09 19:26:20] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:20] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 19:26:20] [INFO ] Deduced a trap composed of 166 places in 121 ms of which 0 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 205 places in 119 ms of which 1 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 181 places in 114 ms of which 0 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 194 places in 120 ms of which 0 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 192 places in 120 ms of which 1 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 180 places in 115 ms of which 0 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 187 places in 113 ms of which 0 ms to minimize.
[2021-05-09 19:26:21] [INFO ] Deduced a trap composed of 178 places in 117 ms of which 0 ms to minimize.
[2021-05-09 19:26:22] [INFO ] Deduced a trap composed of 194 places in 122 ms of which 0 ms to minimize.
[2021-05-09 19:26:22] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 0 ms to minimize.
[2021-05-09 19:26:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1520 ms
[2021-05-09 19:26:22] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-09 19:26:25] [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 11
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:26:25] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:26:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:25] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-09 19:26:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:26:25] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:26] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-09 19:26:26] [INFO ] Deduced a trap composed of 178 places in 134 ms of which 3 ms to minimize.
[2021-05-09 19:26:26] [INFO ] Deduced a trap composed of 101 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:26:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2021-05-09 19:26:26] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-09 19:26:30] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 9 ms to minimize.
[2021-05-09 19:26:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 19:26:31] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:26:31] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2021-05-09 19:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:31] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-09 19:26:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:26:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-09 19:26:31] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2021-05-09 19:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:26:31] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2021-05-09 19:26:31] [INFO ] Deduced a trap composed of 175 places in 132 ms of which 0 ms to minimize.
[2021-05-09 19:26:31] [INFO ] Deduced a trap composed of 205 places in 133 ms of which 0 ms to minimize.
[2021-05-09 19:26:31] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2021-05-09 19:26:32] [INFO ] Deduced a trap composed of 199 places in 130 ms of which 0 ms to minimize.
[2021-05-09 19:26:32] [INFO ] Deduced a trap composed of 208 places in 130 ms of which 1 ms to minimize.
[2021-05-09 19:26:32] [INFO ] Deduced a trap composed of 212 places in 129 ms of which 0 ms to minimize.
[2021-05-09 19:26:32] [INFO ] Deduced a trap composed of 238 places in 130 ms of which 0 ms to minimize.
[2021-05-09 19:26:32] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1221 ms
[2021-05-09 19:26:32] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2021-05-09 19:26:33] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 0 ms to minimize.
[2021-05-09 19:26:34] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 0 ms to minimize.
[2021-05-09 19:26:34] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2021-05-09 19:26:34] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 0 ms to minimize.
[2021-05-09 19:26:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 599 ms
[2021-05-09 19:26:34] [INFO ] Added : 157 causal constraints over 32 iterations in 1807 ms. Result :sat
Minimization took 311 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 33, 1, 1, 1, 1, 1, 33, 1, 1, 2, -1, 22] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 79500 steps, including 2902 resets, run finished after 204 ms. (steps per millisecond=389 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5267100 steps, including 194873 resets, run finished after 9663 ms. (steps per millisecond=545 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8778300 steps, including 310402 resets, run finished after 16322 ms. (steps per millisecond=537 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 879200 steps, including 32565 resets, run finished after 1566 ms. (steps per millisecond=561 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1323400 steps, including 46413 resets, run finished after 2373 ms. (steps per millisecond=557 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 389100 steps, including 14466 resets, run finished after 683 ms. (steps per millisecond=569 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1085700 steps, including 38190 resets, run finished after 1918 ms. (steps per millisecond=566 ) properties (out of 14) seen :0 could not realise parikh vector
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions 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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 419 transition count 384
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 228 place count 415 transition count 384
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 228 place count 415 transition count 363
Deduced a syphon composed of 21 places in 3 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 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 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 517 place count 289 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 554 place count 252 transition count 238
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 596 place count 252 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 597 place count 251 transition count 237
Applied a total of 597 rules in 145 ms. Remains 251 /534 variables (removed 283) and now considering 237/498 (removed 261) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/534 places, 237/498 transitions.
// Phase 1: matrix 237 rows 251 cols
[2021-05-09 19:27:07] [INFO ] Computed 50 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 128288 resets, run finished after 1855 ms. (steps per millisecond=539 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84554 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84732 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84857 resets, run finished after 1216 ms. (steps per millisecond=822 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84825 resets, run finished after 1221 ms. (steps per millisecond=819 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84837 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84644 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84879 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84787 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84800 resets, run finished after 1220 ms. (steps per millisecond=819 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84759 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84451 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84547 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84557 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84763 resets, run finished after 1215 ms. (steps per millisecond=823 ) properties (out of 14) seen :0
// Phase 1: matrix 237 rows 251 cols
[2021-05-09 19:27:26] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-09 19:27:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:26] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:27:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:26] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:26] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-09 19:27:26] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:27:26] [INFO ] [Nat]Added 35 Read/Feed constraints in 33 ms returned sat
[2021-05-09 19:27:26] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2021-05-09 19:27:26] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:27:27] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:27:27] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:27:27] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:27:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2021-05-09 19:27:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 346 ms
[2021-05-09 19:27:27] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 16 ms.
[2021-05-09 19:27:28] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:29] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 1 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 0 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:27:30] [INFO ] Deduced a trap composed of 98 places in 68 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 97 places in 86 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 94 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 1 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:27:31] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:27:32] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3610 ms
[2021-05-09 19:27:32] [INFO ] Added : 203 causal constraints over 41 iterations in 5309 ms. Result :sat
Minimization took 352 ms.
[2021-05-09 19:27:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:32] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:32] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-09 19:27:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:33] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:33] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-09 19:27:33] [INFO ] [Nat]Added 35 Read/Feed constraints in 19 ms returned sat
[2021-05-09 19:27:33] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:27:34] [INFO ] Added : 176 causal constraints over 36 iterations in 1375 ms. Result :sat
Minimization took 197 ms.
[2021-05-09 19:27:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:34] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:34] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-09 19:27:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:34] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 10 ms returned sat
[2021-05-09 19:27:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-09 19:27:34] [INFO ] [Nat]Added 35 Read/Feed constraints in 17 ms returned sat
[2021-05-09 19:27:34] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 14 ms.
[2021-05-09 19:27:36] [INFO ] Added : 175 causal constraints over 36 iterations in 1490 ms. Result :sat
Minimization took 160 ms.
[2021-05-09 19:27:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:36] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:36] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:27:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:36] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:36] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-09 19:27:36] [INFO ] [Nat]Added 35 Read/Feed constraints in 18 ms returned sat
[2021-05-09 19:27:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-09 19:27:36] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 14 ms.
[2021-05-09 19:27:38] [INFO ] Added : 203 causal constraints over 41 iterations in 1918 ms. Result :sat
Minimization took 173 ms.
[2021-05-09 19:27:39] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:39] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:39] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:27:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:39] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:39] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:27:39] [INFO ] [Nat]Added 35 Read/Feed constraints in 16 ms returned sat
[2021-05-09 19:27:39] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-09 19:27:39] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 13 ms.
[2021-05-09 19:27:41] [INFO ] Added : 193 causal constraints over 40 iterations in 1705 ms. Result :sat
Minimization took 264 ms.
[2021-05-09 19:27:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:41] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:41] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-09 19:27:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:27:41] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:41] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:27:41] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:27:41] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2021-05-09 19:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-09 19:27:41] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:27:43] [INFO ] Added : 198 causal constraints over 40 iterations in 1437 ms. Result :sat
Minimization took 188 ms.
[2021-05-09 19:27:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:27:43] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:43] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-09 19:27:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:43] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:43] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-09 19:27:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:27:43] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-09 19:27:43] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 13 ms.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:27:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 904 ms
[2021-05-09 19:27:45] [INFO ] Added : 179 causal constraints over 36 iterations in 2316 ms. Result :sat
Minimization took 244 ms.
[2021-05-09 19:27:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:46] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:46] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-09 19:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:27:46] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:46] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:27:46] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2021-05-09 19:27:46] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 13 ms.
[2021-05-09 19:27:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:27:48] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:27:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2021-05-09 19:27:48] [INFO ] Added : 191 causal constraints over 39 iterations in 1644 ms. Result :sat
Minimization took 216 ms.
[2021-05-09 19:27:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:48] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:48] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-09 19:27:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:48] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:48] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-09 19:27:48] [INFO ] [Nat]Added 35 Read/Feed constraints in 26 ms returned sat
[2021-05-09 19:27:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2021-05-09 19:27:48] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:27:49] [INFO ] Added : 172 causal constraints over 36 iterations in 1214 ms. Result :sat
Minimization took 134 ms.
[2021-05-09 19:27:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:50] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:50] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:27:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:50] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:50] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:27:50] [INFO ] [Nat]Added 35 Read/Feed constraints in 19 ms returned sat
[2021-05-09 19:27:50] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2021-05-09 19:27:50] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 0 ms to minimize.
[2021-05-09 19:27:50] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:27:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2021-05-09 19:27:50] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:27:51] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2021-05-09 19:27:51] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2021-05-09 19:27:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 795 ms
[2021-05-09 19:27:52] [INFO ] Added : 173 causal constraints over 36 iterations in 2015 ms. Result :sat
Minimization took 266 ms.
[2021-05-09 19:27:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:27:52] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:52] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:27:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:53] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:53] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-09 19:27:53] [INFO ] [Nat]Added 35 Read/Feed constraints in 17 ms returned sat
[2021-05-09 19:27:53] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 13 ms.
[2021-05-09 19:27:54] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 0 ms to minimize.
[2021-05-09 19:27:54] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 0 ms to minimize.
[2021-05-09 19:27:54] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2021-05-09 19:27:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-09 19:27:54] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:27:55] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2021-05-09 19:27:55] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:55] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2021-05-09 19:27:55] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2021-05-09 19:27:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 946 ms
[2021-05-09 19:27:55] [INFO ] Added : 187 causal constraints over 38 iterations in 2262 ms. Result :sat
Minimization took 210 ms.
[2021-05-09 19:27:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:55] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:55] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 19:27:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:27:55] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:55] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:27:55] [INFO ] [Nat]Added 35 Read/Feed constraints in 47 ms returned sat
[2021-05-09 19:27:55] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 75 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 73 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 76 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 70 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Deduced a trap composed of 72 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:27:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 685 ms
[2021-05-09 19:27:56] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:27:57] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2021-05-09 19:27:58] [INFO ] Added : 120 causal constraints over 24 iterations in 1482 ms. Result :sat
Minimization took 163 ms.
[2021-05-09 19:27:58] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:58] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:58] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:27:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:27:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:27:58] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:27:58] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:27:58] [INFO ] [Nat]Added 35 Read/Feed constraints in 34 ms returned sat
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:27:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 348 ms
[2021-05-09 19:27:58] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 13 ms.
[2021-05-09 19:28:00] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:28:00] [INFO ] Deduced a trap composed of 93 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:28:00] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 0 ms to minimize.
[2021-05-09 19:28:00] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2021-05-09 19:28:00] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 93 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2021-05-09 19:28:01] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 92 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 1 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 98 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 85 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:02] [INFO ] Deduced a trap composed of 86 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:28:03] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3505 ms
[2021-05-09 19:28:04] [INFO ] Added : 203 causal constraints over 41 iterations in 5185 ms. Result :sat
Minimization took 352 ms.
[2021-05-09 19:28:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:28:04] [INFO ] [Real]Absence check using 3 positive and 47 generalized place invariants in 12 ms returned sat
[2021-05-09 19:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:28:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-09 19:28:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:28:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 19:28:04] [INFO ] [Nat]Absence check using 3 positive and 47 generalized place invariants in 11 ms returned sat
[2021-05-09 19:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:28:04] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:28:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 36 ms returned sat
[2021-05-09 19:28:04] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:28:04] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:28:04] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:28:04] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:28:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2021-05-09 19:28:04] [INFO ] Computed and/alt/rep : 204/1086/204 causal constraints (skipped 32 transitions) in 12 ms.
[2021-05-09 19:28:06] [INFO ] Added : 184 causal constraints over 37 iterations in 1766 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, 1, 33, 1, 1, 2, -1, 22] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 50000 steps, including 7739 resets, run finished after 112 ms. (steps per millisecond=446 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 654200 steps, including 101396 resets, run finished after 1237 ms. (steps per millisecond=528 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 560700 steps, including 86857 resets, run finished after 1044 ms. (steps per millisecond=537 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 748100 steps, including 115905 resets, run finished after 1420 ms. (steps per millisecond=526 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2846800 steps, including 441740 resets, run finished after 5466 ms. (steps per millisecond=520 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 33500 steps, including 4867 resets, run finished after 63 ms. (steps per millisecond=531 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3914000 steps, including 607026 resets, run finished after 7511 ms. (steps per millisecond=521 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3449200 steps, including 535136 resets, run finished after 6601 ms. (steps per millisecond=522 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 190800 steps, including 29529 resets, run finished after 356 ms. (steps per millisecond=535 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4506400 steps, including 698952 resets, run finished after 8660 ms. (steps per millisecond=520 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 92900 steps, including 14438 resets, run finished after 178 ms. (steps per millisecond=521 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 114100 steps, including 17605 resets, run finished after 221 ms. (steps per millisecond=516 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 78200 steps, including 12154 resets, run finished after 151 ms. (steps per millisecond=517 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 654200 steps, including 101229 resets, run finished after 1256 ms. (steps per millisecond=520 ) properties (out of 14) seen :0 could not realise parikh vector
Support contains 13 out of 251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 251/251 places, 237/237 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 251/251 places, 237/237 transitions.
Starting structural reductions, iteration 0 : 251/251 places, 237/237 transitions.
Applied a total of 0 rules in 12 ms. Remains 251 /251 variables (removed 0) and now considering 237/237 (removed 0) transitions.
// Phase 1: matrix 237 rows 251 cols
[2021-05-09 19:28:41] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-09 19:28:41] [INFO ] Implicit Places using invariants in 298 ms returned [28, 49, 54, 77, 82, 104, 110, 132, 139, 140, 160, 166, 189, 197, 204, 212, 218, 242, 248]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 301 ms to find 19 implicit places.
[2021-05-09 19:28:41] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 237 rows 232 cols
[2021-05-09 19:28:41] [INFO ] Computed 32 place invariants in 13 ms
[2021-05-09 19:28:41] [INFO ] Dead Transitions using invariants and state equation in 128 ms returned []
Starting structural reductions, iteration 1 : 232/251 places, 237/237 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 231 transition count 236
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 231 transition count 228
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 223 transition count 228
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 223 transition count 228
Applied a total of 20 rules in 32 ms. Remains 223 /232 variables (removed 9) and now considering 228/237 (removed 9) transitions.
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:28:41] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-09 19:28:41] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:28:41] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:28:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:28:42] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 223/251 places, 228/237 transitions.
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:28:42] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144265 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91752 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91455 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91443 resets, run finished after 1143 ms. (steps per millisecond=874 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91061 resets, run finished after 1144 ms. (steps per millisecond=874 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91445 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91293 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91172 resets, run finished after 1146 ms. (steps per millisecond=872 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91659 resets, run finished after 1143 ms. (steps per millisecond=874 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91411 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91181 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91142 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91456 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91433 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91569 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 14) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:29:00] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-09 19:29:00] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:00] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:00] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 19:29:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:00] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:00] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-09 19:29:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:29:00] [INFO ] [Nat]Added 35 Read/Feed constraints in 50 ms returned sat
[2021-05-09 19:29:00] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:29:00] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:00] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:29:00] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 272 ms
[2021-05-09 19:29:00] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:03] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:29:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2021-05-09 19:29:03] [INFO ] Added : 196 causal constraints over 40 iterations in 3019 ms. Result :sat
Minimization took 460 ms.
[2021-05-09 19:29:04] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:29:04] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:04] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:29:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:04] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:04] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-09 19:29:04] [INFO ] [Nat]Added 35 Read/Feed constraints in 34 ms returned sat
[2021-05-09 19:29:04] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:05] [INFO ] Added : 123 causal constraints over 26 iterations in 1042 ms. Result :sat
Minimization took 208 ms.
[2021-05-09 19:29:05] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:05] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:05] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 19:29:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:29:05] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:05] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-09 19:29:05] [INFO ] [Nat]Added 35 Read/Feed constraints in 38 ms returned sat
[2021-05-09 19:29:05] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:05] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:29:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2021-05-09 19:29:06] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:07] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2021-05-09 19:29:07] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:29:07] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2021-05-09 19:29:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2021-05-09 19:29:07] [INFO ] Added : 113 causal constraints over 23 iterations in 1391 ms. Result :sat
Minimization took 139 ms.
[2021-05-09 19:29:07] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:07] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:07] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:29:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:07] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:07] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:29:07] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:29:07] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:29:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2021-05-09 19:29:07] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:08] [INFO ] Added : 106 causal constraints over 22 iterations in 859 ms. Result :sat
Minimization took 149 ms.
[2021-05-09 19:29:08] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:08] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:08] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-09 19:29:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:09] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:09] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-09 19:29:09] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:09] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 3 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:10] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1726 ms
[2021-05-09 19:29:10] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:29:13] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:29:14] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:14] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:14] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 910 ms
[2021-05-09 19:29:14] [INFO ] Added : 196 causal constraints over 40 iterations in 3399 ms. Result :sat
Minimization took 729 ms.
[2021-05-09 19:29:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:15] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:15] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-09 19:29:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:15] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:15] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:29:15] [INFO ] [Nat]Added 35 Read/Feed constraints in 26 ms returned sat
[2021-05-09 19:29:15] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:29:17] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:18] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:29:19] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 2 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:29:20] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3211 ms
[2021-05-09 19:29:20] [INFO ] Added : 196 causal constraints over 40 iterations in 5329 ms. Result :sat
Minimization took 203 ms.
[2021-05-09 19:29:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:20] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:20] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:29:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:20] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:21] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-09 19:29:21] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:21] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2021-05-09 19:29:22] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1690 ms
[2021-05-09 19:29:22] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:24] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2021-05-09 19:29:24] [INFO ] Added : 153 causal constraints over 31 iterations in 1500 ms. Result :sat
Minimization took 253 ms.
[2021-05-09 19:29:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:24] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:24] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-09 19:29:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:24] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:24] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-09 19:29:24] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:29:24] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:24] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2021-05-09 19:29:25] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:27] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:28] [INFO ] Deduced a trap composed of 71 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 82 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:29] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:30] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:30] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:30] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 2901 ms
[2021-05-09 19:29:30] [INFO ] Added : 196 causal constraints over 40 iterations in 5206 ms. Result :sat
Minimization took 590 ms.
[2021-05-09 19:29:30] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:29:30] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:30] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-09 19:29:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:30] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:31] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:29:31] [INFO ] [Nat]Added 35 Read/Feed constraints in 21 ms returned sat
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 79 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:31] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:32] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:32] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:32] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:29:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1064 ms
[2021-05-09 19:29:32] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:34] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:29:34] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:29:35] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 0 ms to minimize.
[2021-05-09 19:29:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 283 ms
[2021-05-09 19:29:35] [INFO ] Added : 180 causal constraints over 36 iterations in 2896 ms. Result :sat
Minimization took 1047 ms.
[2021-05-09 19:29:36] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:36] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:36] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:29:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:36] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:36] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 19:29:36] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:29:36] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:36] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2021-05-09 19:29:36] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:38] [INFO ] Deduced a trap composed of 84 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:39] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:39] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:39] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:39] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:39] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1325 ms
[2021-05-09 19:29:39] [INFO ] Added : 170 causal constraints over 35 iterations in 2837 ms. Result :sat
Minimization took 416 ms.
[2021-05-09 19:29:39] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:39] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:39] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:29:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:39] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:40] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-09 19:29:40] [INFO ] [Nat]Added 35 Read/Feed constraints in 27 ms returned sat
[2021-05-09 19:29:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2021-05-09 19:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-09 19:29:40] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:29:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:29:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-09 19:29:41] [INFO ] Added : 146 causal constraints over 30 iterations in 1139 ms. Result :sat
Minimization took 393 ms.
[2021-05-09 19:29:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:41] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:41] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-09 19:29:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:41] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:41] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:29:41] [INFO ] [Nat]Added 35 Read/Feed constraints in 75 ms returned sat
[2021-05-09 19:29:41] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 406 ms
[2021-05-09 19:29:42] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:43] [INFO ] Added : 130 causal constraints over 27 iterations in 1176 ms. Result :sat
Minimization took 210 ms.
[2021-05-09 19:29:43] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:43] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:43] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 19:29:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:43] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:43] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-09 19:29:43] [INFO ] [Nat]Added 35 Read/Feed constraints in 50 ms returned sat
[2021-05-09 19:29:44] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:29:44] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:44] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:29:44] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 275 ms
[2021-05-09 19:29:44] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 15 ms.
[2021-05-09 19:29:47] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2021-05-09 19:29:47] [INFO ] Added : 196 causal constraints over 40 iterations in 2977 ms. Result :sat
Minimization took 456 ms.
[2021-05-09 19:29:47] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:47] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:47] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 19:29:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:29:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:29:47] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:29:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:29:47] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-09 19:29:47] [INFO ] [Nat]Added 35 Read/Feed constraints in 87 ms returned sat
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:29:48] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Deduced a trap composed of 86 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:29:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1310 ms
[2021-05-09 19:29:49] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:29:50] [INFO ] Added : 129 causal constraints over 26 iterations in 1461 ms. Result :sat
Minimization took 369 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, -1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 37400 steps, including 6287 resets, run finished after 70 ms. (steps per millisecond=534 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5884600 steps, including 934627 resets, run finished after 11205 ms. (steps per millisecond=525 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6959200 steps, including 1214078 resets, run finished after 13117 ms. (steps per millisecond=530 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 4000900 steps, including 697720 resets, run finished after 7654 ms. (steps per millisecond=522 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5777900 steps, including 965773 resets, run finished after 10965 ms. (steps per millisecond=526 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3782600 steps, including 581555 resets, run finished after 7283 ms. (steps per millisecond=519 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 7111600 steps, including 1240669 resets, run finished after 13447 ms. (steps per millisecond=528 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2408600 steps, including 420150 resets, run finished after 4539 ms. (steps per millisecond=530 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 81100 steps, including 14153 resets, run finished after 151 ms. (steps per millisecond=537 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 8535200 steps, including 1426578 resets, run finished after 16336 ms. (steps per millisecond=522 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 167600 steps, including 29309 resets, run finished after 312 ms. (steps per millisecond=537 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 6468 resets, run finished after 69 ms. (steps per millisecond=528 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 113400 steps, including 19580 resets, run finished after 208 ms. (steps per millisecond=545 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 5884600 steps, including 935264 resets, run finished after 11252 ms. (steps per millisecond=522 ) properties (out of 14) seen :0 could not realise parikh vector
Support contains 13 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 228/228 transitions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 223 /223 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:31:27] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:31:27] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:31:27] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:31:27] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:31:28] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2021-05-09 19:31:28] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:31:28] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:31:28] [INFO ] Dead Transitions using invariants and state equation in 115 ms returned []
Finished structural reductions, in 1 iterations. Remains : 223/223 places, 228/228 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:31:28] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:31:28] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:31:28] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:31:28] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:31:28] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 19:31:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:31:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:31:28] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:31:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:31:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-09 19:31:28] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:31:28] [INFO ] [Nat]Added 35 Read/Feed constraints in 51 ms returned sat
[2021-05-09 19:31:28] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:31:29] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:31:29] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:31:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:31:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 272 ms
[2021-05-09 19:31:29] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:31:32] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:31:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2021-05-09 19:31:32] [INFO ] Added : 196 causal constraints over 40 iterations in 3014 ms. Result :sat
Minimization took 461 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 5884600 steps, including 935820 resets, run finished after 10494 ms. (steps per millisecond=560 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions 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 223 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 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 2 place count 222 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 6 place count 220 transition count 225
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 16 place count 215 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 2 with 4 rules applied. Total rules applied 20 place count 213 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 213 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 208 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 208 transition count 215
Applied a total of 33 rules in 38 ms. Remains 208 /223 variables (removed 15) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:31:43] [INFO ] Computed 32 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 144103 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91504 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:31:45] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-09 19:31:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:31:45] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 19:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:31:45] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-09 19:31:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:31:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:31:45] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 19:31:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:31:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:31:46] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:31:46] [INFO ] [Nat]Added 39 Read/Feed constraints in 50 ms returned sat
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:31:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 674 ms
[2021-05-09 19:31:46] [INFO ] Computed and/alt/rep : 172/1101/172 causal constraints (skipped 42 transitions) in 13 ms.
[2021-05-09 19:31:49] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:31:49] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:31:49] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:31:49] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:31:49] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:31:50] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:31:51] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:31:52] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:31:52] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:31:52] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2603 ms
[2021-05-09 19:31:52] [INFO ] Added : 172 causal constraints over 36 iterations in 5478 ms. Result :sat
Minimization took 410 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 3716500 steps, including 620248 resets, run finished after 6635 ms. (steps per millisecond=560 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 208 /208 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:31:59] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-09 19:31:59] [INFO ] Implicit Places using invariants in 133 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
[2021-05-09 19:31:59] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:31:59] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-09 19:31:59] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 207/208 places, 215/215 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 214
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 214
Applied a total of 2 rules in 12 ms. Remains 206 /207 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:31:59] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:31:59] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:31:59] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:31:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:32:00] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 214/215 transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:32:00] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 143911 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91483 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:32:02] [INFO ] Computed 31 place invariants in 12 ms
[2021-05-09 19:32:02] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:32:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:02] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 19:32:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:32:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:03] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:03] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-09 19:32:03] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:32:03] [INFO ] [Nat]Added 39 Read/Feed constraints in 26 ms returned sat
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:32:03] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 20 ms to minimize.
[2021-05-09 19:32:04] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1687 ms
[2021-05-09 19:32:04] [INFO ] Computed and/alt/rep : 171/1096/171 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-09 19:32:06] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:32:06] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:32:06] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:32:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:32:07] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:32:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 410 ms
[2021-05-09 19:32:07] [INFO ] Added : 153 causal constraints over 31 iterations in 2319 ms. Result :sat
Minimization took 1058 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 4297500 steps, including 749892 resets, run finished after 7658 ms. (steps per millisecond=561 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:32:15] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:32:16] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:32:16] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:16] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:32:16] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2021-05-09 19:32:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:32:16] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:32:16] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 48075 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:32:16] [INFO ] Computed 32 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1488 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 893 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:32:16] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:32:16] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:16] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:16] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:32:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:32:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:16] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:16] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-09 19:32:16] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:32:16] [INFO ] [Nat]Added 35 Read/Feed constraints in 33 ms returned sat
[2021-05-09 19:32:16] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 13 ms.
[2021-05-09 19:32:18] [INFO ] Added : 123 causal constraints over 26 iterations in 1048 ms. Result :sat
Minimization took 211 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 113400 steps, including 19613 resets, run finished after 198 ms. (steps per millisecond=572 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 212 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 207 transition count 215
Applied a total of 35 rules in 23 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:32:18] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144578 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91707 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:32:21] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:32:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:32:21] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:21] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 19:32:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:32:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:32:21] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:32:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:21] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-09 19:32:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:32:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:32:21] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:32:21] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2021-05-09 19:32:21] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2021-05-09 19:32:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 134 ms
[2021-05-09 19:32:21] [INFO ] Computed and/alt/rep : 169/1098/169 causal constraints (skipped 45 transitions) in 12 ms.
[2021-05-09 19:32:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-09 19:32:22] [INFO ] Added : 107 causal constraints over 22 iterations in 1143 ms. Result :sat
Minimization took 222 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14517100 steps, including 2426511 resets, run finished after 25614 ms. (steps per millisecond=566 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:32:48] [INFO ] Computed 32 place invariants in 12 ms
[2021-05-09 19:32:48] [INFO ] Implicit Places using invariants in 132 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
[2021-05-09 19:32:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:32:48] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:48] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 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 205 transition count 214
Applied a total of 2 rules in 9 ms. Remains 205 /206 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:48] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:48] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:48] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:32:49] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 205/207 places, 214/215 transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:49] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 143892 resets, run finished after 1569 ms. (steps per millisecond=637 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91487 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:52] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:52] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-09 19:32:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:32:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:32:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:32:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:52] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-09 19:32:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:32:52] [INFO ] [Nat]Added 42 Read/Feed constraints in 54 ms returned sat
[2021-05-09 19:32:52] [INFO ] Computed and/alt/rep : 168/1093/168 causal constraints (skipped 45 transitions) in 11 ms.
[2021-05-09 19:32:54] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:32:54] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2021-05-09 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2021-05-09 19:32:54] [INFO ] Added : 159 causal constraints over 33 iterations in 1847 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 88000 steps, including 13570 resets, run finished after 155 ms. (steps per millisecond=567 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:54] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:54] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:54] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:32:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:32:55] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 795 ms to find 0 implicit places.
[2021-05-09 19:32:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:32:55] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:32:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 38847 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-03
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:32:55] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1434 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:32:55] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:32:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:32:55] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:55] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:32:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:32:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:32:55] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:32:55] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:32:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:32:55] [INFO ] [Nat]Added 35 Read/Feed constraints in 38 ms returned sat
[2021-05-09 19:32:55] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:32:55] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:32:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2021-05-09 19:32:55] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:32:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2021-05-09 19:32:57] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:32:57] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:32:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2021-05-09 19:32:57] [INFO ] Added : 113 causal constraints over 23 iterations in 1379 ms. Result :sat
Minimization took 139 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 36500 steps, including 6491 resets, run finished after 75 ms. (steps per millisecond=486 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 214 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 211 transition count 219
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 211 transition count 216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 208 transition count 216
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 208 transition count 216
Applied a total of 33 rules in 24 ms. Remains 208 /223 variables (removed 15) and now considering 216/228 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 216/228 transitions.
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:32:57] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144329 resets, run finished after 1599 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91395 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 1) seen :0
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:33:00] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:33:00] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:00] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:00] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:33:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:00] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:00] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-09 19:33:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 43 ms returned sat
[2021-05-09 19:33:00] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:33:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-09 19:33:00] [INFO ] Computed and/alt/rep : 170/1103/170 causal constraints (skipped 45 transitions) in 12 ms.
[2021-05-09 19:33:02] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:33:02] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:33:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2021-05-09 19:33:02] [INFO ] Added : 142 causal constraints over 29 iterations in 1729 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 27500 steps, including 4658 resets, run finished after 48 ms. (steps per millisecond=572 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 216/216 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 208 /208 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:33:02] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:33:02] [INFO ] Implicit Places using invariants in 129 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
[2021-05-09 19:33:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 216 rows 207 cols
[2021-05-09 19:33:02] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:02] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Starting structural reductions, iteration 1 : 207/208 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 207 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 206 transition count 215
Applied a total of 2 rules in 8 ms. Remains 206 /207 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:02] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:02] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:02] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:03] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 215/216 transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:03] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144208 resets, run finished after 1591 ms. (steps per millisecond=628 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91409 resets, run finished after 1073 ms. (steps per millisecond=931 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:06] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:06] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:33:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2021-05-09 19:33:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:06] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-09 19:33:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2021-05-09 19:33:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:33:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-09 19:33:06] [INFO ] Computed and/alt/rep : 169/1098/169 causal constraints (skipped 45 transitions) in 11 ms.
[2021-05-09 19:33:07] [INFO ] Added : 113 causal constraints over 23 iterations in 826 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 5024600 steps, including 839735 resets, run finished after 8923 ms. (steps per millisecond=563 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:16] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:16] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:16] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:17] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2021-05-09 19:33:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:17] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:17] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-03 in 21743 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:33:17] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1478 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 921 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:33:17] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:33:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:17] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:17] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 19:33:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:33:17] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:17] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:33:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:33:17] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2021-05-09 19:33:17] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-09 19:33:17] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:33:18] [INFO ] Added : 106 causal constraints over 22 iterations in 886 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 167600 steps, including 29217 resets, run finished after 288 ms. (steps per millisecond=581 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 221 transition count 225
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 6 place count 220 transition count 225
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 212 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 207 transition count 215
Applied a total of 35 rules in 18 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:33:18] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144438 resets, run finished after 1574 ms. (steps per millisecond=635 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91449 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:33:21] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:33:21] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:21] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:21] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 19:33:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:21] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:21] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-09 19:33:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:21] [INFO ] [Nat]Added 42 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:33:21] [INFO ] Computed and/alt/rep : 168/1086/168 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:33:23] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2021-05-09 19:33:23] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Deduced a trap composed of 31 places in 15 ms of which 1 ms to minimize.
[2021-05-09 19:33:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 400 ms
[2021-05-09 19:33:24] [INFO ] Added : 168 causal constraints over 34 iterations in 2402 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 9030500 steps, including 1389568 resets, run finished after 16138 ms. (steps per millisecond=559 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:33:40] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:33:40] [INFO ] Implicit Places using invariants in 128 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
[2021-05-09 19:33:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:33:40] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:41] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 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 205 transition count 214
Applied a total of 2 rules in 8 ms. Remains 205 /206 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:41] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:41] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:41] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:33:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:41] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 205/207 places, 214/215 transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:41] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 143935 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91533 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:44] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:44] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:33:44] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:44] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-09 19:33:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:44] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:44] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-09 19:33:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:44] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2021-05-09 19:33:44] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-09 19:33:44] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 12 ms.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2021-05-09 19:33:46] [INFO ] Deduced a trap composed of 71 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2021-05-09 19:33:47] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 737 ms
[2021-05-09 19:33:47] [INFO ] Added : 157 causal constraints over 33 iterations in 2372 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 218000 steps, including 38096 resets, run finished after 377 ms. (steps per millisecond=578 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:47] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:47] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:47] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:48] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2021-05-09 19:33:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:33:48] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:33:48] [INFO ] Dead Transitions using invariants and state equation in 114 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 31388 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-05
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:33:48] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 909 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:33:48] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:33:48] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:33:48] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:48] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 19:33:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:33:48] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:48] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 19:33:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:33:48] [INFO ] [Nat]Added 35 Read/Feed constraints in 14 ms returned sat
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:49] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:50] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1738 ms
[2021-05-09 19:33:50] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:33:53] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 221 transition count 225
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 6 place count 220 transition count 225
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 16 place count 215 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 2 with 4 rules applied. Total rules applied 20 place count 213 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 213 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 208 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 208 transition count 215
Applied a total of 33 rules in 20 ms. Remains 208 /223 variables (removed 15) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:33:53] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144133 resets, run finished after 1579 ms. (steps per millisecond=633 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91350 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:33:56] [INFO ] Computed 32 place invariants in 11 ms
[2021-05-09 19:33:56] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:56] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:56] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:33:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:33:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:33:56] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:33:56] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-09 19:33:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:33:56] [INFO ] [Nat]Added 42 Read/Feed constraints in 39 ms returned sat
[2021-05-09 19:33:56] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:33:56] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:33:56] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:33:57] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:33:57] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:33:57] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2021-05-09 19:33:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:33:57] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 373 ms
[2021-05-09 19:33:57] [INFO ] Computed and/alt/rep : 170/1090/170 causal constraints (skipped 44 transitions) in 10 ms.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:33:58] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:33:59] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2021-05-09 19:34:00] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2335 ms
[2021-05-09 19:34:00] [INFO ] Added : 155 causal constraints over 32 iterations in 3470 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 526600 steps, including 91975 resets, run finished after 912 ms. (steps per millisecond=577 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:34:01] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:34:01] [INFO ] Implicit Places using invariants in 129 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
[2021-05-09 19:34:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:34:01] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:02] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 207/208 places, 215/215 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 214
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 214
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:02] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:34:02] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:02] [INFO ] Computed 31 place invariants in 24 ms
[2021-05-09 19:34:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:02] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 214/215 transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:02] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144138 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91410 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:05] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:05] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:05] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-09 19:34:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:34:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:05] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-09 19:34:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 13 ms returned sat
[2021-05-09 19:34:05] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:05] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:05] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:06] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 62 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 67 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:34:07] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 2097 ms
[2021-05-09 19:34:07] [INFO ] Computed and/alt/rep : 169/1085/169 causal constraints (skipped 44 transitions) in 11 ms.
[2021-05-09 19:34:09] [INFO ] Added : 162 causal constraints over 33 iterations in 1863 ms. Result :sat
Minimization took 742 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2377300 steps, including 396997 resets, run finished after 4197 ms. (steps per millisecond=566 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:14] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:14] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:14] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:34:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:15] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2021-05-09 19:34:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:15] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:15] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-05 in 27036 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:34:15] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1459 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:34:15] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:34:15] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:15] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:15] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-09 19:34:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:15] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:34:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:15] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 19:34:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:34:15] [INFO ] [Nat]Added 35 Read/Feed constraints in 25 ms returned sat
[2021-05-09 19:34:16] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:18] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:19] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 79 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:34:20] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 221 transition count 225
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 6 place count 220 transition count 225
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 214 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 211 transition count 219
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 211 transition count 214
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 206 transition count 214
Applied a total of 37 rules in 18 ms. Remains 206 /223 variables (removed 17) and now considering 214/228 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/223 places, 214/228 transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:20] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144385 resets, run finished after 1559 ms. (steps per millisecond=641 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91583 resets, run finished after 1066 ms. (steps per millisecond=938 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:23] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:34:23] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:23] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:23] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:34:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:23] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:23] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:34:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:23] [INFO ] [Nat]Added 42 Read/Feed constraints in 88 ms returned sat
[2021-05-09 19:34:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2021-05-09 19:34:23] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2021-05-09 19:34:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2021-05-09 19:34:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 147 ms
[2021-05-09 19:34:24] [INFO ] Computed and/alt/rep : 167/1090/167 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 28 places in 18 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Deduced a trap composed of 27 places in 16 ms of which 0 ms to minimize.
[2021-05-09 19:34:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 380 ms
[2021-05-09 19:34:25] [INFO ] Added : 156 causal constraints over 32 iterations in 1874 ms. Result :sat
Minimization took 398 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 220900 steps, including 36980 resets, run finished after 384 ms. (steps per millisecond=575 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:34:26] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:34:26] [INFO ] Implicit Places using invariants in 130 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
[2021-05-09 19:34:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:34:26] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:34:26] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 205/206 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 205 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 204 transition count 213
Applied a total of 2 rules in 7 ms. Remains 204 /205 variables (removed 1) and now considering 213/214 (removed 1) transitions.
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:26] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:27] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:27] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:27] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 204/206 places, 213/214 transitions.
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:27] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144205 resets, run finished after 1572 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91526 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:30] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:30] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:30] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-09 19:34:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:30] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:34:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:30] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:30] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:31] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:32] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 77 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:33] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 3129 ms
[2021-05-09 19:34:33] [INFO ] Computed and/alt/rep : 166/1085/166 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:36] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:37] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 68 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 85 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:38] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 2714 ms
[2021-05-09 19:34:38] [INFO ] Added : 148 causal constraints over 31 iterations in 5038 ms. Result :sat
Minimization took 1055 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2669500 steps, including 411023 resets, run finished after 4755 ms. (steps per millisecond=561 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:44] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:44] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:44] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:34:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:34:45] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2021-05-09 19:34:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 213 rows 204 cols
[2021-05-09 19:34:45] [INFO ] Computed 31 place invariants in 12 ms
[2021-05-09 19:34:45] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 29790 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:34:45] [INFO ] Computed 32 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1442 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 936 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:34:45] [INFO ] Computed 32 place invariants in 18 ms
[2021-05-09 19:34:45] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:45] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:45] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-09 19:34:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:34:45] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:45] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-09 19:34:45] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:34:45] [INFO ] [Nat]Added 35 Read/Feed constraints in 15 ms returned sat
[2021-05-09 19:34:45] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:34:45] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:34:46] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 57 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2021-05-09 19:34:47] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1715 ms
[2021-05-09 19:34:47] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:34:48] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2021-05-09 19:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-09 19:34:49] [INFO ] Added : 153 causal constraints over 31 iterations in 1514 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2408600 steps, including 420172 resets, run finished after 4254 ms. (steps per millisecond=566 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions 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 223 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 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 2 place count 222 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 6 place count 220 transition count 225
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 212 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 207 transition count 215
Applied a total of 35 rules in 20 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:34:53] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144334 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91508 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:34:56] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:34:56] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:56] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:56] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-09 19:34:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:34:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:34:56] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:34:56] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2021-05-09 19:34:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:34:56] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:34:56] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:34:57] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:34:57] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:34:57] [INFO ] Deduced a trap composed of 49 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:34:57] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:34:57] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 754 ms
[2021-05-09 19:34:57] [INFO ] Computed and/alt/rep : 168/1087/168 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:34:59] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:34:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2021-05-09 19:34:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2021-05-09 19:34:59] [INFO ] Added : 167 causal constraints over 34 iterations in 1969 ms. Result :sat
Minimization took 732 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14727600 steps, including 2569503 resets, run finished after 26471 ms. (steps per millisecond=556 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:35:26] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:35:26] [INFO ] Implicit Places using invariants in 128 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
[2021-05-09 19:35:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:35:26] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:26] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 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 205 transition count 214
Applied a total of 2 rules in 7 ms. Remains 205 /206 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:26] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:26] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:26] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:26] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:35:27] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 730 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 205/207 places, 214/215 transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:27] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144098 resets, run finished after 1568 ms. (steps per millisecond=637 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91435 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:30] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:30] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:35:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:35:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:35:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:35:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:30] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-09 19:35:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:35:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 682 ms
[2021-05-09 19:35:30] [INFO ] Computed and/alt/rep : 167/1082/167 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:32] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:33] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1806 ms
[2021-05-09 19:35:33] [INFO ] Added : 155 causal constraints over 32 iterations in 2979 ms. Result :sat
Minimization took 341 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 2872800 steps, including 501237 resets, run finished after 5093 ms. (steps per millisecond=564 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:39] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:39] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:39] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:35:40] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2021-05-09 19:35:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:35:40] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:35:40] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 54772 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-09
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:35:40] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 904 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:35:40] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:35:40] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:35:40] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:40] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-09 19:35:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:35:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:35:40] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:40] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-09 19:35:40] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:35:40] [INFO ] [Nat]Added 35 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:35:40] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:35:40] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:35:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2021-05-09 19:35:40] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:43] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:44] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:45] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:35:45] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 212 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 208 transition count 216
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 208 transition count 216
Applied a total of 32 rules in 19 ms. Remains 208 /223 variables (removed 15) and now considering 216/228 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 216/228 transitions.
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:35:45] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144528 resets, run finished after 1587 ms. (steps per millisecond=630 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91279 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 1) seen :0
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:35:48] [INFO ] Computed 32 place invariants in 12 ms
[2021-05-09 19:35:48] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:35:48] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:48] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-09 19:35:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:35:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-09 19:35:48] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:35:48] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2021-05-09 19:35:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:35:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:35:48] [INFO ] Deduced a trap composed of 29 places in 14 ms of which 0 ms to minimize.
[2021-05-09 19:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-09 19:35:48] [INFO ] Computed and/alt/rep : 171/1100/171 causal constraints (skipped 44 transitions) in 11 ms.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 67 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 59 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:50] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:35:51] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:35:52] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 2736 ms
[2021-05-09 19:35:52] [INFO ] Added : 166 causal constraints over 34 iterations in 4506 ms. Result :sat
Minimization took 620 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 11635500 steps, including 1945550 resets, run finished after 20638 ms. (steps per millisecond=563 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 208/208 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/208 places, 216/216 transitions.
Starting structural reductions, iteration 0 : 208/208 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 208 cols
[2021-05-09 19:36:14] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:36:14] [INFO ] Implicit Places using invariants in 132 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
[2021-05-09 19:36:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 216 rows 207 cols
[2021-05-09 19:36:14] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:14] [INFO ] Dead Transitions using invariants and state equation in 109 ms returned []
Starting structural reductions, iteration 1 : 207/208 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 207 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 206 transition count 215
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:14] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:14] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:14] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:36:15] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 215/216 transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:15] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144208 resets, run finished after 1570 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91797 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:17] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:17] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:36:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:17] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 19:36:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:36:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:36:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:17] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-09 19:36:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:36:17] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2021-05-09 19:36:18] [INFO ] Deduced a trap composed of 29 places in 15 ms of which 1 ms to minimize.
[2021-05-09 19:36:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2021-05-09 19:36:18] [INFO ] Computed and/alt/rep : 170/1095/170 causal constraints (skipped 44 transitions) in 11 ms.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:19] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 77 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:36:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1256 ms
[2021-05-09 19:36:20] [INFO ] Added : 155 causal constraints over 31 iterations in 2559 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6963400 steps, including 1213944 resets, run finished after 12248 ms. (steps per millisecond=568 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:33] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:36:33] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:33] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:36:33] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2021-05-09 19:36:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:33] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:36:34] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-09 in 53775 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:36:34] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:36:34] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:36:34] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:36:34] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:34] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-09 19:36:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:36:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:36:34] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:34] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-09 19:36:34] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:36:34] [INFO ] [Nat]Added 35 Read/Feed constraints in 20 ms returned sat
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:34] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 79 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:36:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1088 ms
[2021-05-09 19:36:35] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:36:38] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:36:38] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:36:38] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2021-05-09 19:36:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 288 ms
[2021-05-09 19:36:38] [INFO ] Added : 180 causal constraints over 36 iterations in 2926 ms. Result :sat
Minimization took 853 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 212 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 207 transition count 215
Applied a total of 34 rules in 18 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:36:39] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144160 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91200 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:36:41] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:36:41] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2021-05-09 19:36:41] [INFO ] [Real]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-09 19:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:42] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-09 19:36:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:36:42] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-09 19:36:42] [INFO ] [Nat]Absence check using 12 positive and 20 generalized place invariants in 3 ms returned sat
[2021-05-09 19:36:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:42] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:36:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:36:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 23 ms returned sat
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 16 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:42] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 71 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 76 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:43] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:44] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:45] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 79 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 79 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:46] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 76 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 83 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:47] [INFO ] Trap strengthening (SAT) tested/added 93/92 trap constraints in 5435 ms
[2021-05-09 19:36:47] [INFO ] Computed and/alt/rep : 169/1086/169 causal constraints (skipped 45 transitions) in 12 ms.
[2021-05-09 19:36:51] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:36:51] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:36:51] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:36:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 269 ms
[2021-05-09 19:36:51] [INFO ] Added : 151 causal constraints over 31 iterations in 4110 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 43500 steps, including 7611 resets, run finished after 73 ms. (steps per millisecond=595 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:36:52] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:36:52] [INFO ] Implicit Places using invariants in 127 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
[2021-05-09 19:36:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:36:52] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-09 19:36:52] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 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 205 transition count 214
Applied a total of 2 rules in 7 ms. Remains 205 /206 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:36:52] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:36:52] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:36:52] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-09 19:36:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:36:52] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 205/207 places, 214/215 transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:36:52] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 144437 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91554 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:36:55] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:36:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 19:36:55] [INFO ] [Real]Absence check using 5 positive and 26 generalized place invariants in 4 ms returned sat
[2021-05-09 19:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:55] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-09 19:36:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-09 19:36:55] [INFO ] [Nat]Absence check using 5 positive and 26 generalized place invariants in 4 ms returned sat
[2021-05-09 19:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:36:55] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-09 19:36:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:36:55] [INFO ] [Nat]Added 42 Read/Feed constraints in 23 ms returned sat
[2021-05-09 19:36:55] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:55] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:55] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 64 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:36:56] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 72 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 78 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:36:57] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:36:58] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:36:58] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:36:58] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:36:58] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 2319 ms
[2021-05-09 19:36:58] [INFO ] Computed and/alt/rep : 168/1081/168 causal constraints (skipped 45 transitions) in 12 ms.
[2021-05-09 19:36:59] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:36:59] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:36:59] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:36:59] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 862 ms
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:37:00] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 69 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 73 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:37:01] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:37:02] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:02] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:02] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1598 ms
[2021-05-09 19:37:02] [INFO ] Added : 133 causal constraints over 29 iterations in 4043 ms. Result :sat
Minimization took 602 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 33400 steps, including 5595 resets, run finished after 57 ms. (steps per millisecond=585 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:37:02] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-09 19:37:02] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:37:02] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:37:03] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2021-05-09 19:37:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:37:03] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:03] [INFO ] Dead Transitions using invariants and state equation in 107 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 29614 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:37:03] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 942 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:37:03] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:37:03] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:03] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:03] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-09 19:37:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:37:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 19:37:03] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:03] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-09 19:37:03] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:37:03] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:37:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:37:04] [INFO ] Deduced a trap composed of 74 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2021-05-09 19:37:04] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:37:05] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:37:05] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:37:05] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:05] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:37:05] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:37:06] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1351 ms
[2021-05-09 19:37:06] [INFO ] Added : 170 causal constraints over 35 iterations in 2867 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 5777900 steps, including 965261 resets, run finished after 10255 ms. (steps per millisecond=563 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 16 place count 215 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 2 with 4 rules applied. Total rules applied 20 place count 213 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 213 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 208 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 208 transition count 215
Applied a total of 33 rules in 22 ms. Remains 208 /223 variables (removed 15) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:37:17] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144147 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91728 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:37:20] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:37:20] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:37:20] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:20] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 19:37:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:37:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:37:20] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:20] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-09 19:37:20] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:37:20] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:20] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:37:21] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 477 ms
[2021-05-09 19:37:21] [INFO ] Computed and/alt/rep : 171/1088/171 causal constraints (skipped 43 transitions) in 12 ms.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:37:22] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:37:23] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 28 places in 17 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2021-05-09 19:37:24] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 2635 ms
[2021-05-09 19:37:25] [INFO ] Added : 142 causal constraints over 29 iterations in 4017 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 3184600 steps, including 532184 resets, run finished after 5566 ms. (steps per millisecond=572 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:37:31] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:37:31] [INFO ] Implicit Places using invariants in 138 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
[2021-05-09 19:37:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:37:31] [INFO ] Computed 31 place invariants in 13 ms
[2021-05-09 19:37:31] [INFO ] Dead Transitions using invariants and state equation in 111 ms returned []
Starting structural reductions, iteration 1 : 207/208 places, 215/215 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 214
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 214
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:31] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:31] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:31] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:37:32] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 214/215 transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:32] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144047 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91327 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:34] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:34] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:34] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-09 19:37:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:37:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:34] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2021-05-09 19:37:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:37:34] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2021-05-09 19:37:34] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:37:35] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:37:35] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:37:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2021-05-09 19:37:35] [INFO ] Computed and/alt/rep : 170/1083/170 causal constraints (skipped 43 transitions) in 11 ms.
[2021-05-09 19:37:36] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:37:36] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2021-05-09 19:37:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2021-05-09 19:37:36] [INFO ] Added : 148 causal constraints over 31 iterations in 1329 ms. Result :sat
Minimization took 596 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4870300 steps, including 849587 resets, run finished after 8584 ms. (steps per millisecond=567 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:45] [INFO ] Computed 31 place invariants in 12 ms
[2021-05-09 19:37:45] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:45] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-09 19:37:46] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2021-05-09 19:37:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:37:46] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:37:46] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 42845 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:37:46] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1463 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:37:46] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:37:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:46] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:46] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-09 19:37:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:37:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:46] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:46] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-09 19:37:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:37:46] [INFO ] [Nat]Added 35 Read/Feed constraints in 27 ms returned sat
[2021-05-09 19:37:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:37:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-09 19:37:46] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 11 ms.
[2021-05-09 19:37:47] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2021-05-09 19:37:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-09 19:37:48] [INFO ] Added : 146 causal constraints over 30 iterations in 1139 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4000900 steps, including 697980 resets, run finished after 7163 ms. (steps per millisecond=558 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 16 place count 215 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 212 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 212 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 207 transition count 215
Applied a total of 35 rules in 15 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:37:55] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144423 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91554 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:37:58] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:37:58] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:37:58] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:58] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 19:37:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:37:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2021-05-09 19:37:58] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:37:58] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2021-05-09 19:37:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:37:58] [INFO ] [Nat]Added 41 Read/Feed constraints in 17 ms returned sat
[2021-05-09 19:37:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2021-05-09 19:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-09 19:37:58] [INFO ] Computed and/alt/rep : 168/1090/168 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:38:00] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:38:00] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:38:00] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:00] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:38:00] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 397 ms
[2021-05-09 19:38:00] [INFO ] Added : 148 causal constraints over 31 iterations in 1810 ms. Result :sat
Minimization took 417 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 11514900 steps, including 1773892 resets, run finished after 20396 ms. (steps per millisecond=564 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:38:21] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:38:21] [INFO ] Implicit Places using invariants in 126 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
[2021-05-09 19:38:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:38:21] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:38:21] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 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 205 transition count 214
Applied a total of 2 rules in 6 ms. Remains 205 /206 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:21] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:38:21] [INFO ] Implicit Places using invariants in 126 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:21] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:38:21] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:38:22] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 205/207 places, 214/215 transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:22] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144064 resets, run finished after 1564 ms. (steps per millisecond=639 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91507 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:24] [INFO ] Computed 31 place invariants in 11 ms
[2021-05-09 19:38:24] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:38:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:24] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 19:38:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:38:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:38:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:25] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-09 19:38:25] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:38:25] [INFO ] [Nat]Added 41 Read/Feed constraints in 12 ms returned sat
[2021-05-09 19:38:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2021-05-09 19:38:25] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2021-05-09 19:38:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-09 19:38:25] [INFO ] Computed and/alt/rep : 167/1085/167 causal constraints (skipped 46 transitions) in 12 ms.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:26] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 55 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:27] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 71 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:28] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 72 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 80 places in 51 ms of which 1 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:38:29] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:30] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:30] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:30] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 3809 ms
[2021-05-09 19:38:30] [INFO ] Added : 143 causal constraints over 29 iterations in 5013 ms. Result :sat
Minimization took 341 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 147200 steps, including 25682 resets, run finished after 251 ms. (steps per millisecond=586 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:30] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:38:30] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:30] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:38:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2021-05-09 19:38:31] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2021-05-09 19:38:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 205 cols
[2021-05-09 19:38:31] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:38:31] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 45090 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:38:31] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:38:31] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:38:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:38:31] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 19:38:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:38:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:38:31] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:31] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-09 19:38:31] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:38:31] [INFO ] [Nat]Added 35 Read/Feed constraints in 76 ms returned sat
[2021-05-09 19:38:31] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 0 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2021-05-09 19:38:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 410 ms
[2021-05-09 19:38:32] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:38:33] [INFO ] Added : 130 causal constraints over 27 iterations in 1188 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6959200 steps, including 1214009 resets, run finished after 12274 ms. (steps per millisecond=566 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 214 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 211 transition count 219
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 211 transition count 215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 207 transition count 215
Applied a total of 34 rules in 15 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:38:45] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144293 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91341 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:38:48] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:38:48] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:38:48] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:48] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 19:38:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:38:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:38:48] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:38:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:38:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:38:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:38:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 39 ms returned sat
[2021-05-09 19:38:48] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:48] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 74 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 79 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 77 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 81 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:49] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 77 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 81 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 85 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 85 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 81 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 78 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:50] [INFO ] Deduced a trap composed of 88 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 92 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 90 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 93 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 78 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 76 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:51] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 80 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 83 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 68 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 89 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 88 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 84 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 80 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:52] [INFO ] Deduced a trap composed of 79 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 84 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 83 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 79 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 85 places in 45 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 78 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 87 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 83 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 81 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 86 places in 46 ms of which 1 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 87 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 88 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:53] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 91 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 86 places in 45 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 74 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 75 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 80 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 77 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 83 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 78 places in 46 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 83 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Deduced a trap composed of 82 places in 44 ms of which 1 ms to minimize.
[2021-05-09 19:38:54] [INFO ] Trap strengthening (SAT) tested/added 106/105 trap constraints in 6101 ms
[2021-05-09 19:38:54] [INFO ] Computed and/alt/rep : 169/1095/169 causal constraints (skipped 45 transitions) in 10 ms.
[2021-05-09 19:38:55] [INFO ] Added : 40 causal constraints over 8 iterations in 658 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 4473400 steps, including 780521 resets, run finished after 7897 ms. (steps per millisecond=566 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:39:03] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:39:03] [INFO ] Implicit Places using invariants in 147 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
[2021-05-09 19:39:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:03] [INFO ] Computed 31 place invariants in 11 ms
[2021-05-09 19:39:04] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Starting structural reductions, iteration 1 : 206/207 places, 215/215 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 206 transition count 215
Applied a total of 1 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:04] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:04] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:04] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:39:04] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/207 places, 215/215 transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:04] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144717 resets, run finished after 1560 ms. (steps per millisecond=641 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91240 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:07] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:07] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-09 19:39:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:39:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-09 19:39:07] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:39:07] [INFO ] [Nat]Added 42 Read/Feed constraints in 39 ms returned sat
[2021-05-09 19:39:07] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:07] [INFO ] Deduced a trap composed of 70 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:39:07] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2021-05-09 19:39:07] [INFO ] Computed and/alt/rep : 168/1087/168 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:39:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 861 ms
[2021-05-09 19:39:09] [INFO ] Added : 134 causal constraints over 27 iterations in 2069 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 91100 steps, including 15813 resets, run finished after 159 ms. (steps per millisecond=572 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:10] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:10] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:10] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:39:11] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2021-05-09 19:39:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 206 cols
[2021-05-09 19:39:11] [INFO ] Computed 31 place invariants in 10 ms
[2021-05-09 19:39:11] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 39770 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-14
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:39:11] [INFO ] Computed 32 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1454 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 924 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:39:11] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:39:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:11] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:11] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 19:39:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:39:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:11] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:39:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:11] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-09 19:39:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:39:11] [INFO ] [Nat]Added 35 Read/Feed constraints in 51 ms returned sat
[2021-05-09 19:39:11] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2021-05-09 19:39:11] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:39:11] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:39:11] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:39:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2021-05-09 19:39:11] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 15 ms.
[2021-05-09 19:39:14] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:39:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2021-05-09 19:39:14] [INFO ] Added : 196 causal constraints over 40 iterations in 3004 ms. Result :sat
Minimization took 463 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 5884600 steps, including 935337 resets, run finished after 10491 ms. (steps per millisecond=560 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions 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 223 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 222 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 2 place count 222 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 6 place count 220 transition count 225
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 16 place count 215 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 2 with 4 rules applied. Total rules applied 20 place count 213 transition count 220
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 213 transition count 215
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 30 place count 208 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 208 transition count 215
Applied a total of 33 rules in 17 ms. Remains 208 /223 variables (removed 15) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 208/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:39:25] [INFO ] Computed 32 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 144324 resets, run finished after 1566 ms. (steps per millisecond=638 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91346 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:39:28] [INFO ] Computed 32 place invariants in 8 ms
[2021-05-09 19:39:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:39:28] [INFO ] [Real]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 19:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:39:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:39:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-09 19:39:28] [INFO ] [Nat]Absence check using 3 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-09 19:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:28] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-09 19:39:28] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:39:28] [INFO ] [Nat]Added 39 Read/Feed constraints in 50 ms returned sat
[2021-05-09 19:39:28] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:39:28] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 0 ms to minimize.
[2021-05-09 19:39:28] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 0 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 0 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:39:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 660 ms
[2021-05-09 19:39:29] [INFO ] Computed and/alt/rep : 172/1101/172 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 70 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 61 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 0 ms to minimize.
[2021-05-09 19:39:33] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 65 places in 47 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 68 places in 50 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:39:34] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2526 ms
[2021-05-09 19:39:34] [INFO ] Added : 172 causal constraints over 36 iterations in 5366 ms. Result :sat
Minimization took 412 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 3716500 steps, including 621003 resets, run finished after 6552 ms. (steps per millisecond=567 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 208/208 places, 215/215 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 215 rows 208 cols
[2021-05-09 19:39:41] [INFO ] Computed 32 place invariants in 7 ms
[2021-05-09 19:39:41] [INFO ] Implicit Places using invariants in 126 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
[2021-05-09 19:39:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:39:41] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-09 19:39:41] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 207/208 places, 215/215 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 214
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 214
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:42] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:39:42] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:42] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:39:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:39:42] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 206/208 places, 214/215 transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:42] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144326 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91471 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 1) seen :0
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:45] [INFO ] Computed 31 place invariants in 8 ms
[2021-05-09 19:39:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2021-05-09 19:39:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2021-05-09 19:39:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 19:39:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:39:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-09 19:39:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:45] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2021-05-09 19:39:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:39:45] [INFO ] [Nat]Added 39 Read/Feed constraints in 26 ms returned sat
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:45] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:39:46] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:47] [INFO ] Deduced a trap composed of 66 places in 52 ms of which 1 ms to minimize.
[2021-05-09 19:39:47] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:39:47] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:47] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1608 ms
[2021-05-09 19:39:47] [INFO ] Computed and/alt/rep : 171/1096/171 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-09 19:39:49] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2021-05-09 19:39:49] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:39:49] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:39:49] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2021-05-09 19:39:49] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2021-05-09 19:39:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 433 ms
[2021-05-09 19:39:49] [INFO ] Added : 153 causal constraints over 31 iterations in 2345 ms. Result :sat
Minimization took 1058 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 4297500 steps, including 749463 resets, run finished after 7675 ms. (steps per millisecond=559 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:58] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:39:58] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:58] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:39:58] [INFO ] State equation strengthened by 39 read => feed constraints.
[2021-05-09 19:39:58] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2021-05-09 19:39:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 214 rows 206 cols
[2021-05-09 19:39:58] [INFO ] Computed 31 place invariants in 9 ms
[2021-05-09 19:39:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-14 in 47729 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:39:59] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1447 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 228 rows 223 cols
[2021-05-09 19:39:59] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:39:59] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:59] [INFO ] [Real]Absence check using 10 positive and 22 generalized place invariants in 4 ms returned sat
[2021-05-09 19:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:59] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-09 19:39:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:39:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-09 19:39:59] [INFO ] [Nat]Absence check using 10 positive and 22 generalized place invariants in 3 ms returned sat
[2021-05-09 19:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:39:59] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-09 19:39:59] [INFO ] State equation strengthened by 35 read => feed constraints.
[2021-05-09 19:39:59] [INFO ] [Nat]Added 35 Read/Feed constraints in 87 ms returned sat
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:39:59] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 1 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 89 places in 54 ms of which 1 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 87 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 77 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 0 ms to minimize.
[2021-05-09 19:40:00] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1265 ms
[2021-05-09 19:40:00] [INFO ] Computed and/alt/rep : 196/1111/196 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-09 19:40:02] [INFO ] Added : 129 causal constraints over 26 iterations in 1494 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 37400 steps, including 6245 resets, run finished after 65 ms. (steps per millisecond=575 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 223/223 places, 228/228 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 223 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 221 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 4 place count 221 transition count 224
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 219 transition count 224
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 214 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 211 transition count 219
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 211 transition count 215
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 32 place count 207 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 207 transition count 215
Applied a total of 35 rules in 20 ms. Remains 207 /223 variables (removed 16) and now considering 215/228 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/223 places, 215/228 transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:40:02] [INFO ] Computed 32 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144151 resets, run finished after 1578 ms. (steps per millisecond=633 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91158 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 1) seen :0
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:40:05] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:40:05] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-09 19:40:05] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 19:40:05] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2021-05-09 19:40:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 19:40:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-09 19:40:05] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 2 ms returned sat
[2021-05-09 19:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 19:40:05] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 19:40:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:40:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 57 ms returned sat
[2021-05-09 19:40:05] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2021-05-09 19:40:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-09 19:40:05] [INFO ] Computed and/alt/rep : 168/1076/168 causal constraints (skipped 46 transitions) in 11 ms.
[2021-05-09 19:40:06] [INFO ] Added : 51 causal constraints over 11 iterations in 458 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 12000 steps, including 2095 resets, run finished after 21 ms. (steps per millisecond=571 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Starting structural reductions, iteration 0 : 207/207 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 215/215 (removed 0) transitions.
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:40:06] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:40:06] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:40:06] [INFO ] Computed 32 place invariants in 9 ms
[2021-05-09 19:40:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2021-05-09 19:40:06] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2021-05-09 19:40:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 215 rows 207 cols
[2021-05-09 19:40:06] [INFO ] Computed 32 place invariants in 10 ms
[2021-05-09 19:40:07] [INFO ] Dead Transitions using invariants and state equation in 113 ms returned []
Finished structural reductions, in 1 iterations. Remains : 207/207 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 8002 ms.
[2021-05-09 19:40:07] [INFO ] Flatten gal took : 62 ms
[2021-05-09 19:40:07] [INFO ] Applying decomposition
[2021-05-09 19:40:07] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16609311067742018909.txt, -o, /tmp/graph16609311067742018909.bin, -w, /tmp/graph16609311067742018909.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16609311067742018909.bin, -l, -1, -v, -w, /tmp/graph16609311067742018909.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 19:40:07] [INFO ] Decomposing Gal with order
[2021-05-09 19:40:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 19:40:07] [INFO ] Removed a total of 103 redundant transitions.
[2021-05-09 19:40:07] [INFO ] Flatten gal took : 61 ms
[2021-05-09 19:40:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 10 ms.
[2021-05-09 19:40:07] [INFO ] Time to serialize gal into /tmp/UpperBounds11771003891131582047.gal : 8 ms
[2021-05-09 19:40:07] [INFO ] Time to serialize properties into /tmp/UpperBounds2940705851908181895.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11771003891131582047.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2940705851908181895.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11771003891131582047.gal -t CGAL -reachable-file /tmp/UpperBounds2940705851908181895.prop --nowitness
Loading property file /tmp/UpperBounds2940705851908181895.prop.
Detected timeout of ITS tools.
[2021-05-09 20:05:01] [INFO ] Flatten gal took : 21 ms
[2021-05-09 20:05:01] [INFO ] Time to serialize gal into /tmp/UpperBounds11362652586468895608.gal : 3 ms
[2021-05-09 20:05:01] [INFO ] Time to serialize properties into /tmp/UpperBounds3660875023151031330.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11362652586468895608.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3660875023151031330.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11362652586468895608.gal -t CGAL -reachable-file /tmp/UpperBounds3660875023151031330.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds3660875023151031330.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DoubleExponent-PT-010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875400427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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