Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.5K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 340K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652718917817

Running Version 0
[2022-05-16 16:35:19] [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]
[2022-05-16 16:35:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:35:19] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-16 16:35:19] [INFO ] Transformed 1064 places.
[2022-05-16 16:35:19] [INFO ] Transformed 998 transitions.
[2022-05-16 16:35:19] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 129 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 65 ms.
// Phase 1: matrix 998 rows 1064 cols
[2022-05-16 16:35:19] [INFO ] Invariants computation overflowed in 140 ms
Incomplete random walk after 10000 steps, including 332 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 275 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 273 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2022-05-16 16:35:20] [INFO ] Invariants computation overflowed in 109 ms
[2022-05-16 16:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:20] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2022-05-16 16:35:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:21] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2022-05-16 16:35:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-16 16:35:25] [INFO ] Added : 20 causal constraints over 4 iterations in 3990 ms. Result :sat
Minimization took 385 ms.
[2022-05-16 16:35:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:26] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-05-16 16:35:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:26] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 385 places in 362 ms of which 4 ms to minimize.
[2022-05-16 16:35:27] [INFO ] Deduced a trap composed of 53 places in 333 ms of which 2 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 1 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 392 places in 321 ms of which 1 ms to minimize.
[2022-05-16 16:35:28] [INFO ] Deduced a trap composed of 373 places in 341 ms of which 1 ms to minimize.
[2022-05-16 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2298 ms
[2022-05-16 16:35:29] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-16 16:35:31] [INFO ] Added : 20 causal constraints over 4 iterations in 2317 ms. Result :unknown
[2022-05-16 16:35:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:32] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2022-05-16 16:35:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:33] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2022-05-16 16:35:33] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 219 places in 165 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 1 ms to minimize.
[2022-05-16 16:35:34] [INFO ] Deduced a trap composed of 163 places in 168 ms of which 0 ms to minimize.
[2022-05-16 16:35:35] [INFO ] Deduced a trap composed of 149 places in 168 ms of which 0 ms to minimize.
[2022-05-16 16:35:35] [INFO ] Deduced a trap composed of 173 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:35:35] [INFO ] Deduced a trap composed of 187 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:35:35] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 0 ms to minimize.
[2022-05-16 16:35:35] [INFO ] Deduced a trap composed of 185 places in 159 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Deduced a trap composed of 211 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:35:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2460 ms
[2022-05-16 16:35:36] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 54 ms.
[2022-05-16 16:35:37] [INFO ] Added : 35 causal constraints over 7 iterations in 1419 ms. Result :unknown
[2022-05-16 16:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:38] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2022-05-16 16:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:38] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2022-05-16 16:35:38] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 48 ms.
[2022-05-16 16:35:43] [INFO ] Deduced a trap composed of 8 places in 335 ms of which 1 ms to minimize.
[2022-05-16 16:35:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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)
[2022-05-16 16:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:43] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2022-05-16 16:35:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:44] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-16 16:35:44] [INFO ] Deduced a trap composed of 398 places in 333 ms of which 1 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 402 places in 340 ms of which 1 ms to minimize.
[2022-05-16 16:35:45] [INFO ] Deduced a trap composed of 380 places in 313 ms of which 1 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Deduced a trap composed of 35 places in 315 ms of which 1 ms to minimize.
[2022-05-16 16:35:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1969 ms
[2022-05-16 16:35:46] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 54 ms.
[2022-05-16 16:35:49] [INFO ] Added : 20 causal constraints over 4 iterations in 2645 ms. Result :unknown
[2022-05-16 16:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:50] [INFO ] [Real]Absence check using state equation in 1592 ms returned sat
[2022-05-16 16:35:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:52] [INFO ] [Nat]Absence check using state equation in 2096 ms returned sat
[2022-05-16 16:35:53] [INFO ] Deduced a trap composed of 407 places in 308 ms of which 1 ms to minimize.
[2022-05-16 16:35:53] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 1 ms to minimize.
[2022-05-16 16:35:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 717 ms
[2022-05-16 16:35:53] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-16 16:35:55] [INFO ] Added : 20 causal constraints over 4 iterations in 2116 ms. Result :unknown
[2022-05-16 16:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:59] [INFO ] [Real]Absence check using state equation in 3367 ms returned sat
[2022-05-16 16:35:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:02] [INFO ] [Nat]Absence check using state equation in 3348 ms returned sat
[2022-05-16 16:36:03] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 3 ms to minimize.
[2022-05-16 16:36:03] [INFO ] Deduced a trap composed of 113 places in 285 ms of which 0 ms to minimize.
[2022-05-16 16:36:03] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 0 ms to minimize.
[2022-05-16 16:36:04] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 0 ms to minimize.
[2022-05-16 16:36:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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.verifyPossible(DeadlockTester.java:588)
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)
[2022-05-16 16:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:05] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-05-16 16:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:05] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2022-05-16 16:36:06] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2022-05-16 16:36:06] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 1 ms to minimize.
[2022-05-16 16:36:06] [INFO ] Deduced a trap composed of 115 places in 244 ms of which 0 ms to minimize.
[2022-05-16 16:36:06] [INFO ] Deduced a trap composed of 16 places in 244 ms of which 1 ms to minimize.
[2022-05-16 16:36:07] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2022-05-16 16:36:07] [INFO ] Deduced a trap composed of 101 places in 215 ms of which 0 ms to minimize.
[2022-05-16 16:36:07] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 1 ms to minimize.
[2022-05-16 16:36:08] [INFO ] Deduced a trap composed of 113 places in 203 ms of which 5 ms to minimize.
[2022-05-16 16:36:08] [INFO ] Deduced a trap composed of 185 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:36:08] [INFO ] Deduced a trap composed of 191 places in 152 ms of which 1 ms to minimize.
[2022-05-16 16:36:08] [INFO ] Deduced a trap composed of 187 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:36:08] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2901 ms
[2022-05-16 16:36:08] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-16 16:36:10] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 1 ms to minimize.
[2022-05-16 16:36:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-05-16 16:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:10] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-05-16 16:36:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:11] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-05-16 16:36:11] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-16 16:36:15] [INFO ] Added : 20 causal constraints over 4 iterations in 4067 ms. Result :sat
Minimization took 446 ms.
[2022-05-16 16:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:18] [INFO ] [Real]Absence check using state equation in 2277 ms returned sat
[2022-05-16 16:36:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:22] [INFO ] [Nat]Absence check using state equation in 3899 ms returned sat
[2022-05-16 16:36:22] [INFO ] Deduced a trap composed of 53 places in 284 ms of which 2 ms to minimize.
[2022-05-16 16:36:23] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 1 ms to minimize.
[2022-05-16 16:36:23] [INFO ] Deduced a trap composed of 161 places in 293 ms of which 1 ms to minimize.
[2022-05-16 16:36:23] [INFO ] Deduced a trap composed of 416 places in 294 ms of which 1 ms to minimize.
[2022-05-16 16:36:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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)
[2022-05-16 16:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:26] [INFO ] [Real]Absence check using state equation in 2401 ms returned sat
[2022-05-16 16:36:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:27] [INFO ] [Nat]Absence check using state equation in 1224 ms returned sat
[2022-05-16 16:36:27] [INFO ] Deduced a trap composed of 43 places in 248 ms of which 1 ms to minimize.
[2022-05-16 16:36:28] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 1 ms to minimize.
[2022-05-16 16:36:28] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 1 ms to minimize.
[2022-05-16 16:36:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 938 ms
[2022-05-16 16:36:28] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-16 16:36:31] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2022-05-16 16:36: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 10
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)
[2022-05-16 16:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:35] [INFO ] [Real]Absence check using state equation in 3424 ms returned sat
[2022-05-16 16:36:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:36] [INFO ] [Nat]Absence check using state equation in 1653 ms returned sat
[2022-05-16 16:36:37] [INFO ] Deduced a trap composed of 413 places in 276 ms of which 0 ms to minimize.
[2022-05-16 16:36:37] [INFO ] Deduced a trap composed of 424 places in 269 ms of which 1 ms to minimize.
[2022-05-16 16:36:37] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 1 ms to minimize.
[2022-05-16 16:36:38] [INFO ] Deduced a trap composed of 420 places in 270 ms of which 1 ms to minimize.
[2022-05-16 16:36:38] [INFO ] Deduced a trap composed of 103 places in 299 ms of which 1 ms to minimize.
[2022-05-16 16:36:38] [INFO ] Deduced a trap composed of 417 places in 306 ms of which 1 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 419 places in 285 ms of which 1 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 417 places in 277 ms of which 1 ms to minimize.
[2022-05-16 16:36:39] [INFO ] Deduced a trap composed of 434 places in 277 ms of which 1 ms to minimize.
[2022-05-16 16:36:40] [INFO ] Deduced a trap composed of 427 places in 267 ms of which 1 ms to minimize.
[2022-05-16 16:36:40] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
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)
[2022-05-16 16:36:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:45] [INFO ] [Real]Absence check using state equation in 4942 ms returned unknown
[2022-05-16 16:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:49] [INFO ] [Real]Absence check using state equation in 4166 ms returned sat
[2022-05-16 16:36:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:54] [INFO ] [Nat]Absence check using state equation in 4215 ms returned sat
[2022-05-16 16:36:54] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 1 ms to minimize.
[2022-05-16 16:36:54] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 1 ms to minimize.
[2022-05-16 16:36:54] [INFO ] Deduced a trap composed of 25 places in 259 ms of which 0 ms to minimize.
[2022-05-16 16:36:54] [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 13
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.verifyPossible(DeadlockTester.java:588)
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)
[2022-05-16 16:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:55] [INFO ] [Real]Absence check using state equation in 242 ms returned unsat
[2022-05-16 16:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:36:57] [INFO ] [Real]Absence check using state equation in 2507 ms returned sat
[2022-05-16 16:36:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:00] [INFO ] [Nat]Absence check using state equation in 2358 ms returned sat
[2022-05-16 16:37:00] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 53 ms.
[2022-05-16 16:37:02] [INFO ] Added : 20 causal constraints over 4 iterations in 2465 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -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, 1, 0]
FORMULA DoubleExponent-PT-020-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 879100 steps, including 30760 resets, run finished after 871 ms. (steps per millisecond=1009 ) properties (out of 15) seen :1 could not realise parikh vector
Incomplete Parikh walk after 247100 steps, including 8643 resets, run finished after 441 ms. (steps per millisecond=560 ) properties (out of 15) seen :0 could not realise parikh vector
Incomplete Parikh walk after 60000 steps, including 2116 resets, run finished after 58 ms. (steps per millisecond=1034 ) properties (out of 15) seen :0 could not realise parikh vector
Interrupted Parikh walk after 27056795 steps, including 946884 resets, run timeout after 30001 ms. (steps per millisecond=901 ) properties (out of 15) seen :1
Incomplete Parikh walk after 299400 steps, including 10511 resets, run finished after 299 ms. (steps per millisecond=1001 ) properties (out of 15) seen :1 could not realise parikh vector
Support contains 15 out of 1064 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 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 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1057 transition count 771
Reduce places removed 225 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 765
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 466 place count 826 transition count 765
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 466 place count 826 transition count 725
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 546 place count 786 transition count 725
Performed 178 Post agglomeration using F-continuation condition.Transition count delta: 178
Deduced a syphon composed of 178 places in 9 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 902 place count 608 transition count 547
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 7 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 972 place count 573 transition count 547
Free-agglomeration rule (complex) applied 82 times.
Iterating global reduction 3 with 82 rules applied. Total rules applied 1054 place count 573 transition count 465
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 3 with 82 rules applied. Total rules applied 1136 place count 491 transition count 465
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1216 place count 491 transition count 465
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1217 place count 490 transition count 464
Applied a total of 1217 rules in 316 ms. Remains 490 /1064 variables (removed 574) and now considering 464/998 (removed 534) transitions.
Finished structural reductions, in 1 iterations. Remains : 490/1064 places, 464/998 transitions.
// Phase 1: matrix 464 rows 490 cols
[2022-05-16 16:37:35] [INFO ] Computed 100 place invariants in 78 ms
Incomplete random walk after 1000000 steps, including 128497 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84848 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84616 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84766 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84946 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 85025 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84641 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84739 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84758 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 85027 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84655 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84838 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84987 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84750 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84489 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84846 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 15) seen :1
// Phase 1: matrix 464 rows 490 cols
[2022-05-16 16:37:46] [INFO ] Computed 100 place invariants in 90 ms
[2022-05-16 16:37:46] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-16 16:37:46] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2022-05-16 16:37:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:46] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2022-05-16 16:37:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-05-16 16:37:46] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:46] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-16 16:37:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:37:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 87 ms returned sat
[2022-05-16 16:37:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:37:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-16 16:37:46] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 44 ms.
[2022-05-16 16:37:55] [INFO ] Added : 326 causal constraints over 66 iterations in 8125 ms. Result :sat
Minimization took 1491 ms.
[2022-05-16 16:37:56] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-16 16:37:56] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:37:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:56] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-16 16:37:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:37:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:37:56] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:37:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:37:57] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-16 16:37:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 86 ms returned sat
[2022-05-16 16:37:57] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 33 ms.
[2022-05-16 16:37:59] [INFO ] Added : 93 causal constraints over 19 iterations in 2646 ms. Result :sat
Minimization took 294 ms.
[2022-05-16 16:38:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:00] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2022-05-16 16:38:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:00] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:00] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2022-05-16 16:38:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 46 ms returned sat
[2022-05-16 16:38:00] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:38:00] [INFO ] Deduced a trap composed of 40 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:38:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2022-05-16 16:38:00] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 32 ms.
[2022-05-16 16:38:08] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:38:08] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:38:08] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 1 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:38:09] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 0 ms to minimize.
[2022-05-16 16:38:10] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2412 ms
[2022-05-16 16:38:10] [INFO ] Added : 354 causal constraints over 71 iterations in 9992 ms. Result :sat
Minimization took 1396 ms.
[2022-05-16 16:38:12] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:12] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:12] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-16 16:38:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-05-16 16:38:12] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2022-05-16 16:38:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:12] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-05-16 16:38:13] [INFO ] [Nat]Added 74 Read/Feed constraints in 195 ms returned sat
[2022-05-16 16:38:13] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 30 ms.
[2022-05-16 16:38:16] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 0 ms to minimize.
[2022-05-16 16:38:17] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 11 ms to minimize.
[2022-05-16 16:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 500 ms
[2022-05-16 16:38:17] [INFO ] Added : 100 causal constraints over 20 iterations in 3992 ms. Result :sat
Minimization took 431 ms.
[2022-05-16 16:38:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:38:17] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 22 ms returned unsat
[2022-05-16 16:38:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:17] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 35 ms returned sat
[2022-05-16 16:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:17] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-16 16:38:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:18] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2022-05-16 16:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:18] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-05-16 16:38:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 95 ms returned sat
[2022-05-16 16:38:18] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-16 16:38:24] [INFO ] Added : 25 causal constraints over 5 iterations in 6420 ms. Result :sat
Minimization took 521 ms.
[2022-05-16 16:38:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:25] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:38:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:25] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-16 16:38:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:25] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2022-05-16 16:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:25] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-16 16:38:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 33 ms returned sat
[2022-05-16 16:38:26] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:38:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2022-05-16 16:38:26] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-16 16:38:35] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2022-05-16 16:38:35] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 1 ms to minimize.
[2022-05-16 16:38:35] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:38:36] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 0 ms to minimize.
[2022-05-16 16:38:36] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:38:36] [INFO ] Deduced a trap composed of 135 places in 213 ms of which 0 ms to minimize.
[2022-05-16 16:38:36] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 0 ms to minimize.
[2022-05-16 16:38:37] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 0 ms to minimize.
[2022-05-16 16:38:37] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:38:37] [INFO ] Deduced a trap composed of 150 places in 209 ms of which 0 ms to minimize.
[2022-05-16 16:38:37] [INFO ] Deduced a trap composed of 142 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:38:37] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3036 ms
[2022-05-16 16:38:38] [INFO ] Added : 347 causal constraints over 71 iterations in 11938 ms. Result :sat
Minimization took 2086 ms.
[2022-05-16 16:38:40] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:38:40] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2022-05-16 16:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:40] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-16 16:38:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:38:40] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-05-16 16:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:40] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2022-05-16 16:38:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 46 ms returned sat
[2022-05-16 16:38:40] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-16 16:38:47] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:38:47] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2022-05-16 16:38:48] [INFO ] Deduced a trap composed of 125 places in 218 ms of which 0 ms to minimize.
[2022-05-16 16:38:48] [INFO ] Deduced a trap composed of 133 places in 217 ms of which 1 ms to minimize.
[2022-05-16 16:38:48] [INFO ] Deduced a trap composed of 132 places in 227 ms of which 1 ms to minimize.
[2022-05-16 16:38:49] [INFO ] Deduced a trap composed of 126 places in 221 ms of which 1 ms to minimize.
[2022-05-16 16:38:49] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 1 ms to minimize.
[2022-05-16 16:38:49] [INFO ] Deduced a trap composed of 155 places in 209 ms of which 1 ms to minimize.
[2022-05-16 16:38:49] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 0 ms to minimize.
[2022-05-16 16:38:50] [INFO ] Deduced a trap composed of 137 places in 209 ms of which 0 ms to minimize.
[2022-05-16 16:38:50] [INFO ] Deduced a trap composed of 146 places in 204 ms of which 1 ms to minimize.
[2022-05-16 16:38:50] [INFO ] Deduced a trap composed of 144 places in 199 ms of which 0 ms to minimize.
[2022-05-16 16:38:50] [INFO ] Deduced a trap composed of 141 places in 202 ms of which 0 ms to minimize.
[2022-05-16 16:38:51] [INFO ] Deduced a trap composed of 151 places in 203 ms of which 0 ms to minimize.
[2022-05-16 16:38:51] [INFO ] Deduced a trap composed of 134 places in 203 ms of which 0 ms to minimize.
[2022-05-16 16:38:51] [INFO ] Deduced a trap composed of 131 places in 199 ms of which 1 ms to minimize.
[2022-05-16 16:38:52] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 0 ms to minimize.
[2022-05-16 16:38:52] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 1 ms to minimize.
[2022-05-16 16:38:52] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 0 ms to minimize.
[2022-05-16 16:38:52] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:38:53] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:38:53] [INFO ] Deduced a trap composed of 151 places in 207 ms of which 1 ms to minimize.
[2022-05-16 16:38:53] [INFO ] Deduced a trap composed of 154 places in 210 ms of which 0 ms to minimize.
[2022-05-16 16:38:54] [INFO ] Deduced a trap composed of 153 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:38:54] [INFO ] Deduced a trap composed of 149 places in 188 ms of which 0 ms to minimize.
[2022-05-16 16:38:54] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 0 ms to minimize.
[2022-05-16 16:38:54] [INFO ] Deduced a trap composed of 153 places in 202 ms of which 0 ms to minimize.
[2022-05-16 16:38:55] [INFO ] Deduced a trap composed of 151 places in 205 ms of which 1 ms to minimize.
[2022-05-16 16:38:55] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 1 ms to minimize.
[2022-05-16 16:38:55] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:38:55] [INFO ] Deduced a trap composed of 131 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:38:56] [INFO ] Deduced a trap composed of 157 places in 201 ms of which 1 ms to minimize.
[2022-05-16 16:38:56] [INFO ] Deduced a trap composed of 149 places in 182 ms of which 0 ms to minimize.
[2022-05-16 16:38:56] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 1 ms to minimize.
[2022-05-16 16:38:56] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 9306 ms
[2022-05-16 16:38:56] [INFO ] Added : 342 causal constraints over 70 iterations in 16044 ms. Result :sat
Minimization took 2772 ms.
[2022-05-16 16:38:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:38:59] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2022-05-16 16:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:38:59] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-16 16:38:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:38:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:39:00] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2022-05-16 16:39:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:00] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-16 16:39:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 108 ms returned sat
[2022-05-16 16:39:00] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:39:00] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:39:00] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:39:00] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:39:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 486 ms
[2022-05-16 16:39:00] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 30 ms.
[2022-05-16 16:39:08] [INFO ] Deduced a trap composed of 131 places in 201 ms of which 1 ms to minimize.
[2022-05-16 16:39:08] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 12 ms to minimize.
[2022-05-16 16:39:09] [INFO ] Deduced a trap composed of 134 places in 223 ms of which 0 ms to minimize.
[2022-05-16 16:39:09] [INFO ] Deduced a trap composed of 145 places in 214 ms of which 0 ms to minimize.
[2022-05-16 16:39:09] [INFO ] Deduced a trap composed of 143 places in 238 ms of which 0 ms to minimize.
[2022-05-16 16:39:10] [INFO ] Deduced a trap composed of 115 places in 226 ms of which 1 ms to minimize.
[2022-05-16 16:39:10] [INFO ] Deduced a trap composed of 130 places in 219 ms of which 0 ms to minimize.
[2022-05-16 16:39:10] [INFO ] Deduced a trap composed of 132 places in 217 ms of which 1 ms to minimize.
[2022-05-16 16:39:10] [INFO ] Deduced a trap composed of 112 places in 216 ms of which 1 ms to minimize.
[2022-05-16 16:39:11] [INFO ] Deduced a trap composed of 136 places in 221 ms of which 0 ms to minimize.
[2022-05-16 16:39:11] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 1 ms to minimize.
[2022-05-16 16:39:11] [INFO ] Deduced a trap composed of 143 places in 199 ms of which 0 ms to minimize.
[2022-05-16 16:39:12] [INFO ] Deduced a trap composed of 120 places in 219 ms of which 0 ms to minimize.
[2022-05-16 16:39:12] [INFO ] Deduced a trap composed of 144 places in 223 ms of which 0 ms to minimize.
[2022-05-16 16:39:12] [INFO ] Deduced a trap composed of 151 places in 212 ms of which 1 ms to minimize.
[2022-05-16 16:39:12] [INFO ] Deduced a trap composed of 134 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:39:13] [INFO ] Deduced a trap composed of 136 places in 222 ms of which 1 ms to minimize.
[2022-05-16 16:39:13] [INFO ] Deduced a trap composed of 126 places in 209 ms of which 1 ms to minimize.
[2022-05-16 16:39:13] [INFO ] Deduced a trap composed of 134 places in 197 ms of which 0 ms to minimize.
[2022-05-16 16:39:14] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2022-05-16 16:39:14] [INFO ] Deduced a trap composed of 116 places in 204 ms of which 1 ms to minimize.
[2022-05-16 16:39:14] [INFO ] Deduced a trap composed of 113 places in 198 ms of which 0 ms to minimize.
[2022-05-16 16:39:14] [INFO ] Deduced a trap composed of 135 places in 200 ms of which 0 ms to minimize.
[2022-05-16 16:39:15] [INFO ] Deduced a trap composed of 138 places in 202 ms of which 1 ms to minimize.
[2022-05-16 16:39:15] [INFO ] Deduced a trap composed of 138 places in 199 ms of which 0 ms to minimize.
[2022-05-16 16:39:15] [INFO ] Deduced a trap composed of 111 places in 197 ms of which 0 ms to minimize.
[2022-05-16 16:39:15] [INFO ] Deduced a trap composed of 139 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:39:16] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 1 ms to minimize.
[2022-05-16 16:39:16] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7838 ms
[2022-05-16 16:39:16] [INFO ] Added : 341 causal constraints over 69 iterations in 15589 ms. Result :sat
Minimization took 1842 ms.
[2022-05-16 16:39:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:39:18] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 35 ms returned sat
[2022-05-16 16:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:18] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-05-16 16:39:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:39:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:39:18] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:39:18] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-16 16:39:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 42 ms returned sat
[2022-05-16 16:39:19] [INFO ] Deduced a trap composed of 159 places in 195 ms of which 1 ms to minimize.
[2022-05-16 16:39:19] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2022-05-16 16:39:19] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 1 ms to minimize.
[2022-05-16 16:39:19] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2022-05-16 16:39:19] [INFO ] Deduced a trap composed of 161 places in 189 ms of which 1 ms to minimize.
[2022-05-16 16:39:20] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 1 ms to minimize.
[2022-05-16 16:39:20] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2022-05-16 16:39:20] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 1 ms to minimize.
[2022-05-16 16:39:20] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 0 ms to minimize.
[2022-05-16 16:39:20] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 1 ms to minimize.
[2022-05-16 16:39:21] [INFO ] Deduced a trap composed of 140 places in 182 ms of which 0 ms to minimize.
[2022-05-16 16:39:21] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:39:21] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 1 ms to minimize.
[2022-05-16 16:39:21] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 1 ms to minimize.
[2022-05-16 16:39:22] [INFO ] Deduced a trap composed of 164 places in 222 ms of which 1 ms to minimize.
[2022-05-16 16:39:22] [INFO ] Deduced a trap composed of 146 places in 208 ms of which 0 ms to minimize.
[2022-05-16 16:39:22] [INFO ] Deduced a trap composed of 144 places in 193 ms of which 1 ms to minimize.
[2022-05-16 16:39:22] [INFO ] Deduced a trap composed of 156 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:39:22] [INFO ] Deduced a trap composed of 154 places in 186 ms of which 0 ms to minimize.
[2022-05-16 16:39:23] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:39:23] [INFO ] Deduced a trap composed of 142 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:39:23] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:39:23] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 143 places in 183 ms of which 1 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 142 places in 185 ms of which 1 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 146 places in 229 ms of which 0 ms to minimize.
[2022-05-16 16:39:24] [INFO ] Deduced a trap composed of 140 places in 191 ms of which 0 ms to minimize.
[2022-05-16 16:39:25] [INFO ] Deduced a trap composed of 150 places in 186 ms of which 0 ms to minimize.
[2022-05-16 16:39:25] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6167 ms
[2022-05-16 16:39:25] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 43 ms.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:39:33] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 36 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:39:34] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:39:35] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:39:36] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:39:36] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:39:36] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:36] [INFO ] Deduced a trap composed of 54 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:39:37] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 145 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:39:38] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:39:39] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:39:39] [INFO ] Deduced a trap composed of 159 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:39:39] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:39:39] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:39:39] [INFO ] Deduced a trap composed of 121 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 0 ms to minimize.
[2022-05-16 16:39:40] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 155 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:39:41] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:39:42] [INFO ] Deduced a trap composed of 154 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:39:42] [INFO ] Deduced a trap composed of 138 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:39:42] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:39:42] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:39:43] [INFO ] Deduced a trap composed of 156 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:39:43] [INFO ] Deduced a trap composed of 153 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:39:43] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:39:43] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:39:43] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:39:44] [INFO ] Deduced a trap composed of 152 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:39:44] [INFO ] Deduced a trap composed of 148 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:39:44] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:39:44] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:39:44] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:39:45] [INFO ] Deduced a trap composed of 127 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:39:45] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:39:45] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:39:45] [INFO ] Deduced a trap composed of 157 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:45] [INFO ] Deduced a trap composed of 131 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:39:46] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:39:46] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:39:46] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 125 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:39:47] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 155 places in 139 ms of which 3 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:39:48] [INFO ] Deduced a trap composed of 155 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:49] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:39:49] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:39:49] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:49] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 1 ms to minimize.
[2022-05-16 16:39:49] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 1 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 0 ms to minimize.
[2022-05-16 16:39:50] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 130 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:39:51] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 1 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 147 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 153 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 1 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 153 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:39:52] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 1 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:39:53] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 1 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 1 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 154 places in 124 ms of which 0 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:39:54] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 148 places in 123 ms of which 1 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:39:55] [INFO ] Deduced a trap composed of 139 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:39:56] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:39:57] [INFO ] Deduced a trap composed of 154 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 123 places in 103 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 164 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:39:58] [INFO ] Deduced a trap composed of 156 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 112 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 159 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:39:59] [INFO ] Deduced a trap composed of 147 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 156 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 151 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 161 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:40:00] [INFO ] Deduced a trap composed of 141 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 159 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:40:01] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 158 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 151 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:40:02] [INFO ] Deduced a trap composed of 140 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 142 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 150 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:40:03] [INFO ] Deduced a trap composed of 155 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:40:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2022-05-16 16:40:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:03] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:03] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2022-05-16 16:40:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:04] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:04] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-05-16 16:40:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 58 ms returned sat
[2022-05-16 16:40:04] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:40:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2022-05-16 16:40:04] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 26 ms.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 1 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:40:13] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:40:14] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:40:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2082 ms
[2022-05-16 16:40:15] [INFO ] Added : 343 causal constraints over 69 iterations in 11001 ms. Result :sat
Minimization took 1734 ms.
[2022-05-16 16:40:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:40:17] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:17] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2022-05-16 16:40:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:40:17] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:17] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-05-16 16:40:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 64 ms returned sat
[2022-05-16 16:40:18] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:40:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-16 16:40:18] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 31 ms.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:40:27] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2022-05-16 16:40:28] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 1 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 72 places in 41 ms of which 0 ms to minimize.
[2022-05-16 16:40:29] [INFO ] Deduced a trap composed of 64 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 68 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Deduced a trap composed of 77 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:40:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2746 ms
[2022-05-16 16:40:30] [INFO ] Added : 362 causal constraints over 73 iterations in 12087 ms. Result :sat
Minimization took 1403 ms.
[2022-05-16 16:40:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-05-16 16:40:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:32] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-05-16 16:40:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:32] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:32] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-16 16:40:32] [INFO ] [Nat]Added 74 Read/Feed constraints in 55 ms returned sat
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:40:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 545 ms
[2022-05-16 16:40:33] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-16 16:40:41] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2022-05-16 16:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2022-05-16 16:40:41] [INFO ] Added : 345 causal constraints over 69 iterations in 8821 ms. Result :sat
Minimization took 1133 ms.
[2022-05-16 16:40:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:43] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:43] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2022-05-16 16:40:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:43] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:43] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-16 16:40:43] [INFO ] [Nat]Added 74 Read/Feed constraints in 28 ms returned sat
[2022-05-16 16:40:43] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:40:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-16 16:40:43] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 30 ms.
[2022-05-16 16:40:51] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:40:51] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:40:51] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:40:52] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 1 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:40:53] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:40:54] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3444 ms
[2022-05-16 16:40:54] [INFO ] Added : 356 causal constraints over 72 iterations in 11353 ms. Result :sat
Minimization took 1995 ms.
[2022-05-16 16:40:57] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:40:57] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:57] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-05-16 16:40:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:40:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:40:57] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:40:57] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-16 16:40:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 100 ms returned sat
[2022-05-16 16:40:57] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:40:57] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 123 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 130 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 1 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 130 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:40:58] [INFO ] Deduced a trap composed of 132 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:40:59] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 1 ms to minimize.
[2022-05-16 16:40:59] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:40:59] [INFO ] Deduced a trap composed of 127 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:40:59] [INFO ] Deduced a trap composed of 136 places in 98 ms of which 0 ms to minimize.
[2022-05-16 16:40:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1817 ms
[2022-05-16 16:40:59] [INFO ] Computed and/alt/rep : 377/2175/377 causal constraints (skipped 86 transitions) in 31 ms.
[2022-05-16 16:41:12] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2022-05-16 16:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2022-05-16 16:41:12] [INFO ] Added : 349 causal constraints over 71 iterations in 12876 ms. Result :sat
Minimization took 1300 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-020-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Interrupted Parikh walk after 26632137 steps, including 4129893 resets, run timeout after 30001 ms. (steps per millisecond=887 ) properties (out of 14) seen :0
Interrupted Parikh walk after 24605339 steps, including 3814686 resets, run timeout after 30001 ms. (steps per millisecond=820 ) properties (out of 14) seen :0
Interrupted Parikh walk after 26900978 steps, including 4170674 resets, run timeout after 30001 ms. (steps per millisecond=896 ) properties (out of 14) seen :0
Interrupted Parikh walk after 28161380 steps, including 4366197 resets, run timeout after 30001 ms. (steps per millisecond=938 ) properties (out of 14) seen :0
Interrupted Parikh walk after 25186211 steps, including 3905283 resets, run timeout after 30001 ms. (steps per millisecond=839 ) properties (out of 14) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18580908 steps, including 2881127 resets, run finished after 23073 ms. (steps per millisecond=805 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 244700 steps, including 37917 resets, run finished after 243 ms. (steps per millisecond=1006 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26200 steps, including 4041 resets, run finished after 31 ms. (steps per millisecond=845 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 27390293 steps, including 4246523 resets, run timeout after 30001 ms. (steps per millisecond=912 ) properties (out of 14) seen :0
Incomplete Parikh walk after 184800 steps, including 28673 resets, run finished after 190 ms. (steps per millisecond=972 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11017700 steps, including 1708776 resets, run finished after 11460 ms. (steps per millisecond=961 ) properties (out of 14) seen :0 could not realise parikh vector
Support contains 14 out of 490 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 490/490 places, 464/464 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 490 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 489 transition count 463
Applied a total of 2 rules in 44 ms. Remains 489 /490 variables (removed 1) and now considering 463/464 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 489/490 places, 463/464 transitions.
// Phase 1: matrix 463 rows 489 cols
[2022-05-16 16:44:48] [INFO ] Computed 100 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 128240 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85024 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84791 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84668 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84872 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84615 resets, run finished after 748 ms. (steps per millisecond=1336 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84604 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84499 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84729 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84631 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84550 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84340 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84642 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84502 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84884 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 14) seen :0
// Phase 1: matrix 463 rows 489 cols
[2022-05-16 16:45:00] [INFO ] Computed 100 place invariants in 51 ms
[2022-05-16 16:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:00] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-05-16 16:45:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:45:00] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:00] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2022-05-16 16:45:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:45:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 105 ms returned sat
[2022-05-16 16:45:01] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:45:01] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 0 ms to minimize.
[2022-05-16 16:45:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2022-05-16 16:45:01] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 27 ms.
[2022-05-16 16:45:13] [INFO ] Added : 360 causal constraints over 72 iterations in 12329 ms. Result :sat
Minimization took 1106 ms.
[2022-05-16 16:45:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:14] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:14] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-05-16 16:45:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:14] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:15] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2022-05-16 16:45:15] [INFO ] [Nat]Added 74 Read/Feed constraints in 100 ms returned sat
[2022-05-16 16:45:15] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 32 ms.
[2022-05-16 16:45:24] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:45:24] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2022-05-16 16:45:24] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2022-05-16 16:45:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 776 ms
[2022-05-16 16:45:24] [INFO ] Added : 332 causal constraints over 67 iterations in 9607 ms. Result :sat
Minimization took 1794 ms.
[2022-05-16 16:45:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:26] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:26] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-05-16 16:45:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:27] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:27] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2022-05-16 16:45:27] [INFO ] [Nat]Added 74 Read/Feed constraints in 35 ms returned sat
[2022-05-16 16:45:27] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 0 ms to minimize.
[2022-05-16 16:45:27] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 0 ms to minimize.
[2022-05-16 16:45:27] [INFO ] Deduced a trap composed of 59 places in 37 ms of which 0 ms to minimize.
[2022-05-16 16:45:27] [INFO ] Deduced a trap composed of 61 places in 35 ms of which 1 ms to minimize.
[2022-05-16 16:45:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 279 ms
[2022-05-16 16:45:27] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 31 ms.
[2022-05-16 16:45:34] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2022-05-16 16:45:34] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:45:35] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 0 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 0 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:45:36] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 0 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 0 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 1 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:45:37] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2022-05-16 16:45:38] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:45:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3454 ms
[2022-05-16 16:45:38] [INFO ] Added : 357 causal constraints over 73 iterations in 10729 ms. Result :sat
Minimization took 2356 ms.
[2022-05-16 16:45:40] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:40] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:40] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-16 16:45:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:45:40] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:41] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-16 16:45:41] [INFO ] [Nat]Added 74 Read/Feed constraints in 189 ms returned sat
[2022-05-16 16:45:41] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2022-05-16 16:45:41] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 30 ms.
[2022-05-16 16:45:50] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:45:51] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:45:51] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:45:51] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 0 ms to minimize.
[2022-05-16 16:45:52] [INFO ] Deduced a trap composed of 156 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:45:52] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:45:52] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:45:53] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:45:53] [INFO ] Deduced a trap composed of 159 places in 181 ms of which 1 ms to minimize.
[2022-05-16 16:45:53] [INFO ] Deduced a trap composed of 174 places in 199 ms of which 1 ms to minimize.
[2022-05-16 16:45:53] [INFO ] Deduced a trap composed of 154 places in 192 ms of which 1 ms to minimize.
[2022-05-16 16:45:54] [INFO ] Deduced a trap composed of 180 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:45:54] [INFO ] Deduced a trap composed of 177 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:45:54] [INFO ] Deduced a trap composed of 145 places in 172 ms of which 0 ms to minimize.
[2022-05-16 16:45:54] [INFO ] Deduced a trap composed of 149 places in 188 ms of which 0 ms to minimize.
[2022-05-16 16:45:55] [INFO ] Deduced a trap composed of 146 places in 175 ms of which 0 ms to minimize.
[2022-05-16 16:45:55] [INFO ] Deduced a trap composed of 157 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:45:55] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:45:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5188 ms
[2022-05-16 16:45:55] [INFO ] Added : 367 causal constraints over 74 iterations in 14466 ms. Result :sat
Minimization took 3003 ms.
[2022-05-16 16:45:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:59] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2022-05-16 16:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:59] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-16 16:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:45:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:45:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:45:59] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2022-05-16 16:45:59] [INFO ] [Nat]Added 74 Read/Feed constraints in 94 ms returned sat
[2022-05-16 16:45:59] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:45:59] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:45:59] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:00] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 139 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 148 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 128 places in 94 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:01] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 137 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 131 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 132 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:02] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 130 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 141 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:03] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 150 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 112 places in 93 ms of which 1 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 1 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 1 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 118 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:04] [INFO ] Deduced a trap composed of 153 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 149 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:05] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:06] [INFO ] Deduced a trap composed of 131 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 155 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 12 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 156 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:07] [INFO ] Deduced a trap composed of 141 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 135 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 144 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 152 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:08] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 152 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 137 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 150 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 140 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 152 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:46:09] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 138 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 123 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 131 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 125 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:10] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 134 places in 101 ms of which 1 ms to minimize.
[2022-05-16 16:46:11] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 147 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 155 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 152 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:12] [INFO ] Deduced a trap composed of 136 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 127 places in 95 ms of which 1 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 114 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 1 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 136 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:46:13] [INFO ] Deduced a trap composed of 129 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 0 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 1 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 1 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 131 places in 91 ms of which 1 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 138 places in 93 ms of which 1 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 131 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 135 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:46:14] [INFO ] Deduced a trap composed of 140 places in 94 ms of which 0 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 99 places in 91 ms of which 1 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:46:15] [INFO ] Deduced a trap composed of 145 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 144 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 155 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 142 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 153 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:46:16] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 1 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 113 places in 91 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 130 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 131 places in 92 ms of which 1 ms to minimize.
[2022-05-16 16:46:17] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 1 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 119 places in 91 ms of which 1 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 134 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 149 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:18] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 145 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:19] [INFO ] Deduced a trap composed of 152 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 151 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 155 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:20] [INFO ] Deduced a trap composed of 155 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 137 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 149 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 1 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 1 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 117 places in 84 ms of which 0 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 1 ms to minimize.
[2022-05-16 16:46:21] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 1 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 154 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 0 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 155 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 151 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:22] [INFO ] Deduced a trap composed of 147 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 113 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 133 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 146 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:23] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 151 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:24] [INFO ] Deduced a trap composed of 112 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:25] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 130 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:26] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:27] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:28] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 114 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:29] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 128 places in 94 ms of which 1 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 1 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 128 places in 99 ms of which 1 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 138 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:46:30] [INFO ] Deduced a trap composed of 131 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:31] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 152 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 148 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:46:32] [INFO ] Deduced a trap composed of 144 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 140 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:33] [INFO ] Deduced a trap composed of 120 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:34] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:35] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 136 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 133 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:36] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 119 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:46:37] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 139 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 144 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:38] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:39] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 126 places in 115 ms of which 1 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 0 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 131 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:40] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 1 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 142 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 141 places in 111 ms of which 1 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 137 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 142 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:46:41] [INFO ] Deduced a trap composed of 143 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 139 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 145 places in 117 ms of which 0 ms to minimize.
[2022-05-16 16:46:42] [INFO ] Deduced a trap composed of 147 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 139 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:43] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:46:44] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 0 ms to minimize.
[2022-05-16 16:46:44] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 1 ms to minimize.
[2022-05-16 16:46:44] [INFO ] Deduced a trap composed of 149 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:46:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:588)
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)
[2022-05-16 16:46:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:46:44] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:46:44] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-16 16:46:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:46:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:46:44] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:46:44] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-05-16 16:46:44] [INFO ] [Nat]Added 74 Read/Feed constraints in 38 ms returned sat
[2022-05-16 16:46:45] [INFO ] Deduced a trap composed of 117 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:46:45] [INFO ] Deduced a trap composed of 111 places in 191 ms of which 1 ms to minimize.
[2022-05-16 16:46:45] [INFO ] Deduced a trap composed of 123 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:46:45] [INFO ] Deduced a trap composed of 102 places in 203 ms of which 0 ms to minimize.
[2022-05-16 16:46:46] [INFO ] Deduced a trap composed of 103 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:46:46] [INFO ] Deduced a trap composed of 112 places in 203 ms of which 1 ms to minimize.
[2022-05-16 16:46:46] [INFO ] Deduced a trap composed of 120 places in 202 ms of which 0 ms to minimize.
[2022-05-16 16:46:46] [INFO ] Deduced a trap composed of 107 places in 185 ms of which 0 ms to minimize.
[2022-05-16 16:46:46] [INFO ] Deduced a trap composed of 105 places in 208 ms of which 0 ms to minimize.
[2022-05-16 16:46:47] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 0 ms to minimize.
[2022-05-16 16:46:47] [INFO ] Deduced a trap composed of 107 places in 202 ms of which 1 ms to minimize.
[2022-05-16 16:46:47] [INFO ] Deduced a trap composed of 134 places in 200 ms of which 0 ms to minimize.
[2022-05-16 16:46:47] [INFO ] Deduced a trap composed of 111 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:46:48] [INFO ] Deduced a trap composed of 112 places in 186 ms of which 0 ms to minimize.
[2022-05-16 16:46:48] [INFO ] Deduced a trap composed of 116 places in 187 ms of which 0 ms to minimize.
[2022-05-16 16:46:48] [INFO ] Deduced a trap composed of 120 places in 200 ms of which 1 ms to minimize.
[2022-05-16 16:46:48] [INFO ] Deduced a trap composed of 115 places in 201 ms of which 1 ms to minimize.
[2022-05-16 16:46:48] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:46:49] [INFO ] Deduced a trap composed of 128 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:46:49] [INFO ] Deduced a trap composed of 134 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:46:49] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4496 ms
[2022-05-16 16:46:49] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 28 ms.
[2022-05-16 16:47:00] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:47:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 366 ms
[2022-05-16 16:47:00] [INFO ] Added : 347 causal constraints over 70 iterations in 11104 ms. Result :sat
Minimization took 3011 ms.
[2022-05-16 16:47:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:03] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:03] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-16 16:47:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:47:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:03] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:47:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:04] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-05-16 16:47:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 40 ms returned sat
[2022-05-16 16:47:04] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 34 ms.
[2022-05-16 16:47:11] [INFO ] Deduced a trap composed of 157 places in 211 ms of which 1 ms to minimize.
[2022-05-16 16:47:11] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 0 ms to minimize.
[2022-05-16 16:47:11] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 1 ms to minimize.
[2022-05-16 16:47:12] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 1 ms to minimize.
[2022-05-16 16:47:12] [INFO ] Deduced a trap composed of 29 places in 207 ms of which 1 ms to minimize.
[2022-05-16 16:47:13] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2022-05-16 16:47:13] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:47:14] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:47:14] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2022-05-16 16:47:14] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2022-05-16 16:47:15] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 1 ms to minimize.
[2022-05-16 16:47:15] [INFO ] Deduced a trap composed of 150 places in 201 ms of which 0 ms to minimize.
[2022-05-16 16:47:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4412 ms
[2022-05-16 16:47:15] [INFO ] Added : 342 causal constraints over 69 iterations in 11351 ms. Result :sat
Minimization took 1506 ms.
[2022-05-16 16:47:17] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:17] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:17] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2022-05-16 16:47:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:47:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:17] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:17] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-16 16:47:17] [INFO ] [Nat]Added 74 Read/Feed constraints in 180 ms returned sat
[2022-05-16 16:47:17] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:47:17] [INFO ] Deduced a trap composed of 77 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:47:18] [INFO ] Deduced a trap composed of 89 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:47:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 293 ms
[2022-05-16 16:47:18] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 28 ms.
[2022-05-16 16:47:32] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 0 ms to minimize.
[2022-05-16 16:47:33] [INFO ] Deduced a trap composed of 155 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:47:33] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2022-05-16 16:47:33] [INFO ] Deduced a trap composed of 158 places in 200 ms of which 0 ms to minimize.
[2022-05-16 16:47:33] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 1 ms to minimize.
[2022-05-16 16:47:34] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-16 16:47:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1763 ms
[2022-05-16 16:47:34] [INFO ] Added : 374 causal constraints over 75 iterations in 16370 ms. Result :sat
Minimization took 1287 ms.
[2022-05-16 16:47:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:35] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:47:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:36] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-16 16:47:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:47:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:47:36] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2022-05-16 16:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:47:36] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-05-16 16:47:36] [INFO ] [Nat]Added 74 Read/Feed constraints in 57 ms returned sat
[2022-05-16 16:47:36] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:36] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:47:36] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:47:36] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 1 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 135 places in 90 ms of which 1 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 139 places in 93 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 0 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 1 ms to minimize.
[2022-05-16 16:47:37] [INFO ] Deduced a trap composed of 132 places in 93 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 1 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 125 places in 91 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 143 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 141 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 129 places in 91 ms of which 1 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 139 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:38] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 141 places in 89 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 142 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 1 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 133 places in 94 ms of which 1 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 133 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 1 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 137 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:39] [INFO ] Deduced a trap composed of 122 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 134 places in 89 ms of which 1 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 144 places in 83 ms of which 1 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 1 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2022-05-16 16:47:40] [INFO ] Deduced a trap composed of 102 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 127 places in 81 ms of which 1 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 0 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 0 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 110 places in 79 ms of which 0 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 145 places in 81 ms of which 1 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 158 places in 79 ms of which 0 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 135 places in 83 ms of which 1 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 146 places in 83 ms of which 1 ms to minimize.
[2022-05-16 16:47:41] [INFO ] Deduced a trap composed of 142 places in 84 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 148 places in 82 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 141 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 152 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 143 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 147 places in 89 ms of which 0 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Deduced a trap composed of 147 places in 82 ms of which 1 ms to minimize.
[2022-05-16 16:47:42] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 6174 ms
[2022-05-16 16:47:42] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 32 ms.
[2022-05-16 16:47:56] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 1 ms to minimize.
[2022-05-16 16:47:56] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2022-05-16 16:47:56] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2022-05-16 16:47:57] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 0 ms to minimize.
[2022-05-16 16:47:57] [INFO ] Deduced a trap composed of 174 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:47:57] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 0 ms to minimize.
[2022-05-16 16:47:57] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:47:58] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2022-05-16 16:47:58] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 0 ms to minimize.
[2022-05-16 16:47:58] [INFO ] Deduced a trap composed of 166 places in 188 ms of which 0 ms to minimize.
[2022-05-16 16:47:58] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 1 ms to minimize.
[2022-05-16 16:47:59] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 2 ms to minimize.
[2022-05-16 16:47:59] [INFO ] Deduced a trap composed of 168 places in 172 ms of which 0 ms to minimize.
[2022-05-16 16:47:59] [INFO ] Deduced a trap composed of 175 places in 175 ms of which 0 ms to minimize.
[2022-05-16 16:47:59] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 0 ms to minimize.
[2022-05-16 16:48:00] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2022-05-16 16:48:00] [INFO ] Deduced a trap composed of 178 places in 174 ms of which 0 ms to minimize.
[2022-05-16 16:48:00] [INFO ] Deduced a trap composed of 171 places in 176 ms of which 0 ms to minimize.
[2022-05-16 16:48:00] [INFO ] Deduced a trap composed of 167 places in 175 ms of which 1 ms to minimize.
[2022-05-16 16:48:01] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 0 ms to minimize.
[2022-05-16 16:48:01] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2022-05-16 16:48:01] [INFO ] Deduced a trap composed of 167 places in 168 ms of which 1 ms to minimize.
[2022-05-16 16:48:01] [INFO ] Deduced a trap composed of 187 places in 173 ms of which 1 ms to minimize.
[2022-05-16 16:48:01] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5677 ms
[2022-05-16 16:48:01] [INFO ] Added : 333 causal constraints over 68 iterations in 19300 ms. Result :sat
Minimization took 2008 ms.
[2022-05-16 16:48:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:04] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:04] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2022-05-16 16:48:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:48:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:04] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:04] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-05-16 16:48:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 62 ms returned sat
[2022-05-16 16:48:04] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2022-05-16 16:48:04] [INFO ] Deduced a trap composed of 133 places in 192 ms of which 1 ms to minimize.
[2022-05-16 16:48:05] [INFO ] Deduced a trap composed of 132 places in 193 ms of which 1 ms to minimize.
[2022-05-16 16:48:05] [INFO ] Deduced a trap composed of 145 places in 194 ms of which 0 ms to minimize.
[2022-05-16 16:48:05] [INFO ] Deduced a trap composed of 151 places in 196 ms of which 0 ms to minimize.
[2022-05-16 16:48:05] [INFO ] Deduced a trap composed of 145 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:48:06] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 0 ms to minimize.
[2022-05-16 16:48:06] [INFO ] Deduced a trap composed of 143 places in 195 ms of which 1 ms to minimize.
[2022-05-16 16:48:06] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:48:06] [INFO ] Deduced a trap composed of 137 places in 204 ms of which 0 ms to minimize.
[2022-05-16 16:48:06] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 0 ms to minimize.
[2022-05-16 16:48:07] [INFO ] Deduced a trap composed of 146 places in 200 ms of which 1 ms to minimize.
[2022-05-16 16:48:07] [INFO ] Deduced a trap composed of 137 places in 195 ms of which 0 ms to minimize.
[2022-05-16 16:48:07] [INFO ] Deduced a trap composed of 142 places in 194 ms of which 0 ms to minimize.
[2022-05-16 16:48:07] [INFO ] Deduced a trap composed of 142 places in 192 ms of which 1 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Deduced a trap composed of 141 places in 198 ms of which 1 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Deduced a trap composed of 147 places in 192 ms of which 0 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 0 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Deduced a trap composed of 147 places in 193 ms of which 1 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Deduced a trap composed of 147 places in 198 ms of which 0 ms to minimize.
[2022-05-16 16:48:08] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4408 ms
[2022-05-16 16:48:08] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 28 ms.
[2022-05-16 16:48:19] [INFO ] Added : 363 causal constraints over 73 iterations in 10914 ms. Result :sat
Minimization took 1600 ms.
[2022-05-16 16:48:21] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:21] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:22] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2022-05-16 16:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:48:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:22] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:22] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2022-05-16 16:48:22] [INFO ] [Nat]Added 74 Read/Feed constraints in 53 ms returned sat
[2022-05-16 16:48:22] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:48:22] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:48:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2022-05-16 16:48:23] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:48:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 467 ms
[2022-05-16 16:48:23] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 31 ms.
[2022-05-16 16:48:30] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2022-05-16 16:48:30] [INFO ] Deduced a trap composed of 139 places in 201 ms of which 1 ms to minimize.
[2022-05-16 16:48:31] [INFO ] Deduced a trap composed of 148 places in 200 ms of which 0 ms to minimize.
[2022-05-16 16:48:31] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 0 ms to minimize.
[2022-05-16 16:48:31] [INFO ] Deduced a trap composed of 150 places in 199 ms of which 0 ms to minimize.
[2022-05-16 16:48:31] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 1 ms to minimize.
[2022-05-16 16:48:32] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2022-05-16 16:48:32] [INFO ] Deduced a trap composed of 151 places in 186 ms of which 0 ms to minimize.
[2022-05-16 16:48:32] [INFO ] Deduced a trap composed of 139 places in 187 ms of which 1 ms to minimize.
[2022-05-16 16:48:33] [INFO ] Deduced a trap composed of 149 places in 183 ms of which 0 ms to minimize.
[2022-05-16 16:48:33] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2022-05-16 16:48:33] [INFO ] Deduced a trap composed of 142 places in 202 ms of which 1 ms to minimize.
[2022-05-16 16:48:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3370 ms
[2022-05-16 16:48:33] [INFO ] Added : 353 causal constraints over 71 iterations in 10616 ms. Result :sat
Minimization took 1384 ms.
[2022-05-16 16:48:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:35] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:35] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-05-16 16:48:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:48:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:35] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:35] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-16 16:48:35] [INFO ] [Nat]Added 74 Read/Feed constraints in 33 ms returned sat
[2022-05-16 16:48:35] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:48:35] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Deduced a trap composed of 68 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 1 ms to minimize.
[2022-05-16 16:48:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 595 ms
[2022-05-16 16:48:36] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 29 ms.
[2022-05-16 16:48:43] [INFO ] Added : 351 causal constraints over 71 iterations in 6698 ms. Result :sat
Minimization took 1886 ms.
[2022-05-16 16:48:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-16 16:48:45] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:45] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-16 16:48:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:48:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:48:45] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 25 ms returned sat
[2022-05-16 16:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:45] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-05-16 16:48:45] [INFO ] [Nat]Added 74 Read/Feed constraints in 24 ms returned sat
[2022-05-16 16:48:45] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2022-05-16 16:48:45] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:48:45] [INFO ] Deduced a trap composed of 57 places in 39 ms of which 0 ms to minimize.
[2022-05-16 16:48:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 220 ms
[2022-05-16 16:48:45] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 33 ms.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 0 ms to minimize.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:48:54] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:48:55] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2022-05-16 16:48:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2888 ms
[2022-05-16 16:48:56] [INFO ] Added : 348 causal constraints over 70 iterations in 11078 ms. Result :sat
Minimization took 2258 ms.
[2022-05-16 16:48:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:48:59] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 26 ms returned sat
[2022-05-16 16:48:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:59] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-05-16 16:48:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:48:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 16:48:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 24 ms returned sat
[2022-05-16 16:48:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:48:59] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-05-16 16:48:59] [INFO ] [Nat]Added 74 Read/Feed constraints in 111 ms returned sat
[2022-05-16 16:48:59] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 128 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 150 places in 98 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 136 places in 96 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 132 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 133 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:49:00] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 132 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 139 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 140 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:49:01] [INFO ] Deduced a trap composed of 144 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 0 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 152 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 130 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 139 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:49:02] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 1 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 153 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 141 places in 109 ms of which 1 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 127 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 136 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 135 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:03] [INFO ] Deduced a trap composed of 139 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 0 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 130 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 143 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 145 places in 110 ms of which 0 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 121 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:49:04] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 1 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 148 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 135 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 126 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 135 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:49:05] [INFO ] Deduced a trap composed of 134 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 134 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 125 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 138 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 146 places in 102 ms of which 1 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 140 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 135 places in 107 ms of which 1 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:49:06] [INFO ] Deduced a trap composed of 134 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 156 places in 105 ms of which 1 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 145 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 1 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 1 ms to minimize.
[2022-05-16 16:49:07] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 141 places in 101 ms of which 1 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 142 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 150 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 150 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 146 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 153 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 149 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:49:08] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 1 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 145 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 130 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 140 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 149 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 147 places in 101 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 152 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:09] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 0 ms to minimize.
[2022-05-16 16:49:10] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:10] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:10] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:49:10] [INFO ] Trap strengthening (SAT) tested/added 83/82 trap constraints in 10534 ms
[2022-05-16 16:49:10] [INFO ] Computed and/alt/rep : 376/2174/376 causal constraints (skipped 86 transitions) in 30 ms.
[2022-05-16 16:49:24] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 1 ms to minimize.
[2022-05-16 16:49:24] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2022-05-16 16:49:25] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 0 ms to minimize.
[2022-05-16 16:49:25] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 0 ms to minimize.
[2022-05-16 16:49:25] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 1 ms to minimize.
[2022-05-16 16:49:25] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2022-05-16 16:49:26] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 0 ms to minimize.
[2022-05-16 16:49:26] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2022-05-16 16:49:26] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:49:26] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-05-16 16:49:26] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:49:27] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:49:27] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2022-05-16 16:49:27] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2022-05-16 16:49:28] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2022-05-16 16:49:28] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-16 16:49:28] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 0 ms to minimize.
[2022-05-16 16:49:28] [INFO ] Deduced a trap composed of 117 places in 75 ms of which 0 ms to minimize.
[2022-05-16 16:49:28] [INFO ] Deduced a trap composed of 46 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 108 places in 79 ms of which 1 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 0 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 0 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 124 places in 79 ms of which 1 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:49:29] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 0 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 116 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 0 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 121 places in 69 ms of which 0 ms to minimize.
[2022-05-16 16:49:30] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 115 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 122 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 123 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:49:31] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 120 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 122 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 124 places in 73 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 121 places in 72 ms of which 1 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 124 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:49:32] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:49:33] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:49:33] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 8542 ms
[2022-05-16 16:49:33] [INFO ] Added : 365 causal constraints over 74 iterations in 22819 ms. Result :sat
Minimization took 1098 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 1441500 steps, including 223573 resets, run finished after 1662 ms. (steps per millisecond=867 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 25000868 steps, including 3768089 resets, run timeout after 30001 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 26039006 steps, including 4037727 resets, run timeout after 30001 ms. (steps per millisecond=867 ) properties (out of 14) seen :0
Interrupted Parikh walk after 25994350 steps, including 4031718 resets, run timeout after 30001 ms. (steps per millisecond=866 ) properties (out of 14) seen :0
Interrupted Parikh walk after 24592186 steps, including 3811821 resets, run timeout after 30001 ms. (steps per millisecond=819 ) properties (out of 14) seen :0
Incomplete Parikh walk after 11592400 steps, including 1797029 resets, run finished after 13369 ms. (steps per millisecond=867 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 24331835 steps, including 3773465 resets, run timeout after 30001 ms. (steps per millisecond=811 ) properties (out of 14) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 25893609 steps, including 4014363 resets, run timeout after 30001 ms. (steps per millisecond=863 ) properties (out of 14) seen :0
Support contains 14 out of 489 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 489/489 places, 463/463 transitions.
Applied a total of 0 rules in 17 ms. Remains 489 /489 variables (removed 0) and now considering 463/463 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 489/489 places, 463/463 transitions.
Starting structural reductions, iteration 0 : 489/489 places, 463/463 transitions.
Applied a total of 0 rules in 16 ms. Remains 489 /489 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 489 cols
[2022-05-16 16:52:49] [INFO ] Computed 100 place invariants in 44 ms
[2022-05-16 16:52:50] [INFO ] Implicit Places using invariants in 1462 ms returned [14, 20, 45, 51, 71, 76, 97, 102, 124, 130, 152, 158, 159, 181, 186, 207, 213, 220, 234, 239, 262, 268, 290, 295, 318, 323, 344, 350, 371, 376, 397, 399, 403, 423, 429, 452, 457, 461, 479, 487]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 1465 ms to find 40 implicit places.
[2022-05-16 16:52:50] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 463 rows 449 cols
[2022-05-16 16:52:50] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-16 16:52:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Starting structural reductions, iteration 1 : 449/489 places, 463/463 transitions.
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 449 transition count 445
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 36 place count 431 transition count 445
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 431 transition count 445
Applied a total of 37 rules in 67 ms. Remains 431 /449 variables (removed 18) and now considering 445/463 (removed 18) transitions.
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:52:51] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-16 16:52:51] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:52:51] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-16 16:52:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:52:54] [INFO ] Implicit Places using invariants and state equation in 2789 ms returned []
Implicit Place search using SMT with State Equation took 3045 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 431/489 places, 445/463 transitions.
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:52:54] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 1000000 steps, including 144257 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91412 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91368 resets, run finished after 649 ms. (steps per millisecond=1540 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91555 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91283 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91431 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91297 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91312 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91193 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91449 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91276 resets, run finished after 644 ms. (steps per millisecond=1552 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91528 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91797 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91597 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91783 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 14) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:53:04] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 16:53:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:04] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-05-16 16:53:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:04] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2022-05-16 16:53:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:53:05] [INFO ] [Nat]Added 74 Read/Feed constraints in 167 ms returned sat
[2022-05-16 16:53:05] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:53:05] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 1 ms to minimize.
[2022-05-16 16:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2022-05-16 16:53:05] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 28 ms.
[2022-05-16 16:53:12] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2022-05-16 16:53:12] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2022-05-16 16:53:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2022-05-16 16:53:12] [INFO ] Added : 292 causal constraints over 60 iterations in 7008 ms. Result :sat
Minimization took 3003 ms.
[2022-05-16 16:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:15] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-16 16:53:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:16] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2022-05-16 16:53:16] [INFO ] [Nat]Added 74 Read/Feed constraints in 105 ms returned sat
[2022-05-16 16:53:16] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:53:16] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2022-05-16 16:53:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2022-05-16 16:53:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2022-05-16 16:53:17] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 22 ms.
[2022-05-16 16:53:28] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:53:28] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 1 ms to minimize.
[2022-05-16 16:53:28] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:53:28] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:53:28] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2022-05-16 16:53:29] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:53:29] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1139 ms
[2022-05-16 16:53:29] [INFO ] Added : 321 causal constraints over 65 iterations in 12256 ms. Result :sat
Minimization took 628 ms.
[2022-05-16 16:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:30] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-16 16:53:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:30] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2022-05-16 16:53:30] [INFO ] [Nat]Added 74 Read/Feed constraints in 48 ms returned sat
[2022-05-16 16:53:30] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 28 ms.
[2022-05-16 16:53:43] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:53:43] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:53:43] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:53:43] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:53:43] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:53:44] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:53:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1200 ms
[2022-05-16 16:53:44] [INFO ] Added : 337 causal constraints over 68 iterations in 13369 ms. Result :sat
Minimization took 1456 ms.
[2022-05-16 16:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:45] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-05-16 16:53:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:46] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-05-16 16:53:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 215 ms returned sat
[2022-05-16 16:53:46] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:53:46] [INFO ] Deduced a trap composed of 124 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:53:46] [INFO ] Deduced a trap composed of 131 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:53:46] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:53:47] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:53:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 801 ms
[2022-05-16 16:53:47] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 26 ms.
[2022-05-16 16:53:50] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2022-05-16 16:53:50] [INFO ] Deduced a trap composed of 117 places in 155 ms of which 0 ms to minimize.
[2022-05-16 16:53:50] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 0 ms to minimize.
[2022-05-16 16:53:51] [INFO ] Deduced a trap composed of 116 places in 166 ms of which 0 ms to minimize.
[2022-05-16 16:53:51] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 1 ms to minimize.
[2022-05-16 16:53:51] [INFO ] Deduced a trap composed of 108 places in 169 ms of which 1 ms to minimize.
[2022-05-16 16:53:51] [INFO ] Deduced a trap composed of 116 places in 161 ms of which 0 ms to minimize.
[2022-05-16 16:53:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1581 ms
[2022-05-16 16:53:51] [INFO ] Added : 82 causal constraints over 17 iterations in 4859 ms. Result :sat
Minimization took 1728 ms.
[2022-05-16 16:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:53] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2022-05-16 16:53:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:53:54] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2022-05-16 16:53:54] [INFO ] [Nat]Added 74 Read/Feed constraints in 249 ms returned sat
[2022-05-16 16:53:54] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:53:54] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:53:55] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:53:56] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:53:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1510 ms
[2022-05-16 16:53:56] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 16:54:08] [INFO ] Added : 255 causal constraints over 51 iterations in 12719 ms. Result :sat
Minimization took 1839 ms.
[2022-05-16 16:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:11] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2022-05-16 16:54:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:11] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2022-05-16 16:54:11] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2022-05-16 16:54:11] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 16:54:21] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:54:22] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:54:22] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:54:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 642 ms
[2022-05-16 16:54:22] [INFO ] Added : 352 causal constraints over 71 iterations in 10798 ms. Result :sat
Minimization took 2642 ms.
[2022-05-16 16:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:25] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-16 16:54:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:26] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2022-05-16 16:54:26] [INFO ] [Nat]Added 74 Read/Feed constraints in 37 ms returned sat
[2022-05-16 16:54:26] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 25 ms.
[2022-05-16 16:54:33] [INFO ] Added : 307 causal constraints over 62 iterations in 7514 ms. Result :sat
Minimization took 3001 ms.
[2022-05-16 16:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:37] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-16 16:54:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:37] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-05-16 16:54:37] [INFO ] [Nat]Added 74 Read/Feed constraints in 177 ms returned sat
[2022-05-16 16:54:37] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 26 ms.
[2022-05-16 16:54:40] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 0 ms to minimize.
[2022-05-16 16:54:40] [INFO ] Deduced a trap composed of 122 places in 182 ms of which 1 ms to minimize.
[2022-05-16 16:54:41] [INFO ] Deduced a trap composed of 122 places in 176 ms of which 0 ms to minimize.
[2022-05-16 16:54:41] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 1 ms to minimize.
[2022-05-16 16:54:41] [INFO ] Deduced a trap composed of 122 places in 181 ms of which 0 ms to minimize.
[2022-05-16 16:54:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1112 ms
[2022-05-16 16:54:41] [INFO ] Added : 137 causal constraints over 29 iterations in 4270 ms. Result :sat
Minimization took 1836 ms.
[2022-05-16 16:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:44] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2022-05-16 16:54:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:54:44] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-05-16 16:54:44] [INFO ] [Nat]Added 74 Read/Feed constraints in 58 ms returned sat
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 0 ms to minimize.
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 112 places in 155 ms of which 1 ms to minimize.
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 124 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:54:45] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 125 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 0 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 0 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 0 ms to minimize.
[2022-05-16 16:54:46] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 1 ms to minimize.
[2022-05-16 16:54:47] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:54:48] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 120 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 127 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:54:49] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:54:50] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 119 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 1 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:54:51] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:54:52] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:54:53] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 121 places in 155 ms of which 0 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 121 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:54:54] [INFO ] Deduced a trap composed of 129 places in 156 ms of which 0 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 139 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 125 places in 157 ms of which 1 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 0 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 120 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 0 ms to minimize.
[2022-05-16 16:54:55] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 120 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:54:56] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 107 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 1 ms to minimize.
[2022-05-16 16:54:57] [INFO ] Deduced a trap composed of 125 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 126 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 118 places in 131 ms of which 1 ms to minimize.
[2022-05-16 16:54:58] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:54:59] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 136 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 1 ms to minimize.
[2022-05-16 16:55:00] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 130 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 142 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:55:01] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:55:02] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 1 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 139 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:55:03] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 140 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 139 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:55:04] [INFO ] Deduced a trap composed of 134 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 134 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 132 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 118 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:55:05] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 1 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 138 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 1 ms to minimize.
[2022-05-16 16:55:06] [INFO ] Trap strengthening (SAT) tested/added 136/135 trap constraints in 22004 ms
[2022-05-16 16:55:06] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 31 ms.
[2022-05-16 16:55:25] [INFO ] Added : 337 causal constraints over 68 iterations in 18724 ms. Result :sat
Minimization took 3001 ms.
[2022-05-16 16:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:28] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-05-16 16:55:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:29] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-05-16 16:55:29] [INFO ] [Nat]Added 74 Read/Feed constraints in 58 ms returned sat
[2022-05-16 16:55:29] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:55:29] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:55:30] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:55:30] [INFO ] Deduced a trap composed of 118 places in 170 ms of which 1 ms to minimize.
[2022-05-16 16:55:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 692 ms
[2022-05-16 16:55:30] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 27 ms.
[2022-05-16 16:55:43] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 0 ms to minimize.
[2022-05-16 16:55:43] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2022-05-16 16:55:43] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 1 ms to minimize.
[2022-05-16 16:55:43] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:55:44] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2022-05-16 16:55:44] [INFO ] Deduced a trap composed of 159 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:55:44] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:55:44] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:55:44] [INFO ] Deduced a trap composed of 151 places in 157 ms of which 1 ms to minimize.
[2022-05-16 16:55:45] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 0 ms to minimize.
[2022-05-16 16:55:45] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:55:45] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:55:45] [INFO ] Deduced a trap composed of 153 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:55:45] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2022-05-16 16:55:46] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:55:46] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:46] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:55:46] [INFO ] Deduced a trap composed of 133 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:55:47] [INFO ] Deduced a trap composed of 133 places in 141 ms of which 1 ms to minimize.
[2022-05-16 16:55:47] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 0 ms to minimize.
[2022-05-16 16:55:47] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:55:47] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:55:48] [INFO ] Deduced a trap composed of 146 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:55:48] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:55:48] [INFO ] Deduced a trap composed of 144 places in 154 ms of which 1 ms to minimize.
[2022-05-16 16:55:48] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 0 ms to minimize.
[2022-05-16 16:55:48] [INFO ] Deduced a trap composed of 146 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:55:49] [INFO ] Deduced a trap composed of 147 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:55:49] [INFO ] Deduced a trap composed of 152 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:49] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:55:49] [INFO ] Deduced a trap composed of 147 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:55:49] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:55:50] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:55:50] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 0 ms to minimize.
[2022-05-16 16:55:50] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:55:50] [INFO ] Deduced a trap composed of 138 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:55:50] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:55:51] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:55:51] [INFO ] Deduced a trap composed of 146 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:55:51] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:55:51] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:55:52] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:55:52] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:55:52] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:55:52] [INFO ] Deduced a trap composed of 45 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:55:52] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 0 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 0 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 0 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:55:53] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 0 ms to minimize.
[2022-05-16 16:55:54] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2022-05-16 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 11115 ms
[2022-05-16 16:55:54] [INFO ] Added : 350 causal constraints over 70 iterations in 24022 ms. Result :sat
Minimization took 3002 ms.
[2022-05-16 16:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:57] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2022-05-16 16:55:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:55:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:55:58] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-05-16 16:55:58] [INFO ] [Nat]Added 74 Read/Feed constraints in 19 ms returned sat
[2022-05-16 16:55:58] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:55:58] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:55:58] [INFO ] Deduced a trap composed of 119 places in 152 ms of which 1 ms to minimize.
[2022-05-16 16:55:58] [INFO ] Deduced a trap composed of 129 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:55:58] [INFO ] Deduced a trap composed of 120 places in 160 ms of which 0 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 1 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 0 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 1 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 0 ms to minimize.
[2022-05-16 16:55:59] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 1 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:56:00] [INFO ] Deduced a trap composed of 125 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 119 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:56:01] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3902 ms
[2022-05-16 16:56:02] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 16:56:15] [INFO ] Added : 342 causal constraints over 69 iterations in 13201 ms. Result :sat
Minimization took 3007 ms.
[2022-05-16 16:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:56:18] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2022-05-16 16:56:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:56:20] [INFO ] [Nat]Absence check using state equation in 1518 ms returned sat
[2022-05-16 16:56:20] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 58 places in 45 ms of which 0 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 0 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Deduced a trap composed of 53 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:56:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 625 ms
[2022-05-16 16:56:20] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 25 ms.
[2022-05-16 16:56:28] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 1 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-05-16 16:56:29] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 0 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 1 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 0 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1859 ms
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2022-05-16 16:56:30] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2022-05-16 16:56:31] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2022-05-16 16:56:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2022-05-16 16:56:31] [INFO ] Added : 322 causal constraints over 65 iterations in 10460 ms. Result :sat
Minimization took 2376 ms.
[2022-05-16 16:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:56:33] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2022-05-16 16:56:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:56:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:56:34] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-16 16:56:34] [INFO ] [Nat]Added 74 Read/Feed constraints in 17 ms returned sat
[2022-05-16 16:56:34] [INFO ] Deduced a trap composed of 115 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:56:34] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:56:34] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 130 places in 134 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:56:35] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 112 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:36] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 123 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:56:37] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 128 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:56:38] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 1 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 1 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 115 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:56:39] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 1 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 1 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 1 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:40] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:56:41] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 1 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 1 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:56:42] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 112 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:43] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 0 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:56:44] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 113 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:56:45] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 122 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 117 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2022-05-16 16:56:46] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 0 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 127 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 122 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 129 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:47] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 1 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 134 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:56:48] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 135 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 138 places in 135 ms of which 0 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 0 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:56:49] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 0 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 0 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:56:50] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:56:51] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:56:51] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 1 ms to minimize.
[2022-05-16 16:56:51] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:56:51] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 0 ms to minimize.
[2022-05-16 16:56:51] [INFO ] Deduced a trap composed of 117 places in 174 ms of which 1 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 0 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 119 places in 159 ms of which 0 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 0 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 109 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:56:52] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 0 ms to minimize.
[2022-05-16 16:56:53] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 0 ms to minimize.
[2022-05-16 16:56:53] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 0 ms to minimize.
[2022-05-16 16:56:53] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2022-05-16 16:56:53] [INFO ] Deduced a trap composed of 66 places in 48 ms of which 0 ms to minimize.
[2022-05-16 16:56:53] [INFO ] Trap strengthening (SAT) tested/added 121/120 trap constraints in 19090 ms
[2022-05-16 16:56:53] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 26 ms.
[2022-05-16 16:57:02] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2022-05-16 16:57:02] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2022-05-16 16:57:02] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-16 16:57:02] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2022-05-16 16:57:02] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 0 ms to minimize.
[2022-05-16 16:57:03] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-05-16 16:57:04] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 0 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 0 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 1 ms to minimize.
[2022-05-16 16:57:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3643 ms
[2022-05-16 16:57:05] [INFO ] Added : 342 causal constraints over 69 iterations in 12327 ms. Result :sat
Minimization took 3104 ms.
[2022-05-16 16:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:57:09] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-16 16:57:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:57:09] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2022-05-16 16:57:09] [INFO ] [Nat]Added 74 Read/Feed constraints in 157 ms returned sat
[2022-05-16 16:57:09] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 1 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:57:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1036 ms
[2022-05-16 16:57:10] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 28 ms.
[2022-05-16 16:57:19] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2022-05-16 16:57:20] [INFO ] Deduced a trap composed of 142 places in 162 ms of which 1 ms to minimize.
[2022-05-16 16:57:20] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2022-05-16 16:57:20] [INFO ] Deduced a trap composed of 136 places in 153 ms of which 0 ms to minimize.
[2022-05-16 16:57:20] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:21] [INFO ] Deduced a trap composed of 142 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:57:21] [INFO ] Deduced a trap composed of 129 places in 176 ms of which 0 ms to minimize.
[2022-05-16 16:57:21] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:57:21] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2022-05-16 16:57:21] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2022-05-16 16:57:22] [INFO ] Deduced a trap composed of 128 places in 159 ms of which 0 ms to minimize.
[2022-05-16 16:57:22] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2022-05-16 16:57:22] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2022-05-16 16:57:22] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2022-05-16 16:57:23] [INFO ] Deduced a trap composed of 127 places in 158 ms of which 0 ms to minimize.
[2022-05-16 16:57:23] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2022-05-16 16:57:23] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 1 ms to minimize.
[2022-05-16 16:57:23] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 1 ms to minimize.
[2022-05-16 16:57:23] [INFO ] Deduced a trap composed of 137 places in 176 ms of which 1 ms to minimize.
[2022-05-16 16:57:24] [INFO ] Deduced a trap composed of 136 places in 152 ms of which 0 ms to minimize.
[2022-05-16 16:57:24] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 0 ms to minimize.
[2022-05-16 16:57:24] [INFO ] Deduced a trap composed of 137 places in 155 ms of which 1 ms to minimize.
[2022-05-16 16:57:24] [INFO ] Deduced a trap composed of 125 places in 171 ms of which 0 ms to minimize.
[2022-05-16 16:57:24] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:25] [INFO ] Deduced a trap composed of 130 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:57:25] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 0 ms to minimize.
[2022-05-16 16:57:25] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:57:25] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:57:26] [INFO ] Deduced a trap composed of 106 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:57:26] [INFO ] Deduced a trap composed of 130 places in 152 ms of which 0 ms to minimize.
[2022-05-16 16:57:26] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 0 ms to minimize.
[2022-05-16 16:57:27] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:57:27] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:27] [INFO ] Deduced a trap composed of 126 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:27] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:28] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:28] [INFO ] Deduced a trap composed of 127 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:57:28] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 1 ms to minimize.
[2022-05-16 16:57:28] [INFO ] Deduced a trap composed of 135 places in 153 ms of which 1 ms to minimize.
[2022-05-16 16:57:29] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:57:29] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:57:29] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:57:29] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:57:30] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:30] [INFO ] Deduced a trap composed of 133 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:30] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:30] [INFO ] Deduced a trap composed of 132 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:57:31] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:31] [INFO ] Deduced a trap composed of 132 places in 149 ms of which 1 ms to minimize.
[2022-05-16 16:57:31] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:57:31] [INFO ] Deduced a trap composed of 129 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:57:32] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:57:32] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:32] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:32] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:32] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:57:33] [INFO ] Deduced a trap composed of 126 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:33] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:33] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:33] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 1 ms to minimize.
[2022-05-16 16:57:33] [INFO ] Deduced a trap composed of 36 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:57:34] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:34] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:34] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:34] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:57:35] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:35] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:57:35] [INFO ] Deduced a trap composed of 115 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:35] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:57:35] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:36] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:36] [INFO ] Deduced a trap composed of 132 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:57:36] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:57:37] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 1 ms to minimize.
[2022-05-16 16:57:37] [INFO ] Deduced a trap composed of 132 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:57:37] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:57:37] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:57:37] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:57:38] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 0 ms to minimize.
[2022-05-16 16:57:38] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:57:38] [INFO ] Deduced a trap composed of 139 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:57:38] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:57:38] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 0 ms to minimize.
[2022-05-16 16:57:39] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:57:39] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2022-05-16 16:57:39] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:39] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 0 ms to minimize.
[2022-05-16 16:57:40] [INFO ] Deduced a trap composed of 128 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:57:40] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:57:40] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:40] [INFO ] Deduced a trap composed of 139 places in 149 ms of which 1 ms to minimize.
[2022-05-16 16:57:40] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 0 ms to minimize.
[2022-05-16 16:57:41] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:41] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 0 ms to minimize.
[2022-05-16 16:57:41] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 1 ms to minimize.
[2022-05-16 16:57:41] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 1 ms to minimize.
[2022-05-16 16:57:42] [INFO ] Deduced a trap composed of 140 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:42] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:57:42] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:57:42] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 1 ms to minimize.
[2022-05-16 16:57:42] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:57:43] [INFO ] Deduced a trap composed of 133 places in 132 ms of which 1 ms to minimize.
[2022-05-16 16:57:43] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:57:43] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:57:43] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:57:43] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 1 ms to minimize.
[2022-05-16 16:57:44] [INFO ] Deduced a trap composed of 139 places in 148 ms of which 1 ms to minimize.
[2022-05-16 16:57:44] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:57:44] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 0 ms to minimize.
[2022-05-16 16:57:44] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 0 ms to minimize.
[2022-05-16 16:57:45] [INFO ] Deduced a trap composed of 119 places in 129 ms of which 1 ms to minimize.
[2022-05-16 16:57:45] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 0 ms to minimize.
[2022-05-16 16:57:45] [INFO ] Deduced a trap composed of 142 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:57:45] [INFO ] Deduced a trap composed of 135 places in 152 ms of which 2 ms to minimize.
[2022-05-16 16:57:46] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 0 ms to minimize.
[2022-05-16 16:57:47] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 1 ms to minimize.
[2022-05-16 16:57:47] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:57:47] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:57:47] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 1 ms to minimize.
[2022-05-16 16:57:47] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 1 ms to minimize.
[2022-05-16 16:57:48] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:57:48] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 0 ms to minimize.
[2022-05-16 16:57:48] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 0 ms to minimize.
[2022-05-16 16:57:48] [INFO ] Deduced a trap composed of 143 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:57:49] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:57:49] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 0 ms to minimize.
[2022-05-16 16:57:49] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 0 ms to minimize.
[2022-05-16 16:57:49] [INFO ] Deduced a trap composed of 133 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:57:50] [INFO ] Trap strengthening (SAT) tested/added 129/128 trap constraints in 30848 ms
[2022-05-16 16:57:50] [INFO ] Added : 314 causal constraints over 64 iterations in 39978 ms.(timeout) Result :sat
Minimization took 1190 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 701700 steps, including 117149 resets, run finished after 805 ms. (steps per millisecond=871 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 24720744 steps, including 4313432 resets, run timeout after 30001 ms. (steps per millisecond=823 ) properties (out of 14) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Interrupted Parikh walk after 26394828 steps, including 4604413 resets, run timeout after 30001 ms. (steps per millisecond=879 ) properties (out of 14) seen :0
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 14) seen :0 could not realise parikh vector
Incomplete Parikh walk after 278000 steps, including 46450 resets, run finished after 271 ms. (steps per millisecond=1025 ) properties (out of 14) seen :0 could not realise parikh vector
Support contains 14 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 431 /431 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 431/431 places, 445/445 transitions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 transitions.
Applied a total of 0 rules in 9 ms. Remains 431 /431 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:58:53] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 16:58:53] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:58:53] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 16:58:53] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:58:56] [INFO ] Implicit Places using invariants and state equation in 2892 ms returned []
Implicit Place search using SMT with State Equation took 3148 ms to find 0 implicit places.
[2022-05-16 16:58:56] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:58:56] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 16:58:56] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Finished structural reductions, in 1 iterations. Remains : 431/431 places, 445/445 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:58:56] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 929 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:58:56] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 16:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:58:57] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2022-05-16 16:58:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:58:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:58:57] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-05-16 16:58:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:58:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 163 ms returned sat
[2022-05-16 16:58:57] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 1 ms to minimize.
[2022-05-16 16:58:57] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2022-05-16 16:58:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2022-05-16 16:58:57] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 46 ms.
[2022-05-16 16:59:02] [INFO ] Added : 245 causal constraints over 49 iterations in 4183 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 2102100 steps, including 351309 resets, run finished after 2204 ms. (steps per millisecond=953 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 62 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 16:59:04] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144194 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91398 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 16:59:05] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-16 16:59:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:59:06] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2022-05-16 16:59:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:59:06] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-16 16:59:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 16:59:06] [INFO ] [Nat]Added 84 Read/Feed constraints in 85 ms returned sat
[2022-05-16 16:59:06] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 1 ms to minimize.
[2022-05-16 16:59:06] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2022-05-16 16:59:07] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 1 ms to minimize.
[2022-05-16 16:59:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 499 ms
[2022-05-16 16:59:07] [INFO ] Computed and/alt/rep : 321/2150/321 causal constraints (skipped 111 transitions) in 27 ms.
[2022-05-16 16:59:15] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:59:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1162 ms
[2022-05-16 16:59:16] [INFO ] Added : 301 causal constraints over 61 iterations in 9801 ms. Result :sat
Minimization took 2235 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 10 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 16:59:19] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-16 16:59:19] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 16:59:19] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-16 16:59:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 16:59:23] [INFO ] Implicit Places using invariants and state equation in 3556 ms returned []
Implicit Place search using SMT with State Equation took 3826 ms to find 0 implicit places.
[2022-05-16 16:59:23] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 16:59:23] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-16 16:59:23] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 26787 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:59:23] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 10000 steps, including 1452 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 901 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 16:59:23] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-16 16:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:59:23] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-16 16:59:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:59:24] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2022-05-16 16:59:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 16:59:24] [INFO ] [Nat]Added 74 Read/Feed constraints in 91 ms returned sat
[2022-05-16 16:59:24] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 0 ms to minimize.
[2022-05-16 16:59:24] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2022-05-16 16:59:24] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 0 ms to minimize.
[2022-05-16 16:59:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 453 ms
[2022-05-16 16:59:24] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 16:59:28] [INFO ] Added : 220 causal constraints over 44 iterations in 3725 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 30794657 steps, including 4954084 resets, run timeout after 30001 ms. (steps per millisecond=1026 ) properties (out of 1) seen :0
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 419 transition count 433
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 416 transition count 434
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 432
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 414 transition count 432
Applied a total of 37 rules in 44 ms. Remains 414 /431 variables (removed 17) and now considering 432/445 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 432/445 transitions.
// Phase 1: matrix 432 rows 414 cols
[2022-05-16 16:59:58] [INFO ] Invariants computation overflowed in 43 ms
Incomplete random walk after 1000000 steps, including 144312 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91236 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 1) seen :0
// Phase 1: matrix 432 rows 414 cols
[2022-05-16 17:00:00] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:00] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-05-16 17:00:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:00] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-16 17:00:00] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-16 17:00:00] [INFO ] [Nat]Added 83 Read/Feed constraints in 218 ms returned sat
[2022-05-16 17:00:01] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2022-05-16 17:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2022-05-16 17:00:01] [INFO ] Computed and/alt/rep : 323/2144/323 causal constraints (skipped 108 transitions) in 26 ms.
[2022-05-16 17:00:10] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:00:10] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:00:10] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:00:10] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:00:11] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:00:11] [INFO ] Deduced a trap composed of 128 places in 161 ms of which 1 ms to minimize.
[2022-05-16 17:00:11] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:00:11] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2022-05-16 17:00:11] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-05-16 17:00:12] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:00:12] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:00:12] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 1 ms to minimize.
[2022-05-16 17:00:12] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:00:12] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:00:13] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:00:13] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:00:13] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:00:13] [INFO ] Deduced a trap composed of 128 places in 134 ms of which 1 ms to minimize.
[2022-05-16 17:00:13] [INFO ] Deduced a trap composed of 137 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:00:14] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:14] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:00:14] [INFO ] Deduced a trap composed of 140 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:14] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 0 ms to minimize.
[2022-05-16 17:00:14] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:00:15] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:15] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:00:15] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:15] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:00:15] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:16] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:00:16] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:00:16] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:00:16] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:00:16] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 6741 ms
[2022-05-16 17:00:16] [INFO ] Added : 291 causal constraints over 59 iterations in 15790 ms. Result :sat
Minimization took 600 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 168600 steps, including 28233 resets, run finished after 147 ms. (steps per millisecond=1146 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 432/432 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 432/432 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 432/432 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 414 cols
[2022-05-16 17:00:17] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-16 17:00:18] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 432 rows 414 cols
[2022-05-16 17:00:18] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-16 17:00:18] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-05-16 17:00:21] [INFO ] Implicit Places using invariants and state equation in 3807 ms returned []
Implicit Place search using SMT with State Equation took 4124 ms to find 0 implicit places.
[2022-05-16 17:00:21] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 432 rows 414 cols
[2022-05-16 17:00:21] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-16 17:00:22] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 432/432 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 58814 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:00:22] [INFO ] Invariants computation overflowed in 22 ms
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 903 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:00:22] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-16 17:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:22] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-16 17:00:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:22] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-05-16 17:00:22] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:00:23] [INFO ] [Nat]Added 74 Read/Feed constraints in 51 ms returned sat
[2022-05-16 17:00:23] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 28 ms.
[2022-05-16 17:00:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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: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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 44 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:00:27] [INFO ] Invariants computation overflowed in 49 ms
Incomplete random walk after 1000000 steps, including 144245 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91580 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:00:28] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-16 17:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:29] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-16 17:00:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:00:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:00:29] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-16 17:00:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:00:29] [INFO ] [Nat]Added 85 Read/Feed constraints in 52 ms returned sat
[2022-05-16 17:00:29] [INFO ] Computed and/alt/rep : 321/2151/321 causal constraints (skipped 111 transitions) in 25 ms.
[2022-05-16 17:00:39] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:00:39] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 0 ms to minimize.
[2022-05-16 17:00:40] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 1 ms to minimize.
[2022-05-16 17:00:40] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:00:40] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 0 ms to minimize.
[2022-05-16 17:00:40] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:00:40] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:00:41] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 1 ms to minimize.
[2022-05-16 17:00:41] [INFO ] Deduced a trap composed of 141 places in 153 ms of which 0 ms to minimize.
[2022-05-16 17:00:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1929 ms
[2022-05-16 17:00:41] [INFO ] Added : 313 causal constraints over 63 iterations in 11648 ms. Result :sat
Minimization took 2674 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 27209386 steps, including 4747106 resets, run timeout after 30001 ms. (steps per millisecond=906 ) properties (out of 1) seen :0
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 11 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:01:14] [INFO ] Invariants computation overflowed in 56 ms
[2022-05-16 17:01:14] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:01:14] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-16 17:01:14] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:01:17] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 3415 ms to find 0 implicit places.
[2022-05-16 17:01:17] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:01:17] [INFO ] Invariants computation overflowed in 53 ms
[2022-05-16 17:01:17] [INFO ] Dead Transitions using invariants and state equation in 222 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 55761 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:01:17] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1482 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:01:17] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-16 17:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:18] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-16 17:01:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:18] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-16 17:01:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:01:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 218 ms returned sat
[2022-05-16 17:01:18] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:01:18] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:01:18] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:01:19] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:01:19] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:01:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 822 ms
[2022-05-16 17:01:19] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 17:01:22] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2022-05-16 17:01:22] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 1 ms to minimize.
[2022-05-16 17:01:23] [INFO ] Deduced a trap composed of 112 places in 213 ms of which 1 ms to minimize.
[2022-05-16 17:01:23] [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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 419 transition count 433
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 415 transition count 434
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 415 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 413 transition count 432
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 39 place count 413 transition count 432
Applied a total of 39 rules in 43 ms. Remains 413 /431 variables (removed 18) and now considering 432/445 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/431 places, 432/445 transitions.
// Phase 1: matrix 432 rows 413 cols
[2022-05-16 17:01:23] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144076 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91538 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
// Phase 1: matrix 432 rows 413 cols
[2022-05-16 17:01:24] [INFO ] Invariants computation overflowed in 36 ms
[2022-05-16 17:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:24] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-16 17:01:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:25] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2022-05-16 17:01:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:01:25] [INFO ] [Nat]Added 85 Read/Feed constraints in 129 ms returned sat
[2022-05-16 17:01:25] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:01:25] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:01:25] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 0 ms to minimize.
[2022-05-16 17:01:25] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:01:26] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:01:26] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 1 ms to minimize.
[2022-05-16 17:01:26] [INFO ] Deduced a trap composed of 116 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:01:26] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 1 ms to minimize.
[2022-05-16 17:01:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1272 ms
[2022-05-16 17:01:26] [INFO ] Computed and/alt/rep : 320/2150/320 causal constraints (skipped 111 transitions) in 25 ms.
[2022-05-16 17:01:40] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2022-05-16 17:01:40] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-16 17:01:40] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 0 ms to minimize.
[2022-05-16 17:01:40] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2022-05-16 17:01:40] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2022-05-16 17:01:41] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2022-05-16 17:01:41] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-16 17:01:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2146 ms
[2022-05-16 17:01:42] [INFO ] Added : 308 causal constraints over 62 iterations in 15966 ms. Result :sat
Minimization took 2693 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 119600 steps, including 20680 resets, run finished after 105 ms. (steps per millisecond=1139 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 413 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 413/413 places, 432/432 transitions.
Applied a total of 0 rules in 18 ms. Remains 413 /413 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 432/432 transitions.
Starting structural reductions, iteration 0 : 413/413 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 413 /413 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 413 cols
[2022-05-16 17:01:45] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-16 17:01:45] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 432 rows 413 cols
[2022-05-16 17:01:45] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-16 17:01:45] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:01:47] [INFO ] Implicit Places using invariants and state equation in 1829 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2022-05-16 17:01:47] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 432 rows 413 cols
[2022-05-16 17:01:47] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 17:01:47] [INFO ] Dead Transitions using invariants and state equation in 216 ms returned []
Finished structural reductions, in 1 iterations. Remains : 413/413 places, 432/432 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 29843 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:01:47] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1422 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 886 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:01:47] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 17:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:48] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-16 17:01:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:01:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:48] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2022-05-16 17:01:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:01:48] [INFO ] [Nat]Added 74 Read/Feed constraints in 237 ms returned sat
[2022-05-16 17:01:48] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 1 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 114 places in 149 ms of which 1 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:01:49] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:01:50] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:01:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1423 ms
[2022-05-16 17:01:50] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 26 ms.
[2022-05-16 17:01:53] [INFO ] Deduced a trap composed of 2 places in 186 ms of which 1 ms to minimize.
[2022-05-16 17:01: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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
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 430 transition count 442
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 6 place count 428 transition count 442
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 42 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:01:53] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 144325 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91103 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:01:54] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 17:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:55] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2022-05-16 17:01:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:01:55] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-05-16 17:01:55] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:01:55] [INFO ] [Nat]Added 85 Read/Feed constraints in 243 ms returned sat
[2022-05-16 17:01:55] [INFO ] Computed and/alt/rep : 321/2146/321 causal constraints (skipped 111 transitions) in 25 ms.
[2022-05-16 17:02:05] [INFO ] Added : 316 causal constraints over 65 iterations in 9944 ms. Result :sat
Minimization took 1404 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 149400 steps, including 26095 resets, run finished after 133 ms. (steps per millisecond=1123 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:02:07] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 17:02:07] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:02:07] [INFO ] Invariants computation overflowed in 23 ms
[2022-05-16 17:02:07] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:02:10] [INFO ] Implicit Places using invariants and state equation in 3287 ms returned []
Implicit Place search using SMT with State Equation took 3555 ms to find 0 implicit places.
[2022-05-16 17:02:10] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:02:10] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-16 17:02:10] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 23131 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:02:10] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1420 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:02:10] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 17:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:02:11] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2022-05-16 17:02:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:02:11] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2022-05-16 17:02:11] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:02:11] [INFO ] [Nat]Added 74 Read/Feed constraints in 21 ms returned sat
[2022-05-16 17:02:11] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 26 ms.
[2022-05-16 17:02:16] [INFO ] Added : 270 causal constraints over 54 iterations in 4507 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 29611182 steps, including 4950241 resets, run timeout after 30001 ms. (steps per millisecond=987 ) properties (out of 1) seen :0
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 42 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:02:46] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144461 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91338 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:02:47] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 17:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:02:48] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-05-16 17:02:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:02:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:02:48] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2022-05-16 17:02:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:02:48] [INFO ] [Nat]Added 84 Read/Feed constraints in 24 ms returned sat
[2022-05-16 17:02:48] [INFO ] Deduced a trap composed of 121 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:02:48] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:02:48] [INFO ] Deduced a trap composed of 119 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:02:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 504 ms
[2022-05-16 17:02:49] [INFO ] Computed and/alt/rep : 321/2145/321 causal constraints (skipped 111 transitions) in 25 ms.
[2022-05-16 17:02:58] [INFO ] Added : 271 causal constraints over 55 iterations in 9033 ms. Result :sat
Minimization took 2236 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 27932502 steps, including 4668123 resets, run timeout after 30001 ms. (steps per millisecond=931 ) properties (out of 1) seen :0
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:03:30] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-16 17:03:30] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:03:30] [INFO ] Invariants computation overflowed in 24 ms
[2022-05-16 17:03:30] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:03:34] [INFO ] Implicit Places using invariants and state equation in 3998 ms returned []
Implicit Place search using SMT with State Equation took 4273 ms to find 0 implicit places.
[2022-05-16 17:03:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:03:34] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-16 17:03:34] [INFO ] Dead Transitions using invariants and state equation in 170 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 83955 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:03:34] [INFO ] Invariants computation overflowed in 22 ms
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:03:34] [INFO ] Invariants computation overflowed in 22 ms
[2022-05-16 17:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:03:35] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-05-16 17:03:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:03:35] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2022-05-16 17:03:35] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:03:36] [INFO ] [Nat]Added 74 Read/Feed constraints in 40 ms returned sat
[2022-05-16 17:03:36] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 25 ms.
[2022-05-16 17:03:40] [INFO ] Added : 215 causal constraints over 43 iterations in 4130 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 29864486 steps, including 4991621 resets, run timeout after 30001 ms. (steps per millisecond=995 ) properties (out of 1) seen :0
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 416 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 415 transition count 434
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 415 transition count 434
Applied a total of 34 rules in 40 ms. Remains 415 /431 variables (removed 16) and now considering 434/445 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/431 places, 434/445 transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:04:10] [INFO ] Invariants computation overflowed in 47 ms
Incomplete random walk after 1000000 steps, including 143948 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91454 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:04:11] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-16 17:04:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:04:11] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-16 17:04:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:04:12] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2022-05-16 17:04:12] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:04:12] [INFO ] [Nat]Added 84 Read/Feed constraints in 34 ms returned sat
[2022-05-16 17:04:12] [INFO ] Computed and/alt/rep : 322/2146/322 causal constraints (skipped 111 transitions) in 25 ms.
[2022-05-16 17:04:24] [INFO ] Added : 270 causal constraints over 54 iterations in 12286 ms. Result :sat
Minimization took 1787 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 30904208 steps, including 5166460 resets, run timeout after 30001 ms. (steps per millisecond=1030 ) properties (out of 1) seen :0
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:04:56] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-16 17:04:56] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:04:56] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:04:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:04:59] [INFO ] Implicit Places using invariants and state equation in 3113 ms returned []
Implicit Place search using SMT with State Equation took 3398 ms to find 0 implicit places.
[2022-05-16 17:04:59] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:04:59] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-16 17:04:59] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 85205 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:04:59] [INFO ] Invariants computation overflowed in 23 ms
Incomplete random walk after 10000 steps, including 1474 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:05:00] [INFO ] Invariants computation overflowed in 29 ms
[2022-05-16 17:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:00] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 17:05:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:00] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-16 17:05:00] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:05:00] [INFO ] [Nat]Added 74 Read/Feed constraints in 165 ms returned sat
[2022-05-16 17:05:00] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 29 ms.
[2022-05-16 17:05:03] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 1 ms to minimize.
[2022-05-16 17:05:04] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 1 ms to minimize.
[2022-05-16 17:05:04] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 1 ms to minimize.
[2022-05-16 17:05:04] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 0 ms to minimize.
[2022-05-16 17:05:04] [INFO ] Deduced a trap composed of 122 places in 160 ms of which 0 ms to minimize.
[2022-05-16 17:05:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1022 ms
[2022-05-16 17:05:04] [INFO ] Added : 137 causal constraints over 29 iterations in 4096 ms. Result :sat
Minimization took 540 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 431 transition count 442
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 428 transition count 442
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 417 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 415 transition count 433
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 415 transition count 433
Applied a total of 35 rules in 46 ms. Remains 415 /431 variables (removed 16) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:05:05] [INFO ] Invariants computation overflowed in 42 ms
Incomplete random walk after 1000000 steps, including 144094 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91324 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:05:06] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-16 17:05:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:07] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2022-05-16 17:05:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:05:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:07] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-16 17:05:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-16 17:05:07] [INFO ] [Nat]Added 82 Read/Feed constraints in 233 ms returned sat
[2022-05-16 17:05:07] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:05:07] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 116 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 117 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 1 ms to minimize.
[2022-05-16 17:05:08] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 1 ms to minimize.
[2022-05-16 17:05:09] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:05:09] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:05:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1779 ms
[2022-05-16 17:05:09] [INFO ] Computed and/alt/rep : 324/2150/324 causal constraints (skipped 108 transitions) in 27 ms.
[2022-05-16 17:05:15] [INFO ] Added : 100 causal constraints over 20 iterations in 6437 ms. Result :sat
Minimization took 886 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 3357200 steps, including 546610 resets, run finished after 3480 ms. (steps per millisecond=964 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:05:20] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-16 17:05:20] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:05:20] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:05:20] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-05-16 17:05:24] [INFO ] Implicit Places using invariants and state equation in 3795 ms returned []
Implicit Place search using SMT with State Equation took 4070 ms to find 0 implicit places.
[2022-05-16 17:05:24] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:05:24] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-16 17:05:24] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 24502 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:05:24] [INFO ] Invariants computation overflowed in 22 ms
Incomplete random walk after 10000 steps, including 1441 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 936 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:05:24] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-16 17:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:25] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2022-05-16 17:05:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:25] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2022-05-16 17:05:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:05:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 59 ms returned sat
[2022-05-16 17:05:25] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 1 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:05:26] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 1 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 1 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:05:27] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 1 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:05:28] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 1 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:05:29] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:05:30] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:30] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:05:30] [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.verifyPossible(DeadlockTester.java:588)
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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 414 transition count 433
Applied a total of 36 rules in 43 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:05:30] [INFO ] Invariants computation overflowed in 48 ms
Incomplete random walk after 1000000 steps, including 144710 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91436 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:05:31] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-16 17:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:32] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2022-05-16 17:05:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:05:32] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-16 17:05:32] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:05:32] [INFO ] [Nat]Added 85 Read/Feed constraints in 25 ms returned sat
[2022-05-16 17:05:32] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 112 places in 160 ms of which 1 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:05:33] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 141 places in 128 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 140 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 144 places in 129 ms of which 1 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 0 ms to minimize.
[2022-05-16 17:05:34] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 0 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 133 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2022-05-16 17:05:35] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 0 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 131 places in 126 ms of which 0 ms to minimize.
[2022-05-16 17:05:36] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 1 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 0 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 127 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:05:37] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 1 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 0 ms to minimize.
[2022-05-16 17:05:38] [INFO ] Deduced a trap composed of 134 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 0 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 1 ms to minimize.
[2022-05-16 17:05:39] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 1 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 118 places in 137 ms of which 0 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:05:40] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 124 places in 137 ms of which 0 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 0 ms to minimize.
[2022-05-16 17:05:41] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:05:42] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:05:42] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 9378 ms
[2022-05-16 17:05:42] [INFO ] Computed and/alt/rep : 321/2141/321 causal constraints (skipped 111 transitions) in 26 ms.
[2022-05-16 17:05:52] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:05:52] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2022-05-16 17:05:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2022-05-16 17:05:52] [INFO ] Added : 302 causal constraints over 61 iterations in 10636 ms. Result :sat
Minimization took 1888 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 30705031 steps, including 4732126 resets, run timeout after 30001 ms. (steps per millisecond=1023 ) properties (out of 1) seen :0
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:06:24] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-16 17:06:25] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:06:25] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-16 17:06:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:06:28] [INFO ] Implicit Places using invariants and state equation in 3063 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
[2022-05-16 17:06:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:06:28] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-16 17:06:28] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 63858 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:06:28] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 10000 steps, including 1436 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:06:28] [INFO ] Invariants computation overflowed in 32 ms
[2022-05-16 17:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:06:28] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2022-05-16 17:06:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:06:29] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-05-16 17:06:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:06:29] [INFO ] [Nat]Added 74 Read/Feed constraints in 59 ms returned sat
[2022-05-16 17:06:29] [INFO ] Deduced a trap composed of 116 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:06:29] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:06:29] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:06:30] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:06:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 675 ms
[2022-05-16 17:06:30] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 25 ms.
[2022-05-16 17:06:33] [INFO ] Added : 185 causal constraints over 37 iterations in 3777 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 29177644 steps, including 4876725 resets, run timeout after 30001 ms. (steps per millisecond=972 ) properties (out of 1) seen :0
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
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 430 transition count 442
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 428 transition count 442
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 420 transition count 434
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 28 place count 417 transition count 434
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 417 transition count 432
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 415 transition count 432
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 415 transition count 432
Applied a total of 35 rules in 38 ms. Remains 415 /431 variables (removed 16) and now considering 432/445 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/431 places, 432/445 transitions.
// Phase 1: matrix 432 rows 415 cols
[2022-05-16 17:07:03] [INFO ] Invariants computation overflowed in 32 ms
Incomplete random walk after 1000000 steps, including 144297 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91282 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 1) seen :0
// Phase 1: matrix 432 rows 415 cols
[2022-05-16 17:07:05] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-16 17:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:05] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2022-05-16 17:07:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:07:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:06] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2022-05-16 17:07:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:07:06] [INFO ] [Nat]Added 84 Read/Feed constraints in 34 ms returned sat
[2022-05-16 17:07:06] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-16 17:07:06] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2022-05-16 17:07:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2022-05-16 17:07:06] [INFO ] Computed and/alt/rep : 327/2172/327 causal constraints (skipped 104 transitions) in 24 ms.
[2022-05-16 17:07:14] [INFO ] Added : 309 causal constraints over 62 iterations in 8514 ms. Result :sat
Minimization took 966 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 32566103 steps, including 5681542 resets, run timeout after 30001 ms. (steps per millisecond=1085 ) properties (out of 1) seen :0
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 432/432 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 432/432 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 432/432 (removed 0) transitions.
// Phase 1: matrix 432 rows 415 cols
[2022-05-16 17:07:45] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-16 17:07:46] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2022-05-16 17:07:46] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-16 17:07:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:07:48] [INFO ] Implicit Places using invariants and state equation in 2815 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
[2022-05-16 17:07:48] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 432 rows 415 cols
[2022-05-16 17:07:49] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:07:49] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 432/432 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 80854 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:07:49] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 10000 steps, including 1434 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 922 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:07:49] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-16 17:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:49] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-16 17:07:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:50] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2022-05-16 17:07:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:07:50] [INFO ] [Nat]Added 74 Read/Feed constraints in 19 ms returned sat
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 0 ms to minimize.
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 119 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:07:50] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 124 places in 179 ms of which 1 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:07:51] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:07:52] [INFO ] Deduced a trap composed of 116 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Deduced a trap composed of 123 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:07:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 3698 ms
[2022-05-16 17:07:53] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 28 ms.
[2022-05-16 17:07:54] [INFO ] Added : 15 causal constraints over 3 iterations in 940 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 416 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 415 transition count 434
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 415 transition count 434
Applied a total of 34 rules in 43 ms. Remains 415 /431 variables (removed 16) and now considering 434/445 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/431 places, 434/445 transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:07:54] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144221 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91316 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:07:56] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:56] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-16 17:07:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:07:56] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2022-05-16 17:07:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:07:56] [INFO ] [Nat]Added 84 Read/Feed constraints in 80 ms returned sat
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:07:57] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:07:58] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:07:58] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:07:58] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-05-16 17:07:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1492 ms
[2022-05-16 17:07:58] [INFO ] Computed and/alt/rep : 322/2135/322 causal constraints (skipped 111 transitions) in 28 ms.
[2022-05-16 17:08:09] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:09] [INFO ] Deduced a trap composed of 133 places in 126 ms of which 0 ms to minimize.
[2022-05-16 17:08:10] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:08:10] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:08:10] [INFO ] Deduced a trap composed of 127 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:08:10] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:08:10] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:08:11] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:12] [INFO ] Deduced a trap composed of 148 places in 153 ms of which 0 ms to minimize.
[2022-05-16 17:08:12] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:08:12] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 1 ms to minimize.
[2022-05-16 17:08:12] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:08:13] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:08:13] [INFO ] Deduced a trap composed of 33 places in 156 ms of which 0 ms to minimize.
[2022-05-16 17:08:13] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:08:13] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:08:14] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:08:14] [INFO ] Deduced a trap composed of 141 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:08:14] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:08:14] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:08:14] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:08:15] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:08:15] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:08:15] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:08:15] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:08:15] [INFO ] Deduced a trap composed of 145 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:08:16] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:08:16] [INFO ] Deduced a trap composed of 139 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:08:16] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:08:16] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:08:16] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:08:17] [INFO ] Deduced a trap composed of 128 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:17] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:08:17] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:17] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:08:17] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:08:18] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:08:18] [INFO ] Deduced a trap composed of 129 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:18] [INFO ] Deduced a trap composed of 142 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:08:18] [INFO ] Deduced a trap composed of 119 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:08:18] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:08:19] [INFO ] Deduced a trap composed of 141 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:08:19] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:08:19] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:08:19] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:19] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:08:20] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:08:20] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:08:20] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:08:20] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:08:20] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:08:21] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 0 ms to minimize.
[2022-05-16 17:08:21] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 0 ms to minimize.
[2022-05-16 17:08:21] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:08:21] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2022-05-16 17:08:21] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2022-05-16 17:08:22] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2022-05-16 17:08:22] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2022-05-16 17:08:22] [INFO ] Deduced a trap composed of 137 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:22] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:08:23] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 1 ms to minimize.
[2022-05-16 17:08:23] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 1 ms to minimize.
[2022-05-16 17:08:23] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:23] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2022-05-16 17:08:23] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 0 ms to minimize.
[2022-05-16 17:08:24] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 0 ms to minimize.
[2022-05-16 17:08:24] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:08:24] [INFO ] Deduced a trap composed of 140 places in 120 ms of which 1 ms to minimize.
[2022-05-16 17:08:24] [INFO ] Deduced a trap composed of 137 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:08:24] [INFO ] Deduced a trap composed of 143 places in 120 ms of which 1 ms to minimize.
[2022-05-16 17:08:25] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:08:25] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 1 ms to minimize.
[2022-05-16 17:08:25] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 1 ms to minimize.
[2022-05-16 17:08:25] [INFO ] Deduced a trap composed of 147 places in 136 ms of which 1 ms to minimize.
[2022-05-16 17:08:25] [INFO ] Deduced a trap composed of 145 places in 120 ms of which 0 ms to minimize.
[2022-05-16 17:08:26] [INFO ] Deduced a trap composed of 151 places in 121 ms of which 1 ms to minimize.
[2022-05-16 17:08:26] [INFO ] Deduced a trap composed of 145 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:26] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 0 ms to minimize.
[2022-05-16 17:08:26] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 1 ms to minimize.
[2022-05-16 17:08:26] [INFO ] Deduced a trap composed of 142 places in 121 ms of which 0 ms to minimize.
[2022-05-16 17:08:27] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:08:27] [INFO ] Deduced a trap composed of 151 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:08:27] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 0 ms to minimize.
[2022-05-16 17:08:27] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:08:27] [INFO ] Deduced a trap composed of 155 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:08:28] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:08:28] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 0 ms to minimize.
[2022-05-16 17:08:28] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2022-05-16 17:08:28] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 0 ms to minimize.
[2022-05-16 17:08:29] [INFO ] Deduced a trap composed of 135 places in 129 ms of which 0 ms to minimize.
[2022-05-16 17:08:29] [INFO ] Deduced a trap composed of 128 places in 125 ms of which 1 ms to minimize.
[2022-05-16 17:08:29] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:08:29] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 0 ms to minimize.
[2022-05-16 17:08:29] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 1 ms to minimize.
[2022-05-16 17:08:30] [INFO ] Deduced a trap composed of 141 places in 127 ms of which 1 ms to minimize.
[2022-05-16 17:08:30] [INFO ] Deduced a trap composed of 139 places in 125 ms of which 0 ms to minimize.
[2022-05-16 17:08:30] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 1 ms to minimize.
[2022-05-16 17:08:30] [INFO ] Deduced a trap composed of 131 places in 127 ms of which 1 ms to minimize.
[2022-05-16 17:08:30] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 1 ms to minimize.
[2022-05-16 17:08:31] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2022-05-16 17:08:31] [INFO ] Deduced a trap composed of 132 places in 122 ms of which 0 ms to minimize.
[2022-05-16 17:08:31] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:08:31] [INFO ] Deduced a trap composed of 136 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:08:31] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2022-05-16 17:08:32] [INFO ] Deduced a trap composed of 129 places in 133 ms of which 1 ms to minimize.
[2022-05-16 17:08:32] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:08:32] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 1 ms to minimize.
[2022-05-16 17:08:32] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 0 ms to minimize.
[2022-05-16 17:08:32] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 1 ms to minimize.
[2022-05-16 17:08:33] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 0 ms to minimize.
[2022-05-16 17:08:33] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2022-05-16 17:08:33] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2022-05-16 17:08:33] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 1 ms to minimize.
[2022-05-16 17:08:33] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2022-05-16 17:08:34] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:08:34] [INFO ] Deduced a trap composed of 129 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:08:34] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:08:35] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:08:35] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:08:35] [INFO ] Deduced a trap composed of 127 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:08:35] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 0 ms to minimize.
[2022-05-16 17:08:36] [INFO ] Deduced a trap composed of 128 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:08:36] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:08:37] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2022-05-16 17:08:37] [INFO ] Deduced a trap composed of 138 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:08:37] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:38] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:08:38] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2022-05-16 17:08:38] [INFO ] Deduced a trap composed of 134 places in 141 ms of which 1 ms to minimize.
[2022-05-16 17:08:38] [INFO ] Deduced a trap composed of 135 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:08:39] [INFO ] Deduced a trap composed of 130 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:08:39] [INFO ] Deduced a trap composed of 145 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:08:39] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:08:40] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:08:40] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2022-05-16 17:08:40] [INFO ] Deduced a trap composed of 139 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:08:40] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 1 ms to minimize.
[2022-05-16 17:08:41] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:08:41] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:08:41] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:08:41] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:08:41] [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 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 434/434 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:08:41] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-16 17:08:42] [INFO ] Implicit Places using invariants in 387 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:08:42] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-16 17:08:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:08:44] [INFO ] Implicit Places using invariants and state equation in 2739 ms returned []
Implicit Place search using SMT with State Equation took 3146 ms to find 0 implicit places.
[2022-05-16 17:08:44] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 434 rows 415 cols
[2022-05-16 17:08:44] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-16 17:08:45] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 55837 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:08:45] [INFO ] Invariants computation overflowed in 22 ms
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 881 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:08:45] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-16 17:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:08:45] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-16 17:08:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:08:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:08:46] [INFO ] [Nat]Absence check using state equation in 1506 ms returned sat
[2022-05-16 17:08:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:08:47] [INFO ] [Nat]Added 74 Read/Feed constraints in 15 ms returned sat
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2022-05-16 17:08:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 721 ms
[2022-05-16 17:08:47] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 22 ms.
[2022-05-16 17:08:50] [INFO ] Deduced a trap composed of 2 places in 183 ms of which 0 ms to minimize.
[2022-05-16 17:08:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 38 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:08:50] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 1000000 steps, including 144010 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91447 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:08:52] [INFO ] Invariants computation overflowed in 35 ms
[2022-05-16 17:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:08:52] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-05-16 17:08:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:08:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:08:52] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2022-05-16 17:08:52] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:08:52] [INFO ] [Nat]Added 85 Read/Feed constraints in 21 ms returned sat
[2022-05-16 17:08:52] [INFO ] Deduced a trap composed of 63 places in 44 ms of which 0 ms to minimize.
[2022-05-16 17:08:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-16 17:08:53] [INFO ] Computed and/alt/rep : 322/2152/322 causal constraints (skipped 110 transitions) in 25 ms.
[2022-05-16 17:09:04] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2022-05-16 17:09:04] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2022-05-16 17:09:04] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2022-05-16 17:09:05] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 1 ms to minimize.
[2022-05-16 17:09:05] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 1 ms to minimize.
[2022-05-16 17:09:05] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2022-05-16 17:09:05] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2022-05-16 17:09:05] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2022-05-16 17:09:06] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 1 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 0 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 0 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 0 ms to minimize.
[2022-05-16 17:09:07] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 0 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 0 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 0 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 0 ms to minimize.
[2022-05-16 17:09:08] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 0 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 0 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Deduced a trap composed of 49 places in 50 ms of which 0 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 0 ms to minimize.
[2022-05-16 17:09:09] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5193 ms
[2022-05-16 17:09:09] [INFO ] Added : 322 causal constraints over 65 iterations in 16818 ms. Result :sat
Minimization took 2313 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 30798511 steps, including 5371581 resets, run timeout after 30001 ms. (steps per millisecond=1026 ) properties (out of 1) seen :0
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 8 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:09:42] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-16 17:09:42] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:09:42] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-16 17:09:42] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:09:45] [INFO ] Implicit Places using invariants and state equation in 2709 ms returned []
Implicit Place search using SMT with State Equation took 2999 ms to find 0 implicit places.
[2022-05-16 17:09:45] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:09:45] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-16 17:09:45] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 60347 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:09:45] [INFO ] Invariants computation overflowed in 23 ms
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:09:45] [INFO ] Invariants computation overflowed in 28 ms
[2022-05-16 17:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:09:45] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-16 17:09:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:09:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:09:46] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2022-05-16 17:09:46] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:09:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 15 ms returned sat
[2022-05-16 17:09:46] [INFO ] Deduced a trap composed of 115 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:09:46] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 0 ms to minimize.
[2022-05-16 17:09:46] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 1 ms to minimize.
[2022-05-16 17:09:46] [INFO ] Deduced a trap composed of 130 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:09:46] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 0 ms to minimize.
[2022-05-16 17:09:47] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 0 ms to minimize.
[2022-05-16 17:09:47] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:09:47] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:09:47] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:09:47] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 115 places in 185 ms of which 1 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 0 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 117 places in 151 ms of which 1 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 0 ms to minimize.
[2022-05-16 17:09:48] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 1 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 123 places in 146 ms of which 1 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 0 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 0 ms to minimize.
[2022-05-16 17:09:49] [INFO ] Deduced a trap composed of 120 places in 150 ms of which 1 ms to minimize.
[2022-05-16 17:09:50] [INFO ] Deduced a trap composed of 128 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:09:50] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:09:50] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:09:50] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:09:50] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:09:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:588)
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 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
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 430 transition count 442
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 6 place count 428 transition count 442
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 417 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 415 transition count 433
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 415 transition count 433
Applied a total of 35 rules in 38 ms. Remains 415 /431 variables (removed 16) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:09:50] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 143889 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91335 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:09:52] [INFO ] Invariants computation overflowed in 33 ms
[2022-05-16 17:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:09:52] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-16 17:09:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:09:52] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-16 17:09:52] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:09:52] [INFO ] [Nat]Added 85 Read/Feed constraints in 23 ms returned sat
[2022-05-16 17:09:52] [INFO ] Computed and/alt/rep : 323/2150/323 causal constraints (skipped 109 transitions) in 25 ms.
[2022-05-16 17:10:00] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2022-05-16 17:10:00] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 0 ms to minimize.
[2022-05-16 17:10:00] [INFO ] Deduced a trap composed of 118 places in 158 ms of which 0 ms to minimize.
[2022-05-16 17:10:01] [INFO ] Deduced a trap composed of 16 places in 155 ms of which 0 ms to minimize.
[2022-05-16 17:10:01] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 0 ms to minimize.
[2022-05-16 17:10:01] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 0 ms to minimize.
[2022-05-16 17:10:01] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 0 ms to minimize.
[2022-05-16 17:10:02] [INFO ] Deduced a trap composed of 132 places in 157 ms of which 1 ms to minimize.
[2022-05-16 17:10:02] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 1 ms to minimize.
[2022-05-16 17:10:02] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 0 ms to minimize.
[2022-05-16 17:10:02] [INFO ] Deduced a trap composed of 136 places in 154 ms of which 0 ms to minimize.
[2022-05-16 17:10:02] [INFO ] Deduced a trap composed of 135 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:10:03] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:10:03] [INFO ] Deduced a trap composed of 128 places in 151 ms of which 0 ms to minimize.
[2022-05-16 17:10:03] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 0 ms to minimize.
[2022-05-16 17:10:03] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:10:04] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 0 ms to minimize.
[2022-05-16 17:10:04] [INFO ] Deduced a trap composed of 121 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:10:04] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 0 ms to minimize.
[2022-05-16 17:10:04] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 0 ms to minimize.
[2022-05-16 17:10:04] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 1 ms to minimize.
[2022-05-16 17:10:05] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 1 ms to minimize.
[2022-05-16 17:10:05] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 1 ms to minimize.
[2022-05-16 17:10:05] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:10:05] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 1 ms to minimize.
[2022-05-16 17:10:05] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 1 ms to minimize.
[2022-05-16 17:10:06] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 0 ms to minimize.
[2022-05-16 17:10:06] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:10:06] [INFO ] Deduced a trap composed of 140 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:10:06] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 0 ms to minimize.
[2022-05-16 17:10:07] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 1 ms to minimize.
[2022-05-16 17:10:07] [INFO ] Deduced a trap composed of 129 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:10:07] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:10:07] [INFO ] Deduced a trap composed of 27 places in 132 ms of which 0 ms to minimize.
[2022-05-16 17:10:07] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 1 ms to minimize.
[2022-05-16 17:10:08] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:10:08] [INFO ] Deduced a trap composed of 134 places in 149 ms of which 1 ms to minimize.
[2022-05-16 17:10:08] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 0 ms to minimize.
[2022-05-16 17:10:08] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 0 ms to minimize.
[2022-05-16 17:10:08] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 1 ms to minimize.
[2022-05-16 17:10:09] [INFO ] Deduced a trap composed of 119 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:10:09] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 0 ms to minimize.
[2022-05-16 17:10:09] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:10:09] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 0 ms to minimize.
[2022-05-16 17:10:09] [INFO ] Deduced a trap composed of 116 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:10:10] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:10:10] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 0 ms to minimize.
[2022-05-16 17:10:10] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 0 ms to minimize.
[2022-05-16 17:10:10] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 0 ms to minimize.
[2022-05-16 17:10:10] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 1 ms to minimize.
[2022-05-16 17:10:11] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 0 ms to minimize.
[2022-05-16 17:10:11] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:10:11] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 1 ms to minimize.
[2022-05-16 17:10:11] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 0 ms to minimize.
[2022-05-16 17:10:11] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 11437 ms
[2022-05-16 17:10:11] [INFO ] Added : 301 causal constraints over 61 iterations in 19035 ms. Result :sat
Minimization took 2291 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:10:14] [INFO ] Invariants computation overflowed in 30 ms
[2022-05-16 17:10:14] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:10:14] [INFO ] Invariants computation overflowed in 25 ms
[2022-05-16 17:10:14] [INFO ] State equation strengthened by 85 read => feed constraints.
[2022-05-16 17:10:17] [INFO ] Implicit Places using invariants and state equation in 2782 ms returned []
Implicit Place search using SMT with State Equation took 3097 ms to find 0 implicit places.
[2022-05-16 17:10:17] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2022-05-16 17:10:17] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-16 17:10:17] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 32155 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:10:17] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 10000 steps, including 1428 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 431 cols
[2022-05-16 17:10:17] [INFO ] Invariants computation overflowed in 31 ms
[2022-05-16 17:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:10:17] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-05-16 17:10:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:10:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:10:18] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-16 17:10:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-16 17:10:18] [INFO ] [Nat]Added 74 Read/Feed constraints in 152 ms returned sat
[2022-05-16 17:10:18] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 0 ms to minimize.
[2022-05-16 17:10:18] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:10:18] [INFO ] Deduced a trap composed of 114 places in 153 ms of which 0 ms to minimize.
[2022-05-16 17:10:19] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2022-05-16 17:10:19] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2022-05-16 17:10:19] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:10:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1022 ms
[2022-05-16 17:10:19] [INFO ] Computed and/alt/rep : 352/2172/352 causal constraints (skipped 92 transitions) in 24 ms.
[2022-05-16 17:10:22] [INFO ] Added : 150 causal constraints over 30 iterations in 3514 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 30038312 steps, including 5021005 resets, run timeout after 30001 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
Support contains 1 out of 431 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 431/431 places, 445/445 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 431 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 430 transition count 444
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 430 transition count 441
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 8 place count 427 transition count 441
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 22 place count 420 transition count 434
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
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 30 place count 416 transition count 435
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 416 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 34 place count 414 transition count 433
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 414 transition count 433
Applied a total of 37 rules in 36 ms. Remains 414 /431 variables (removed 17) and now considering 433/445 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/431 places, 433/445 transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:10:53] [INFO ] Invariants computation overflowed in 42 ms
Incomplete random walk after 1000000 steps, including 143944 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91339 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:10:54] [INFO ] Invariants computation overflowed in 34 ms
[2022-05-16 17:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:10:54] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-16 17:10:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:10:55] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2022-05-16 17:10:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:10:55] [INFO ] [Nat]Added 84 Read/Feed constraints in 141 ms returned sat
[2022-05-16 17:10:55] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2022-05-16 17:10:55] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2022-05-16 17:10:55] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 1 ms to minimize.
[2022-05-16 17:10:55] [INFO ] Deduced a trap composed of 113 places in 180 ms of which 1 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 0 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 108 places in 165 ms of which 0 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 0 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:10:56] [INFO ] Deduced a trap composed of 126 places in 150 ms of which 1 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 1 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 117 places in 148 ms of which 0 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 122 places in 154 ms of which 1 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 115 places in 142 ms of which 0 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 1 ms to minimize.
[2022-05-16 17:10:57] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 0 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 137 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 124 places in 177 ms of which 1 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 123 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 0 ms to minimize.
[2022-05-16 17:10:58] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 0 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 0 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 134 places in 166 ms of which 0 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 1 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 118 places in 150 ms of which 1 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 129 places in 151 ms of which 1 ms to minimize.
[2022-05-16 17:10:59] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 0 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 119 places in 149 ms of which 1 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 0 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 0 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 0 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 0 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Deduced a trap composed of 124 places in 153 ms of which 1 ms to minimize.
[2022-05-16 17:11:00] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 5805 ms
[2022-05-16 17:11:00] [INFO ] Computed and/alt/rep : 321/2150/321 causal constraints (skipped 111 transitions) in 29 ms.
[2022-05-16 17:11:12] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2022-05-16 17:11:13] [INFO ] Deduced a trap composed of 142 places in 131 ms of which 1 ms to minimize.
[2022-05-16 17:11:13] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 0 ms to minimize.
[2022-05-16 17:11:13] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 1 ms to minimize.
[2022-05-16 17:11:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 831 ms
[2022-05-16 17:11:13] [INFO ] Added : 319 causal constraints over 65 iterations in 12620 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 15 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Starting structural reductions, iteration 0 : 414/414 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 414 /414 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:11:16] [INFO ] Invariants computation overflowed in 26 ms
[2022-05-16 17:11:16] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:11:16] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-16 17:11:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-05-16 17:11:19] [INFO ] Implicit Places using invariants and state equation in 2737 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2022-05-16 17:11:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 433 rows 414 cols
[2022-05-16 17:11:19] [INFO ] Invariants computation overflowed in 27 ms
[2022-05-16 17:11:19] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 414/414 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 62423 ms.
[2022-05-16 17:11:20] [INFO ] Flatten gal took : 189 ms
[2022-05-16 17:11:20] [INFO ] Applying decomposition
[2022-05-16 17:11:20] [INFO ] Flatten gal took : 50 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/graph9653025511295857374.txt, -o, /tmp/graph9653025511295857374.bin, -w, /tmp/graph9653025511295857374.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/graph9653025511295857374.bin, -l, -1, -v, -w, /tmp/graph9653025511295857374.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 17:11:20] [INFO ] Decomposing Gal with order
[2022-05-16 17:11:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:11:20] [INFO ] Removed a total of 218 redundant transitions.
[2022-05-16 17:11:21] [INFO ] Flatten gal took : 160 ms
[2022-05-16 17:11:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 52 ms.
[2022-05-16 17:11:21] [INFO ] Time to serialize gal into /tmp/UpperBounds9029488103234408116.gal : 41 ms
[2022-05-16 17:11:21] [INFO ] Time to serialize properties into /tmp/UpperBounds6869513766738868592.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/UpperBounds9029488103234408116.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6869513766738868592.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/UpperBounds9029488103234408116.gal -t CGAL -reachable-file /tmp/UpperBounds6869513766738868592.prop --nowitness
Loading property file /tmp/UpperBounds6869513766738868592.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-020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DoubleExponent-PT-020, 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 r089-tall-165260117600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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