About the Execution of 2023-gold for DoubleExponent-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16223.308 | 3600000.00 | 3108790.00 | 296244.60 | ? ? ? 1 ? ? ? ? ? 1 ? ? ? 1 ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600346.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r153-tall-171631151600346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716423878566
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 00:24:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:24:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:24:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-05-23 00:24:40] [INFO ] Transformed 534 places.
[2024-05-23 00:24:40] [INFO ] Transformed 498 transitions.
[2024-05-23 00:24:40] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 498 rows 534 cols
[2024-05-23 00:24:40] [INFO ] Computed 54 invariants in 69 ms
Incomplete random walk after 10000 steps, including 338 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :3
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :2
[2024-05-23 00:24:40] [INFO ] Invariant cache hit.
[2024-05-23 00:24:41] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2024-05-23 00:24:41] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-23 00:24:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:41] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2024-05-23 00:24:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:24:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:24:41] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:24:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:41] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-05-23 00:24:41] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 3 ms to minimize.
[2024-05-23 00:24:42] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 0 ms to minimize.
[2024-05-23 00:24:42] [INFO ] Deduced a trap composed of 236 places in 147 ms of which 1 ms to minimize.
[2024-05-23 00:24:42] [INFO ] Deduced a trap composed of 176 places in 138 ms of which 2 ms to minimize.
[2024-05-23 00:24:42] [INFO ] Deduced a trap composed of 228 places in 138 ms of which 1 ms to minimize.
[2024-05-23 00:24:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 934 ms
[2024-05-23 00:24:42] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-23 00:24:46] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:24: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2024-05-23 00:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:24:46] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:46] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2024-05-23 00:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:24:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:24:46] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2024-05-23 00:24:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:47] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 193 places in 144 ms of which 0 ms to minimize.
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 126 places in 88 ms of which 1 ms to minimize.
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 113 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 115 places in 103 ms of which 0 ms to minimize.
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 0 ms to minimize.
[2024-05-23 00:24:47] [INFO ] Deduced a trap composed of 221 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 229 places in 140 ms of which 0 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2024-05-23 00:24:48] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 1 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 0 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 224 places in 125 ms of which 4 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 217 places in 123 ms of which 0 ms to minimize.
[2024-05-23 00:24:49] [INFO ] Deduced a trap composed of 212 places in 134 ms of which 1 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 226 places in 129 ms of which 0 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 223 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 217 places in 141 ms of which 0 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 222 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:24:50] [INFO ] Deduced a trap composed of 208 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 228 places in 127 ms of which 0 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 221 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 156 places in 127 ms of which 1 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 217 places in 129 ms of which 2 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 221 places in 125 ms of which 0 ms to minimize.
[2024-05-23 00:24:51] [INFO ] Deduced a trap composed of 212 places in 132 ms of which 1 ms to minimize.
[2024-05-23 00:24:51] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2024-05-23 00:24:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:24:52] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:24:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:52] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-23 00:24:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:24:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:24:52] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 23 ms returned sat
[2024-05-23 00:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:52] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-23 00:24:52] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-23 00:24:57] [INFO ] Added : 385 causal constraints over 77 iterations in 4620 ms. Result :unknown
[2024-05-23 00:24:57] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:24:57] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 17 ms returned sat
[2024-05-23 00:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:57] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-23 00:24:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:24:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:24:57] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:24:57] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-23 00:24:58] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 28 ms.
[2024-05-23 00:25:02] [INFO ] Added : 385 causal constraints over 77 iterations in 4694 ms. Result :unknown
[2024-05-23 00:25:02] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:02] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:02] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2024-05-23 00:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:25:03] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:03] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-23 00:25:03] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 00:25:08] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2024-05-23 00:25:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2024-05-23 00:25:08] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:08] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:08] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-23 00:25:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:25:08] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:08] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 205 places in 131 ms of which 0 ms to minimize.
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 226 places in 131 ms of which 0 ms to minimize.
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 241 places in 125 ms of which 1 ms to minimize.
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 1 ms to minimize.
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 0 ms to minimize.
[2024-05-23 00:25:09] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 0 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 214 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 219 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 213 places in 132 ms of which 0 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 218 places in 136 ms of which 0 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 199 places in 123 ms of which 1 ms to minimize.
[2024-05-23 00:25:10] [INFO ] Deduced a trap composed of 211 places in 126 ms of which 0 ms to minimize.
[2024-05-23 00:25:11] [INFO ] Deduced a trap composed of 198 places in 113 ms of which 1 ms to minimize.
[2024-05-23 00:25:11] [INFO ] Deduced a trap composed of 196 places in 114 ms of which 0 ms to minimize.
[2024-05-23 00:25:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2307 ms
[2024-05-23 00:25:11] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 00:25:13] [INFO ] Added : 210 causal constraints over 42 iterations in 2268 ms. Result :unknown
[2024-05-23 00:25:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:13] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:13] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2024-05-23 00:25:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:13] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:14] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 209 places in 131 ms of which 1 ms to minimize.
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 203 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 1 ms to minimize.
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 220 places in 139 ms of which 2 ms to minimize.
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:25:14] [INFO ] Deduced a trap composed of 204 places in 128 ms of which 0 ms to minimize.
[2024-05-23 00:25:15] [INFO ] Deduced a trap composed of 221 places in 136 ms of which 0 ms to minimize.
[2024-05-23 00:25:15] [INFO ] Deduced a trap composed of 223 places in 133 ms of which 0 ms to minimize.
[2024-05-23 00:25:15] [INFO ] Deduced a trap composed of 225 places in 141 ms of which 1 ms to minimize.
[2024-05-23 00:25:15] [INFO ] Deduced a trap composed of 221 places in 132 ms of which 0 ms to minimize.
[2024-05-23 00:25:15] [INFO ] Deduced a trap composed of 207 places in 134 ms of which 1 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 237 places in 134 ms of which 1 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 219 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 215 places in 133 ms of which 2 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 219 places in 142 ms of which 1 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 218 places in 130 ms of which 2 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 218 places in 136 ms of which 9 ms to minimize.
[2024-05-23 00:25:16] [INFO ] Deduced a trap composed of 223 places in 139 ms of which 1 ms to minimize.
[2024-05-23 00:25:17] [INFO ] Deduced a trap composed of 238 places in 133 ms of which 1 ms to minimize.
[2024-05-23 00:25:17] [INFO ] Deduced a trap composed of 221 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:25:17] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 0 ms to minimize.
[2024-05-23 00:25:17] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 1 ms to minimize.
[2024-05-23 00:25:17] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3573 ms
[2024-05-23 00:25:17] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-23 00:25:18] [INFO ] Added : 115 causal constraints over 23 iterations in 1178 ms. Result :unknown
[2024-05-23 00:25:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:18] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:19] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-23 00:25:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:19] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:19] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2024-05-23 00:25:19] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-23 00:25:24] [INFO ] Added : 425 causal constraints over 85 iterations in 4629 ms. Result :unknown
[2024-05-23 00:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 12 ms returned unsat
[2024-05-23 00:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:24] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 18 ms returned sat
[2024-05-23 00:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:24] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-23 00:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:24] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:24] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2024-05-23 00:25:24] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 00:25:29] [INFO ] Added : 390 causal constraints over 78 iterations in 4608 ms. Result :unknown
[2024-05-23 00:25:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:29] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:29] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-05-23 00:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:29] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:30] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 184 places in 132 ms of which 0 ms to minimize.
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 193 places in 126 ms of which 1 ms to minimize.
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 191 places in 135 ms of which 0 ms to minimize.
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 228 places in 139 ms of which 1 ms to minimize.
[2024-05-23 00:25:30] [INFO ] Deduced a trap composed of 225 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 222 places in 131 ms of which 0 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 205 places in 125 ms of which 1 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 240 places in 129 ms of which 4 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 204 places in 136 ms of which 1 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 194 places in 132 ms of which 0 ms to minimize.
[2024-05-23 00:25:31] [INFO ] Deduced a trap composed of 194 places in 131 ms of which 0 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 190 places in 130 ms of which 1 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 200 places in 125 ms of which 1 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 212 places in 131 ms of which 1 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 0 ms to minimize.
[2024-05-23 00:25:32] [INFO ] Deduced a trap composed of 235 places in 129 ms of which 1 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 222 places in 129 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 187 places in 127 ms of which 0 ms to minimize.
[2024-05-23 00:25:33] [INFO ] Deduced a trap composed of 224 places in 128 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 113 places in 129 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 182 places in 119 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 182 places in 124 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 101 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:25:34] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 1 ms to minimize.
[2024-05-23 00:25:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2024-05-23 00:25:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:35] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 24 ms returned sat
[2024-05-23 00:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:35] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2024-05-23 00:25:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-23 00:25:35] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 20 ms returned sat
[2024-05-23 00:25:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:35] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 0 ms to minimize.
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2024-05-23 00:25:35] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 0 ms to minimize.
[2024-05-23 00:25:36] [INFO ] Deduced a trap composed of 43 places in 112 ms of which 1 ms to minimize.
[2024-05-23 00:25:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 664 ms
[2024-05-23 00:25:36] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-23 00:25:40] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2024-05-23 00:25:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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)
[2024-05-23 00:25:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:40] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 10 ms returned unsat
[2024-05-23 00:25:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-23 00:25:40] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:40] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-23 00:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-23 00:25:40] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:41] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-23 00:25:41] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-23 00:25:42] [INFO ] Added : 161 causal constraints over 33 iterations in 1363 ms. Result :sat
Minimization took 339 ms.
[2024-05-23 00:25:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:42] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 16 ms returned sat
[2024-05-23 00:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:43] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2024-05-23 00:25:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:25:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-23 00:25:43] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 15 ms returned sat
[2024-05-23 00:25:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:25:43] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-05-23 00:25:43] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 25 ms.
[2024-05-23 00:25:48] [INFO ] Added : 410 causal constraints over 82 iterations in 4662 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 2, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 527 transition count 388
Reduce places removed 108 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 111 rules applied. Total rules applied 223 place count 419 transition count 385
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 226 place count 416 transition count 385
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 226 place count 416 transition count 363
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 270 place count 394 transition count 363
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 446 place count 306 transition count 275
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 480 place count 289 transition count 275
Free-agglomeration rule (complex) applied 36 times.
Iterating global reduction 3 with 36 rules applied. Total rules applied 516 place count 289 transition count 239
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 552 place count 253 transition count 239
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 4 with 40 rules applied. Total rules applied 592 place count 253 transition count 239
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 593 place count 252 transition count 238
Applied a total of 593 rules in 146 ms. Remains 252 /534 variables (removed 282) and now considering 238/498 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 252/534 places, 238/498 transitions.
// Phase 1: matrix 238 rows 252 cols
[2024-05-23 00:26:36] [INFO ] Computed 50 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 128086 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84897 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84507 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84561 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84928 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84704 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84626 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84579 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84917 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84584 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84618 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84840 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84901 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84853 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 13) seen :0
[2024-05-23 00:26:45] [INFO ] Invariant cache hit.
[2024-05-23 00:26:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-23 00:26:45] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:45] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 00:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:45] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2024-05-23 00:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:45] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-23 00:26:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:26:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 57 ms returned sat
[2024-05-23 00:26:45] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 16 ms.
[2024-05-23 00:26:46] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 0 ms to minimize.
[2024-05-23 00:26:46] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2024-05-23 00:26:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1133 ms
[2024-05-23 00:26:47] [INFO ] Added : 123 causal constraints over 25 iterations in 2325 ms. Result :sat
Minimization took 165 ms.
[2024-05-23 00:26:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:48] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 00:26:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-23 00:26:48] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:48] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-23 00:26:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 39 ms returned sat
[2024-05-23 00:26:48] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-23 00:26:50] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-23 00:26:50] [INFO ] Added : 201 causal constraints over 41 iterations in 2150 ms. Result :sat
Minimization took 447 ms.
[2024-05-23 00:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-23 00:26:51] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2024-05-23 00:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:51] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-23 00:26:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:51] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2024-05-23 00:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-23 00:26:51] [INFO ] [Nat]Added 33 Read/Feed constraints in 105 ms returned sat
[2024-05-23 00:26:51] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-23 00:26:52] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2024-05-23 00:26:52] [INFO ] Added : 184 causal constraints over 37 iterations in 1593 ms. Result :sat
Minimization took 352 ms.
[2024-05-23 00:26:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:53] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:53] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:26:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:53] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 15 ms returned sat
[2024-05-23 00:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:53] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-23 00:26:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 48 ms returned sat
[2024-05-23 00:26:53] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 20 ms.
[2024-05-23 00:26:55] [INFO ] Added : 186 causal constraints over 38 iterations in 1783 ms. Result :sat
Minimization took 340 ms.
[2024-05-23 00:26:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:55] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:55] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-23 00:26:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-23 00:26:56] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 16 ms returned sat
[2024-05-23 00:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:56] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-23 00:26:56] [INFO ] [Nat]Added 33 Read/Feed constraints in 57 ms returned sat
[2024-05-23 00:26:56] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-23 00:26:57] [INFO ] Added : 162 causal constraints over 33 iterations in 1354 ms. Result :sat
Minimization took 356 ms.
[2024-05-23 00:26:58] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:26:58] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:58] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-23 00:26:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:26:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-23 00:26:58] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-23 00:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:26:58] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 00:26:58] [INFO ] [Nat]Added 33 Read/Feed constraints in 639 ms returned sat
[2024-05-23 00:26:58] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 13 ms.
[2024-05-23 00:27:01] [INFO ] Added : 210 causal constraints over 42 iterations in 2379 ms. Result :sat
Minimization took 540 ms.
[2024-05-23 00:27:01] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:01] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:01] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-23 00:27:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:02] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2024-05-23 00:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:02] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-23 00:27:02] [INFO ] [Nat]Added 33 Read/Feed constraints in 182 ms returned sat
[2024-05-23 00:27:02] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 0 ms to minimize.
[2024-05-23 00:27:02] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 0 ms to minimize.
[2024-05-23 00:27:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2024-05-23 00:27:02] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 12 ms.
[2024-05-23 00:27:03] [INFO ] Added : 90 causal constraints over 19 iterations in 746 ms. Result :sat
Minimization took 168 ms.
[2024-05-23 00:27:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:03] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 00:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:03] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:27:03] [INFO ] [Nat]Added 33 Read/Feed constraints in 51 ms returned sat
[2024-05-23 00:27:03] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-23 00:27:05] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:27:05] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:27:05] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:27:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2024-05-23 00:27:05] [INFO ] Added : 169 causal constraints over 34 iterations in 1661 ms. Result :sat
Minimization took 315 ms.
[2024-05-23 00:27:05] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:05] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:05] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 00:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:05] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 13 ms returned sat
[2024-05-23 00:27:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:06] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-05-23 00:27:06] [INFO ] [Nat]Added 33 Read/Feed constraints in 31 ms returned sat
[2024-05-23 00:27:06] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-23 00:27:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:27:07] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:27:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-23 00:27:07] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 0 ms to minimize.
[2024-05-23 00:27:07] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:27:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 393 ms
[2024-05-23 00:27:08] [INFO ] Added : 169 causal constraints over 34 iterations in 1970 ms. Result :sat
Minimization took 422 ms.
[2024-05-23 00:27:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:08] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:08] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-23 00:27:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:08] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:08] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-23 00:27:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 75 ms returned sat
[2024-05-23 00:27:08] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 17 ms.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:27:10] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:27:11] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:27:12] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 91 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:27:13] [INFO ] Deduced a trap composed of 93 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 87 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:27:14] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:27:15] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:27:15] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:27:15] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:27:15] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 4944 ms
[2024-05-23 00:27:15] [INFO ] Added : 193 causal constraints over 40 iterations in 6477 ms. Result :sat
Minimization took 582 ms.
[2024-05-23 00:27:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:16] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:16] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 00:27:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:16] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:16] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:27:16] [INFO ] [Nat]Added 33 Read/Feed constraints in 37 ms returned sat
[2024-05-23 00:27:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:27:16] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2024-05-23 00:27:16] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 12 ms.
[2024-05-23 00:27:16] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2024-05-23 00:27:17] [INFO ] Added : 94 causal constraints over 20 iterations in 932 ms. Result :sat
Minimization took 128 ms.
[2024-05-23 00:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-23 00:27:17] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:17] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-23 00:27:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:17] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 14 ms returned sat
[2024-05-23 00:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:17] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-23 00:27:17] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2024-05-23 00:27:17] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 14 ms.
[2024-05-23 00:27:18] [INFO ] Added : 58 causal constraints over 12 iterations in 258 ms. Result :sat
Minimization took 124 ms.
[2024-05-23 00:27:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-23 00:27:18] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 11 ms returned sat
[2024-05-23 00:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:18] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-23 00:27:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:27:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:27:18] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 12 ms returned sat
[2024-05-23 00:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:27:18] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-23 00:27:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 84 ms returned sat
[2024-05-23 00:27:18] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-23 00:27:18] [INFO ] Computed and/alt/rep : 214/1135/214 causal constraints (skipped 23 transitions) in 12 ms.
[2024-05-23 00:27:20] [INFO ] Added : 202 causal constraints over 41 iterations in 2334 ms. Result :sat
Minimization took 393 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 2, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 12 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 252/252 places, 238/238 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 238/238 transitions.
Applied a total of 0 rules in 9 ms. Remains 252 /252 variables (removed 0) and now considering 238/238 (removed 0) transitions.
[2024-05-23 00:28:35] [INFO ] Invariant cache hit.
[2024-05-23 00:28:36] [INFO ] Implicit Places using invariants in 281 ms returned [21, 27, 48, 53, 75, 81, 102, 108, 130, 136, 137, 164, 188, 196, 203, 211, 217, 242]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 283 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 234/252 places, 238/238 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 233 transition count 237
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 233 transition count 231
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 14 place count 227 transition count 231
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 227 transition count 231
Applied a total of 17 rules in 28 ms. Remains 227 /234 variables (removed 7) and now considering 231/238 (removed 7) transitions.
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:28:36] [INFO ] Computed 33 invariants in 11 ms
[2024-05-23 00:28:36] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-23 00:28:36] [INFO ] Invariant cache hit.
[2024-05-23 00:28:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:28:38] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 1750 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 227/252 places, 231/238 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2071 ms. Remains : 227/252 places, 231/238 transitions.
[2024-05-23 00:28:38] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144169 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91624 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91641 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91588 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91445 resets, run finished after 576 ms. (steps per millisecond=1736 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91473 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91381 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91226 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91382 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91721 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91287 resets, run finished after 585 ms. (steps per millisecond=1709 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91440 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91335 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91689 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 13) seen :0
[2024-05-23 00:28:46] [INFO ] Invariant cache hit.
[2024-05-23 00:28:46] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:28:46] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:46] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-23 00:28:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:28:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:28:46] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:28:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:46] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-23 00:28:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:28:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 78 ms returned sat
[2024-05-23 00:28:46] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-23 00:28:47] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:28:47] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:28:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:28:47] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:28:47] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:28:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 457 ms
[2024-05-23 00:28:48] [INFO ] Added : 113 causal constraints over 23 iterations in 1176 ms. Result :sat
Minimization took 342 ms.
[2024-05-23 00:28:48] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-05-23 00:28:48] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:48] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-23 00:28:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:28:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:28:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:28:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:48] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-05-23 00:28:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 44 ms returned sat
[2024-05-23 00:28:48] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:28:48] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:28:48] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:28:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2024-05-23 00:28:49] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 10 ms.
[2024-05-23 00:28:52] [INFO ] Added : 207 causal constraints over 42 iterations in 3299 ms. Result :sat
Minimization took 492 ms.
[2024-05-23 00:28:52] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:28:52] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:52] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:28:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:28:53] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-23 00:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:53] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-23 00:28:53] [INFO ] [Nat]Added 33 Read/Feed constraints in 43 ms returned sat
[2024-05-23 00:28:53] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:28:55] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:28:56] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:28:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 830 ms
[2024-05-23 00:28:56] [INFO ] Added : 206 causal constraints over 42 iterations in 2912 ms. Result :sat
Minimization took 574 ms.
[2024-05-23 00:28:56] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:28:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:56] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-23 00:28:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:28:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:28:56] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:28:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:28:57] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-23 00:28:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 118 ms returned sat
[2024-05-23 00:28:57] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:28:59] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:28:59] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-23 00:28:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:29:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2024-05-23 00:29:00] [INFO ] Added : 208 causal constraints over 43 iterations in 2927 ms. Result :sat
Minimization took 532 ms.
[2024-05-23 00:29:00] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:00] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:00] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-23 00:29:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:00] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:00] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:29:01] [INFO ] [Nat]Added 33 Read/Feed constraints in 108 ms returned sat
[2024-05-23 00:29:01] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:29:01] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-23 00:29:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2024-05-23 00:29:01] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:29:02] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:29:02] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:02] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:29:02] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:02] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:03] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:04] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 93 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 96 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:05] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Deduced a trap composed of 92 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:29:06] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 4275 ms
[2024-05-23 00:29:06] [INFO ] Added : 150 causal constraints over 30 iterations in 5592 ms. Result :sat
Minimization took 733 ms.
[2024-05-23 00:29:07] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:07] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:07] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-23 00:29:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:07] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:07] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-23 00:29:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 527 ms returned sat
[2024-05-23 00:29:08] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:29:11] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:11] [INFO ] Deduced a trap composed of 97 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 3 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 97 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 95 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 95 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:12] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 88 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:13] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 100 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 87 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 88 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:14] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 3152 ms
[2024-05-23 00:29:14] [INFO ] Added : 201 causal constraints over 41 iterations in 6653 ms. Result :sat
Minimization took 3007 ms.
[2024-05-23 00:29:18] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:18] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:18] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-23 00:29:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:18] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:18] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-23 00:29:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 141 ms returned sat
[2024-05-23 00:29:18] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:20] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 940 ms
[2024-05-23 00:29:21] [INFO ] Added : 132 causal constraints over 28 iterations in 2620 ms. Result :sat
Minimization took 366 ms.
[2024-05-23 00:29:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:21] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:21] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 00:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:21] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:21] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:29:21] [INFO ] [Nat]Added 33 Read/Feed constraints in 88 ms returned sat
[2024-05-23 00:29:21] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:23] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:24] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 88 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:25] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:26] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 88 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:27] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:29:28] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:29] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:29] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 5812 ms
[2024-05-23 00:29:29] [INFO ] Added : 184 causal constraints over 38 iterations in 7320 ms. Result :sat
Minimization took 531 ms.
[2024-05-23 00:29:29] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:29] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-05-23 00:29:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:29] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-23 00:29:30] [INFO ] [Nat]Added 33 Read/Feed constraints in 85 ms returned sat
[2024-05-23 00:29:30] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-23 00:29:30] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:29:31] [INFO ] Added : 173 causal constraints over 35 iterations in 1681 ms. Result :sat
Minimization took 472 ms.
[2024-05-23 00:29:32] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:32] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:32] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2024-05-23 00:29:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:32] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:29:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:32] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-23 00:29:32] [INFO ] [Nat]Added 33 Read/Feed constraints in 46 ms returned sat
[2024-05-23 00:29:32] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:29:32] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:32] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:32] [INFO ] Deduced a trap composed of 91 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:33] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:34] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1956 ms
[2024-05-23 00:29:34] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:29:35] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:29:36] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:36] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:29:36] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:29:36] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 521 ms
[2024-05-23 00:29:36] [INFO ] Added : 140 causal constraints over 29 iterations in 1846 ms. Result :sat
Minimization took 281 ms.
[2024-05-23 00:29:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:36] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:29:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:36] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:29:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:36] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:37] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:29:37] [INFO ] [Nat]Added 33 Read/Feed constraints in 52 ms returned sat
[2024-05-23 00:29:37] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:29:37] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-23 00:29:37] [INFO ] Added : 109 causal constraints over 22 iterations in 853 ms. Result :sat
Minimization took 256 ms.
[2024-05-23 00:29:38] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:38] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-23 00:29:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:38] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 18 ms returned sat
[2024-05-23 00:29:38] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:29:38] [INFO ] Added : 43 causal constraints over 9 iterations in 239 ms. Result :sat
Minimization took 98 ms.
[2024-05-23 00:29:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:39] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-05-23 00:29:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:29:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:29:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-23 00:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:29:39] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-23 00:29:39] [INFO ] [Nat]Added 33 Read/Feed constraints in 177 ms returned sat
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:39] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 85 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:29:40] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 94 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 5 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:41] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 84 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 85 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:42] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 88 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:29:43] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Deduced a trap composed of 69 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:44] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 4788 ms
[2024-05-23 00:29:44] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:49] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 81 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:29:50] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:29:51] [INFO ] Deduced a trap composed of 87 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 91 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 77 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:29:52] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:29:53] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:29:53] [INFO ] Deduced a trap composed of 90 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:29:53] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:29:53] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 3932 ms
[2024-05-23 00:29:53] [INFO ] Added : 205 causal constraints over 42 iterations in 9084 ms. Result :sat
Minimization took 1064 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 69] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 13 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 227/227 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Applied a total of 0 rules in 8 ms. Remains 227 /227 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-23 00:30:42] [INFO ] Invariant cache hit.
[2024-05-23 00:30:42] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-23 00:30:42] [INFO ] Invariant cache hit.
[2024-05-23 00:30:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:30:44] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
[2024-05-23 00:30:44] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-23 00:30:44] [INFO ] Invariant cache hit.
[2024-05-23 00:30:44] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1820 ms. Remains : 227/227 places, 231/231 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
[2024-05-23 00:30:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1461 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 909 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:30:44] [INFO ] Invariant cache hit.
[2024-05-23 00:30:44] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:44] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:44] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-05-23 00:30:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:30:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:44] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:44] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-23 00:30:44] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:30:44] [INFO ] [Nat]Added 33 Read/Feed constraints in 79 ms returned sat
[2024-05-23 00:30:44] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:30:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 466 ms
[2024-05-23 00:30:45] [INFO ] Added : 113 causal constraints over 23 iterations in 1177 ms. Result :sat
Minimization took 339 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 216 transition count 222
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 216 transition count 216
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 34 place count 210 transition count 216
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 38 place count 210 transition count 216
Applied a total of 38 rules in 48 ms. Remains 210 /227 variables (removed 17) and now considering 216/231 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 210/227 places, 216/231 transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:30:46] [INFO ] Computed 33 invariants in 18 ms
Incomplete random walk after 1000000 steps, including 144092 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 91322 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 1) seen :0
[2024-05-23 00:30:47] [INFO ] Invariant cache hit.
[2024-05-23 00:30:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:47] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-23 00:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:30:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:48] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:48] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-23 00:30:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:30:48] [INFO ] [Nat]Added 40 Read/Feed constraints in 70 ms returned sat
[2024-05-23 00:30:48] [INFO ] Computed and/alt/rep : 167/1054/167 causal constraints (skipped 48 transitions) in 13 ms.
[2024-05-23 00:30:48] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:30:48] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:30:49] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:30:50] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2250 ms
[2024-05-23 00:30:51] [INFO ] Added : 86 causal constraints over 19 iterations in 2897 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 6 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:30:52] [INFO ] Invariant cache hit.
[2024-05-23 00:30:53] [INFO ] Implicit Places using invariants in 146 ms returned [136, 207]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 149 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/210 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 214
Applied a total of 4 rules in 11 ms. Remains 206 /208 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 206 cols
[2024-05-23 00:30:53] [INFO ] Computed 31 invariants in 8 ms
[2024-05-23 00:30:53] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:30:53] [INFO ] Invariant cache hit.
[2024-05-23 00:30:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:30:54] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/210 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1612 ms. Remains : 206/210 places, 214/216 transitions.
[2024-05-23 00:30:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144220 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91544 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 1) seen :0
[2024-05-23 00:30:55] [INFO ] Invariant cache hit.
[2024-05-23 00:30:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:55] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2024-05-23 00:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:55] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-23 00:30:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:30:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:55] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2024-05-23 00:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-23 00:30:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:30:55] [INFO ] [Nat]Added 40 Read/Feed constraints in 43 ms returned sat
[2024-05-23 00:30:56] [INFO ] Computed and/alt/rep : 170/1093/170 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-23 00:30:57] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:30:57] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-23 00:30:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:30:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2024-05-23 00:30:57] [INFO ] Added : 106 causal constraints over 22 iterations in 1217 ms. Result :sat
Minimization took 220 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:30:57] [INFO ] Invariant cache hit.
[2024-05-23 00:30:57] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-23 00:30:57] [INFO ] Invariant cache hit.
[2024-05-23 00:30:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:30:59] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
[2024-05-23 00:30:59] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-23 00:30:59] [INFO ] Invariant cache hit.
[2024-05-23 00:30:59] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1584 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 15113 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:30:59] [INFO ] Computed 33 invariants in 8 ms
Incomplete random walk after 10000 steps, including 1444 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 912 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:30:59] [INFO ] Invariant cache hit.
[2024-05-23 00:30:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:59] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:59] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-23 00:30:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:30:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:30:59] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:30:59] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-23 00:30:59] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:30:59] [INFO ] [Nat]Added 33 Read/Feed constraints in 51 ms returned sat
[2024-05-23 00:30:59] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:30:59] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:31:00] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:31:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 284 ms
[2024-05-23 00:31:00] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 12 ms.
[2024-05-23 00:31:03] [INFO ] Added : 207 causal constraints over 42 iterations in 3208 ms. Result :sat
Minimization took 481 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 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 227 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 226 transition count 230
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 226 transition count 229
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 225 transition count 229
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 220 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 218 transition count 224
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 27 place count 218 transition count 215
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 36 place count 209 transition count 215
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 215
Applied a total of 40 rules in 25 ms. Remains 209 /227 variables (removed 18) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 209/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:31:12] [INFO ] Computed 33 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144272 resets, run finished after 728 ms. (steps per millisecond=1373 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91638 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
[2024-05-23 00:31:13] [INFO ] Invariant cache hit.
[2024-05-23 00:31:13] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:31:13] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:13] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:31:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:31:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:31:13] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:13] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-23 00:31:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:31:14] [INFO ] [Nat]Added 40 Read/Feed constraints in 38 ms returned sat
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 5 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:31:14] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:31:15] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1797 ms
[2024-05-23 00:31:15] [INFO ] Computed and/alt/rep : 166/1049/166 causal constraints (skipped 48 transitions) in 11 ms.
[2024-05-23 00:31:16] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-23 00:31:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 556 ms
[2024-05-23 00:31:17] [INFO ] Added : 105 causal constraints over 22 iterations in 1674 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 5 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:31:33] [INFO ] Invariant cache hit.
[2024-05-23 00:31:33] [INFO ] Implicit Places using invariants in 182 ms returned [134, 206]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 192 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/209 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 213
Applied a total of 4 rules in 10 ms. Remains 205 /207 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 205 cols
[2024-05-23 00:31:33] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 00:31:33] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 00:31:33] [INFO ] Invariant cache hit.
[2024-05-23 00:31:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:31:34] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/209 places, 213/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1533 ms. Remains : 205/209 places, 213/215 transitions.
[2024-05-23 00:31:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144169 resets, run finished after 712 ms. (steps per millisecond=1404 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91748 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 1) seen :0
[2024-05-23 00:31:35] [INFO ] Invariant cache hit.
[2024-05-23 00:31:35] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:31:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 00:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:35] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-23 00:31:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:31:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:31:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:36] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-23 00:31:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:31:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 35 ms returned sat
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-05-23 00:31:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-23 00:31:37] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:31:37] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:31:37] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:31:37] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1143 ms
[2024-05-23 00:31:37] [INFO ] Computed and/alt/rep : 169/1088/169 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-23 00:31:38] [INFO ] Added : 102 causal constraints over 21 iterations in 1099 ms. Result :sat
Minimization took 238 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 REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 00:31:45] [INFO ] Invariant cache hit.
[2024-05-23 00:31:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:31:45] [INFO ] Invariant cache hit.
[2024-05-23 00:31:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:31:47] [INFO ] Implicit Places using invariants and state equation in 1302 ms returned []
Implicit Place search using SMT with State Equation took 1431 ms to find 0 implicit places.
[2024-05-23 00:31:47] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-23 00:31:47] [INFO ] Invariant cache hit.
[2024-05-23 00:31:47] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1561 ms. Remains : 205/205 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 47931 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-02
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:31:47] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1432 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 922 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:31:47] [INFO ] Invariant cache hit.
[2024-05-23 00:31:47] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:31:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:47] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-23 00:31:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:31:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:31:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:47] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-23 00:31:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:31:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 42 ms returned sat
[2024-05-23 00:31:47] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:31:49] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:31:49] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:31:49] [INFO ] Deduced a trap composed of 85 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:31:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 805 ms
[2024-05-23 00:31:50] [INFO ] Added : 206 causal constraints over 42 iterations in 2836 ms. Result :sat
Minimization took 559 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 219 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 217 transition count 223
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 217 transition count 216
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 210 transition count 216
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 210 transition count 216
Applied a total of 37 rules in 22 ms. Remains 210 /227 variables (removed 17) and now considering 216/231 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 210/227 places, 216/231 transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:31:55] [INFO ] Computed 33 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144295 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91692 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
[2024-05-23 00:31:56] [INFO ] Invariant cache hit.
[2024-05-23 00:31:56] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:31:56] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:31:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:56] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-23 00:31:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:31:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:31:57] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:31:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:31:57] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-23 00:31:57] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:31:57] [INFO ] [Nat]Added 39 Read/Feed constraints in 74 ms returned sat
[2024-05-23 00:31:57] [INFO ] Computed and/alt/rep : 168/1045/168 causal constraints (skipped 47 transitions) in 15 ms.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:31:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 867 ms
[2024-05-23 00:31:59] [INFO ] Added : 133 causal constraints over 27 iterations in 1814 ms. Result :sat
Minimization took 351 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:32:19] [INFO ] Invariant cache hit.
[2024-05-23 00:32:19] [INFO ] Implicit Places using invariants in 151 ms returned [134, 207]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 152 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/210 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 214
Applied a total of 4 rules in 8 ms. Remains 206 /208 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 206 cols
[2024-05-23 00:32:20] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 00:32:20] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-23 00:32:20] [INFO ] Invariant cache hit.
[2024-05-23 00:32:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:32:21] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/210 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1802 ms. Remains : 206/210 places, 214/216 transitions.
[2024-05-23 00:32:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144174 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91498 resets, run finished after 500 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2024-05-23 00:32:22] [INFO ] Invariant cache hit.
[2024-05-23 00:32:22] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:32:22] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-23 00:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:32:23] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:23] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-23 00:32:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:32:23] [INFO ] [Nat]Added 39 Read/Feed constraints in 75 ms returned sat
[2024-05-23 00:32:23] [INFO ] Computed and/alt/rep : 171/1084/171 causal constraints (skipped 42 transitions) in 12 ms.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:32:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 548 ms
[2024-05-23 00:32:24] [INFO ] Added : 135 causal constraints over 28 iterations in 1550 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:32:29] [INFO ] Invariant cache hit.
[2024-05-23 00:32:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-23 00:32:29] [INFO ] Invariant cache hit.
[2024-05-23 00:32:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:32:30] [INFO ] Implicit Places using invariants and state equation in 1480 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2024-05-23 00:32:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:32:30] [INFO ] Invariant cache hit.
[2024-05-23 00:32:30] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1746 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-02 in 43542 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:32:30] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1459 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 904 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:32:30] [INFO ] Invariant cache hit.
[2024-05-23 00:32:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:32:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:31] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-23 00:32:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:32:31] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:32:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:31] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-23 00:32:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:32:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 116 ms returned sat
[2024-05-23 00:32:31] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-23 00:32:33] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:32:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2024-05-23 00:32:34] [INFO ] Added : 208 causal constraints over 43 iterations in 2878 ms. Result :sat
Minimization took 527 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 217 transition count 222
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 217 transition count 214
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 209 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 214
Applied a total of 40 rules in 20 ms. Remains 209 /227 variables (removed 18) and now considering 214/231 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 209/227 places, 214/231 transitions.
// Phase 1: matrix 214 rows 209 cols
[2024-05-23 00:32:35] [INFO ] Computed 33 invariants in 13 ms
Incomplete random walk after 1000000 steps, including 143937 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91251 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 1) seen :0
[2024-05-23 00:32:37] [INFO ] Invariant cache hit.
[2024-05-23 00:32:37] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:32:37] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:37] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-23 00:32:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:32:37] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:37] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-23 00:32:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 48 ms returned sat
[2024-05-23 00:32:37] [INFO ] Computed and/alt/rep : 167/1048/167 causal constraints (skipped 46 transitions) in 15 ms.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-23 00:32:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 304 ms
[2024-05-23 00:32:38] [INFO ] Added : 119 causal constraints over 24 iterations in 1303 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:32:40] [INFO ] Invariant cache hit.
[2024-05-23 00:32:40] [INFO ] Implicit Places using invariants in 155 ms returned [135, 206]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/209 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 212
Applied a total of 4 rules in 7 ms. Remains 205 /207 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 205 cols
[2024-05-23 00:32:40] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:32:40] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:32:40] [INFO ] Invariant cache hit.
[2024-05-23 00:32:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:41] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/209 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1452 ms. Remains : 205/209 places, 212/214 transitions.
[2024-05-23 00:32:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143934 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91256 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
[2024-05-23 00:32:42] [INFO ] Invariant cache hit.
[2024-05-23 00:32:42] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:32:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:42] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:32:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:32:42] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-23 00:32:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:42] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-23 00:32:42] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:43] [INFO ] [Nat]Added 40 Read/Feed constraints in 35 ms returned sat
[2024-05-23 00:32:43] [INFO ] Computed and/alt/rep : 170/1087/170 causal constraints (skipped 41 transitions) in 13 ms.
[2024-05-23 00:32:43] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-23 00:32:44] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-23 00:32:44] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:32:44] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-23 00:32:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 299 ms
[2024-05-23 00:32:44] [INFO ] Added : 117 causal constraints over 24 iterations in 1198 ms. Result :sat
Minimization took 403 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 212/212 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-05-23 00:32:45] [INFO ] Invariant cache hit.
[2024-05-23 00:32:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-23 00:32:45] [INFO ] Invariant cache hit.
[2024-05-23 00:32:46] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:46] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
[2024-05-23 00:32:46] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:32:46] [INFO ] Invariant cache hit.
[2024-05-23 00:32:47] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1288 ms. Remains : 205/205 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 16191 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-05
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:32:47] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1441 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:32:47] [INFO ] Invariant cache hit.
[2024-05-23 00:32:47] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:32:47] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:47] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-05-23 00:32:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:32:47] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:32:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:47] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:32:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:32:47] [INFO ] [Nat]Added 33 Read/Feed constraints in 113 ms returned sat
[2024-05-23 00:32:47] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:32:47] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-23 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2024-05-23 00:32:47] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 11 ms.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 76 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 79 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:32:49] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:32:50] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 81 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 79 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:32:51] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:32:52] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:32:52] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 225 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 224 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 219 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 217 transition count 223
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 209 transition count 215
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 215
Applied a total of 40 rules in 24 ms. Remains 209 /227 variables (removed 18) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 209/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:32:52] [INFO ] Computed 33 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144216 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 91605 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
[2024-05-23 00:32:53] [INFO ] Invariant cache hit.
[2024-05-23 00:32:53] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-23 00:32:53] [INFO ] [Real]Absence check using 6 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 00:32:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:53] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-23 00:32:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 00:32:53] [INFO ] [Nat]Absence check using 6 positive and 27 generalized place invariants in 5 ms returned sat
[2024-05-23 00:32:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:53] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-23 00:32:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:53] [INFO ] [Nat]Added 40 Read/Feed constraints in 28 ms returned sat
[2024-05-23 00:32:53] [INFO ] Computed and/alt/rep : 166/1044/166 causal constraints (skipped 48 transitions) in 11 ms.
[2024-05-23 00:32:54] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:32:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-23 00:32:54] [INFO ] Added : 123 causal constraints over 26 iterations in 892 ms. Result :sat
Minimization took 264 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:32:55] [INFO ] Invariant cache hit.
[2024-05-23 00:32:56] [INFO ] Implicit Places using invariants in 144 ms returned [135, 206]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/209 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 213
Applied a total of 4 rules in 7 ms. Remains 205 /207 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 205 cols
[2024-05-23 00:32:56] [INFO ] Computed 31 invariants in 8 ms
[2024-05-23 00:32:56] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 00:32:56] [INFO ] Invariant cache hit.
[2024-05-23 00:32:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:57] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/209 places, 213/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1983 ms. Remains : 205/209 places, 213/215 transitions.
[2024-05-23 00:32:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144115 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91446 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 1) seen :0
[2024-05-23 00:32:59] [INFO ] Invariant cache hit.
[2024-05-23 00:32:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-23 00:32:59] [INFO ] [Real]Absence check using 6 positive and 25 generalized place invariants in 4 ms returned sat
[2024-05-23 00:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:59] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 00:32:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:32:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-23 00:32:59] [INFO ] [Nat]Absence check using 6 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-23 00:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:32:59] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-23 00:32:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:32:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 203 ms returned sat
[2024-05-23 00:32:59] [INFO ] Computed and/alt/rep : 169/1083/169 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:33:00] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:33:01] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:33:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 646 ms
[2024-05-23 00:33:01] [INFO ] Added : 102 causal constraints over 21 iterations in 1509 ms. Result :sat
Minimization took 154 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 REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 00:33:01] [INFO ] Invariant cache hit.
[2024-05-23 00:33:01] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:33:01] [INFO ] Invariant cache hit.
[2024-05-23 00:33:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:33:03] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2024-05-23 00:33:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:33:03] [INFO ] Invariant cache hit.
[2024-05-23 00:33:03] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1890 ms. Remains : 205/205 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-05 in 16465 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:33:03] [INFO ] Computed 33 invariants in 8 ms
Incomplete random walk after 10000 steps, including 1448 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 931 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:33:03] [INFO ] Invariant cache hit.
[2024-05-23 00:33:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:33:03] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:03] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:33:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:33:03] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:03] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-05-23 00:33:03] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:33:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 522 ms returned sat
[2024-05-23 00:33:04] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:33:07] [INFO ] Deduced a trap composed of 96 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 95 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 96 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 97 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 95 places in 56 ms of which 0 ms to minimize.
[2024-05-23 00:33:08] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:33:08] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 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 227 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 226 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 226 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 224 transition count 228
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 220 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 218 transition count 224
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 218 transition count 216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 210 transition count 216
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 210 transition count 216
Applied a total of 39 rules in 18 ms. Remains 210 /227 variables (removed 17) and now considering 216/231 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 210/227 places, 216/231 transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:33:08] [INFO ] Computed 33 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 143927 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 91303 resets, run finished after 520 ms. (steps per millisecond=1923 ) properties (out of 1) seen :0
[2024-05-23 00:33:10] [INFO ] Invariant cache hit.
[2024-05-23 00:33:10] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:10] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:10] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-23 00:33:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:10] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:10] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-23 00:33:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:33:10] [INFO ] [Nat]Added 39 Read/Feed constraints in 391 ms returned sat
[2024-05-23 00:33:10] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:33:10] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:33:10] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:33:11] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:33:11] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:33:11] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:33:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 827 ms
[2024-05-23 00:33:11] [INFO ] Computed and/alt/rep : 167/1050/167 causal constraints (skipped 48 transitions) in 13 ms.
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:12] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:33:13] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:14] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:15] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2509 ms
[2024-05-23 00:33:15] [INFO ] Added : 126 causal constraints over 28 iterations in 3645 ms. Result :sat
Minimization took 405 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:33:19] [INFO ] Invariant cache hit.
[2024-05-23 00:33:19] [INFO ] Implicit Places using invariants in 147 ms returned [134, 207]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/210 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 214
Applied a total of 4 rules in 6 ms. Remains 206 /208 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 206 cols
[2024-05-23 00:33:19] [INFO ] Computed 31 invariants in 11 ms
[2024-05-23 00:33:20] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-23 00:33:20] [INFO ] Invariant cache hit.
[2024-05-23 00:33:20] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:33:21] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 1678 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/210 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1836 ms. Remains : 206/210 places, 214/216 transitions.
[2024-05-23 00:33:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 143772 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91269 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
[2024-05-23 00:33:22] [INFO ] Invariant cache hit.
[2024-05-23 00:33:22] [INFO ] [Real]Absence check using 12 positive place invariants in 32 ms returned sat
[2024-05-23 00:33:22] [INFO ] [Real]Absence check using 12 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-23 00:33:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:23] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-23 00:33:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-23 00:33:23] [INFO ] [Nat]Absence check using 12 positive and 19 generalized place invariants in 2 ms returned sat
[2024-05-23 00:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:23] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-23 00:33:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:33:23] [INFO ] [Nat]Added 39 Read/Feed constraints in 296 ms returned sat
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:33:23] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 71 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 66 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:24] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:25] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:25] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:33:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1684 ms
[2024-05-23 00:33:25] [INFO ] Computed and/alt/rep : 170/1089/170 causal constraints (skipped 43 transitions) in 15 ms.
[2024-05-23 00:33:27] [INFO ] Added : 117 causal constraints over 24 iterations in 2225 ms. Result :sat
Minimization took 516 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:33:28] [INFO ] Invariant cache hit.
[2024-05-23 00:33:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-23 00:33:28] [INFO ] Invariant cache hit.
[2024-05-23 00:33:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:33:30] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-05-23 00:33:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:33:30] [INFO ] Invariant cache hit.
[2024-05-23 00:33:30] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1804 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 27087 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:33:30] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1428 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 916 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:33:30] [INFO ] Invariant cache hit.
[2024-05-23 00:33:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:33:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:30] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2024-05-23 00:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:33:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:30] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-23 00:33:30] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:33:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 141 ms returned sat
[2024-05-23 00:33:31] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:33:32] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:33:32] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 80 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:33:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 887 ms
[2024-05-23 00:33:33] [INFO ] Added : 132 causal constraints over 28 iterations in 2556 ms. Result :sat
Minimization took 374 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
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 20 place count 217 transition count 222
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 27 place count 217 transition count 215
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 210 transition count 215
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 210 transition count 215
Applied a total of 36 rules in 17 ms. Remains 210 /227 variables (removed 17) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 210/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 210 cols
[2024-05-23 00:33:34] [INFO ] Computed 33 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144209 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91471 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 1) seen :0
[2024-05-23 00:33:35] [INFO ] Invariant cache hit.
[2024-05-23 00:33:35] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:35] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:35] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-23 00:33:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:35] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:35] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-23 00:33:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:33:35] [INFO ] [Nat]Added 36 Read/Feed constraints in 174 ms returned sat
[2024-05-23 00:33:35] [INFO ] Computed and/alt/rep : 174/1067/174 causal constraints (skipped 40 transitions) in 14 ms.
[2024-05-23 00:33:36] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2024-05-23 00:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-05-23 00:33:36] [INFO ] Added : 86 causal constraints over 18 iterations in 744 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 210/210 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:33:37] [INFO ] Invariant cache hit.
[2024-05-23 00:33:37] [INFO ] Implicit Places using invariants in 147 ms returned [136, 207]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 156 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/210 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 213
Applied a total of 4 rules in 6 ms. Remains 206 /208 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 206 cols
[2024-05-23 00:33:37] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 00:33:37] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-23 00:33:37] [INFO ] Invariant cache hit.
[2024-05-23 00:33:37] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:33:39] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/210 places, 213/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1883 ms. Remains : 206/210 places, 213/215 transitions.
[2024-05-23 00:33:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144502 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91145 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
[2024-05-23 00:33:40] [INFO ] Invariant cache hit.
[2024-05-23 00:33:40] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:33:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:40] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-05-23 00:33:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:40] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:40] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-23 00:33:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:33:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 95 ms returned sat
[2024-05-23 00:33:41] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:33:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2024-05-23 00:33:41] [INFO ] Computed and/alt/rep : 177/1106/177 causal constraints (skipped 35 transitions) in 19 ms.
[2024-05-23 00:33:42] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:33:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-23 00:33:42] [INFO ] Added : 130 causal constraints over 27 iterations in 1672 ms. Result :sat
Minimization took 382 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 00:33:43] [INFO ] Invariant cache hit.
[2024-05-23 00:33:43] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-23 00:33:43] [INFO ] Invariant cache hit.
[2024-05-23 00:33:43] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-23 00:33:44] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 1608 ms to find 0 implicit places.
[2024-05-23 00:33:44] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:33:44] [INFO ] Invariant cache hit.
[2024-05-23 00:33:45] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1719 ms. Remains : 206/206 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 14438 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:33:45] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1459 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 943 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:33:45] [INFO ] Invariant cache hit.
[2024-05-23 00:33:45] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:33:45] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:45] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-05-23 00:33:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:33:45] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2024-05-23 00:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:45] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-23 00:33:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:33:45] [INFO ] [Nat]Added 33 Read/Feed constraints in 88 ms returned sat
[2024-05-23 00:33:45] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 13 ms.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 72 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:47] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 88 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:33:48] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:33:49] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:33:50] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:33:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 219 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 217 transition count 223
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 209 transition count 215
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 215
Applied a total of 40 rules in 18 ms. Remains 209 /227 variables (removed 18) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 209/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:33:50] [INFO ] Computed 33 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144297 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91683 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 1) seen :0
[2024-05-23 00:33:51] [INFO ] Invariant cache hit.
[2024-05-23 00:33:51] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2024-05-23 00:33:51] [INFO ] [Real]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:33:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:51] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-23 00:33:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:33:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 00:33:51] [INFO ] [Nat]Absence check using 15 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:33:51] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-23 00:33:51] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:33:52] [INFO ] [Nat]Added 39 Read/Feed constraints in 88 ms returned sat
[2024-05-23 00:33:52] [INFO ] Computed and/alt/rep : 166/1048/166 causal constraints (skipped 48 transitions) in 14 ms.
[2024-05-23 00:33:53] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-23 00:33:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-23 00:33:53] [INFO ] Added : 143 causal constraints over 29 iterations in 1029 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:33:58] [INFO ] Invariant cache hit.
[2024-05-23 00:33:59] [INFO ] Implicit Places using invariants in 141 ms returned [134, 206]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/209 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 213
Applied a total of 4 rules in 6 ms. Remains 205 /207 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 205 cols
[2024-05-23 00:33:59] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:33:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 00:33:59] [INFO ] Invariant cache hit.
[2024-05-23 00:33:59] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:34:00] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/209 places, 213/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1763 ms. Remains : 205/209 places, 213/215 transitions.
[2024-05-23 00:34:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144353 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91294 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
[2024-05-23 00:34:01] [INFO ] Invariant cache hit.
[2024-05-23 00:34:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 00:34:01] [INFO ] [Real]Absence check using 10 positive and 21 generalized place invariants in 3 ms returned sat
[2024-05-23 00:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:01] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-23 00:34:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-23 00:34:02] [INFO ] [Nat]Absence check using 10 positive and 21 generalized place invariants in 3 ms returned sat
[2024-05-23 00:34:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:02] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-23 00:34:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:34:02] [INFO ] [Nat]Added 39 Read/Feed constraints in 69 ms returned sat
[2024-05-23 00:34:02] [INFO ] Computed and/alt/rep : 169/1087/169 causal constraints (skipped 43 transitions) in 12 ms.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:34:03] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:34:04] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 737 ms
[2024-05-23 00:34:04] [INFO ] Added : 150 causal constraints over 31 iterations in 2064 ms. Result :sat
Minimization took 245 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 REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 2 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 00:34:07] [INFO ] Invariant cache hit.
[2024-05-23 00:34:07] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-23 00:34:07] [INFO ] Invariant cache hit.
[2024-05-23 00:34:07] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:34:08] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2024-05-23 00:34:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:34:08] [INFO ] Invariant cache hit.
[2024-05-23 00:34:09] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1839 ms. Remains : 205/205 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 23991 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:34:09] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1451 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:34:09] [INFO ] Invariant cache hit.
[2024-05-23 00:34:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:34:09] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:09] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2024-05-23 00:34:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:34:09] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:09] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-23 00:34:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:34:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 91 ms returned sat
[2024-05-23 00:34:09] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:34:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-23 00:34:09] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-23 00:34:11] [INFO ] Added : 173 causal constraints over 35 iterations in 1721 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 220 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 218 transition count 224
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 218 transition count 216
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 210 transition count 216
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 39 place count 210 transition count 216
Applied a total of 39 rules in 16 ms. Remains 210 /227 variables (removed 17) and now considering 216/231 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 210/227 places, 216/231 transitions.
// Phase 1: matrix 216 rows 210 cols
[2024-05-23 00:34:19] [INFO ] Computed 33 invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144275 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91431 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 1) seen :0
[2024-05-23 00:34:20] [INFO ] Invariant cache hit.
[2024-05-23 00:34:20] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:34:20] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:20] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-23 00:34:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:34:20] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:21] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-23 00:34:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:34:21] [INFO ] [Nat]Added 40 Read/Feed constraints in 75 ms returned sat
[2024-05-23 00:34:21] [INFO ] Computed and/alt/rep : 167/1044/167 causal constraints (skipped 48 transitions) in 12 ms.
[2024-05-23 00:34:22] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-05-23 00:34:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 00:34:22] [INFO ] Added : 121 causal constraints over 25 iterations in 1269 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 210/210 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 210 /210 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:34:26] [INFO ] Invariant cache hit.
[2024-05-23 00:34:26] [INFO ] Implicit Places using invariants in 152 ms returned [134, 207]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 153 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/210 places, 216/216 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 206 transition count 214
Applied a total of 4 rules in 7 ms. Remains 206 /208 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 206 cols
[2024-05-23 00:34:26] [INFO ] Computed 31 invariants in 11 ms
[2024-05-23 00:34:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-23 00:34:27] [INFO ] Invariant cache hit.
[2024-05-23 00:34:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:34:28] [INFO ] Implicit Places using invariants and state equation in 1934 ms returned []
Implicit Place search using SMT with State Equation took 2064 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 206/210 places, 214/216 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2227 ms. Remains : 206/210 places, 214/216 transitions.
[2024-05-23 00:34:28] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144171 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 91706 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 1) seen :0
[2024-05-23 00:34:30] [INFO ] Invariant cache hit.
[2024-05-23 00:34:30] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:34:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:30] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 00:34:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-23 00:34:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:34:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:30] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-23 00:34:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:34:30] [INFO ] [Nat]Added 40 Read/Feed constraints in 41 ms returned sat
[2024-05-23 00:34:30] [INFO ] Computed and/alt/rep : 170/1083/170 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-23 00:34:32] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-23 00:34:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-23 00:34:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-05-23 00:34:32] [INFO ] Added : 139 causal constraints over 28 iterations in 1765 ms. Result :sat
Minimization took 423 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:34:38] [INFO ] Invariant cache hit.
[2024-05-23 00:34:38] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-23 00:34:38] [INFO ] Invariant cache hit.
[2024-05-23 00:34:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:34:39] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2024-05-23 00:34:39] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:34:39] [INFO ] Invariant cache hit.
[2024-05-23 00:34:39] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1858 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 30770 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:34:39] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1425 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 897 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-23 00:34:39] [INFO ] Invariant cache hit.
[2024-05-23 00:34:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:34:39] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:40] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-23 00:34:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:34:40] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-23 00:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:40] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-23 00:34:40] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:34:40] [INFO ] [Nat]Added 33 Read/Feed constraints in 45 ms returned sat
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 80 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 77 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 77 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:34:40] [INFO ] Deduced a trap composed of 77 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 84 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:34:41] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:34:42] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1935 ms
[2024-05-23 00:34:42] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-23 00:34:43] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:34:43] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:34:43] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:34:43] [INFO ] Deduced a trap composed of 80 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:34:43] [INFO ] Deduced a trap composed of 86 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:34:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 519 ms
[2024-05-23 00:34:44] [INFO ] Added : 140 causal constraints over 29 iterations in 1845 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 216 transition count 222
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 216 transition count 214
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 38 place count 208 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 208 transition count 214
Applied a total of 41 rules in 16 ms. Remains 208 /227 variables (removed 19) and now considering 214/231 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 208/227 places, 214/231 transitions.
// Phase 1: matrix 214 rows 208 cols
[2024-05-23 00:34:58] [INFO ] Computed 33 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 144062 resets, run finished after 703 ms. (steps per millisecond=1422 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91698 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 1) seen :0
[2024-05-23 00:34:59] [INFO ] Invariant cache hit.
[2024-05-23 00:34:59] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:34:59] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:59] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-23 00:34:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:34:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:34:59] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-23 00:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:34:59] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-23 00:34:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:34:59] [INFO ] [Nat]Added 40 Read/Feed constraints in 54 ms returned sat
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:34:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:35:00] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-23 00:35:00] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:35:00] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-23 00:35:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 535 ms
[2024-05-23 00:35:00] [INFO ] Computed and/alt/rep : 165/1041/165 causal constraints (skipped 48 transitions) in 11 ms.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:01] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:02] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:03] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:35:04] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:05] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:35:06] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 5018 ms
[2024-05-23 00:35:06] [INFO ] Added : 131 causal constraints over 27 iterations in 6298 ms. Result :sat
Minimization took 278 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 208/208 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 208 /208 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:35:08] [INFO ] Invariant cache hit.
[2024-05-23 00:35:08] [INFO ] Implicit Places using invariants in 141 ms returned [134, 205]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/208 places, 214/214 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 206 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 204 transition count 212
Applied a total of 4 rules in 7 ms. Remains 204 /206 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 204 cols
[2024-05-23 00:35:08] [INFO ] Computed 31 invariants in 9 ms
[2024-05-23 00:35:08] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-23 00:35:08] [INFO ] Invariant cache hit.
[2024-05-23 00:35:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:10] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 204/208 places, 212/214 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1815 ms. Remains : 204/208 places, 212/214 transitions.
[2024-05-23 00:35:10] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144355 resets, run finished after 700 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91663 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :0
[2024-05-23 00:35:11] [INFO ] Invariant cache hit.
[2024-05-23 00:35:11] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:11] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-23 00:35:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-23 00:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:11] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2024-05-23 00:35:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:11] [INFO ] [Nat]Added 40 Read/Feed constraints in 89 ms returned sat
[2024-05-23 00:35:11] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:35:11] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:35:11] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:35:12] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:35:12] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:35:12] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:35:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 606 ms
[2024-05-23 00:35:12] [INFO ] Computed and/alt/rep : 168/1080/168 causal constraints (skipped 43 transitions) in 13 ms.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:35:13] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-23 00:35:14] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1396 ms
[2024-05-23 00:35:14] [INFO ] Added : 119 causal constraints over 25 iterations in 2555 ms. Result :sat
Minimization took 634 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 REACHABILITY mode, iteration 0 : 204/204 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 204/204 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 212/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 204 /204 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-05-23 00:35:17] [INFO ] Invariant cache hit.
[2024-05-23 00:35:17] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-23 00:35:17] [INFO ] Invariant cache hit.
[2024-05-23 00:35:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:19] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
[2024-05-23 00:35:19] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:35:19] [INFO ] Invariant cache hit.
[2024-05-23 00:35:19] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1777 ms. Remains : 204/204 places, 212/212 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 39426 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:35:19] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 923 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:35:19] [INFO ] Invariant cache hit.
[2024-05-23 00:35:19] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:35:19] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:19] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-23 00:35:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:19] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:19] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-23 00:35:19] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:35:19] [INFO ] [Nat]Added 33 Read/Feed constraints in 52 ms returned sat
[2024-05-23 00:35:19] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 15 ms.
[2024-05-23 00:35:20] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-23 00:35:20] [INFO ] Added : 109 causal constraints over 22 iterations in 862 ms. Result :sat
Minimization took 250 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 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 227 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 226 transition count 230
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 226 transition count 228
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 224 transition count 228
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 219 transition count 223
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 217 transition count 223
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 217 transition count 215
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 36 place count 209 transition count 215
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 215
Applied a total of 40 rules in 17 ms. Remains 209 /227 variables (removed 18) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 209/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:35:21] [INFO ] Computed 33 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144539 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91447 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :0
[2024-05-23 00:35:22] [INFO ] Invariant cache hit.
[2024-05-23 00:35:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:22] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-23 00:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:22] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-23 00:35:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:35:22] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:23] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2024-05-23 00:35:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:35:23] [INFO ] [Nat]Added 39 Read/Feed constraints in 89 ms returned sat
[2024-05-23 00:35:23] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2024-05-23 00:35:23] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-23 00:35:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 162 ms
[2024-05-23 00:35:23] [INFO ] Computed and/alt/rep : 166/1052/166 causal constraints (skipped 48 transitions) in 12 ms.
[2024-05-23 00:35:23] [INFO ] Added : 58 causal constraints over 12 iterations in 378 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:35:24] [INFO ] Invariant cache hit.
[2024-05-23 00:35:24] [INFO ] Implicit Places using invariants in 141 ms returned [135, 206]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 207/209 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 213
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 213
Applied a total of 4 rules in 5 ms. Remains 205 /207 variables (removed 2) and now considering 213/215 (removed 2) transitions.
// Phase 1: matrix 213 rows 205 cols
[2024-05-23 00:35:24] [INFO ] Computed 31 invariants in 10 ms
[2024-05-23 00:35:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-23 00:35:24] [INFO ] Invariant cache hit.
[2024-05-23 00:35:24] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:35:26] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 205/209 places, 213/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1738 ms. Remains : 205/209 places, 213/215 transitions.
[2024-05-23 00:35:26] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144149 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91317 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :0
[2024-05-23 00:35:27] [INFO ] Invariant cache hit.
[2024-05-23 00:35:27] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-23 00:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:27] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:35:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 2 ms returned sat
[2024-05-23 00:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:27] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-05-23 00:35:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:35:27] [INFO ] [Nat]Added 39 Read/Feed constraints in 30 ms returned sat
[2024-05-23 00:35:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-23 00:35:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-23 00:35:27] [INFO ] Computed and/alt/rep : 169/1091/169 causal constraints (skipped 43 transitions) in 11 ms.
[2024-05-23 00:35:28] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:35:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-23 00:35:28] [INFO ] Added : 101 causal constraints over 21 iterations in 890 ms. Result :sat
Minimization took 139 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 REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 205/205 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-23 00:35:29] [INFO ] Invariant cache hit.
[2024-05-23 00:35:29] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-23 00:35:29] [INFO ] Invariant cache hit.
[2024-05-23 00:35:29] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 00:35:30] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-23 00:35:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:35:30] [INFO ] Invariant cache hit.
[2024-05-23 00:35:30] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1688 ms. Remains : 205/205 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 11424 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-14
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:35:30] [INFO ] Computed 33 invariants in 7 ms
Incomplete random walk after 10000 steps, including 1465 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 927 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-23 00:35:30] [INFO ] Invariant cache hit.
[2024-05-23 00:35:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:30] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-23 00:35:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:31] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-23 00:35:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:35:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 17 ms returned sat
[2024-05-23 00:35:31] [INFO ] Computed and/alt/rep : 211/1162/211 causal constraints (skipped 19 transitions) in 14 ms.
[2024-05-23 00:35:31] [INFO ] Added : 43 causal constraints over 9 iterations in 230 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 216 transition count 222
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 216 transition count 217
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 32 place count 211 transition count 217
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 211 transition count 217
Applied a total of 36 rules in 16 ms. Remains 211 /227 variables (removed 16) and now considering 217/231 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 211/227 places, 217/231 transitions.
// Phase 1: matrix 217 rows 211 cols
[2024-05-23 00:35:31] [INFO ] Computed 33 invariants in 19 ms
Incomplete random walk after 1000000 steps, including 144299 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91424 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 1) seen :0
[2024-05-23 00:35:32] [INFO ] Invariant cache hit.
[2024-05-23 00:35:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:32] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:35:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:32] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-23 00:35:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:32] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2024-05-23 00:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:32] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-23 00:35:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:32] [INFO ] [Nat]Added 40 Read/Feed constraints in 12 ms returned sat
[2024-05-23 00:35:32] [INFO ] Computed and/alt/rep : 183/1143/183 causal constraints (skipped 33 transitions) in 12 ms.
[2024-05-23 00:35:33] [INFO ] Added : 57 causal constraints over 12 iterations in 332 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 211/211 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 211/211 places, 217/217 transitions.
Applied a total of 0 rules in 3 ms. Remains 211 /211 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-23 00:35:33] [INFO ] Invariant cache hit.
[2024-05-23 00:35:33] [INFO ] Implicit Places using invariants in 126 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 210/211 places, 217/217 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 210 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 216
Applied a total of 2 rules in 6 ms. Remains 209 /210 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 209 cols
[2024-05-23 00:35:33] [INFO ] Computed 32 invariants in 8 ms
[2024-05-23 00:35:33] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-23 00:35:33] [INFO ] Invariant cache hit.
[2024-05-23 00:35:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:34] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 209/211 places, 216/217 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1481 ms. Remains : 209/211 places, 216/217 transitions.
[2024-05-23 00:35:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144339 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91515 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 1) seen :0
[2024-05-23 00:35:36] [INFO ] Invariant cache hit.
[2024-05-23 00:35:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:36] [INFO ] [Real]Absence check using 4 positive and 28 generalized place invariants in 5 ms returned sat
[2024-05-23 00:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:36] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-23 00:35:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:36] [INFO ] [Nat]Absence check using 4 positive and 28 generalized place invariants in 5 ms returned sat
[2024-05-23 00:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:36] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-23 00:35:36] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:36] [INFO ] [Nat]Added 40 Read/Feed constraints in 17 ms returned sat
[2024-05-23 00:35:36] [INFO ] Computed and/alt/rep : 182/1142/182 causal constraints (skipped 33 transitions) in 13 ms.
[2024-05-23 00:35:37] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-23 00:35:37] [INFO ] Added : 74 causal constraints over 16 iterations in 689 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 216/216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-23 00:35:37] [INFO ] Invariant cache hit.
[2024-05-23 00:35:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-23 00:35:37] [INFO ] Invariant cache hit.
[2024-05-23 00:35:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:38] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-05-23 00:35:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:35:38] [INFO ] Invariant cache hit.
[2024-05-23 00:35:38] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1614 ms. Remains : 209/209 places, 216/216 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-14 in 8131 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 231 rows 227 cols
[2024-05-23 00:35:38] [INFO ] Computed 33 invariants in 9 ms
Incomplete random walk after 10000 steps, including 1420 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 944 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-23 00:35:38] [INFO ] Invariant cache hit.
[2024-05-23 00:35:38] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-23 00:35:38] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:39] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-23 00:35:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-05-23 00:35:39] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2024-05-23 00:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:39] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-23 00:35:39] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-23 00:35:39] [INFO ] [Nat]Added 33 Read/Feed constraints in 175 ms returned sat
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:35:39] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 85 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 78 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 92 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 80 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:41] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 84 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 81 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 87 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 85 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-23 00:35:42] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 69 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 76 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 96 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 76 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 83 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:35:43] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:35:44] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-05-23 00:35:44] [INFO ] Deduced a trap composed of 2 places in 85 ms of which 0 ms to minimize.
[2024-05-23 00:35:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java: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) : [69] Max seen :[0]
Support contains 1 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 231/231 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 227 transition count 229
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 225 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 225 transition count 227
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 223 transition count 227
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 218 transition count 222
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 216 transition count 222
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 29 place count 216 transition count 215
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 209 transition count 215
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 209 transition count 215
Applied a total of 40 rules in 15 ms. Remains 209 /227 variables (removed 18) and now considering 215/231 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 209/227 places, 215/231 transitions.
// Phase 1: matrix 215 rows 209 cols
[2024-05-23 00:35:44] [INFO ] Computed 33 invariants in 16 ms
Incomplete random walk after 1000000 steps, including 144148 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91317 resets, run finished after 490 ms. (steps per millisecond=2040 ) properties (out of 1) seen :0
[2024-05-23 00:35:45] [INFO ] Invariant cache hit.
[2024-05-23 00:35:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:45] [INFO ] [Real]Absence check using 13 positive and 20 generalized place invariants in 2 ms returned sat
[2024-05-23 00:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:45] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-23 00:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:35:45] [INFO ] [Nat]Absence check using 13 positive and 20 generalized place invariants in 2 ms returned sat
[2024-05-23 00:35:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:35:45] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2024-05-23 00:35:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:45] [INFO ] [Nat]Added 40 Read/Feed constraints in 136 ms returned sat
[2024-05-23 00:35:45] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2024-05-23 00:35:45] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:35:46] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:35:48] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 1 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:35:49] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 0 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:35:50] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:35:51] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 0 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 6855 ms
[2024-05-23 00:35:52] [INFO ] Computed and/alt/rep : 169/1060/169 causal constraints (skipped 45 transitions) in 15 ms.
[2024-05-23 00:35:54] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:35:54] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:35:54] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 0 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 0 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 1 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:35:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1047 ms
[2024-05-23 00:35:55] [INFO ] Added : 134 causal constraints over 27 iterations in 3110 ms. Result :sat
Minimization took 420 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 209/209 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 215/215 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-23 00:35:57] [INFO ] Invariant cache hit.
[2024-05-23 00:35:58] [INFO ] Implicit Places using invariants in 136 ms returned [206]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/209 places, 215/215 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 208 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 207 transition count 214
Applied a total of 2 rules in 6 ms. Remains 207 /208 variables (removed 1) and now considering 214/215 (removed 1) transitions.
// Phase 1: matrix 214 rows 207 cols
[2024-05-23 00:35:58] [INFO ] Computed 32 invariants in 10 ms
[2024-05-23 00:35:58] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-23 00:35:58] [INFO ] Invariant cache hit.
[2024-05-23 00:35:58] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:35:59] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/209 places, 214/215 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1794 ms. Remains : 207/209 places, 214/215 transitions.
[2024-05-23 00:35:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144396 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91747 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :0
[2024-05-23 00:36:00] [INFO ] Invariant cache hit.
[2024-05-23 00:36:00] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-23 00:36:00] [INFO ] [Real]Absence check using 13 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-23 00:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 00:36:01] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-23 00:36:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-23 00:36:01] [INFO ] [Nat]Absence check using 13 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-23 00:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 00:36:01] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-23 00:36:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:36:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 76 ms returned sat
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 0 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:36:01] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:36:02] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:36:03] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:36:03] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1800 ms
[2024-05-23 00:36:03] [INFO ] Computed and/alt/rep : 173/1100/173 causal constraints (skipped 40 transitions) in 12 ms.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 0 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 0 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1478 ms
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 0 ms to minimize.
[2024-05-23 00:36:05] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 0 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 0 ms to minimize.
[2024-05-23 00:36:07] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1393 ms
[2024-05-23 00:36:07] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-23 00:36:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-23 00:36:07] [INFO ] Added : 116 causal constraints over 26 iterations in 4474 ms. Result :sat
Minimization took 496 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 207 /207 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 207/207 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 214/214 transitions.
Applied a total of 0 rules in 2 ms. Remains 207 /207 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-23 00:36:08] [INFO ] Invariant cache hit.
[2024-05-23 00:36:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-23 00:36:08] [INFO ] Invariant cache hit.
[2024-05-23 00:36:08] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 00:36:10] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
[2024-05-23 00:36:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:36:10] [INFO ] Invariant cache hit.
[2024-05-23 00:36:10] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1698 ms. Remains : 207/207 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 31386 ms.
[2024-05-23 00:36:10] [INFO ] Flatten gal took : 61 ms
[2024-05-23 00:36:10] [INFO ] Applying decomposition
[2024-05-23 00:36:10] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16324927056891910666.txt' '-o' '/tmp/graph16324927056891910666.bin' '-w' '/tmp/graph16324927056891910666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16324927056891910666.bin' '-l' '-1' '-v' '-w' '/tmp/graph16324927056891910666.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:36:10] [INFO ] Decomposing Gal with order
[2024-05-23 00:36:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:36:10] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-23 00:36:10] [INFO ] Flatten gal took : 113 ms
[2024-05-23 00:36:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 20 ms.
[2024-05-23 00:36:10] [INFO ] Time to serialize gal into /tmp/UpperBounds4476842801314211415.gal : 8 ms
[2024-05-23 00:36:10] [INFO ] Time to serialize properties into /tmp/UpperBounds7768010426053887130.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4476842801314211415.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7768010426053887130.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7768010426053887130.prop.
Detected timeout of ITS tools.
[2024-05-23 01:00:01] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:00:01] [INFO ] Time to serialize gal into /tmp/UpperBounds9875627053530127011.gal : 3 ms
[2024-05-23 01:00:01] [INFO ] Time to serialize properties into /tmp/UpperBounds2443791312776861397.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9875627053530127011.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2443791312776861397.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds2443791312776861397.prop.
Detected timeout of ITS tools.
[2024-05-23 01:23:57] [INFO ] Flatten gal took : 186 ms
[2024-05-23 01:23:59] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-23 01:23:59] [INFO ] Transformed 227 places.
[2024-05-23 01:23:59] [INFO ] Transformed 231 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-23 01:23:59] [INFO ] Time to serialize gal into /tmp/UpperBounds10544736602985151598.gal : 5 ms
[2024-05-23 01:23:59] [INFO ] Time to serialize properties into /tmp/UpperBounds8070937524968058442.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10544736602985151598.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8070937524968058442.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8070937524968058442.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15088256 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16252152 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r153-tall-171631151600346"
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 '
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 ;