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.r078-tall-165260110000197.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 itstools
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110000197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.9K Apr 29 13:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 13:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 29 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 29 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 169K May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652643136800

Running Version 202205111006
[2022-05-15 19:32:17] [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-15 19:32:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:32:18] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-05-15 19:32:18] [INFO ] Transformed 534 places.
[2022-05-15 19:32:18] [INFO ] Transformed 498 transitions.
[2022-05-15 19:32:18] [INFO ] Parsed PT model containing 534 places and 498 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 498 rows 534 cols
[2022-05-15 19:32:18] [INFO ] Computed 54 place invariants in 86 ms
FORMULA DoubleExponent-PT-010-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 327 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :4
FORMULA DoubleExponent-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 14) seen :3
// Phase 1: matrix 498 rows 534 cols
[2022-05-15 19:32:18] [INFO ] Computed 54 place invariants in 42 ms
[2022-05-15 19:32:18] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2022-05-15 19:32:18] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2022-05-15 19:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:18] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2022-05-15 19:32:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-15 19:32:19] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:19] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-05-15 19:32:19] [INFO ] Deduced a trap composed of 216 places in 180 ms of which 7 ms to minimize.
[2022-05-15 19:32:19] [INFO ] Deduced a trap composed of 206 places in 156 ms of which 2 ms to minimize.
[2022-05-15 19:32:19] [INFO ] Deduced a trap composed of 221 places in 158 ms of which 1 ms to minimize.
[2022-05-15 19:32:20] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 1 ms to minimize.
[2022-05-15 19:32:20] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 2 ms to minimize.
[2022-05-15 19:32:20] [INFO ] Deduced a trap composed of 214 places in 146 ms of which 1 ms to minimize.
[2022-05-15 19:32:20] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 1 ms to minimize.
[2022-05-15 19:32:20] [INFO ] Deduced a trap composed of 202 places in 139 ms of which 1 ms to minimize.
[2022-05-15 19:32:21] [INFO ] Deduced a trap composed of 193 places in 145 ms of which 1 ms to minimize.
[2022-05-15 19:32:21] [INFO ] Deduced a trap composed of 230 places in 163 ms of which 1 ms to minimize.
[2022-05-15 19:32:21] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 0 ms to minimize.
[2022-05-15 19:32:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2108 ms
[2022-05-15 19:32:21] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-15 19:32:24] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2022-05-15 19:32:24] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:32:24] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-15 19:32:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:24] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-05-15 19:32:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-15 19:32:24] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:25] [INFO ] [Nat]Absence check using state equation in 467 ms returned sat
[2022-05-15 19:32:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-15 19:32:29] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2022-05-15 19:32:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:32:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:30] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-15 19:32:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-15 19:32:30] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:30] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-15 19:32:30] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-15 19:32:34] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:32:34] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2022-05-15 19:32:34] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 0 ms to minimize.
[2022-05-15 19:32:34] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2022-05-15 19:32:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 597 ms
[2022-05-15 19:32:34] [INFO ] Added : 358 causal constraints over 72 iterations in 4405 ms. Result :sat
Minimization took 304 ms.
[2022-05-15 19:32:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-15 19:32:35] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:35] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-05-15 19:32:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:35] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:35] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-05-15 19:32:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-15 19:32:40] [INFO ] Added : 355 causal constraints over 71 iterations in 4433 ms. Result :sat
Minimization took 278 ms.
[2022-05-15 19:32:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:40] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:40] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-15 19:32:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:40] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned sat
[2022-05-15 19:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:41] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2022-05-15 19:32:41] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 1 ms to minimize.
[2022-05-15 19:32:41] [INFO ] Deduced a trap composed of 120 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:32:41] [INFO ] Deduced a trap composed of 120 places in 81 ms of which 1 ms to minimize.
[2022-05-15 19:32:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 347 ms
[2022-05-15 19:32:41] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-15 19:32:45] [INFO ] Added : 400 causal constraints over 80 iterations in 4373 ms. Result :unknown
[2022-05-15 19:32:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:45] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:45] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2022-05-15 19:32:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:46] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:46] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-05-15 19:32:46] [INFO ] Deduced a trap composed of 216 places in 130 ms of which 0 ms to minimize.
[2022-05-15 19:32:46] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2022-05-15 19:32:46] [INFO ] Deduced a trap composed of 167 places in 108 ms of which 1 ms to minimize.
[2022-05-15 19:32:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 513 ms
[2022-05-15 19:32:46] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-15 19:32:47] [INFO ] Added : 103 causal constraints over 21 iterations in 831 ms. Result :sat
Minimization took 264 ms.
[2022-05-15 19:32:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:47] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:48] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-05-15 19:32:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:48] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2022-05-15 19:32:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:48] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2022-05-15 19:32:48] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-15 19:32:53] [INFO ] Added : 460 causal constraints over 92 iterations in 4672 ms. Result :unknown
[2022-05-15 19:32:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 13 ms returned unsat
[2022-05-15 19:32:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:53] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-15 19:32:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:53] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:53] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-15 19:32:54] [INFO ] Deduced a trap composed of 203 places in 125 ms of which 0 ms to minimize.
[2022-05-15 19:32:54] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 1 ms to minimize.
[2022-05-15 19:32:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2022-05-15 19:32:54] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-15 19:32:58] [INFO ] Added : 400 causal constraints over 80 iterations in 4381 ms. Result :unknown
[2022-05-15 19:32:58] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:58] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:58] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2022-05-15 19:32:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:32:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:32:58] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:32:59] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2022-05-15 19:32:59] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2022-05-15 19:32:59] [INFO ] Deduced a trap composed of 205 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:32:59] [INFO ] Deduced a trap composed of 219 places in 138 ms of which 1 ms to minimize.
[2022-05-15 19:32:59] [INFO ] Deduced a trap composed of 194 places in 132 ms of which 0 ms to minimize.
[2022-05-15 19:32:59] [INFO ] Deduced a trap composed of 217 places in 132 ms of which 1 ms to minimize.
[2022-05-15 19:33:00] [INFO ] Deduced a trap composed of 232 places in 136 ms of which 0 ms to minimize.
[2022-05-15 19:33:00] [INFO ] Deduced a trap composed of 231 places in 134 ms of which 1 ms to minimize.
[2022-05-15 19:33:00] [INFO ] Deduced a trap composed of 220 places in 129 ms of which 1 ms to minimize.
[2022-05-15 19:33:00] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 1 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 187 places in 126 ms of which 1 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 245 places in 125 ms of which 1 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 189 places in 131 ms of which 1 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 196 places in 137 ms of which 0 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 212 places in 130 ms of which 0 ms to minimize.
[2022-05-15 19:33:01] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 1 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 210 places in 128 ms of which 1 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 225 places in 129 ms of which 1 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 209 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:33:02] [INFO ] Deduced a trap composed of 209 places in 130 ms of which 1 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 231 places in 133 ms of which 0 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 225 places in 128 ms of which 0 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 206 places in 129 ms of which 1 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 232 places in 131 ms of which 1 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 226 places in 128 ms of which 1 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 220 places in 142 ms of which 1 ms to minimize.
[2022-05-15 19:33:03] [INFO ] Deduced a trap composed of 205 places in 134 ms of which 1 ms to minimize.
[2022-05-15 19:33: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:33:04] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:04] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:04] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-15 19:33:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:33:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-15 19:33:04] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:04] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-05-15 19:33:04] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-15 19:33:09] [INFO ] Added : 365 causal constraints over 73 iterations in 4643 ms. Result :unknown
[2022-05-15 19:33:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:09] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:09] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-05-15 19:33:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:33:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:09] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2022-05-15 19:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:09] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2022-05-15 19:33:09] [INFO ] Deduced a trap composed of 166 places in 115 ms of which 1 ms to minimize.
[2022-05-15 19:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2022-05-15 19:33:10] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-15 19:33:12] [INFO ] Added : 179 causal constraints over 36 iterations in 2445 ms. Result :sat
Minimization took 737 ms.
[2022-05-15 19:33:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:13] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:13] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-15 19:33:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:33:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:13] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 14 ms returned sat
[2022-05-15 19:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:13] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-05-15 19:33:13] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2022-05-15 19:33:18] [INFO ] Deduced a trap composed of 189 places in 133 ms of which 1 ms to minimize.
[2022-05-15 19:33:18] [INFO ] Deduced a trap composed of 206 places in 131 ms of which 1 ms to minimize.
[2022-05-15 19:33:18] [INFO ] Deduced a trap composed of 202 places in 131 ms of which 1 ms to minimize.
[2022-05-15 19:33:18] [INFO ] Deduced a trap composed of 225 places in 126 ms of which 0 ms to minimize.
[2022-05-15 19:33:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:33:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:18] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2022-05-15 19:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:18] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2022-05-15 19:33:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:33:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-15 19:33:19] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2022-05-15 19:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:33:19] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-15 19:33:19] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-15 19:33: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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 8, -1, 2, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 534 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 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 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 527 transition count 385
Reduce places removed 111 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 115 rules applied. Total rules applied 230 place count 416 transition count 381
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 234 place count 412 transition count 381
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 234 place count 412 transition count 362
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 272 place count 393 transition count 362
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 3 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 444 place count 307 transition count 276
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 474 place count 292 transition count 276
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 475 place count 292 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 476 place count 291 transition count 275
Free-agglomeration rule (complex) applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 519 place count 291 transition count 232
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 562 place count 248 transition count 232
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 5 with 34 rules applied. Total rules applied 596 place count 248 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 597 place count 247 transition count 231
Applied a total of 597 rules in 154 ms. Remains 247 /534 variables (removed 287) and now considering 231/498 (removed 267) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/534 places, 231/498 transitions.
// Phase 1: matrix 231 rows 247 cols
[2022-05-15 19:34:04] [INFO ] Computed 50 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 109677 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70635 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70461 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70339 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70462 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70279 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70128 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70328 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70554 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70377 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70404 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70377 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70305 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 12) seen :2
// Phase 1: matrix 231 rows 247 cols
[2022-05-15 19:34:11] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-15 19:34:12] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-05-15 19:34:12] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:12] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2022-05-15 19:34:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:12] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:12] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-15 19:34:12] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:34:12] [INFO ] [Nat]Added 32 Read/Feed constraints in 38 ms returned sat
[2022-05-15 19:34:12] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 16 ms.
[2022-05-15 19:34:13] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2022-05-15 19:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-15 19:34:13] [INFO ] Added : 124 causal constraints over 25 iterations in 986 ms. Result :sat
Minimization took 253 ms.
[2022-05-15 19:34:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 19:34:13] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-05-15 19:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:13] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:34:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:13] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-05-15 19:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:13] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-15 19:34:13] [INFO ] [Nat]Added 32 Read/Feed constraints in 82 ms returned sat
[2022-05-15 19:34:14] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 18 ms.
[2022-05-15 19:34:14] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:34:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 816 ms
[2022-05-15 19:34:15] [INFO ] Added : 141 causal constraints over 29 iterations in 1694 ms. Result :sat
Minimization took 285 ms.
[2022-05-15 19:34:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-05-15 19:34:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:16] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:34:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:16] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-05-15 19:34:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:16] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-15 19:34:16] [INFO ] [Nat]Added 32 Read/Feed constraints in 92 ms returned sat
[2022-05-15 19:34:16] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 1 ms to minimize.
[2022-05-15 19:34:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-15 19:34:16] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 17 ms.
[2022-05-15 19:34:17] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2022-05-15 19:34:17] [INFO ] Added : 99 causal constraints over 20 iterations in 763 ms. Result :sat
Minimization took 176 ms.
[2022-05-15 19:34:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:17] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:34:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:17] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-15 19:34:17] [INFO ] [Nat]Added 32 Read/Feed constraints in 69 ms returned sat
[2022-05-15 19:34:17] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-15 19:34:18] [INFO ] Added : 135 causal constraints over 27 iterations in 1146 ms. Result :sat
Minimization took 278 ms.
[2022-05-15 19:34:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:19] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:19] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2022-05-15 19:34:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:19] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:19] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-15 19:34:19] [INFO ] [Nat]Added 32 Read/Feed constraints in 210 ms returned sat
[2022-05-15 19:34:19] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-15 19:34:19] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-15 19:34:21] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:34:21] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:34:22] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:34:22] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2022-05-15 19:34:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 377 ms
[2022-05-15 19:34:22] [INFO ] Added : 157 causal constraints over 34 iterations in 2429 ms. Result :sat
Minimization took 314 ms.
[2022-05-15 19:34:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:22] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-15 19:34:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:22] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-15 19:34:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 107 ms returned sat
[2022-05-15 19:34:23] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 13 ms.
[2022-05-15 19:34:24] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 1 ms to minimize.
[2022-05-15 19:34:24] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:34:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 231 ms
[2022-05-15 19:34:24] [INFO ] Added : 142 causal constraints over 29 iterations in 1230 ms. Result :sat
Minimization took 256 ms.
[2022-05-15 19:34:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:24] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:24] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-15 19:34:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:24] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2022-05-15 19:34:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:24] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-15 19:34:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 46 ms returned sat
[2022-05-15 19:34:24] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-15 19:34:26] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2022-05-15 19:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2022-05-15 19:34:26] [INFO ] Added : 150 causal constraints over 31 iterations in 1451 ms. Result :sat
Minimization took 224 ms.
[2022-05-15 19:34:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:26] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:26] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 19:34:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:26] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:26] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-15 19:34:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 8 ms returned sat
[2022-05-15 19:34:26] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 0 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 0 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 0 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:34:27] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 0 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 0 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 0 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2022-05-15 19:34:28] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2022-05-15 19:34:29] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 0 ms to minimize.
[2022-05-15 19:34:29] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
[2022-05-15 19:34:29] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:34:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2554 ms
[2022-05-15 19:34:29] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 18 ms.
[2022-05-15 19:34:29] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2022-05-15 19:34:29] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2022-05-15 19:34:30] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:34:30] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:30] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2022-05-15 19:34:30] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 1 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:31] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 1 ms to minimize.
[2022-05-15 19:34:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:32] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:34:32] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:34] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 0 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 1 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 1 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 87 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:35] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:34:36] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:37] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:34:38] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:39] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:39] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:34:39] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:34:40] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 87 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:41] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 79 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 77 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
[2022-05-15 19:34:42] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 1 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:43] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 0 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 0 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 80 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:44] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:34:45] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:34:46] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:47] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:34:48] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 84 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 86 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 83 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 86 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 87 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:34:49] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:50] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:51] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:52] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 78 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 0 ms to minimize.
[2022-05-15 19:34:53] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 86 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:34:54] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:34:55] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:34:56] [INFO ] Trap strengthening (SAT) tested/added 197/196 trap constraints in 26494 ms
[2022-05-15 19:34:56] [INFO ] Added : 50 causal constraints over 11 iterations in 27364 ms.(timeout) Result :sat
Minimization took 3004 ms.
[2022-05-15 19:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:59] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:59] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-15 19:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:34:59] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:34:59] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-15 19:35:00] [INFO ] [Nat]Added 32 Read/Feed constraints in 241 ms returned sat
[2022-05-15 19:35:00] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 25 ms.
[2022-05-15 19:35:01] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2022-05-15 19:35:01] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2022-05-15 19:35:01] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-05-15 19:35:01] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2022-05-15 19:35:01] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2022-05-15 19:35:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 409 ms
[2022-05-15 19:35:01] [INFO ] Added : 141 causal constraints over 29 iterations in 1608 ms. Result :sat
Minimization took 203 ms.
[2022-05-15 19:35:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:02] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 8 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:02] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-15 19:35:02] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2022-05-15 19:35:02] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-15 19:35:02] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2022-05-15 19:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2022-05-15 19:35:02] [INFO ] Added : 51 causal constraints over 11 iterations in 498 ms. Result :sat
Minimization took 118 ms.
[2022-05-15 19:35:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 19:35:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2022-05-15 19:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-15 19:35:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:35:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2022-05-15 19:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:03] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-15 19:35:03] [INFO ] [Nat]Added 32 Read/Feed constraints in 24 ms returned sat
[2022-05-15 19:35:03] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 14 ms.
[2022-05-15 19:35:04] [INFO ] Added : 124 causal constraints over 26 iterations in 914 ms. Result :sat
Minimization took 197 ms.
[2022-05-15 19:35:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-15 19:35:04] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 9 ms returned sat
[2022-05-15 19:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:04] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 19:35:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-15 19:35:04] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 10 ms returned sat
[2022-05-15 19:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:04] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-15 19:35:04] [INFO ] [Nat]Added 32 Read/Feed constraints in 88 ms returned sat
[2022-05-15 19:35:04] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 0 ms to minimize.
[2022-05-15 19:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2022-05-15 19:35:04] [INFO ] Computed and/alt/rep : 198/1065/198 causal constraints (skipped 32 transitions) in 13 ms.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2022-05-15 19:35:06] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2022-05-15 19:35:07] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2022-05-15 19:35:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 807 ms
[2022-05-15 19:35:07] [INFO ] Added : 132 causal constraints over 27 iterations in 2195 ms. Result :sat
Minimization took 252 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 8, -1, 2, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0]
Support contains 12 out of 247 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 247/247 places, 231/231 transitions.
Applied a total of 0 rules in 11 ms. Remains 247 /247 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 247/247 places, 231/231 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 247/247 places, 231/231 transitions.
Applied a total of 0 rules in 11 ms. Remains 247 /247 variables (removed 0) and now considering 231/231 (removed 0) transitions.
// Phase 1: matrix 231 rows 247 cols
[2022-05-15 19:35:37] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-15 19:35:37] [INFO ] Implicit Places using invariants in 324 ms returned [20, 26, 46, 51, 72, 77, 100, 107, 129, 134, 135, 155, 160, 184, 191, 198, 206, 212, 238, 244]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 327 ms to find 20 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 227/247 places, 231/231 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 226 transition count 230
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 226 transition count 225
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 12 place count 221 transition count 225
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 221 transition count 225
Applied a total of 16 rules in 42 ms. Remains 221 /227 variables (removed 6) and now considering 225/231 (removed 6) transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:35:37] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:35:37] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:35:37] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:35:37] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:35:38] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 221/247 places, 225/231 transitions.
Finished structural reductions, in 2 iterations. Remains : 221/247 places, 225/231 transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:35:38] [INFO ] Computed 31 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 109825 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70485 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70471 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70504 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70420 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70296 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70466 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70440 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70248 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70414 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70230 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70424 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 1000000 steps, including 70402 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 12) seen :2
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:35:46] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:35:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:46] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-05-15 19:35:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:35:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:46] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-05-15 19:35:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:35:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 255 ms returned sat
[2022-05-15 19:35:46] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 13 ms.
[2022-05-15 19:35:47] [INFO ] Added : 104 causal constraints over 22 iterations in 745 ms. Result :sat
Minimization took 188 ms.
[2022-05-15 19:35:47] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:47] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:47] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-15 19:35:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:47] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:48] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-05-15 19:35:48] [INFO ] [Nat]Added 32 Read/Feed constraints in 52 ms returned sat
[2022-05-15 19:35:48] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:35:49] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:35:49] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:35:49] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:35:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2022-05-15 19:35:49] [INFO ] Added : 126 causal constraints over 26 iterations in 1053 ms. Result :sat
Minimization took 329 ms.
[2022-05-15 19:35:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:49] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2022-05-15 19:35:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:49] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-05-15 19:35:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 64 ms returned sat
[2022-05-15 19:35:50] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:35:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 648 ms
[2022-05-15 19:35:51] [INFO ] Added : 130 causal constraints over 26 iterations in 1683 ms. Result :sat
Minimization took 158 ms.
[2022-05-15 19:35:51] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:51] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:35:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 19:35:52] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:52] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-15 19:35:52] [INFO ] [Nat]Added 32 Read/Feed constraints in 142 ms returned sat
[2022-05-15 19:35:52] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:35:53] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-15 19:35:53] [INFO ] Added : 121 causal constraints over 27 iterations in 1051 ms. Result :sat
Minimization took 339 ms.
[2022-05-15 19:35:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:53] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:35:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:35:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 19:35:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:53] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-15 19:35:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 82 ms returned sat
[2022-05-15 19:35:54] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-15 19:35:54] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-05-15 19:35:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 525 ms
[2022-05-15 19:35:56] [INFO ] Added : 146 causal constraints over 31 iterations in 1896 ms. Result :sat
Minimization took 268 ms.
[2022-05-15 19:35:56] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-15 19:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:56] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-15 19:35:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:35:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-15 19:35:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 130 ms returned sat
[2022-05-15 19:35:56] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:35:57] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2022-05-15 19:35:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-05-15 19:35:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:35:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 261 ms
[2022-05-15 19:35:57] [INFO ] Added : 134 causal constraints over 27 iterations in 1197 ms. Result :sat
Minimization took 222 ms.
[2022-05-15 19:35:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:35:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:58] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-15 19:35:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:35:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:35:58] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 19:35:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:35:58] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-15 19:35:58] [INFO ] [Nat]Added 32 Read/Feed constraints in 71 ms returned sat
[2022-05-15 19:35:58] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:36:00] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:36:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2022-05-15 19:36:00] [INFO ] Added : 187 causal constraints over 38 iterations in 1907 ms. Result :sat
Minimization took 700 ms.
[2022-05-15 19:36:01] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:01] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:01] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-15 19:36:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:36:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:01] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-15 19:36:01] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
[2022-05-15 19:36:01] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:36:01] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:36:01] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2022-05-15 19:36:01] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:36:01] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:36:02] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:03] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2098 ms
[2022-05-15 19:36:03] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 10 ms.
[2022-05-15 19:36:03] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 0 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2022-05-15 19:36:04] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 89 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:05] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:06] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 93 places in 66 ms of which 1 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 101 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:07] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:08] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 98 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:09] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 100 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:10] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 99 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 100 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:11] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 92 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:12] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 100 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:36:13] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:14] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 89 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:15] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 91 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:16] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:17] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 96 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 2 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:18] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 97 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 88 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 93 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 97 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:19] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 94 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:20] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:21] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 87 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:22] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 101 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:23] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:36:24] [INFO ] Deduced a trap composed of 101 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 76 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 86 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:25] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:26] [INFO ] Deduced a trap composed of 87 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:26] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:26] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 103 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 102 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 105 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 94 places in 52 ms of which 1 ms to minimize.
[2022-05-15 19:36:27] [INFO ] Deduced a trap composed of 106 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 94 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:28] [INFO ] Deduced a trap composed of 97 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 95 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 98 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:29] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 99 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:36:30] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 98 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 101 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 101 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 99 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:31] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 102 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 95 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 88 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 98 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:32] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 105 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 95 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:33] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:34] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 90 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:35] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 91 places in 74 ms of which 1 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 99 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:36:36] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:36:37] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 90 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 91 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:38] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 91 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:39] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:40] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 94 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 89 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 93 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:41] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 91 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:36:42] [INFO ] Deduced a trap composed of 105 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 95 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:43] [INFO ] Deduced a trap composed of 93 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:36:44] [INFO ] Deduced a trap composed of 99 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:44] [INFO ] Deduced a trap composed of 106 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:44] [INFO ] Deduced a trap composed of 98 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:36:44] [INFO ] Deduced a trap composed of 100 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:45] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2022-05-15 19:36:45] [INFO ] Deduced a trap composed of 99 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:36:45] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:36:45] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:36:45] [INFO ] Deduced a trap composed of 94 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:46] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:36:46] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:36:46] [INFO ] Deduced a trap composed of 95 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:36:46] [INFO ] Trap strengthening (SAT) tested/added 401/401 trap constraints in 42406 ms
[2022-05-15 19:36:46] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:36:46] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-15 19:36:46] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:46] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:46] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-15 19:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:36:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:46] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:46] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2022-05-15 19:36:46] [INFO ] [Nat]Added 32 Read/Feed constraints in 143 ms returned sat
[2022-05-15 19:36:46] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:36:48] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:36:48] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-05-15 19:36:48] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:36:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-05-15 19:36:48] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-15 19:36:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 405 ms
[2022-05-15 19:36:49] [INFO ] Added : 157 causal constraints over 33 iterations in 2080 ms. Result :sat
Minimization took 548 ms.
[2022-05-15 19:36:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:36:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:49] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-15 19:36:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:36:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:36:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:49] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-15 19:36:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 21 ms returned sat
[2022-05-15 19:36:49] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:36:50] [INFO ] Added : 75 causal constraints over 16 iterations in 502 ms. Result :sat
Minimization took 349 ms.
[2022-05-15 19:36:50] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:36:50] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:50] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-15 19:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:36:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:36:50] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:50] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-15 19:36:51] [INFO ] [Nat]Added 32 Read/Feed constraints in 43 ms returned sat
[2022-05-15 19:36:51] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:36:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-15 19:36:51] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 14 ms.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2022-05-15 19:36:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 651 ms
[2022-05-15 19:36:52] [INFO ] Added : 116 causal constraints over 24 iterations in 1669 ms. Result :sat
Minimization took 161 ms.
[2022-05-15 19:36:52] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:53] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-15 19:36:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:36:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:36:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:36:53] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2022-05-15 19:36:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 67 ms returned sat
[2022-05-15 19:36:53] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:36:54] [INFO ] Added : 173 causal constraints over 35 iterations in 1525 ms. Result :sat
Minimization took 539 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 3, -1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0]
Support contains 12 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 221 /221 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 225/225 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 transitions.
Applied a total of 0 rules in 7 ms. Remains 221 /221 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:30] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:37:30] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:30] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:37:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:37:31] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1503 ms to find 0 implicit places.
[2022-05-15 19:37:31] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:31] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:37:31] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 225/225 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:31] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 1093 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 704 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:31] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:37:32] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:32] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:32] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-15 19:37:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:32] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:32] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2022-05-15 19:37:32] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:37:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 241 ms returned sat
[2022-05-15 19:37:32] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:37:33] [INFO ] Added : 104 causal constraints over 22 iterations in 732 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 47 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:34] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 143763 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91494 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:35] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-15 19:37:35] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:37:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:35] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-15 19:37:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:37:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2022-05-15 19:37:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:35] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-05-15 19:37:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:37:35] [INFO ] [Nat]Added 41 Read/Feed constraints in 51 ms returned sat
[2022-05-15 19:37:35] [INFO ] Computed and/alt/rep : 168/1076/168 causal constraints (skipped 42 transitions) in 11 ms.
[2022-05-15 19:37:36] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:37:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:37:37] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:37:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2022-05-15 19:37:37] [INFO ] Added : 136 causal constraints over 28 iterations in 1501 ms. Result :sat
Minimization took 238 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:37] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:37:37] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:37] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:37:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:37:39] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1540 ms to find 0 implicit places.
[2022-05-15 19:37:39] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:39] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:37:39] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 7503 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:39] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1092 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 702 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:39] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:37:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:39] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:39] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-15 19:37:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:39] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:39] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-15 19:37:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:37:39] [INFO ] [Nat]Added 32 Read/Feed constraints in 59 ms returned sat
[2022-05-15 19:37:39] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 17 ms.
[2022-05-15 19:37:40] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:37:40] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:37:40] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:37:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 275 ms
[2022-05-15 19:37:40] [INFO ] Added : 126 causal constraints over 26 iterations in 1012 ms. Result :sat
Minimization took 329 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 210 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 41 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 202 transition count 209
Applied a total of 42 rules in 65 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:37:42] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144300 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91581 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:37:43] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:37:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:37:43] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 19:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:43] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 19:37:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:37:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:43] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-15 19:37:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:37:43] [INFO ] [Nat]Added 42 Read/Feed constraints in 66 ms returned sat
[2022-05-15 19:37:43] [INFO ] Computed and/alt/rep : 163/1044/163 causal constraints (skipped 45 transitions) in 10 ms.
[2022-05-15 19:37:44] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2022-05-15 19:37:44] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2022-05-15 19:37:44] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2022-05-15 19:37:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 193 ms
[2022-05-15 19:37:44] [INFO ] Added : 137 causal constraints over 28 iterations in 998 ms. Result :sat
Minimization took 477 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:37:47] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:37:47] [INFO ] Implicit Places using invariants in 140 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:37:47] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:37:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:37:48] [INFO ] Implicit Places using invariants and state equation in 1097 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2022-05-15 19:37:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:37:48] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:37:48] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 9502 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:48] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1103 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 705 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:48] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:37:49] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:49] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2022-05-15 19:37:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:49] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-05-15 19:37:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:37:49] [INFO ] [Nat]Added 32 Read/Feed constraints in 65 ms returned sat
[2022-05-15 19:37:49] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:37:50] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:37:51] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:37:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 651 ms
[2022-05-15 19:37:51] [INFO ] Added : 130 causal constraints over 26 iterations in 1707 ms. Result :sat
Minimization took 158 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 35 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:51] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144208 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91356 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:52] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-15 19:37:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:37:52] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:52] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-15 19:37:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:37:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:53] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:37:53] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:37:53] [INFO ] [Nat]Added 41 Read/Feed constraints in 57 ms returned sat
[2022-05-15 19:37:53] [INFO ] Computed and/alt/rep : 166/1051/166 causal constraints (skipped 44 transitions) in 10 ms.
[2022-05-15 19:37:53] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:37:54] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:55] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:37:56] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 2501 ms
[2022-05-15 19:37:56] [INFO ] Added : 110 causal constraints over 23 iterations in 3346 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:57] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:37:57] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:57] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:37:57] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:37:58] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
[2022-05-15 19:37:58] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:37:58] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:37:58] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 9590 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-03
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:58] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1087 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 701 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:37:58] [INFO ] Computed 31 place invariants in 13 ms
[2022-05-15 19:37:58] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:37:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:58] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 19:37:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:37:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2022-05-15 19:37:58] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:37:58] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-15 19:37:58] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:37:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 142 ms returned sat
[2022-05-15 19:37:59] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:38:00] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-15 19:38:00] [INFO ] Added : 121 causal constraints over 27 iterations in 1093 ms. Result :sat
Minimization took 337 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 210 transition count 211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 34 place count 204 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 40 place count 204 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 203 transition count 210
Applied a total of 41 rules in 38 ms. Remains 203 /221 variables (removed 18) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:38:00] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144346 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91320 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:38:02] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:38:02] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:02] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:02] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 19:38:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:38:02] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:02] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-15 19:38:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:02] [INFO ] [Nat]Added 41 Read/Feed constraints in 53 ms returned sat
[2022-05-15 19:38:02] [INFO ] Computed and/alt/rep : 166/1064/166 causal constraints (skipped 43 transitions) in 11 ms.
[2022-05-15 19:38:03] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:38:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-15 19:38:03] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:38:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2022-05-15 19:38:03] [INFO ] Added : 102 causal constraints over 21 iterations in 1193 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:38:04] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:38:04] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:38:04] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:38:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:05] [INFO ] Implicit Places using invariants and state equation in 1252 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2022-05-15 19:38:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:38:05] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:38:05] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-03 in 7342 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:05] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1079 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 697 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:05] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:38:05] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:38:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:06] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-15 19:38:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:06] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2022-05-15 19:38:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:38:06] [INFO ] [Nat]Added 32 Read/Feed constraints in 81 ms returned sat
[2022-05-15 19:38:06] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 0 ms to minimize.
[2022-05-15 19:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-15 19:38:06] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:38:07] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:38:07] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:38:07] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2022-05-15 19:38:07] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:38:08] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-05-15 19:38:08] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-05-15 19:38:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 517 ms
[2022-05-15 19:38:08] [INFO ] Added : 146 causal constraints over 31 iterations in 1899 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 221 transition count 224
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 28 place count 211 transition count 210
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 202 transition count 209
Applied a total of 43 rules in 30 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:38:09] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144153 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91267 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:38:10] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:38:10] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:38:10] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:10] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-05-15 19:38:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:10] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:10] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-15 19:38:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:38:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 100 ms returned sat
[2022-05-15 19:38:11] [INFO ] Computed and/alt/rep : 164/1062/164 causal constraints (skipped 44 transitions) in 10 ms.
[2022-05-15 19:38:12] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:38:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-05-15 19:38:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2022-05-15 19:38:12] [INFO ] Added : 149 causal constraints over 31 iterations in 1841 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 4 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:38:13] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:38:13] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:38:13] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:38:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:38:14] [INFO ] Implicit Places using invariants and state equation in 1247 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2022-05-15 19:38:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:38:14] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:38:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 9152 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:15] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1094 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 702 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:15] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:38:15] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:15] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:15] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-15 19:38:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:15] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:38:15] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:15] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2022-05-15 19:38:15] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:38:15] [INFO ] [Nat]Added 32 Read/Feed constraints in 129 ms returned sat
[2022-05-15 19:38:15] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:38:16] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-05-15 19:38:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:38:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-05-15 19:38:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 241 ms
[2022-05-15 19:38:16] [INFO ] Added : 134 causal constraints over 27 iterations in 1188 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 37 place count 205 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 204 transition count 211
Applied a total of 38 rules in 30 ms. Remains 204 /221 variables (removed 17) and now considering 211/225 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 211/225 transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:38:26] [INFO ] Computed 31 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 144261 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91404 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:38:27] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-15 19:38:27] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:28] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:38:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:28] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:28] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2022-05-15 19:38:28] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:28] [INFO ] [Nat]Added 41 Read/Feed constraints in 78 ms returned sat
[2022-05-15 19:38:28] [INFO ] Computed and/alt/rep : 167/1065/167 causal constraints (skipped 43 transitions) in 11 ms.
[2022-05-15 19:38:29] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:38:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-15 19:38:29] [INFO ] Added : 132 causal constraints over 28 iterations in 1265 ms. Result :sat
Minimization took 245 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 211/211 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:38:32] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:38:32] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:38:32] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:38:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:34] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1561 ms to find 0 implicit places.
[2022-05-15 19:38:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 211 rows 204 cols
[2022-05-15 19:38:34] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:38:34] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 211/211 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 19208 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:34] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1100 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 698 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:34] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:38:34] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:34] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:34] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:38:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:38:34] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:34] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:38:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:38:34] [INFO ] [Nat]Added 32 Read/Feed constraints in 70 ms returned sat
[2022-05-15 19:38:34] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:38:36] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:38:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-15 19:38:36] [INFO ] Added : 187 causal constraints over 38 iterations in 1931 ms. Result :sat
Minimization took 695 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 25 place count 211 transition count 213
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 30 place count 206 transition count 213
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 36 place count 206 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 205 transition count 212
Applied a total of 37 rules in 25 ms. Remains 205 /221 variables (removed 16) and now considering 212/225 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/221 places, 212/225 transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:38:44] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144234 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91463 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 1) seen :0
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:38:45] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:38:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:38:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 19:38:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:45] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-15 19:38:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:45] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-15 19:38:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:45] [INFO ] [Nat]Added 41 Read/Feed constraints in 50 ms returned sat
[2022-05-15 19:38:45] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:38:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-05-15 19:38:45] [INFO ] Computed and/alt/rep : 168/1075/168 causal constraints (skipped 43 transitions) in 12 ms.
[2022-05-15 19:38:47] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:38:47] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:38:47] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:38:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2022-05-15 19:38:47] [INFO ] Added : 154 causal constraints over 31 iterations in 1892 ms. Result :sat
Minimization took 634 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:38:57] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:38:57] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:38:58] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:38:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:38:59] [INFO ] Implicit Places using invariants and state equation in 1275 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2022-05-15 19:38:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:38:59] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:38:59] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 25190 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:59] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1088 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 705 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:38:59] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:38:59] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:38:59] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:59] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-05-15 19:38:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:38:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:38:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:38:59] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-15 19:38:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:38:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 12 ms returned sat
[2022-05-15 19:38:59] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:38:59] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 0 ms to minimize.
[2022-05-15 19:38:59] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 0 ms to minimize.
[2022-05-15 19:39:00] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:39:00] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:39:00] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:39:00] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 0 ms to minimize.
[2022-05-15 19:39:00] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:39:01] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2154 ms
[2022-05-15 19:39:01] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 15 ms.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:39:02] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 87 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 89 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:03] [INFO ] Deduced a trap composed of 89 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 86 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 90 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 93 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:04] [INFO ] Deduced a trap composed of 88 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 212 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 212 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 211 transition count 212
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 32 place count 205 transition count 212
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 36 place count 205 transition count 212
Applied a total of 36 rules in 21 ms. Remains 205 /221 variables (removed 16) and now considering 212/225 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/221 places, 212/225 transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:39:04] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 109726 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 70479 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :2
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:39:05] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-15 19:39:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:39:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:39:05] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-05-15 19:39:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:39:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:39:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:39:06] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-15 19:39:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-15 19:39:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 7 ms returned sat
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 0 ms to minimize.
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:39:06] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:07] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 0 ms to minimize.
[2022-05-15 19:39:08] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:09] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:39:09] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:09] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:09] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:39:09] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 0 ms to minimize.
[2022-05-15 19:39:10] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:11] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:12] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:13] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:14] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:14] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:14] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:15] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:16] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:17] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 67 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:18] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:19] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:20] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:21] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:22] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 1 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:23] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:24] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:25] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:26] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:27] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:28] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 78 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:29] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:30] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:31] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:32] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:33] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 80 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:34] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 79 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 88 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:35] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 67 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2022-05-15 19:39:36] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:37] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2022-05-15 19:39:37] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:37] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:39:37] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:37] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:38] [INFO ] Deduced a trap composed of 80 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:39] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 86 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:40] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 76 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 80 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:41] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:42] [INFO ] Deduced a trap composed of 83 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 78 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:43] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:39:44] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 78 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 83 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 83 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:39:45] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 76 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 90 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 71 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:46] [INFO ] Deduced a trap composed of 80 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:47] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:47] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:47] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:47] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2022-05-15 19:39:47] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:48] [INFO ] Deduced a trap composed of 80 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 80 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:49] [INFO ] Deduced a trap composed of 67 places in 55 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 76 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 71 places in 54 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2022-05-15 19:39:50] [INFO ] Trap strengthening (SAT) tested/added 405/405 trap constraints in 44885 ms
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 205/205 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 212/212 (removed 0) transitions.
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:39:51] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:39:52] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:39:52] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:39:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-15 19:39:53] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2022-05-15 19:39:53] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 212 rows 205 cols
[2022-05-15 19:39:53] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:39:53] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 205/205 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 54277 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:39:53] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1109 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 688 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:39:53] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:39:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:39:53] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:39:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:39:53] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2022-05-15 19:39:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:39:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:39:53] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:39:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:39:54] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-05-15 19:39:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:39:54] [INFO ] [Nat]Added 32 Read/Feed constraints in 147 ms returned sat
[2022-05-15 19:39:54] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 12 ms.
[2022-05-15 19:39:56] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-15 19:39:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-05-15 19:39:56] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2022-05-15 19:39:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-05-15 19:39:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-05-15 19:39:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 410 ms
[2022-05-15 19:39:56] [INFO ] Added : 157 causal constraints over 33 iterations in 2132 ms. Result :sat
Minimization took 548 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 211 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 211 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 210 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 29 place count 210 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 36 place count 203 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 42 place count 203 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 202 transition count 209
Applied a total of 43 rules in 21 ms. Remains 202 /221 variables (removed 19) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:40:04] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144764 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91567 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:40:05] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:40:05] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:05] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2022-05-15 19:40:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:05] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-15 19:40:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-15 19:40:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:40:05] [INFO ] [Nat]Added 42 Read/Feed constraints in 296 ms returned sat
[2022-05-15 19:40:05] [INFO ] Computed and/alt/rep : 164/1062/164 causal constraints (skipped 44 transitions) in 10 ms.
[2022-05-15 19:40:06] [INFO ] Added : 105 causal constraints over 21 iterations in 935 ms. Result :sat
Minimization took 369 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 202/202 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:40:16] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:40:16] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:40:16] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:40:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:40:17] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2022-05-15 19:40:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 209 rows 202 cols
[2022-05-15 19:40:17] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 19:40:17] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/202 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 24131 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:17] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 1109 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 710 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:17] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:40:17] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:17] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-05-15 19:40:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:18] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-15 19:40:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:40:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 22 ms returned sat
[2022-05-15 19:40:18] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 14 ms.
[2022-05-15 19:40:18] [INFO ] Added : 75 causal constraints over 16 iterations in 507 ms. Result :sat
Minimization took 351 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 213 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 20 place count 211 transition count 218
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 211 transition count 211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 204 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 204 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 203 transition count 210
Applied a total of 41 rules in 17 ms. Remains 203 /221 variables (removed 18) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:40:19] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144469 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91352 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:40:20] [INFO ] Computed 31 place invariants in 11 ms
[2022-05-15 19:40:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:20] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-15 19:40:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:20] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-15 19:40:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:40:20] [INFO ] [Nat]Added 42 Read/Feed constraints in 65 ms returned sat
[2022-05-15 19:40:20] [INFO ] Computed and/alt/rep : 165/1063/165 causal constraints (skipped 44 transitions) in 13 ms.
[2022-05-15 19:40:21] [INFO ] Added : 67 causal constraints over 14 iterations in 624 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 203/203 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:40:21] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:40:21] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:40:21] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-15 19:40:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 19:40:22] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2022-05-15 19:40:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 210 rows 203 cols
[2022-05-15 19:40:22] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:40:23] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 5194 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-14
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:23] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 1117 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 696 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:23] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 19:40:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:23] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:23] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-15 19:40:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:23] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:23] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2022-05-15 19:40:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:40:23] [INFO ] [Nat]Added 32 Read/Feed constraints in 44 ms returned sat
[2022-05-15 19:40:23] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2022-05-15 19:40:23] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 10 ms.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 0 ms to minimize.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2022-05-15 19:40:24] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2022-05-15 19:40:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 646 ms
[2022-05-15 19:40:25] [INFO ] Added : 116 causal constraints over 24 iterations in 1715 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 220 transition count 223
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 219 transition count 223
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 213 transition count 219
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 213 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 212 transition count 218
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 212 transition count 211
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 32 place count 205 transition count 211
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 205 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 204 transition count 210
Applied a total of 39 rules in 20 ms. Remains 204 /221 variables (removed 17) and now considering 210/225 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 210/225 transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-15 19:40:25] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 143879 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91580 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 204 cols
[2022-05-15 19:40:26] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:40:26] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:26] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:27] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-15 19:40:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 19:40:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:27] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-15 19:40:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-15 19:40:27] [INFO ] [Nat]Added 40 Read/Feed constraints in 39 ms returned sat
[2022-05-15 19:40:27] [INFO ] Computed and/alt/rep : 171/1082/171 causal constraints (skipped 38 transitions) in 12 ms.
[2022-05-15 19:40:27] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2022-05-15 19:40:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2022-05-15 19:40:28] [INFO ] Added : 103 causal constraints over 21 iterations in 883 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 204 cols
[2022-05-15 19:40:28] [INFO ] Computed 31 place invariants in 17 ms
[2022-05-15 19:40:28] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-15 19:40:28] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:40:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2022-05-15 19:40:29] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2022-05-15 19:40:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 210 rows 204 cols
[2022-05-15 19:40:29] [INFO ] Computed 31 place invariants in 9 ms
[2022-05-15 19:40:30] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 210/210 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-14 in 7068 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:30] [INFO ] Computed 31 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 1102 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 711 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 225 rows 221 cols
[2022-05-15 19:40:30] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:40:30] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:30] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-15 19:40:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2022-05-15 19:40:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:30] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-15 19:40:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-15 19:40:30] [INFO ] [Nat]Added 32 Read/Feed constraints in 69 ms returned sat
[2022-05-15 19:40:30] [INFO ] Computed and/alt/rep : 191/1060/191 causal constraints (skipped 33 transitions) in 11 ms.
[2022-05-15 19:40:32] [INFO ] Added : 173 causal constraints over 35 iterations in 1520 ms. Result :sat
Minimization took 534 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 225/225 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 221 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 220 transition count 224
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 214 transition count 218
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 213 transition count 218
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 213 transition count 217
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 212 transition count 217
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 212 transition count 210
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 32 place count 205 transition count 210
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 205 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 204 transition count 209
Applied a total of 39 rules in 19 ms. Remains 204 /221 variables (removed 17) and now considering 209/225 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/221 places, 209/225 transitions.
// Phase 1: matrix 209 rows 204 cols
[2022-05-15 19:40:37] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 144218 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91497 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 204 cols
[2022-05-15 19:40:38] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 19:40:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 19:40:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2022-05-15 19:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:38] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-15 19:40:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 19:40:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 19:40:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2022-05-15 19:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 19:40:38] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-15 19:40:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:40:38] [INFO ] [Nat]Added 41 Read/Feed constraints in 86 ms returned sat
[2022-05-15 19:40:38] [INFO ] Computed and/alt/rep : 167/1051/167 causal constraints (skipped 41 transitions) in 11 ms.
[2022-05-15 19:40:39] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-05-15 19:40:39] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2022-05-15 19:40:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2022-05-15 19:40:39] [INFO ] Added : 140 causal constraints over 29 iterations in 1141 ms. Result :sat
Minimization took 371 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 209/209 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 204/204 places, 209/209 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 204 cols
[2022-05-15 19:40:41] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 19:40:42] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 209 rows 204 cols
[2022-05-15 19:40:42] [INFO ] Computed 31 place invariants in 10 ms
[2022-05-15 19:40:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2022-05-15 19:40:43] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 1549 ms to find 0 implicit places.
[2022-05-15 19:40:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 209 rows 204 cols
[2022-05-15 19:40:43] [INFO ] Computed 31 place invariants in 14 ms
[2022-05-15 19:40:43] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/204 places, 209/209 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 13531 ms.
[2022-05-15 19:40:43] [INFO ] Flatten gal took : 89 ms
[2022-05-15 19:40:43] [INFO ] Applying decomposition
[2022-05-15 19:40:43] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph9431919717369364454.txt' '-o' '/tmp/graph9431919717369364454.bin' '-w' '/tmp/graph9431919717369364454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9431919717369364454.bin' '-l' '-1' '-v' '-w' '/tmp/graph9431919717369364454.weights' '-q' '0' '-e' '0.001'
[2022-05-15 19:40:44] [INFO ] Decomposing Gal with order
[2022-05-15 19:40:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 19:40:44] [INFO ] Removed a total of 108 redundant transitions.
[2022-05-15 19:40:44] [INFO ] Flatten gal took : 65 ms
[2022-05-15 19:40:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 14 ms.
[2022-05-15 19:40:44] [INFO ] Time to serialize gal into /tmp/UpperBounds7055951691016588442.gal : 9 ms
[2022-05-15 19:40:44] [INFO ] Time to serialize properties into /tmp/UpperBounds15680204161768080130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7055951691016588442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15680204161768080130.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds15680204161768080130.prop.
Detected timeout of ITS tools.
[2022-05-15 20:03:44] [INFO ] Flatten gal took : 168 ms
[2022-05-15 20:03:44] [INFO ] Time to serialize gal into /tmp/UpperBounds15793771786786302702.gal : 77 ms
[2022-05-15 20:03:44] [INFO ] Time to serialize properties into /tmp/UpperBounds14901578194696600121.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15793771786786302702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14901578194696600121.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds14901578194696600121.prop.
Detected timeout of ITS tools.
[2022-05-15 20:26:50] [INFO ] Flatten gal took : 233 ms
[2022-05-15 20:26:51] [INFO ] Input system was already deterministic with 225 transitions.
[2022-05-15 20:26:52] [INFO ] Transformed 221 places.
[2022-05-15 20:26:52] [INFO ] Transformed 225 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 20:26:52] [INFO ] Time to serialize gal into /tmp/UpperBounds2829895048290152631.gal : 35 ms
[2022-05-15 20:26:52] [INFO ] Time to serialize properties into /tmp/UpperBounds15480612069454146476.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2829895048290152631.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15480612069454146476.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15480612069454146476.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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