Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 340K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620591971269

Running Version 0
[2021-05-09 20:26:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 20:26:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 20:26:12] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-05-09 20:26:12] [INFO ] Transformed 1064 places.
[2021-05-09 20:26:12] [INFO ] Transformed 998 transitions.
[2021-05-09 20:26:12] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 998 rows 1064 cols
[2021-05-09 20:26:13] [INFO ] Invariants computation overflowed in 147 ms
Incomplete random walk after 10000 steps, including 337 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 283 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 284 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 267 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 16) seen :4
// Phase 1: matrix 998 rows 1064 cols
[2021-05-09 20:26:13] [INFO ] Invariants computation overflowed in 130 ms
[2021-05-09 20:26:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:16] [INFO ] [Real]Absence check using state equation in 2217 ms returned sat
[2021-05-09 20:26:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:18] [INFO ] [Nat]Absence check using state equation in 1922 ms returned sat
[2021-05-09 20:26:18] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 4 ms to minimize.
[2021-05-09 20:26:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 590 ms
[2021-05-09 20:26:18] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 61 ms.
[2021-05-09 20:26:21] [INFO ] Added : 80 causal constraints over 16 iterations in 2400 ms. Result :unknown
[2021-05-09 20:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:21] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2021-05-09 20:26:21] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 53 ms.
[2021-05-09 20:26:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:22] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-09 20:26:22] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 54 ms.
[2021-05-09 20:26:26] [INFO ] Added : 40 causal constraints over 8 iterations in 4600 ms. Result :unknown
[2021-05-09 20:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:29] [INFO ] [Real]Absence check using state equation in 2689 ms returned sat
[2021-05-09 20:26:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:32] [INFO ] [Nat]Absence check using state equation in 2893 ms returned sat
[2021-05-09 20:26:32] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 1 ms to minimize.
[2021-05-09 20:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2021-05-09 20:26:33] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2021-05-09 20:26:35] [INFO ] Deduced a trap composed of 8 places in 357 ms of which 2 ms to minimize.
[2021-05-09 20:26:35] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 20:26:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:38] [INFO ] [Real]Absence check using state equation in 3100 ms returned sat
[2021-05-09 20:26:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:41] [INFO ] [Nat]Absence check using state equation in 2741 ms returned sat
[2021-05-09 20:26:41] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 2 ms to minimize.
[2021-05-09 20:26:41] [INFO ] Deduced a trap composed of 31 places in 316 ms of which 2 ms to minimize.
[2021-05-09 20:26:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 775 ms
[2021-05-09 20:26:41] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 56 ms.
[2021-05-09 20:26:43] [INFO ] Added : 20 causal constraints over 4 iterations in 1396 ms. Result :unknown
[2021-05-09 20:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:46] [INFO ] [Real]Absence check using state equation in 3032 ms returned sat
[2021-05-09 20:26:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:48] [INFO ] [Nat]Absence check using state equation in 2372 ms returned sat
[2021-05-09 20:26:49] [INFO ] Deduced a trap composed of 407 places in 346 ms of which 3 ms to minimize.
[2021-05-09 20:26:49] [INFO ] Deduced a trap composed of 405 places in 309 ms of which 1 ms to minimize.
[2021-05-09 20:26:50] [INFO ] Deduced a trap composed of 403 places in 314 ms of which 0 ms to minimize.
[2021-05-09 20:26:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1235 ms
[2021-05-09 20:26:50] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 67 ms.
[2021-05-09 20:26:51] [INFO ] Added : 20 causal constraints over 4 iterations in 1304 ms. Result :unknown
[2021-05-09 20:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:53] [INFO ] [Real]Absence check using state equation in 2011 ms returned sat
[2021-05-09 20:26:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:55] [INFO ] [Nat]Absence check using state equation in 1296 ms returned sat
[2021-05-09 20:26:55] [INFO ] Deduced a trap composed of 405 places in 305 ms of which 1 ms to minimize.
[2021-05-09 20:26:55] [INFO ] Deduced a trap composed of 48 places in 265 ms of which 1 ms to minimize.
[2021-05-09 20:26:55] [INFO ] Deduced a trap composed of 41 places in 268 ms of which 1 ms to minimize.
[2021-05-09 20:26:56] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 1 ms to minimize.
[2021-05-09 20:26:56] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 1 ms to minimize.
[2021-05-09 20:26:56] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 1 ms to minimize.
[2021-05-09 20:26:57] [INFO ] Deduced a trap composed of 67 places in 252 ms of which 1 ms to minimize.
[2021-05-09 20:26:57] [INFO ] Deduced a trap composed of 65 places in 250 ms of which 0 ms to minimize.
[2021-05-09 20:26:57] [INFO ] Deduced a trap composed of 257 places in 194 ms of which 1 ms to minimize.
[2021-05-09 20:26:57] [INFO ] Deduced a trap composed of 182 places in 204 ms of which 1 ms to minimize.
[2021-05-09 20:26:58] [INFO ] Deduced a trap composed of 264 places in 203 ms of which 0 ms to minimize.
[2021-05-09 20:26:58] [INFO ] Deduced a trap composed of 244 places in 191 ms of which 1 ms to minimize.
[2021-05-09 20:26:58] [INFO ] Deduced a trap composed of 240 places in 199 ms of which 1 ms to minimize.
[2021-05-09 20:26:58] [INFO ] Deduced a trap composed of 273 places in 191 ms of which 1 ms to minimize.
[2021-05-09 20:26:58] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 20:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:59] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2021-05-09 20:26:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:26:59] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2021-05-09 20:26:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 53 ms.
[2021-05-09 20:27:04] [INFO ] Added : 50 causal constraints over 10 iterations in 4474 ms. Result :unknown
[2021-05-09 20:27:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:08] [INFO ] [Real]Absence check using state equation in 3622 ms returned sat
[2021-05-09 20:27:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:11] [INFO ] [Nat]Absence check using state equation in 2926 ms returned sat
[2021-05-09 20:27:11] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 1 ms to minimize.
[2021-05-09 20:27:11] [INFO ] Deduced a trap composed of 241 places in 291 ms of which 0 ms to minimize.
[2021-05-09 20:27:12] [INFO ] Deduced a trap composed of 295 places in 292 ms of which 1 ms to minimize.
[2021-05-09 20:27:12] [INFO ] Deduced a trap composed of 216 places in 299 ms of which 2 ms to minimize.
[2021-05-09 20:27:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1425 ms
[2021-05-09 20:27:12] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 66 ms.
[2021-05-09 20:27:13] [INFO ] Added : 20 causal constraints over 4 iterations in 561 ms. Result :unknown
[2021-05-09 20:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:17] [INFO ] [Real]Absence check using state equation in 4704 ms returned sat
[2021-05-09 20:27:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:22] [INFO ] [Nat]Absence check using state equation in 4906 ms returned unknown
[2021-05-09 20:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:27] [INFO ] [Real]Absence check using state equation in 4905 ms returned unknown
[2021-05-09 20:27:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:31] [INFO ] [Real]Absence check using state equation in 3072 ms returned sat
[2021-05-09 20:27:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:33] [INFO ] [Nat]Absence check using state equation in 2413 ms returned sat
[2021-05-09 20:27:33] [INFO ] Deduced a trap composed of 60 places in 236 ms of which 1 ms to minimize.
[2021-05-09 20:27:34] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 0 ms to minimize.
[2021-05-09 20:27:34] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 1 ms to minimize.
[2021-05-09 20:27:34] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 0 ms to minimize.
[2021-05-09 20:27:35] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 0 ms to minimize.
[2021-05-09 20:27:35] [INFO ] Deduced a trap composed of 79 places in 225 ms of which 0 ms to minimize.
[2021-05-09 20:27:35] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 0 ms to minimize.
[2021-05-09 20:27:35] [INFO ] Deduced a trap composed of 91 places in 213 ms of which 0 ms to minimize.
[2021-05-09 20:27:36] [INFO ] Deduced a trap composed of 129 places in 221 ms of which 4 ms to minimize.
[2021-05-09 20:27:36] [INFO ] Deduced a trap composed of 103 places in 218 ms of which 1 ms to minimize.
[2021-05-09 20:27:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 20:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:37] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2021-05-09 20:27:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:37] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2021-05-09 20:27:38] [INFO ] Deduced a trap composed of 378 places in 296 ms of which 1 ms to minimize.
[2021-05-09 20:27:38] [INFO ] Deduced a trap composed of 149 places in 204 ms of which 1 ms to minimize.
[2021-05-09 20:27:38] [INFO ] Deduced a trap composed of 412 places in 319 ms of which 1 ms to minimize.
[2021-05-09 20:27:38] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 0 ms to minimize.
[2021-05-09 20:27:39] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 1 ms to minimize.
[2021-05-09 20:27:39] [INFO ] Deduced a trap composed of 284 places in 170 ms of which 1 ms to minimize.
[2021-05-09 20:27:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1650 ms
[2021-05-09 20:27:39] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2021-05-09 20:27:42] [INFO ] Added : 190 causal constraints over 38 iterations in 2596 ms. Result :unknown
[2021-05-09 20:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:45] [INFO ] [Real]Absence check using state equation in 3789 ms returned unknown
[2021-05-09 20:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:46] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2021-05-09 20:27:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:47] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2021-05-09 20:27:47] [INFO ] Deduced a trap composed of 127 places in 204 ms of which 13 ms to minimize.
[2021-05-09 20:27:47] [INFO ] Deduced a trap composed of 176 places in 189 ms of which 0 ms to minimize.
[2021-05-09 20:27:48] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 0 ms to minimize.
[2021-05-09 20:27:48] [INFO ] Deduced a trap composed of 139 places in 189 ms of which 1 ms to minimize.
[2021-05-09 20:27:48] [INFO ] Deduced a trap composed of 173 places in 187 ms of which 1 ms to minimize.
[2021-05-09 20:27:48] [INFO ] Deduced a trap composed of 175 places in 186 ms of which 1 ms to minimize.
[2021-05-09 20:27:49] [INFO ] Deduced a trap composed of 211 places in 186 ms of which 0 ms to minimize.
[2021-05-09 20:27:49] [INFO ] Deduced a trap composed of 200 places in 187 ms of which 0 ms to minimize.
[2021-05-09 20:27:49] [INFO ] Deduced a trap composed of 125 places in 190 ms of which 2 ms to minimize.
[2021-05-09 20:27:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2086 ms
[2021-05-09 20:27:49] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 47 ms.
[2021-05-09 20:27:52] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 0 ms to minimize.
[2021-05-09 20:27: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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-09 20:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:52] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2021-05-09 20:27:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:27:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:27:53] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2021-05-09 20:27:53] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 51 ms.
[2021-05-09 20:27:57] [INFO ] Added : 175 causal constraints over 35 iterations in 4349 ms. Result :unknown
[2021-05-09 20:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:28:02] [INFO ] [Real]Absence check using state equation in 4908 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Interrupted Parikh walk after 15459776 steps, including 541233 resets, run timeout after 30001 ms. (steps per millisecond=515 ) properties (out of 16) seen :4
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Interrupted Parikh walk after 15597771 steps, including 545689 resets, run timeout after 30001 ms. (steps per millisecond=519 ) properties (out of 16) seen :4
Incomplete Parikh walk after 12482600 steps, including 436852 resets, run finished after 24357 ms. (steps per millisecond=512 ) properties (out of 16) seen :4 could not realise parikh vector
Incomplete Parikh walk after 92400 steps, including 3248 resets, run finished after 180 ms. (steps per millisecond=513 ) properties (out of 16) seen :4 could not realise parikh vector
Incomplete Parikh walk after 26900 steps, including 1553 resets, run finished after 63 ms. (steps per millisecond=426 ) properties (out of 16) seen :4 could not realise parikh vector
Incomplete Parikh walk after 12572600 steps, including 440062 resets, run finished after 24492 ms. (steps per millisecond=513 ) properties (out of 16) seen :4 could not realise parikh vector
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 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 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1057 transition count 770
Reduce places removed 226 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 233 rules applied. Total rules applied 463 place count 831 transition count 763
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 470 place count 824 transition count 763
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 470 place count 824 transition count 723
Deduced a syphon composed of 40 places in 23 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 550 place count 784 transition count 723
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 4 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 3 with 348 rules applied. Total rules applied 898 place count 610 transition count 549
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 8 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 968 place count 575 transition count 549
Free-agglomeration rule (complex) applied 73 times.
Iterating global reduction 3 with 73 rules applied. Total rules applied 1041 place count 575 transition count 476
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 3 with 73 rules applied. Total rules applied 1114 place count 502 transition count 476
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 1200 place count 502 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1201 place count 501 transition count 475
Applied a total of 1201 rules in 318 ms. Remains 501 /1064 variables (removed 563) and now considering 475/998 (removed 523) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/1064 places, 475/998 transitions.
// Phase 1: matrix 475 rows 501 cols
[2021-05-09 20:29:52] [INFO ] Computed 100 place invariants in 70 ms
Incomplete random walk after 1000000 steps, including 112772 resets, run finished after 1980 ms. (steps per millisecond=505 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77564 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77772 resets, run finished after 1365 ms. (steps per millisecond=732 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77743 resets, run finished after 1318 ms. (steps per millisecond=758 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77913 resets, run finished after 1311 ms. (steps per millisecond=762 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77579 resets, run finished after 1301 ms. (steps per millisecond=768 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77597 resets, run finished after 1300 ms. (steps per millisecond=769 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77769 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77879 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77711 resets, run finished after 1298 ms. (steps per millisecond=770 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77513 resets, run finished after 1299 ms. (steps per millisecond=769 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77911 resets, run finished after 1300 ms. (steps per millisecond=769 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77789 resets, run finished after 1299 ms. (steps per millisecond=769 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77354 resets, run finished after 1298 ms. (steps per millisecond=770 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77754 resets, run finished after 1298 ms. (steps per millisecond=770 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 77886 resets, run finished after 1301 ms. (steps per millisecond=768 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 77826 resets, run finished after 1305 ms. (steps per millisecond=766 ) properties (out of 16) seen :4
// Phase 1: matrix 475 rows 501 cols
[2021-05-09 20:30:15] [INFO ] Computed 100 place invariants in 83 ms
[2021-05-09 20:30:15] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-09 20:30:15] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:15] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-09 20:30:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:30:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-05-09 20:30:15] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:15] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-09 20:30:15] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:30:15] [INFO ] [Nat]Added 73 Read/Feed constraints in 65 ms returned sat
[2021-05-09 20:30:15] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2021-05-09 20:30:16] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 1 ms to minimize.
[2021-05-09 20:30:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2021-05-09 20:30:16] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 30 ms.
[2021-05-09 20:30:22] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:30:22] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:30:22] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 7 ms to minimize.
[2021-05-09 20:30:22] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 0 ms to minimize.
[2021-05-09 20:30:23] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:30:23] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:30:23] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:30:24] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:30:24] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:30:24] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:30:24] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:30:24] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:30:25] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:30:25] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:30:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3349 ms
[2021-05-09 20:30:25] [INFO ] Added : 325 causal constraints over 66 iterations in 9542 ms. Result :sat
Minimization took 2013 ms.
[2021-05-09 20:30:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:30:27] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:27] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2021-05-09 20:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:30:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2021-05-09 20:30:27] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2021-05-09 20:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:28] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2021-05-09 20:30:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 211 ms returned sat
[2021-05-09 20:30:28] [INFO ] Deduced a trap composed of 68 places in 37 ms of which 0 ms to minimize.
[2021-05-09 20:30:28] [INFO ] Deduced a trap composed of 82 places in 36 ms of which 0 ms to minimize.
[2021-05-09 20:30:28] [INFO ] Deduced a trap composed of 80 places in 36 ms of which 0 ms to minimize.
[2021-05-09 20:30:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2021-05-09 20:30:28] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:30:35] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2021-05-09 20:30:35] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 0 ms to minimize.
[2021-05-09 20:30:35] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 1 ms to minimize.
[2021-05-09 20:30:36] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 0 ms to minimize.
[2021-05-09 20:30:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 981 ms
[2021-05-09 20:30:36] [INFO ] Added : 313 causal constraints over 63 iterations in 7610 ms. Result :sat
Minimization took 1808 ms.
[2021-05-09 20:30:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:30:38] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:38] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 20:30:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:30:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:30:38] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2021-05-09 20:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:30:38] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-09 20:30:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 31 ms returned sat
[2021-05-09 20:30:38] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:30:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2021-05-09 20:30:38] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:30:49] [INFO ] Deduced a trap composed of 130 places in 163 ms of which 1 ms to minimize.
[2021-05-09 20:30:49] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 1 ms to minimize.
[2021-05-09 20:30:49] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
[2021-05-09 20:30:49] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2021-05-09 20:30:50] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 0 ms to minimize.
[2021-05-09 20:30:50] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 0 ms to minimize.
[2021-05-09 20:30:50] [INFO ] Deduced a trap composed of 161 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:30:50] [INFO ] Deduced a trap composed of 139 places in 161 ms of which 0 ms to minimize.
[2021-05-09 20:30:50] [INFO ] Deduced a trap composed of 149 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:30:51] [INFO ] Deduced a trap composed of 161 places in 163 ms of which 1 ms to minimize.
[2021-05-09 20:30:51] [INFO ] Deduced a trap composed of 164 places in 162 ms of which 1 ms to minimize.
[2021-05-09 20:30:51] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:30:51] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:30:51] [INFO ] Deduced a trap composed of 161 places in 160 ms of which 0 ms to minimize.
[2021-05-09 20:30:52] [INFO ] Deduced a trap composed of 153 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:30:52] [INFO ] Deduced a trap composed of 172 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:30:52] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2021-05-09 20:30:52] [INFO ] Deduced a trap composed of 166 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:53] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:53] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:53] [INFO ] Deduced a trap composed of 150 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:53] [INFO ] Deduced a trap composed of 141 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:30:53] [INFO ] Deduced a trap composed of 140 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:30:54] [INFO ] Deduced a trap composed of 167 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:30:54] [INFO ] Deduced a trap composed of 176 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:30:54] [INFO ] Deduced a trap composed of 171 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:30:54] [INFO ] Deduced a trap composed of 172 places in 157 ms of which 1 ms to minimize.
[2021-05-09 20:30:55] [INFO ] Deduced a trap composed of 176 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:30:55] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 0 ms to minimize.
[2021-05-09 20:30:55] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:55] [INFO ] Deduced a trap composed of 173 places in 167 ms of which 0 ms to minimize.
[2021-05-09 20:30:55] [INFO ] Deduced a trap composed of 162 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:30:56] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:30:56] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:30:56] [INFO ] Deduced a trap composed of 130 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:30:56] [INFO ] Deduced a trap composed of 161 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:57] [INFO ] Deduced a trap composed of 148 places in 155 ms of which 0 ms to minimize.
[2021-05-09 20:30:57] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 1 ms to minimize.
[2021-05-09 20:30:57] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 1 ms to minimize.
[2021-05-09 20:30:57] [INFO ] Deduced a trap composed of 76 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:30:57] [INFO ] Deduced a trap composed of 153 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:30:58] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:30:58] [INFO ] Deduced a trap composed of 143 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:30:58] [INFO ] Deduced a trap composed of 160 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:30:58] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:59] [INFO ] Deduced a trap composed of 120 places in 155 ms of which 1 ms to minimize.
[2021-05-09 20:30:59] [INFO ] Deduced a trap composed of 48 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:30:59] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:30:59] [INFO ] Deduced a trap composed of 155 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:30:59] [INFO ] Deduced a trap composed of 168 places in 154 ms of which 0 ms to minimize.
[2021-05-09 20:31:00] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 0 ms to minimize.
[2021-05-09 20:31:00] [INFO ] Deduced a trap composed of 154 places in 154 ms of which 0 ms to minimize.
[2021-05-09 20:31:00] [INFO ] Deduced a trap composed of 128 places in 154 ms of which 0 ms to minimize.
[2021-05-09 20:31:00] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 1 ms to minimize.
[2021-05-09 20:31:01] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 1 ms to minimize.
[2021-05-09 20:31:01] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 0 ms to minimize.
[2021-05-09 20:31:01] [INFO ] Deduced a trap composed of 167 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:31:01] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:31:01] [INFO ] Deduced a trap composed of 165 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:31:02] [INFO ] Deduced a trap composed of 168 places in 152 ms of which 1 ms to minimize.
[2021-05-09 20:31:02] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 1 ms to minimize.
[2021-05-09 20:31:02] [INFO ] Deduced a trap composed of 156 places in 155 ms of which 1 ms to minimize.
[2021-05-09 20:31:02] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:31:02] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 0 ms to minimize.
[2021-05-09 20:31:03] [INFO ] Deduced a trap composed of 183 places in 161 ms of which 1 ms to minimize.
[2021-05-09 20:31:03] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 0 ms to minimize.
[2021-05-09 20:31:03] [INFO ] Deduced a trap composed of 160 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:31:03] [INFO ] Deduced a trap composed of 155 places in 152 ms of which 1 ms to minimize.
[2021-05-09 20:31:04] [INFO ] Deduced a trap composed of 164 places in 153 ms of which 0 ms to minimize.
[2021-05-09 20:31:04] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 0 ms to minimize.
[2021-05-09 20:31:04] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2021-05-09 20:31:04] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
[2021-05-09 20:31:04] [INFO ] Trap strengthening (SAT) tested/added 73/72 trap constraints in 15594 ms
[2021-05-09 20:31:04] [INFO ] Added : 379 causal constraints over 77 iterations in 25989 ms.(timeout) Result :sat
Minimization took 3003 ms.
[2021-05-09 20:31:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:07] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:07] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2021-05-09 20:31:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:31:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:08] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:08] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2021-05-09 20:31:09] [INFO ] [Nat]Added 73 Read/Feed constraints in 1018 ms returned sat
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 0 ms to minimize.
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 0 ms to minimize.
[2021-05-09 20:31:09] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 0 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 48 places in 79 ms of which 1 ms to minimize.
[2021-05-09 20:31:10] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 0 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 95 places in 78 ms of which 0 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 107 places in 78 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 118 places in 79 ms of which 0 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 127 places in 83 ms of which 0 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 128 places in 77 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2021-05-09 20:31:11] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 1 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 129 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 118 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 124 places in 75 ms of which 1 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 128 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 140 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:12] [INFO ] Deduced a trap composed of 123 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 117 places in 75 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 126 places in 78 ms of which 0 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 123 places in 77 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 127 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:13] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 118 places in 81 ms of which 1 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 114 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 1 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 137 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 125 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 133 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 110 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 123 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 133 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 129 places in 79 ms of which 0 ms to minimize.
[2021-05-09 20:31:14] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 109 places in 81 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 1 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 142 places in 77 ms of which 1 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 139 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 112 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 117 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 110 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 118 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 141 places in 82 ms of which 0 ms to minimize.
[2021-05-09 20:31:15] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 140 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 123 places in 68 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 120 places in 72 ms of which 1 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 123 places in 64 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 114 places in 69 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 125 places in 63 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 121 places in 62 ms of which 1 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 74 places in 37 ms of which 1 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Deduced a trap composed of 71 places in 38 ms of which 0 ms to minimize.
[2021-05-09 20:31:16] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 7654 ms
[2021-05-09 20:31:16] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:31:22] [INFO ] Added : 25 causal constraints over 5 iterations in 6051 ms. Result :sat
Minimization took 634 ms.
[2021-05-09 20:31:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:23] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:31:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:23] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-09 20:31:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:31:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:24] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:24] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2021-05-09 20:31:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 122 ms returned sat
[2021-05-09 20:31:24] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2021-05-09 20:31:24] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2021-05-09 20:31:24] [INFO ] Deduced a trap composed of 72 places in 31 ms of which 0 ms to minimize.
[2021-05-09 20:31:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2021-05-09 20:31:24] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:31:34] [INFO ] Added : 357 causal constraints over 72 iterations in 9606 ms. Result :sat
Minimization took 1207 ms.
[2021-05-09 20:31:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:35] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:35] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2021-05-09 20:31:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:31:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:31:35] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2021-05-09 20:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:31:36] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2021-05-09 20:31:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 70 ms returned sat
[2021-05-09 20:31:36] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2021-05-09 20:31:36] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 0 ms to minimize.
[2021-05-09 20:31:36] [INFO ] Deduced a trap composed of 79 places in 37 ms of which 0 ms to minimize.
[2021-05-09 20:31:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2021-05-09 20:31:36] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 28 ms.
[2021-05-09 20:31:50] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2021-05-09 20:31:50] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2021-05-09 20:31:50] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2021-05-09 20:31:51] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:31:51] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:31:51] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:31:51] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:31:52] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:31:52] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2021-05-09 20:31:52] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 0 ms to minimize.
[2021-05-09 20:31:53] [INFO ] Deduced a trap composed of 150 places in 142 ms of which 1 ms to minimize.
[2021-05-09 20:31:53] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:31:53] [INFO ] Deduced a trap composed of 154 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:31:53] [INFO ] Deduced a trap composed of 148 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:31:53] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2021-05-09 20:31:54] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2021-05-09 20:31:54] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 1 ms to minimize.
[2021-05-09 20:31:54] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:31:54] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:31:55] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:55] [INFO ] Deduced a trap composed of 151 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:31:55] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:55] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2021-05-09 20:31:56] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:31:56] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 0 ms to minimize.
[2021-05-09 20:31:56] [INFO ] Deduced a trap composed of 143 places in 142 ms of which 1 ms to minimize.
[2021-05-09 20:31:57] [INFO ] Deduced a trap composed of 138 places in 143 ms of which 1 ms to minimize.
[2021-05-09 20:31:57] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 0 ms to minimize.
[2021-05-09 20:31:57] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:31:57] [INFO ] Deduced a trap composed of 136 places in 142 ms of which 1 ms to minimize.
[2021-05-09 20:31:57] [INFO ] Deduced a trap composed of 167 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:58] [INFO ] Deduced a trap composed of 166 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:58] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:31:58] [INFO ] Deduced a trap composed of 164 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:58] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:31:58] [INFO ] Deduced a trap composed of 159 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:31:59] [INFO ] Deduced a trap composed of 146 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:31:59] [INFO ] Deduced a trap composed of 141 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:31:59] [INFO ] Deduced a trap composed of 161 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:59] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:31:59] [INFO ] Deduced a trap composed of 154 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:32:00] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:32:00] [INFO ] Deduced a trap composed of 141 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:32:00] [INFO ] Deduced a trap composed of 166 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:32:00] [INFO ] Deduced a trap composed of 162 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:32:00] [INFO ] Deduced a trap composed of 158 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:32:01] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:32:01] [INFO ] Deduced a trap composed of 164 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:32:01] [INFO ] Deduced a trap composed of 159 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:32:01] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:32:01] [INFO ] Deduced a trap composed of 164 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:32:02] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:32:02] [INFO ] Deduced a trap composed of 169 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:32:02] [INFO ] Deduced a trap composed of 167 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:32:02] [INFO ] Deduced a trap composed of 171 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:32:02] [INFO ] Deduced a trap composed of 173 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:32:03] [INFO ] Deduced a trap composed of 165 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:32:03] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:32:03] [INFO ] Deduced a trap composed of 172 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:32:03] [INFO ] Deduced a trap composed of 173 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:32:03] [INFO ] Deduced a trap composed of 163 places in 141 ms of which 0 ms to minimize.
[2021-05-09 20:32:04] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:32:04] [INFO ] Deduced a trap composed of 170 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:32:04] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 1 ms to minimize.
[2021-05-09 20:32:04] [INFO ] Deduced a trap composed of 165 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:32:04] [INFO ] Trap strengthening (SAT) tested/added 66/65 trap constraints in 14865 ms
[2021-05-09 20:32:04] [INFO ] Added : 376 causal constraints over 76 iterations in 28119 ms. Result :sat
Minimization took 2363 ms.
[2021-05-09 20:32:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:32:07] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:07] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-09 20:32:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:32:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:32:07] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:07] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-09 20:32:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 111 ms returned sat
[2021-05-09 20:32:07] [INFO ] Deduced a trap composed of 68 places in 38 ms of which 0 ms to minimize.
[2021-05-09 20:32:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2021-05-09 20:32:08] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 28 ms.
[2021-05-09 20:32:17] [INFO ] Added : 375 causal constraints over 75 iterations in 9431 ms. Result :sat
Minimization took 1211 ms.
[2021-05-09 20:32:18] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:32:18] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:32:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:18] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 20:32:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:32:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:32:19] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2021-05-09 20:32:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:19] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2021-05-09 20:32:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 35 ms returned sat
[2021-05-09 20:32:19] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2021-05-09 20:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2021-05-09 20:32:19] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 27 ms.
[2021-05-09 20:32:31] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:32:31] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:32:31] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:32:31] [INFO ] Deduced a trap composed of 142 places in 161 ms of which 1 ms to minimize.
[2021-05-09 20:32:31] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2021-05-09 20:32:32] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 1 ms to minimize.
[2021-05-09 20:32:32] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:32:32] [INFO ] Deduced a trap composed of 148 places in 166 ms of which 1 ms to minimize.
[2021-05-09 20:32:32] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 1 ms to minimize.
[2021-05-09 20:32:33] [INFO ] Deduced a trap composed of 150 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:32:33] [INFO ] Deduced a trap composed of 147 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:32:33] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:32:33] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2021-05-09 20:32:34] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:32:34] [INFO ] Deduced a trap composed of 18 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:32:34] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:32:34] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:32:35] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:32:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4258 ms
[2021-05-09 20:32:35] [INFO ] Added : 395 causal constraints over 79 iterations in 15814 ms. Result :sat
Minimization took 2136 ms.
[2021-05-09 20:32:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:32:37] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:37] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 20:32:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:32:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:32:37] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:37] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2021-05-09 20:32:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 35 ms returned sat
[2021-05-09 20:32:37] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 37 ms.
[2021-05-09 20:32:49] [INFO ] Added : 355 causal constraints over 71 iterations in 11271 ms. Result :sat
Minimization took 1805 ms.
[2021-05-09 20:32:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:32:51] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:51] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-09 20:32:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:32:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:32:51] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2021-05-09 20:32:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:32:51] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2021-05-09 20:32:51] [INFO ] [Nat]Added 73 Read/Feed constraints in 35 ms returned sat
[2021-05-09 20:32:51] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:32:51] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 1 ms to minimize.
[2021-05-09 20:32:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2021-05-09 20:32:51] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 29 ms.
[2021-05-09 20:33:04] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2021-05-09 20:33:04] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2021-05-09 20:33:04] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 0 ms to minimize.
[2021-05-09 20:33:04] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2021-05-09 20:33:04] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 53 places in 44 ms of which 0 ms to minimize.
[2021-05-09 20:33:05] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:33:06] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2021-05-09 20:33:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2020 ms
[2021-05-09 20:33:06] [INFO ] Added : 401 causal constraints over 81 iterations in 14276 ms. Result :sat
Minimization took 3001 ms.
[2021-05-09 20:33:09] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:33:09] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:33:09] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2021-05-09 20:33:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:33:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:33:09] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2021-05-09 20:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:33:09] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-09 20:33:09] [INFO ] [Nat]Added 73 Read/Feed constraints in 50 ms returned sat
[2021-05-09 20:33:09] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 70 places in 37 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 77 places in 34 ms of which 1 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 72 places in 34 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Deduced a trap composed of 69 places in 31 ms of which 0 ms to minimize.
[2021-05-09 20:33:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 434 ms
[2021-05-09 20:33:10] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:33:21] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2021-05-09 20:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 207 ms
[2021-05-09 20:33:21] [INFO ] Added : 370 causal constraints over 74 iterations in 11370 ms. Result :sat
Minimization took 1725 ms.
[2021-05-09 20:33:23] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:33:23] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:33:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:33:23] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2021-05-09 20:33:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:33:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:33:23] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 28 ms returned sat
[2021-05-09 20:33:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:33:24] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-09 20:33:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 31 ms returned sat
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 1 ms to minimize.
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:33:24] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:25] [INFO ] Deduced a trap composed of 147 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 149 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 157 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 158 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 0 ms to minimize.
[2021-05-09 20:33:26] [INFO ] Deduced a trap composed of 149 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 147 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 149 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 147 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:27] [INFO ] Deduced a trap composed of 146 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 147 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 148 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:28] [INFO ] Deduced a trap composed of 160 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 166 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 167 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 156 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:29] [INFO ] Deduced a trap composed of 143 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 145 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 150 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 158 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 152 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:30] [INFO ] Deduced a trap composed of 167 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 160 places in 116 ms of which 0 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 146 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 151 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 168 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 159 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:31] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 156 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 154 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 157 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 154 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:32] [INFO ] Deduced a trap composed of 140 places in 119 ms of which 0 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 157 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 160 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 160 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 151 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:33] [INFO ] Deduced a trap composed of 162 places in 118 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 164 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 159 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 153 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:34] [INFO ] Deduced a trap composed of 158 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 157 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 161 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 159 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 172 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:35] [INFO ] Deduced a trap composed of 168 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 154 places in 116 ms of which 1 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 162 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 162 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 155 places in 120 ms of which 1 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 167 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 150 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:36] [INFO ] Deduced a trap composed of 158 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 157 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 161 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 155 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 171 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 165 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:37] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 176 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 178 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 145 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 151 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 169 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 136 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:38] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 167 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 162 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 172 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 163 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:39] [INFO ] Deduced a trap composed of 153 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 157 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 165 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 133 places in 110 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:40] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:41] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 130 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 139 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 138 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 145 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:42] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 147 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 160 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 151 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:43] [INFO ] Deduced a trap composed of 164 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 157 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 150 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 168 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 156 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 172 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:44] [INFO ] Deduced a trap composed of 160 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 154 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 118 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 0 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 139 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:45] [INFO ] Deduced a trap composed of 150 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 162 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:33:46] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 13 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 141 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 144 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:47] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 163 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 156 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:48] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 150 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 138 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 127 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 130 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:49] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 147 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 1 ms to minimize.
[2021-05-09 20:33:50] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 1 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 115 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 1 ms to minimize.
[2021-05-09 20:33:51] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 130 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 0 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 0 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:52] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 127 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:53] [INFO ] Deduced a trap composed of 155 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 132 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 131 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 129 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:54] [INFO ] Deduced a trap composed of 136 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 129 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 137 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 139 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 149 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 128 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 0 ms to minimize.
[2021-05-09 20:33:55] [INFO ] Deduced a trap composed of 142 places in 108 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 132 places in 107 ms of which 1 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 145 places in 105 ms of which 0 ms to minimize.
[2021-05-09 20:33:56] [INFO ] Deduced a trap composed of 180 places in 107 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 172 places in 108 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 1 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 132 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 130 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 135 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 147 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:33:57] [INFO ] Deduced a trap composed of 128 places in 110 ms of which 0 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 135 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:58] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 152 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 157 places in 114 ms of which 0 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 154 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 158 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 155 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:33:59] [INFO ] Deduced a trap composed of 161 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:34:00] [INFO ] Deduced a trap composed of 159 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:34:00] [INFO ] Deduced a trap composed of 153 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:34:00] [INFO ] Deduced a trap composed of 148 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:34:00] [INFO ] Trap strengthening (SAT) tested/added 269/268 trap constraints in 36190 ms
[2021-05-09 20:34:00] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 27 ms.
[2021-05-09 20:34:08] [INFO ] Added : 315 causal constraints over 63 iterations in 8473 ms. Result :unknown
[2021-05-09 20:34:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 20:34:08] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:34:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:09] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2021-05-09 20:34:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:34:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:34:09] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:34:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:09] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2021-05-09 20:34:09] [INFO ] [Nat]Added 73 Read/Feed constraints in 52 ms returned sat
[2021-05-09 20:34:09] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 27 ms.
[2021-05-09 20:34:19] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:34:19] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2021-05-09 20:34:19] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2021-05-09 20:34:19] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 1 ms to minimize.
[2021-05-09 20:34:19] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 0 ms to minimize.
[2021-05-09 20:34:20] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2021-05-09 20:34:20] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 0 ms to minimize.
[2021-05-09 20:34:20] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:34:20] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 1 ms to minimize.
[2021-05-09 20:34:20] [INFO ] Deduced a trap composed of 185 places in 149 ms of which 0 ms to minimize.
[2021-05-09 20:34:21] [INFO ] Deduced a trap composed of 195 places in 149 ms of which 1 ms to minimize.
[2021-05-09 20:34:21] [INFO ] Deduced a trap composed of 189 places in 148 ms of which 0 ms to minimize.
[2021-05-09 20:34:21] [INFO ] Deduced a trap composed of 184 places in 149 ms of which 0 ms to minimize.
[2021-05-09 20:34:21] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:21] [INFO ] Deduced a trap composed of 188 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:34:22] [INFO ] Deduced a trap composed of 174 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:34:22] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:34:22] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 1 ms to minimize.
[2021-05-09 20:34:22] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:22] [INFO ] Deduced a trap composed of 195 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:34:23] [INFO ] Deduced a trap composed of 194 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:34:23] [INFO ] Deduced a trap composed of 178 places in 146 ms of which 1 ms to minimize.
[2021-05-09 20:34:23] [INFO ] Deduced a trap composed of 193 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:34:23] [INFO ] Deduced a trap composed of 183 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:34:23] [INFO ] Deduced a trap composed of 187 places in 152 ms of which 0 ms to minimize.
[2021-05-09 20:34:24] [INFO ] Deduced a trap composed of 181 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:34:24] [INFO ] Deduced a trap composed of 179 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:24] [INFO ] Deduced a trap composed of 203 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:24] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5779 ms
[2021-05-09 20:34:24] [INFO ] Added : 390 causal constraints over 78 iterations in 15088 ms. Result :sat
Minimization took 1775 ms.
[2021-05-09 20:34:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:34:26] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:34:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:26] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-09 20:34:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:34:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:34:26] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:27] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-09 20:34:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 42 ms returned sat
[2021-05-09 20:34:27] [INFO ] Deduced a trap composed of 146 places in 162 ms of which 0 ms to minimize.
[2021-05-09 20:34:27] [INFO ] Deduced a trap composed of 148 places in 165 ms of which 1 ms to minimize.
[2021-05-09 20:34:27] [INFO ] Deduced a trap composed of 147 places in 163 ms of which 0 ms to minimize.
[2021-05-09 20:34:27] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 1 ms to minimize.
[2021-05-09 20:34:27] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 0 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 1 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 1 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 1 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 1 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2021-05-09 20:34:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1758 ms
[2021-05-09 20:34:28] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:34:41] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2021-05-09 20:34:41] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2021-05-09 20:34:41] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2021-05-09 20:34:42] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 1 ms to minimize.
[2021-05-09 20:34:42] [INFO ] Deduced a trap composed of 169 places in 166 ms of which 1 ms to minimize.
[2021-05-09 20:34:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1269 ms
[2021-05-09 20:34:42] [INFO ] Added : 399 causal constraints over 80 iterations in 13758 ms. Result :sat
Minimization took 1740 ms.
[2021-05-09 20:34:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:34:44] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2021-05-09 20:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:44] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-09 20:34:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:34:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:34:44] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:34:45] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2021-05-09 20:34:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 19 ms returned sat
[2021-05-09 20:34:45] [INFO ] Deduced a trap composed of 166 places in 150 ms of which 1 ms to minimize.
[2021-05-09 20:34:45] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 1 ms to minimize.
[2021-05-09 20:34:45] [INFO ] Deduced a trap composed of 158 places in 150 ms of which 0 ms to minimize.
[2021-05-09 20:34:45] [INFO ] Deduced a trap composed of 162 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:34:45] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 160 places in 145 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:34:46] [INFO ] Deduced a trap composed of 152 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 158 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 153 places in 144 ms of which 0 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 162 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:34:47] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:34:48] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:34:48] [INFO ] Deduced a trap composed of 161 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:34:48] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:34:48] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3308 ms
[2021-05-09 20:34:48] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:34:59] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2021-05-09 20:34:59] [INFO ] Added : 399 causal constraints over 80 iterations in 10877 ms. Result :sat
Minimization took 2428 ms.
[2021-05-09 20:35:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:35:01] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2021-05-09 20:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:35:01] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2021-05-09 20:35:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-09 20:35:02] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2021-05-09 20:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:35:02] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2021-05-09 20:35:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2021-05-09 20:35:02] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:02] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:02] [INFO ] Deduced a trap composed of 125 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:35:02] [INFO ] Deduced a trap composed of 130 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:03] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 1 ms to minimize.
[2021-05-09 20:35:03] [INFO ] Deduced a trap composed of 158 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:03] [INFO ] Deduced a trap composed of 143 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:03] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:35:03] [INFO ] Deduced a trap composed of 147 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 149 places in 159 ms of which 1 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 146 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:04] [INFO ] Deduced a trap composed of 159 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 161 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 112 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 161 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 1 ms to minimize.
[2021-05-09 20:35:05] [INFO ] Deduced a trap composed of 137 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:06] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 1 ms to minimize.
[2021-05-09 20:35:06] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:35:06] [INFO ] Deduced a trap composed of 150 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:06] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 1 ms to minimize.
[2021-05-09 20:35:06] [INFO ] Deduced a trap composed of 136 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 156 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 1 ms to minimize.
[2021-05-09 20:35:07] [INFO ] Deduced a trap composed of 157 places in 157 ms of which 0 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 1 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 0 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 0 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 165 places in 155 ms of which 0 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 153 places in 153 ms of which 1 ms to minimize.
[2021-05-09 20:35:08] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 0 ms to minimize.
[2021-05-09 20:35:09] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 1 ms to minimize.
[2021-05-09 20:35:09] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 0 ms to minimize.
[2021-05-09 20:35:09] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2021-05-09 20:35:09] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 7028 ms
[2021-05-09 20:35:09] [INFO ] Computed and/alt/rep : 402/2263/402 causal constraints (skipped 72 transitions) in 26 ms.
[2021-05-09 20:35:21] [INFO ] Added : 365 causal constraints over 73 iterations in 12064 ms. Result :sat
Minimization took 1822 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 15285688 steps, including 2047133 resets, run timeout after 30001 ms. (steps per millisecond=509 ) properties (out of 16) seen :4
Interrupted Parikh walk after 14962313 steps, including 2004925 resets, run timeout after 30001 ms. (steps per millisecond=498 ) properties (out of 16) seen :4
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Interrupted Parikh walk after 15495690 steps, including 2076200 resets, run timeout after 30001 ms. (steps per millisecond=516 ) properties (out of 16) seen :4
Interrupted Parikh walk after 14921589 steps, including 1998579 resets, run timeout after 30001 ms. (steps per millisecond=497 ) properties (out of 16) seen :4
Interrupted Parikh walk after 15439144 steps, including 2068171 resets, run timeout after 30001 ms. (steps per millisecond=514 ) properties (out of 16) seen :4
Interrupted Parikh walk after 14875188 steps, including 1991850 resets, run timeout after 30001 ms. (steps per millisecond=495 ) properties (out of 16) seen :4
Interrupted Parikh walk after 15477767 steps, including 2073574 resets, run timeout after 30001 ms. (steps per millisecond=515 ) properties (out of 16) seen :4
Incomplete Parikh walk after 12964600 steps, including 1635890 resets, run finished after 25245 ms. (steps per millisecond=513 ) properties (out of 16) seen :4 could not realise parikh vector
Interrupted Parikh walk after 15372916 steps, including 2059623 resets, run timeout after 30001 ms. (steps per millisecond=512 ) properties (out of 16) seen :4
Incomplete Parikh walk after 12546500 steps, including 1680170 resets, run finished after 24296 ms. (steps per millisecond=516 ) properties (out of 16) seen :4 could not realise parikh vector
Interrupted Parikh walk after 14912924 steps, including 1881115 resets, run timeout after 30001 ms. (steps per millisecond=497 ) properties (out of 16) seen :4
Incomplete Parikh walk after 3600 steps, including 477 resets, run finished after 8 ms. (steps per millisecond=450 ) properties (out of 16) seen :4 could not realise parikh vector
Interrupted Parikh walk after 14899253 steps, including 1996015 resets, run timeout after 30001 ms. (steps per millisecond=496 ) properties (out of 16) seen :4
Support contains 16 out of 501 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 501/501 places, 475/475 transitions.
Applied a total of 0 rules in 38 ms. Remains 501 /501 variables (removed 0) and now considering 475/475 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 501/501 places, 475/475 transitions.
Starting structural reductions, iteration 0 : 501/501 places, 475/475 transitions.
Applied a total of 0 rules in 45 ms. Remains 501 /501 variables (removed 0) and now considering 475/475 (removed 0) transitions.
// Phase 1: matrix 475 rows 501 cols
[2021-05-09 20:41:12] [INFO ] Computed 100 place invariants in 50 ms
[2021-05-09 20:41:13] [INFO ] Implicit Places using invariants in 770 ms returned [15, 20, 45, 52, 72, 78, 99, 104, 124, 130, 151, 156, 157, 177, 182, 204, 210, 217, 231, 263, 269, 292, 297, 323, 350, 373, 379, 404, 406, 410, 435, 441, 465, 470, 474, 493, 499]
Discarding 37 places :
Implicit Place search using SMT only with invariants took 772 ms to find 37 implicit places.
[2021-05-09 20:41:13] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 475 rows 464 cols
[2021-05-09 20:41:13] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:41:13] [INFO ] Dead Transitions using invariants and state equation in 204 ms returned []
Starting structural reductions, iteration 1 : 464/501 places, 475/475 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 463 transition count 474
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 17 place count 463 transition count 459
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 32 place count 448 transition count 459
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 448 transition count 459
Applied a total of 37 rules in 101 ms. Remains 448 /464 variables (removed 16) and now considering 459/475 (removed 16) transitions.
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:41:14] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:41:14] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:41:14] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:41:14] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:41:16] [INFO ] Implicit Places using invariants and state equation in 2495 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 448/501 places, 459/475 transitions.
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:41:16] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 1000000 steps, including 125020 resets, run finished after 1777 ms. (steps per millisecond=562 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83391 resets, run finished after 1247 ms. (steps per millisecond=801 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83654 resets, run finished after 1361 ms. (steps per millisecond=734 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83249 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83316 resets, run finished after 1261 ms. (steps per millisecond=793 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83256 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83435 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83271 resets, run finished after 1252 ms. (steps per millisecond=798 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83291 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83287 resets, run finished after 1253 ms. (steps per millisecond=798 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83236 resets, run finished after 1257 ms. (steps per millisecond=795 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83397 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83403 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83336 resets, run finished after 1251 ms. (steps per millisecond=799 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83474 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83330 resets, run finished after 1252 ms. (steps per millisecond=798 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83348 resets, run finished after 1250 ms. (steps per millisecond=800 ) properties (out of 16) seen :4
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:41:38] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:38] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2021-05-09 20:41:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:39] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-09 20:41:39] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:41:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 93 ms returned sat
[2021-05-09 20:41:39] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 25 ms.
[2021-05-09 20:41:49] [INFO ] Added : 322 causal constraints over 65 iterations in 9803 ms. Result :sat
Minimization took 2411 ms.
[2021-05-09 20:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:51] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 20:41:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:51] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-09 20:41:53] [INFO ] [Nat]Added 73 Read/Feed constraints in 1107 ms returned sat
[2021-05-09 20:41:53] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:41:53] [INFO ] Added : 38 causal constraints over 8 iterations in 829 ms. Result :sat
Minimization took 390 ms.
[2021-05-09 20:41:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:55] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2021-05-09 20:41:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:41:55] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2021-05-09 20:41:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 24 ms returned sat
[2021-05-09 20:41:55] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2021-05-09 20:41:55] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2021-05-09 20:41:56] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:41:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 282 ms
[2021-05-09 20:41:56] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:42:08] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2021-05-09 20:42:08] [INFO ] Added : 373 causal constraints over 75 iterations in 12200 ms. Result :sat
Minimization took 2287 ms.
[2021-05-09 20:42:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:10] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-09 20:42:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:42:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:10] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-09 20:42:11] [INFO ] [Nat]Added 73 Read/Feed constraints in 478 ms returned sat
[2021-05-09 20:42:11] [INFO ] Deduced a trap composed of 115 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:42:11] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:42:11] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:42:11] [INFO ] Deduced a trap composed of 127 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 121 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 113 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:42:12] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:42:13] [INFO ] Deduced a trap composed of 129 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 134 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 128 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:42:14] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:42:15] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 118 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 133 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 129 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:42:16] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:42:17] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 132 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 118 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:18] [INFO ] Deduced a trap composed of 124 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 143 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 140 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 139 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:42:19] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:42:20] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:42:20] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:42:20] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 8843 ms
[2021-05-09 20:42:20] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:42:28] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2021-05-09 20:42:28] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:42:28] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2021-05-09 20:42:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 559 ms
[2021-05-09 20:42:28] [INFO ] Added : 210 causal constraints over 44 iterations in 8576 ms. Result :sat
Minimization took 2825 ms.
[2021-05-09 20:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:31] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2021-05-09 20:42:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:32] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2021-05-09 20:42:32] [INFO ] [Nat]Added 73 Read/Feed constraints in 187 ms returned sat
[2021-05-09 20:42:32] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 25 ms.
[2021-05-09 20:42:41] [INFO ] Deduced a trap composed of 134 places in 144 ms of which 1 ms to minimize.
[2021-05-09 20:42:41] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 149 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 144 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:42:42] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:42:43] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:43] [INFO ] Deduced a trap composed of 143 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:43] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:42:43] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 1 ms to minimize.
[2021-05-09 20:42:43] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:42:44] [INFO ] Deduced a trap composed of 141 places in 147 ms of which 0 ms to minimize.
[2021-05-09 20:42:44] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:44] [INFO ] Deduced a trap composed of 139 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:42:44] [INFO ] Deduced a trap composed of 135 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:44] [INFO ] Deduced a trap composed of 139 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:42:45] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:42:45] [INFO ] Deduced a trap composed of 140 places in 135 ms of which 1 ms to minimize.
[2021-05-09 20:42:45] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2021-05-09 20:42:45] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:42:45] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:46] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:46] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:42:46] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:42:46] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:46] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 1 ms to minimize.
[2021-05-09 20:42:47] [INFO ] Deduced a trap composed of 132 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:42:47] [INFO ] Deduced a trap composed of 136 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:42:47] [INFO ] Deduced a trap composed of 138 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:42:47] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6050 ms
[2021-05-09 20:42:47] [INFO ] Added : 338 causal constraints over 68 iterations in 15151 ms. Result :sat
Minimization took 1642 ms.
[2021-05-09 20:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:49] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-09 20:42:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:42:50] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2021-05-09 20:42:50] [INFO ] [Nat]Added 73 Read/Feed constraints in 64 ms returned sat
[2021-05-09 20:42:50] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:50] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:42:50] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:50] [INFO ] Deduced a trap composed of 135 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:42:50] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:42:51] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 127 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 120 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:42:52] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 149 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 1 ms to minimize.
[2021-05-09 20:42:53] [INFO ] Deduced a trap composed of 133 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:42:54] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 119 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 136 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:55] [INFO ] Deduced a trap composed of 136 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:42:56] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:42:56] [INFO ] Deduced a trap composed of 144 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:42:56] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 5991 ms
[2021-05-09 20:42:56] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 25 ms.
[2021-05-09 20:43:06] [INFO ] Added : 325 causal constraints over 65 iterations in 9980 ms. Result :sat
Minimization took 1752 ms.
[2021-05-09 20:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:08] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2021-05-09 20:43:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:08] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-09 20:43:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 243 ms returned sat
[2021-05-09 20:43:08] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 0 ms to minimize.
[2021-05-09 20:43:08] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2021-05-09 20:43:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 238 ms
[2021-05-09 20:43:08] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:43:22] [INFO ] Added : 335 causal constraints over 67 iterations in 13255 ms. Result :sat
Minimization took 3019 ms.
[2021-05-09 20:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:25] [INFO ] [Real]Absence check using state equation in 813 ms returned sat
[2021-05-09 20:43:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:26] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2021-05-09 20:43:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2021-05-09 20:43:27] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:43:36] [INFO ] Added : 205 causal constraints over 41 iterations in 9403 ms. Result :unknown
[2021-05-09 20:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:37] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2021-05-09 20:43:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:39] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2021-05-09 20:43:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2021-05-09 20:43:39] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:43:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2021-05-09 20:43:39] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:43:51] [INFO ] Added : 350 causal constraints over 70 iterations in 12458 ms. Result :unknown
[2021-05-09 20:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:52] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2021-05-09 20:43:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:43:53] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2021-05-09 20:43:53] [INFO ] [Nat]Added 73 Read/Feed constraints in 16 ms returned sat
[2021-05-09 20:43:54] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:43:54] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:43:54] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:43:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 443 ms
[2021-05-09 20:43:54] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 22 ms.
[2021-05-09 20:44:07] [INFO ] Added : 358 causal constraints over 72 iterations in 13590 ms. Result :sat
Minimization took 3001 ms.
[2021-05-09 20:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:11] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2021-05-09 20:44:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:11] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2021-05-09 20:44:11] [INFO ] [Nat]Added 73 Read/Feed constraints in 20 ms returned sat
[2021-05-09 20:44:12] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2021-05-09 20:44:12] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2021-05-09 20:44:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2021-05-09 20:44:12] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:44:24] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2021-05-09 20:44:24] [INFO ] Added : 369 causal constraints over 74 iterations in 12191 ms. Result :sat
Minimization took 3006 ms.
[2021-05-09 20:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:27] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2021-05-09 20:44:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:28] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2021-05-09 20:44:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 69 ms returned sat
[2021-05-09 20:44:28] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:44:41] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:44:42] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 0 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 1 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 1 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:44:43] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 1 ms to minimize.
[2021-05-09 20:44:44] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2021-05-09 20:44:44] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2021-05-09 20:44:44] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2021-05-09 20:44:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2678 ms
[2021-05-09 20:44:44] [INFO ] Added : 379 causal constraints over 76 iterations in 16317 ms. Result :sat
Minimization took 3001 ms.
[2021-05-09 20:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:48] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2021-05-09 20:44:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:44:48] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2021-05-09 20:44:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 34 ms returned sat
[2021-05-09 20:44:49] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:44:49] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:44:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 289 ms
[2021-05-09 20:44:49] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:45:02] [INFO ] Deduced a trap composed of 161 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:45:02] [INFO ] Deduced a trap composed of 164 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:45:02] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2021-05-09 20:45:02] [INFO ] Deduced a trap composed of 145 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 165 places in 130 ms of which 9 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 164 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 151 places in 118 ms of which 2 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 166 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:45:03] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 0 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:45:04] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 0 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 1 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2021-05-09 20:45:05] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 0 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 155 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:06] [INFO ] Deduced a trap composed of 148 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:45:07] [INFO ] Deduced a trap composed of 151 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:45:07] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:07] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:07] [INFO ] Deduced a trap composed of 147 places in 117 ms of which 1 ms to minimize.
[2021-05-09 20:45:07] [INFO ] Deduced a trap composed of 151 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 145 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 158 places in 111 ms of which 1 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 166 places in 112 ms of which 1 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 163 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:45:08] [INFO ] Deduced a trap composed of 161 places in 109 ms of which 1 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 156 places in 109 ms of which 1 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 151 places in 110 ms of which 1 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 159 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 155 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 166 places in 111 ms of which 0 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 166 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:45:09] [INFO ] Deduced a trap composed of 179 places in 112 ms of which 0 ms to minimize.
[2021-05-09 20:45:10] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 7864 ms
[2021-05-09 20:45:10] [INFO ] Added : 343 causal constraints over 69 iterations in 20925 ms. Result :sat
Minimization took 1366 ms.
[2021-05-09 20:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:11] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-09 20:45:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:12] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2021-05-09 20:45:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 31 ms returned sat
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 0 ms to minimize.
[2021-05-09 20:45:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 496 ms
[2021-05-09 20:45:12] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 25 ms.
[2021-05-09 20:45:24] [INFO ] Added : 325 causal constraints over 65 iterations in 12130 ms. Result :sat
Minimization took 2480 ms.
[2021-05-09 20:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:27] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2021-05-09 20:45:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:27] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2021-05-09 20:45:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 48 ms returned sat
[2021-05-09 20:45:27] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:45:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2021-05-09 20:45:28] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:45:39] [INFO ] Added : 260 causal constraints over 52 iterations in 11848 ms. Result :unknown
[2021-05-09 20:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:40] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2021-05-09 20:45:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:45:41] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2021-05-09 20:45:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 22 ms returned sat
[2021-05-09 20:45:41] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:45:52] [INFO ] Added : 335 causal constraints over 67 iterations in 11013 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Interrupted Parikh walk after 15783734 steps, including 2255793 resets, run timeout after 30001 ms. (steps per millisecond=526 ) properties (out of 16) seen :4
Interrupted Parikh walk after 15693157 steps, including 2242481 resets, run timeout after 30001 ms. (steps per millisecond=523 ) properties (out of 16) seen :4
Interrupted Parikh walk after 15370259 steps, including 2195654 resets, run timeout after 30001 ms. (steps per millisecond=512 ) properties (out of 16) seen :4
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Interrupted Parikh walk after 15772566 steps, including 2178557 resets, run timeout after 30001 ms. (steps per millisecond=525 ) properties (out of 16) seen :4
Interrupted Parikh walk after 15796820 steps, including 2256662 resets, run timeout after 30001 ms. (steps per millisecond=526 ) properties (out of 16) seen :4
Incomplete Parikh walk after 19500 steps, including 2902 resets, run finished after 37 ms. (steps per millisecond=527 ) properties (out of 16) seen :4 could not realise parikh vector
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 16) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 1956 resets, run finished after 24 ms. (steps per millisecond=541 ) properties (out of 16) seen :4 could not realise parikh vector
Interrupted Parikh walk after 15276765 steps, including 2263934 resets, run timeout after 30001 ms. (steps per millisecond=509 ) properties (out of 16) seen :4
Support contains 16 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 459/459 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 459/459 transitions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 transitions.
Applied a total of 0 rules in 11 ms. Remains 448 /448 variables (removed 0) and now considering 459/459 (removed 0) transitions.
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:48:55] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:48:55] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:48:55] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:48:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:48:58] [INFO ] Implicit Places using invariants and state equation in 2463 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2021-05-09 20:48:58] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:48:58] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:48:58] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 459/459 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:48:58] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:48:58] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:48:58] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-05-09 20:48:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:48:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:48:59] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2021-05-09 20:48:59] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:48:59] [INFO ] [Nat]Added 73 Read/Feed constraints in 92 ms returned sat
[2021-05-09 20:48:59] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:49:03] [INFO ] Added : 270 causal constraints over 54 iterations in 4598 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16582598 steps, including 2288092 resets, run timeout after 30001 ms. (steps per millisecond=552 ) properties (out of 1) seen :0
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 444 transition count 455
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 434 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 38 place count 429 transition count 448
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 429 transition count 442
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 423 transition count 442
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 423 transition count 442
Applied a total of 52 rules in 48 ms. Remains 423 /448 variables (removed 25) and now considering 442/459 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/448 places, 442/459 transitions.
// Phase 1: matrix 442 rows 423 cols
[2021-05-09 20:49:33] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 1000000 steps, including 156516 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96358 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 1) seen :0
// Phase 1: matrix 442 rows 423 cols
[2021-05-09 20:49:36] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 20:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:49:36] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2021-05-09 20:49:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:49:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:49:37] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2021-05-09 20:49:37] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:49:37] [INFO ] [Nat]Added 88 Read/Feed constraints in 78 ms returned sat
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 0 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 1 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 0 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 0 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2021-05-09 20:49:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 722 ms
[2021-05-09 20:49:38] [INFO ] Computed and/alt/rep : 338/2271/338 causal constraints (skipped 103 transitions) in 24 ms.
[2021-05-09 20:49:46] [INFO ] Added : 304 causal constraints over 61 iterations in 8915 ms. Result :sat
Minimization took 568 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 7647400 steps, including 1427959 resets, run finished after 13948 ms. (steps per millisecond=548 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 423 /423 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 442/442 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 442/442 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 442/442 (removed 0) transitions.
// Phase 1: matrix 442 rows 423 cols
[2021-05-09 20:50:01] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 20:50:01] [INFO ] Implicit Places using invariants in 224 ms returned []
// Phase 1: matrix 442 rows 423 cols
[2021-05-09 20:50:01] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 20:50:01] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:50:04] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned [276, 301]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2889 ms to find 2 implicit places.
[2021-05-09 20:50:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 442 rows 421 cols
[2021-05-09 20:50:04] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:50:04] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Starting structural reductions, iteration 1 : 421/423 places, 442/442 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 440
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 419 transition count 440
Applied a total of 4 rules in 20 ms. Remains 419 /421 variables (removed 2) and now considering 440/442 (removed 2) transitions.
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:04] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:04] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:04] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-09 20:50:04] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:50:07] [INFO ] Implicit Places using invariants and state equation in 2954 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 419/423 places, 440/442 transitions.
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:07] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 1000000 steps, including 156063 resets, run finished after 1649 ms. (steps per millisecond=606 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96034 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:10] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:10] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-09 20:50:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:11] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2021-05-09 20:50:11] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:50:11] [INFO ] [Nat]Added 88 Read/Feed constraints in 118 ms returned sat
[2021-05-09 20:50:11] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2021-05-09 20:50:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-09 20:50:11] [INFO ] Computed and/alt/rep : 340/2301/340 causal constraints (skipped 99 transitions) in 22 ms.
[2021-05-09 20:50:18] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 0 ms to minimize.
[2021-05-09 20:50:18] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2021-05-09 20:50:18] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:50:18] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2021-05-09 20:50:18] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2021-05-09 20:50:19] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 0 ms to minimize.
[2021-05-09 20:50:19] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2021-05-09 20:50:19] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 0 ms to minimize.
[2021-05-09 20:50:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1196 ms
[2021-05-09 20:50:19] [INFO ] Added : 282 causal constraints over 57 iterations in 8035 ms. Result :sat
Minimization took 1052 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10447900 steps, including 1952884 resets, run finished after 19010 ms. (steps per millisecond=549 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 419/419 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 419 /419 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 419/419 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 419 /419 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:39] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:39] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:39] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:40] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:50:42] [INFO ] Implicit Places using invariants and state equation in 2948 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
[2021-05-09 20:50:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:50:42] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:43] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 419/419 places, 440/440 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 104657 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:50:43] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1239 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:50:43] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:43] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-09 20:50:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:43] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-09 20:50:43] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:50:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 1087 ms returned sat
[2021-05-09 20:50:44] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:50:45] [INFO ] Added : 38 causal constraints over 8 iterations in 815 ms. Result :sat
Minimization took 388 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 13000 steps, including 1997 resets, run finished after 23 ms. (steps per millisecond=565 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 447 transition count 458
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 447 transition count 456
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 445 transition count 456
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 431 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 431 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 422 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 440
Applied a total of 54 rules in 46 ms. Remains 422 /448 variables (removed 26) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:50:45] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 1000000 steps, including 125097 resets, run finished after 1618 ms. (steps per millisecond=618 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 83222 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 1) seen :4
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:50:48] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:48] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-09 20:50:48] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:50:49] [INFO ] [Real]Added 85 Read/Feed constraints in 298 ms returned sat
[2021-05-09 20:50:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:50:49] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2021-05-09 20:50:50] [INFO ] [Nat]Added 85 Read/Feed constraints in 891 ms returned sat
[2021-05-09 20:50:50] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:50:50] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:50:50] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:50:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2021-05-09 20:50:50] [INFO ] Computed and/alt/rep : 325/2184/325 causal constraints (skipped 114 transitions) in 25 ms.
[2021-05-09 20:50:53] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2021-05-09 20:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2021-05-09 20:50:54] [INFO ] Added : 145 causal constraints over 29 iterations in 3431 ms. Result :sat
Minimization took 1194 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Interrupted Parikh walk after 17025425 steps, including 2523044 resets, run timeout after 30001 ms. (steps per millisecond=567 ) properties (out of 1) seen :4
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:51:25] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:51:25] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:51:25] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:51:25] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:51:28] [INFO ] Implicit Places using invariants and state equation in 3122 ms returned [204, 274, 299]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3402 ms to find 3 implicit places.
[2021-05-09 20:51:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:51:28] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:51:28] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 437
Applied a total of 6 rules in 18 ms. Remains 416 /419 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:28] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:29] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:29] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:29] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:51:32] [INFO ] Implicit Places using invariants and state equation in 3055 ms returned []
Implicit Place search using SMT with State Equation took 3327 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 437/440 transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:32] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 1000000 steps, including 125242 resets, run finished after 1619 ms. (steps per millisecond=617 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83623 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 1) seen :4
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:35] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:35] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 20:51:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:35] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2021-05-09 20:51:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:51:35] [INFO ] [Nat]Added 85 Read/Feed constraints in 325 ms returned sat
[2021-05-09 20:51:35] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:51:35] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 1 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Deduced a trap composed of 125 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:51:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1039 ms
[2021-05-09 20:51:36] [INFO ] Computed and/alt/rep : 321/2170/321 causal constraints (skipped 115 transitions) in 23 ms.
[2021-05-09 20:51:38] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 1 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 1 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 0 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 0 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 1 ms to minimize.
[2021-05-09 20:51:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1197 ms
[2021-05-09 20:51:39] [INFO ] Added : 49 causal constraints over 10 iterations in 3126 ms. Result :sat
Minimization took 938 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 4200 steps, including 606 resets, run finished after 8 ms. (steps per millisecond=525 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:40] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:41] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:41] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:41] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:51:43] [INFO ] Implicit Places using invariants and state equation in 2717 ms returned []
Implicit Place search using SMT with State Equation took 2973 ms to find 0 implicit places.
[2021-05-09 20:51:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:51:43] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:44] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 61013 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:51:44] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1249 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:51:44] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:44] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2021-05-09 20:51:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:45] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2021-05-09 20:51:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:51:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2021-05-09 20:51:45] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2021-05-09 20:51:45] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2021-05-09 20:51:45] [INFO ] Deduced a trap composed of 72 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:51:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2021-05-09 20:51:45] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:51:49] [INFO ] Added : 285 causal constraints over 57 iterations in 4083 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 430 transition count 441
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 52 place count 422 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 422 transition count 441
Applied a total of 53 rules in 46 ms. Remains 422 /448 variables (removed 26) and now considering 441/459 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 441/459 transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 20:51:49] [INFO ] Computed 64 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 155976 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96117 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 20:51:52] [INFO ] Computed 64 place invariants in 53 ms
[2021-05-09 20:51:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-09 20:51:52] [INFO ] [Real]Absence check using 3 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-09 20:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:53] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2021-05-09 20:51:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:51:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-09 20:51:53] [INFO ] [Nat]Absence check using 3 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-09 20:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:51:53] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-09 20:51:53] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:51:53] [INFO ] [Nat]Added 87 Read/Feed constraints in 28 ms returned sat
[2021-05-09 20:51:53] [INFO ] Computed and/alt/rep : 325/2190/325 causal constraints (skipped 115 transitions) in 24 ms.
[2021-05-09 20:52:02] [INFO ] Added : 293 causal constraints over 59 iterations in 9286 ms. Result :sat
Minimization took 2130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Interrupted Parikh walk after 15707291 steps, including 2936164 resets, run timeout after 30001 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 441/441 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 10 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 20:52:34] [INFO ] Computed 64 place invariants in 53 ms
[2021-05-09 20:52:35] [INFO ] Implicit Places using invariants in 403 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 404 ms to find 3 implicit places.
[2021-05-09 20:52:35] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 441 rows 419 cols
[2021-05-09 20:52:35] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:52:35] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 441/441 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 438
Applied a total of 6 rules in 17 ms. Remains 416 /419 variables (removed 3) and now considering 438/441 (removed 3) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:35] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:35] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:35] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:35] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:52:38] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3064 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 438/441 transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:38] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 1000000 steps, including 156163 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96342 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:41] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:52:41] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2021-05-09 20:52:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:52:42] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-09 20:52:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:52:42] [INFO ] [Nat]Added 87 Read/Feed constraints in 26 ms returned sat
[2021-05-09 20:52:42] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:52:42] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 0 ms to minimize.
[2021-05-09 20:52:42] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:52:42] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:52:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 631 ms
[2021-05-09 20:52:42] [INFO ] Computed and/alt/rep : 321/2176/321 causal constraints (skipped 116 transitions) in 23 ms.
[2021-05-09 20:52:50] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:52:50] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:52:50] [INFO ] Deduced a trap composed of 135 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:52:50] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:52:50] [INFO ] Deduced a trap composed of 138 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:52:51] [INFO ] Deduced a trap composed of 136 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:52:51] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:52:51] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:52:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1521 ms
[2021-05-09 20:52:51] [INFO ] Added : 277 causal constraints over 56 iterations in 8832 ms. Result :sat
Minimization took 2095 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:53] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:53] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:53] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:54] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:52:56] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3086 ms to find 0 implicit places.
[2021-05-09 20:52:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 20:52:56] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 20:52:56] [INFO ] Dead Transitions using invariants and state equation in 191 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 72908 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:52:56] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1210 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 829 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:52:57] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:52:57] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 20:52:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:52:57] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-09 20:52:57] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:52:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 470 ms returned sat
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 1 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:52:58] [INFO ] Deduced a trap composed of 120 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 0 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 121 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 115 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 122 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:52:59] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 116 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 129 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 128 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:53:00] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 124 places in 126 ms of which 0 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 1 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 1 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 131 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:53:01] [INFO ] Deduced a trap composed of 130 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:53:02] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 0 ms to minimize.
[2021-05-09 20:53:02] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:53:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 430 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 42 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:53:02] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 1000000 steps, including 156174 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96111 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:53:05] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:53:05] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 20:53:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:53:05] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-09 20:53:05] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:53:05] [INFO ] [Nat]Added 87 Read/Feed constraints in 406 ms returned sat
[2021-05-09 20:53:06] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2021-05-09 20:53:06] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2021-05-09 20:53:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2021-05-09 20:53:06] [INFO ] Computed and/alt/rep : 322/2174/322 causal constraints (skipped 117 transitions) in 24 ms.
[2021-05-09 20:53:10] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 0 ms to minimize.
[2021-05-09 20:53:10] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 0 ms to minimize.
[2021-05-09 20:53:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 451 ms
[2021-05-09 20:53:10] [INFO ] Added : 185 causal constraints over 37 iterations in 4723 ms. Result :sat
Minimization took 1381 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16177162 steps, including 3023919 resets, run timeout after 30001 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:53:42] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:53:42] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:53:42] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:53:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:53:45] [INFO ] Implicit Places using invariants and state equation in 3084 ms returned [204, 274, 299]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3355 ms to find 3 implicit places.
[2021-05-09 20:53:45] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 418 cols
[2021-05-09 20:53:45] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-09 20:53:45] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned []
Starting structural reductions, iteration 1 : 418/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 418 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 415 transition count 437
Applied a total of 6 rules in 17 ms. Remains 415 /418 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:53:45] [INFO ] Invariants computation overflowed in 44 ms
[2021-05-09 20:53:46] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:53:46] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 20:53:46] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:53:49] [INFO ] Implicit Places using invariants and state equation in 3256 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 415/421 places, 437/440 transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:53:49] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 1000000 steps, including 156293 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96068 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:53:52] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:53:52] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2021-05-09 20:53:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:53:52] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2021-05-09 20:53:52] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:53:53] [INFO ] [Nat]Added 87 Read/Feed constraints in 187 ms returned sat
[2021-05-09 20:53:53] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2021-05-09 20:53:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2021-05-09 20:53:53] [INFO ] Computed and/alt/rep : 318/2160/318 causal constraints (skipped 118 transitions) in 25 ms.
[2021-05-09 20:53:58] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2021-05-09 20:53:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2021-05-09 20:53:58] [INFO ] Added : 155 causal constraints over 31 iterations in 5003 ms. Result :sat
Minimization took 1658 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15600567 steps, including 2915593 resets, run timeout after 30001 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 8 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:54:29] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:54:30] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:54:30] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:54:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:54:33] [INFO ] Implicit Places using invariants and state equation in 3410 ms returned []
Implicit Place search using SMT with State Equation took 3665 ms to find 0 implicit places.
[2021-05-09 20:54:33] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:54:33] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:54:33] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 96797 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-04
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:54:33] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1236 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 827 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:54:33] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 20:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:54:34] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2021-05-09 20:54:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:54:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:54:34] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2021-05-09 20:54:34] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:54:34] [INFO ] [Nat]Added 73 Read/Feed constraints in 179 ms returned sat
[2021-05-09 20:54:34] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:54:39] [INFO ] Added : 275 causal constraints over 55 iterations in 4601 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 430 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 39 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:54:39] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 155983 resets, run finished after 1673 ms. (steps per millisecond=597 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96226 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:54:42] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 20:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:54:42] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-09 20:54:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:54:42] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-09 20:54:42] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:54:42] [INFO ] [Nat]Added 87 Read/Feed constraints in 120 ms returned sat
[2021-05-09 20:54:42] [INFO ] Deduced a trap composed of 55 places in 31 ms of which 0 ms to minimize.
[2021-05-09 20:54:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-09 20:54:42] [INFO ] Computed and/alt/rep : 322/2180/322 causal constraints (skipped 117 transitions) in 24 ms.
[2021-05-09 20:54:49] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:54:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2021-05-09 20:54:49] [INFO ] Added : 277 causal constraints over 56 iterations in 7209 ms. Result :sat
Minimization took 1100 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16558668 steps, including 3094304 resets, run timeout after 30001 ms. (steps per millisecond=551 ) properties (out of 1) seen :0
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:55:20] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 20:55:21] [INFO ] Implicit Places using invariants in 268 ms returned []
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:55:21] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 20:55:21] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:55:24] [INFO ] Implicit Places using invariants and state equation in 3251 ms returned [203, 274, 299]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3521 ms to find 3 implicit places.
[2021-05-09 20:55:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 418 cols
[2021-05-09 20:55:24] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 20:55:24] [INFO ] Dead Transitions using invariants and state equation in 195 ms returned []
Starting structural reductions, iteration 1 : 418/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 418 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 415 transition count 437
Applied a total of 6 rules in 17 ms. Remains 415 /418 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:55:24] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-09 20:55:24] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:55:25] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-09 20:55:25] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:55:27] [INFO ] Implicit Places using invariants and state equation in 2475 ms returned []
Implicit Place search using SMT with State Equation took 2748 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 415/421 places, 437/440 transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:55:27] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 1000000 steps, including 156403 resets, run finished after 1652 ms. (steps per millisecond=605 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96114 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:55:30] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-09 20:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:55:30] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2021-05-09 20:55:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:55:32] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2021-05-09 20:55:32] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:55:32] [INFO ] [Nat]Added 87 Read/Feed constraints in 19 ms returned sat
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 119 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 127 places in 127 ms of which 0 ms to minimize.
[2021-05-09 20:55:32] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 0 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 0 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 130 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 126 places in 132 ms of which 1 ms to minimize.
[2021-05-09 20:55:33] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 129 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 126 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 1 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:34] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 1 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 116 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:35] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 1 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 0 ms to minimize.
[2021-05-09 20:55:36] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 1 ms to minimize.
[2021-05-09 20:55:37] [INFO ] Deduced a trap composed of 118 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:37] [INFO ] Deduced a trap composed of 117 places in 130 ms of which 0 ms to minimize.
[2021-05-09 20:55:37] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 1 ms to minimize.
[2021-05-09 20:55:37] [INFO ] Deduced a trap composed of 131 places in 129 ms of which 0 ms to minimize.
[2021-05-09 20:55:37] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 5384 ms
[2021-05-09 20:55:37] [INFO ] Computed and/alt/rep : 318/2166/318 causal constraints (skipped 118 transitions) in 25 ms.
[2021-05-09 20:55:44] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 1 ms to minimize.
[2021-05-09 20:55:44] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:55:44] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:55:44] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:55:45] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2021-05-09 20:55:45] [INFO ] Deduced a trap composed of 145 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:55:45] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2021-05-09 20:55:45] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:55:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1807 ms
[2021-05-09 20:55:46] [INFO ] Added : 288 causal constraints over 58 iterations in 8641 ms. Result :sat
Minimization took 1064 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16409066 steps, including 3067411 resets, run timeout after 30001 ms. (steps per millisecond=546 ) properties (out of 1) seen :0
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:56:17] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-09 20:56:17] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:56:17] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-09 20:56:17] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:56:19] [INFO ] Implicit Places using invariants and state equation in 2484 ms returned []
Implicit Place search using SMT with State Equation took 2753 ms to find 0 implicit places.
[2021-05-09 20:56:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 20:56:20] [INFO ] Invariants computation overflowed in 40 ms
[2021-05-09 20:56:20] [INFO ] Dead Transitions using invariants and state equation in 205 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-04 in 106436 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:56:20] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1232 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 863 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:56:20] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:56:20] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2021-05-09 20:56:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:56:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:56:21] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2021-05-09 20:56:21] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:56:21] [INFO ] [Nat]Added 73 Read/Feed constraints in 62 ms returned sat
[2021-05-09 20:56:21] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:56:21] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:21] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2021-05-09 20:56:21] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:21] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 116 places in 119 ms of which 0 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 118 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:22] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 1 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 121 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 0 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 124 places in 120 ms of which 1 ms to minimize.
[2021-05-09 20:56:23] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 0 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 119 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 0 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 1 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 149 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:24] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 0 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 1 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 1 ms to minimize.
[2021-05-09 20:56:25] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2021-05-09 20:56:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 434 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 38 place count 429 transition count 448
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 429 transition count 440
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 37 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:56:25] [INFO ] Computed 64 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 155973 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95966 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:56:28] [INFO ] Computed 64 place invariants in 55 ms
[2021-05-09 20:56:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 20:56:28] [INFO ] [Real]Absence check using 3 positive and 61 generalized place invariants in 17 ms returned sat
[2021-05-09 20:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:56:28] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-09 20:56:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:56:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-09 20:56:28] [INFO ] [Nat]Absence check using 3 positive and 61 generalized place invariants in 15 ms returned sat
[2021-05-09 20:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:56:29] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2021-05-09 20:56:29] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:56:30] [INFO ] [Nat]Added 88 Read/Feed constraints in 232 ms returned sat
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 141 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 126 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:56:30] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 138 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:56:31] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 137 places in 141 ms of which 0 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 1 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2021-05-09 20:56:32] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 1 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 1 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 121 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:56:33] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 131 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 136 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:34] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 0 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 141 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:35] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 129 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 1 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:56:36] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 1 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 132 places in 133 ms of which 1 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 0 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 0 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 0 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:56:37] [INFO ] Deduced a trap composed of 146 places in 142 ms of which 0 ms to minimize.
[2021-05-09 20:56:38] [INFO ] Deduced a trap composed of 143 places in 135 ms of which 0 ms to minimize.
[2021-05-09 20:56:38] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2021-05-09 20:56:38] [INFO ] Deduced a trap composed of 138 places in 134 ms of which 0 ms to minimize.
[2021-05-09 20:56:38] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 8437 ms
[2021-05-09 20:56:38] [INFO ] Computed and/alt/rep : 325/2192/325 causal constraints (skipped 114 transitions) in 24 ms.
[2021-05-09 20:56:53] [INFO ] Added : 215 causal constraints over 43 iterations in 14862 ms. Result :sat
Minimization took 1979 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Interrupted Parikh walk after 16323732 steps, including 3051184 resets, run timeout after 30001 ms. (steps per millisecond=544 ) properties (out of 1) seen :0
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 20:57:25] [INFO ] Computed 64 place invariants in 56 ms
[2021-05-09 20:57:25] [INFO ] Implicit Places using invariants in 405 ms returned [203, 299]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 405 ms to find 2 implicit places.
[2021-05-09 20:57:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:57:25] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 20:57:25] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Starting structural reductions, iteration 1 : 419/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 438
Applied a total of 4 rules in 21 ms. Remains 417 /419 variables (removed 2) and now considering 438/440 (removed 2) transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:26] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 20:57:26] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:26] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 20:57:26] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:57:29] [INFO ] Implicit Places using invariants and state equation in 2865 ms returned []
Implicit Place search using SMT with State Equation took 3130 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 417/421 places, 438/440 transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:29] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 156292 resets, run finished after 1660 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96018 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:31] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 20:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:57:32] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2021-05-09 20:57:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:57:32] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2021-05-09 20:57:32] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:57:32] [INFO ] [Nat]Added 88 Read/Feed constraints in 69 ms returned sat
[2021-05-09 20:57:32] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 0 ms to minimize.
[2021-05-09 20:57:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2021-05-09 20:57:32] [INFO ] Computed and/alt/rep : 322/2179/322 causal constraints (skipped 115 transitions) in 23 ms.
[2021-05-09 20:57:38] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2021-05-09 20:57:39] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2021-05-09 20:57:40] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 0 ms to minimize.
[2021-05-09 20:57:40] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2021-05-09 20:57:40] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 0 ms to minimize.
[2021-05-09 20:57:40] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2021-05-09 20:57:40] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 0 ms to minimize.
[2021-05-09 20:57:41] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2021-05-09 20:57:41] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 0 ms to minimize.
[2021-05-09 20:57:41] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 0 ms to minimize.
[2021-05-09 20:57:41] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 0 ms to minimize.
[2021-05-09 20:57:41] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 0 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 0 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 0 ms to minimize.
[2021-05-09 20:57:42] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 0 ms to minimize.
[2021-05-09 20:57:43] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 0 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 0 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 0 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:57:44] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 59 places in 40 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 83 places in 44 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 0 ms to minimize.
[2021-05-09 20:57:45] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 0 ms to minimize.
[2021-05-09 20:57:46] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2021-05-09 20:57:46] [INFO ] Deduced a trap composed of 52 places in 41 ms of which 0 ms to minimize.
[2021-05-09 20:57:46] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 59 places in 39 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 59 places in 34 ms of which 0 ms to minimize.
[2021-05-09 20:57:47] [INFO ] Deduced a trap composed of 55 places in 33 ms of which 0 ms to minimize.
[2021-05-09 20:57:48] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 9354 ms
[2021-05-09 20:57:48] [INFO ] Added : 275 causal constraints over 56 iterations in 15346 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 438/438 transitions.
Applied a total of 0 rules in 12 ms. Remains 417 /417 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 438/438 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 438/438 transitions.
Applied a total of 0 rules in 8 ms. Remains 417 /417 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:51] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-09 20:57:51] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:51] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 20:57:51] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 20:57:54] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
[2021-05-09 20:57:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 20:57:54] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 20:57:54] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 94475 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:57:54] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1247 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 837 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:57:54] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 20:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:57:54] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-09 20:57:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:57:55] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2021-05-09 20:57:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:57:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 241 ms returned sat
[2021-05-09 20:57:55] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2021-05-09 20:57:55] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2021-05-09 20:57:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2021-05-09 20:57:55] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 20:58:00] [INFO ] Deduced a trap composed of 2 places in 158 ms of which 0 ms to minimize.
[2021-05-09 20:58:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 447 transition count 458
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 447 transition count 456
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 445 transition count 456
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 431 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 431 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 422 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 440
Applied a total of 54 rules in 41 ms. Remains 422 /448 variables (removed 26) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:58:00] [INFO ] Invariants computation overflowed in 22 ms
Incomplete random walk after 1000000 steps, including 156411 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95772 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:58:02] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-09 20:58:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:58:03] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-09 20:58:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:58:03] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-09 20:58:03] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:58:03] [INFO ] [Nat]Added 85 Read/Feed constraints in 154 ms returned sat
[2021-05-09 20:58:03] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 0 ms to minimize.
[2021-05-09 20:58:03] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 0 ms to minimize.
[2021-05-09 20:58:03] [INFO ] Deduced a trap composed of 133 places in 143 ms of which 0 ms to minimize.
[2021-05-09 20:58:04] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 1 ms to minimize.
[2021-05-09 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2021-05-09 20:58:04] [INFO ] Computed and/alt/rep : 325/2180/325 causal constraints (skipped 114 transitions) in 23 ms.
[2021-05-09 20:58:18] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2021-05-09 20:58:18] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 0 ms to minimize.
[2021-05-09 20:58:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1514 ms
[2021-05-09 20:58:20] [INFO ] Added : 322 causal constraints over 65 iterations in 15946 ms. Result :sat
Minimization took 888 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 7980600 steps, including 1491368 resets, run finished after 14490 ms. (steps per millisecond=550 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:58:35] [INFO ] Invariants computation overflowed in 22 ms
[2021-05-09 20:58:35] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 20:58:35] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-09 20:58:35] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:58:38] [INFO ] Implicit Places using invariants and state equation in 2832 ms returned [205, 275, 300]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3098 ms to find 3 implicit places.
[2021-05-09 20:58:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 20:58:38] [INFO ] Invariants computation overflowed in 36 ms
[2021-05-09 20:58:38] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 437
Applied a total of 6 rules in 16 ms. Remains 416 /419 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:58:38] [INFO ] Computed 61 place invariants in 55 ms
[2021-05-09 20:58:39] [INFO ] Implicit Places using invariants in 372 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:58:39] [INFO ] Computed 61 place invariants in 54 ms
[2021-05-09 20:58:39] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:58:41] [INFO ] Implicit Places using invariants and state equation in 2347 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 437/440 transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:58:41] [INFO ] Computed 61 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 156164 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95790 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:58:44] [INFO ] Computed 61 place invariants in 56 ms
[2021-05-09 20:58:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 20:58:44] [INFO ] [Real]Absence check using 3 positive and 58 generalized place invariants in 12 ms returned sat
[2021-05-09 20:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:58:44] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-09 20:58:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:58:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 20:58:44] [INFO ] [Nat]Absence check using 3 positive and 58 generalized place invariants in 12 ms returned sat
[2021-05-09 20:58:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:58:44] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-09 20:58:44] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:58:44] [INFO ] [Nat]Added 85 Read/Feed constraints in 164 ms returned sat
[2021-05-09 20:58:45] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 0 ms to minimize.
[2021-05-09 20:58:45] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2021-05-09 20:58:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2021-05-09 20:58:45] [INFO ] Computed and/alt/rep : 322/2177/322 causal constraints (skipped 114 transitions) in 23 ms.
[2021-05-09 20:59:01] [INFO ] Added : 260 causal constraints over 52 iterations in 16052 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16187581 steps, including 2706668 resets, run timeout after 30001 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:59:31] [INFO ] Computed 61 place invariants in 54 ms
[2021-05-09 20:59:31] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:59:31] [INFO ] Computed 61 place invariants in 55 ms
[2021-05-09 20:59:31] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 20:59:34] [INFO ] Implicit Places using invariants and state equation in 2619 ms returned []
Implicit Place search using SMT with State Equation took 2986 ms to find 0 implicit places.
[2021-05-09 20:59:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 20:59:34] [INFO ] Computed 61 place invariants in 55 ms
[2021-05-09 20:59:34] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 100000 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:59:34] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 815 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 20:59:34] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 20:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:59:35] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2021-05-09 20:59:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:59:36] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2021-05-09 20:59:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 20:59:36] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2021-05-09 20:59:36] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 20:59:40] [INFO ] Added : 205 causal constraints over 41 iterations in 3932 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 456
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 445 transition count 456
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 431 transition count 448
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 431 transition count 439
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 422 transition count 439
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 439
Applied a total of 54 rules in 39 ms. Remains 422 /448 variables (removed 26) and now considering 439/459 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 439/459 transitions.
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 20:59:40] [INFO ] Invariants computation overflowed in 29 ms
Incomplete random walk after 1000000 steps, including 156159 resets, run finished after 1683 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96297 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 20:59:43] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 20:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 20:59:43] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2021-05-09 20:59:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 20:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 20:59:44] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2021-05-09 20:59:44] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 20:59:44] [INFO ] [Nat]Added 87 Read/Feed constraints in 14 ms returned sat
[2021-05-09 20:59:44] [INFO ] Computed and/alt/rep : 322/2143/322 causal constraints (skipped 116 transitions) in 24 ms.
[2021-05-09 20:59:55] [INFO ] Added : 294 causal constraints over 59 iterations in 10901 ms. Result :sat
Minimization took 1617 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16228579 steps, including 3032479 resets, run timeout after 30001 ms. (steps per millisecond=540 ) properties (out of 1) seen :0
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 439/439 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 439/439 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 439/439 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:00:27] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 21:00:27] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:00:27] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 21:00:27] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:00:30] [INFO ] Implicit Places using invariants and state equation in 3037 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3308 ms to find 3 implicit places.
[2021-05-09 21:00:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 439 rows 419 cols
[2021-05-09 21:00:30] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:00:30] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 439/439 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 436
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 436
Applied a total of 6 rules in 16 ms. Remains 416 /419 variables (removed 3) and now considering 436/439 (removed 3) transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:00:30] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:00:30] [INFO ] Implicit Places using invariants in 275 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:00:30] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:00:30] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:00:33] [INFO ] Implicit Places using invariants and state equation in 2880 ms returned []
Implicit Place search using SMT with State Equation took 3155 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 436/439 transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:00:33] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 156418 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96096 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 1) seen :0
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:00:36] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:00:36] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2021-05-09 21:00:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:00:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:00:37] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-09 21:00:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:00:37] [INFO ] [Nat]Added 87 Read/Feed constraints in 29 ms returned sat
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Deduced a trap composed of 58 places in 29 ms of which 0 ms to minimize.
[2021-05-09 21:00:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 468 ms
[2021-05-09 21:00:37] [INFO ] Computed and/alt/rep : 318/2129/318 causal constraints (skipped 117 transitions) in 24 ms.
[2021-05-09 21:00:49] [INFO ] Added : 318 causal constraints over 64 iterations in 11413 ms. Result :sat
Minimization took 1769 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15264124 steps, including 1689892 resets, run timeout after 30001 ms. (steps per millisecond=508 ) properties (out of 1) seen :0
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:01:20] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:01:21] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:01:21] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:01:21] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:01:23] [INFO ] Implicit Places using invariants and state equation in 2791 ms returned []
Implicit Place search using SMT with State Equation took 3052 ms to find 0 implicit places.
[2021-05-09 21:01:23] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:01:23] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:01:24] [INFO ] Dead Transitions using invariants and state equation in 194 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 109516 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:01:24] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:01:24] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:01:25] [INFO ] [Real]Absence check using state equation in 1155 ms returned sat
[2021-05-09 21:01:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:01:26] [INFO ] [Nat]Absence check using state equation in 1450 ms returned sat
[2021-05-09 21:01:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:01:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 22 ms returned sat
[2021-05-09 21:01:27] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2021-05-09 21:01:27] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 22 ms.
[2021-05-09 21:01:30] [INFO ] Added : 225 causal constraints over 45 iterations in 3333 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 430 transition count 441
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 52 place count 422 transition count 441
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 422 transition count 441
Applied a total of 53 rules in 39 ms. Remains 422 /448 variables (removed 26) and now considering 441/459 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 441/459 transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:01:30] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 1000000 steps, including 156082 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96326 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:01:33] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 21:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:01:33] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2021-05-09 21:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:01:34] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2021-05-09 21:01:34] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:01:34] [INFO ] [Nat]Added 87 Read/Feed constraints in 22 ms returned sat
[2021-05-09 21:01:34] [INFO ] Computed and/alt/rep : 324/2182/324 causal constraints (skipped 116 transitions) in 25 ms.
[2021-05-09 21:01:38] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 1 ms to minimize.
[2021-05-09 21:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2021-05-09 21:01:38] [INFO ] Added : 291 causal constraints over 59 iterations in 4267 ms. Result :sat
Minimization took 2630 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15800840 steps, including 2953913 resets, run timeout after 30001 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 441/441 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:02:11] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 21:02:11] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:02:11] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 21:02:11] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:02:14] [INFO ] Implicit Places using invariants and state equation in 3091 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3362 ms to find 3 implicit places.
[2021-05-09 21:02:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 441 rows 419 cols
[2021-05-09 21:02:14] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 21:02:14] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 441/441 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 438
Applied a total of 6 rules in 15 ms. Remains 416 /419 variables (removed 3) and now considering 438/441 (removed 3) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:14] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-09 21:02:15] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:15] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:02:15] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:02:18] [INFO ] Implicit Places using invariants and state equation in 3702 ms returned []
Implicit Place search using SMT with State Equation took 3977 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 438/441 transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:18] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 156061 resets, run finished after 1655 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95788 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:21] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:02:21] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2021-05-09 21:02:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:02:22] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2021-05-09 21:02:22] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:02:22] [INFO ] [Nat]Added 87 Read/Feed constraints in 24 ms returned sat
[2021-05-09 21:02:22] [INFO ] Computed and/alt/rep : 320/2168/320 causal constraints (skipped 117 transitions) in 25 ms.
[2021-05-09 21:02:27] [INFO ] Added : 297 causal constraints over 60 iterations in 5238 ms. Result :sat
Minimization took 1705 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15726638 steps, including 2939206 resets, run timeout after 30001 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:59] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:02:59] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:02:59] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:02:59] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:03:03] [INFO ] Implicit Places using invariants and state equation in 3637 ms returned []
Implicit Place search using SMT with State Equation took 3902 ms to find 0 implicit places.
[2021-05-09 21:03:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:03:03] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:03:03] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 99420 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:03:03] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 835 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:03:03] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 21:03:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:04] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2021-05-09 21:03:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:05] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2021-05-09 21:03:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:03:05] [INFO ] [Nat]Added 73 Read/Feed constraints in 17 ms returned sat
[2021-05-09 21:03:05] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:03:06] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:03:06] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:03:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 455 ms
[2021-05-09 21:03:06] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 21:03:09] [INFO ] Added : 220 causal constraints over 44 iterations in 3327 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 436 transition count 447
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 32 place count 432 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 41 place count 432 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 50 place count 423 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 423 transition count 440
Applied a total of 52 rules in 39 ms. Remains 423 /448 variables (removed 25) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 423 cols
[2021-05-09 21:03:09] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 1000000 steps, including 156289 resets, run finished after 1668 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96101 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 423 cols
[2021-05-09 21:03:12] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:03:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:12] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2021-05-09 21:03:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:03:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:13] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-09 21:03:13] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:03:13] [INFO ] [Nat]Added 86 Read/Feed constraints in 21 ms returned sat
[2021-05-09 21:03:13] [INFO ] Computed and/alt/rep : 326/2175/326 causal constraints (skipped 113 transitions) in 25 ms.
[2021-05-09 21:03:22] [INFO ] Added : 326 causal constraints over 66 iterations in 9399 ms. Result :sat
Minimization took 2679 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 423 /423 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 423 /423 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 423 cols
[2021-05-09 21:03:25] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:03:25] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 440 rows 423 cols
[2021-05-09 21:03:25] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 21:03:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:03:29] [INFO ] Implicit Places using invariants and state equation in 3368 ms returned [204, 274, 299]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3639 ms to find 3 implicit places.
[2021-05-09 21:03:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 420 cols
[2021-05-09 21:03:29] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:03:29] [INFO ] Dead Transitions using invariants and state equation in 201 ms returned []
Starting structural reductions, iteration 1 : 420/423 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 420 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 417 transition count 437
Applied a total of 6 rules in 16 ms. Remains 417 /420 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:03:29] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:03:29] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:03:29] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:03:29] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:03:31] [INFO ] Implicit Places using invariants and state equation in 1624 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 417/423 places, 437/440 transitions.
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:03:31] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 1000000 steps, including 155778 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96094 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:03:34] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:34] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2021-05-09 21:03:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:03:35] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2021-05-09 21:03:35] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:03:35] [INFO ] [Nat]Added 86 Read/Feed constraints in 20 ms returned sat
[2021-05-09 21:03:35] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2021-05-09 21:03:35] [INFO ] Computed and/alt/rep : 322/2161/322 causal constraints (skipped 114 transitions) in 24 ms.
[2021-05-09 21:03:41] [INFO ] Deduced a trap composed of 134 places in 157 ms of which 0 ms to minimize.
[2021-05-09 21:03:41] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2021-05-09 21:03:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2021-05-09 21:03:41] [INFO ] Added : 283 causal constraints over 57 iterations in 5910 ms. Result :sat
Minimization took 1631 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15735649 steps, including 2940029 resets, run timeout after 30001 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:04:13] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:04:13] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:04:13] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:04:13] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:04:15] [INFO ] Implicit Places using invariants and state equation in 1646 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2021-05-09 21:04:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 417 cols
[2021-05-09 21:04:15] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:04:15] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 71789 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:04:15] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1240 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 827 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:04:15] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:04:15] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2021-05-09 21:04:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:04:16] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2021-05-09 21:04:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:04:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2021-05-09 21:04:16] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2021-05-09 21:04:16] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 0 ms to minimize.
[2021-05-09 21:04:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2021-05-09 21:04:16] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 26 ms.
[2021-05-09 21:04:20] [INFO ] Added : 245 causal constraints over 49 iterations in 4252 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16885474 steps, including 2502869 resets, run timeout after 30001 ms. (steps per millisecond=562 ) properties (out of 1) seen :0
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 430 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 39 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:04:51] [INFO ] Computed 64 place invariants in 56 ms
Incomplete random walk after 1000000 steps, including 156514 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96114 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:04:53] [INFO ] Computed 64 place invariants in 55 ms
[2021-05-09 21:04:53] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-09 21:04:53] [INFO ] [Real]Absence check using 8 positive and 56 generalized place invariants in 10 ms returned sat
[2021-05-09 21:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:04:54] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-09 21:04:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:04:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-09 21:04:54] [INFO ] [Nat]Absence check using 8 positive and 56 generalized place invariants in 10 ms returned sat
[2021-05-09 21:04:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:04:54] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-09 21:04:54] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:04:54] [INFO ] [Nat]Added 88 Read/Feed constraints in 66 ms returned sat
[2021-05-09 21:04:54] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 0 ms to minimize.
[2021-05-09 21:04:54] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2021-05-09 21:04:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2021-05-09 21:04:54] [INFO ] Computed and/alt/rep : 322/2178/322 causal constraints (skipped 117 transitions) in 25 ms.
[2021-05-09 21:05:01] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2021-05-09 21:05:02] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2021-05-09 21:05:02] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2021-05-09 21:05:02] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2021-05-09 21:05:02] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 1 ms to minimize.
[2021-05-09 21:05:02] [INFO ] Deduced a trap composed of 142 places in 153 ms of which 1 ms to minimize.
[2021-05-09 21:05:03] [INFO ] Deduced a trap composed of 139 places in 152 ms of which 0 ms to minimize.
[2021-05-09 21:05:03] [INFO ] Deduced a trap composed of 141 places in 162 ms of which 0 ms to minimize.
[2021-05-09 21:05:03] [INFO ] Deduced a trap composed of 126 places in 158 ms of which 1 ms to minimize.
[2021-05-09 21:05:03] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:05:03] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 1 ms to minimize.
[2021-05-09 21:05:04] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2021-05-09 21:05:04] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 1 ms to minimize.
[2021-05-09 21:05:04] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 0 ms to minimize.
[2021-05-09 21:05:04] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 0 ms to minimize.
[2021-05-09 21:05:05] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 0 ms to minimize.
[2021-05-09 21:05:05] [INFO ] Deduced a trap composed of 40 places in 148 ms of which 0 ms to minimize.
[2021-05-09 21:05:05] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 0 ms to minimize.
[2021-05-09 21:05:05] [INFO ] Deduced a trap composed of 130 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:05:05] [INFO ] Deduced a trap composed of 132 places in 151 ms of which 1 ms to minimize.
[2021-05-09 21:05:06] [INFO ] Deduced a trap composed of 137 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:05:06] [INFO ] Deduced a trap composed of 135 places in 150 ms of which 1 ms to minimize.
[2021-05-09 21:05:06] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 1 ms to minimize.
[2021-05-09 21:05:06] [INFO ] Deduced a trap composed of 121 places in 154 ms of which 0 ms to minimize.
[2021-05-09 21:05:07] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 0 ms to minimize.
[2021-05-09 21:05:07] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:05:07] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 1 ms to minimize.
[2021-05-09 21:05:07] [INFO ] Deduced a trap composed of 121 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:05:07] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 0 ms to minimize.
[2021-05-09 21:05:08] [INFO ] Deduced a trap composed of 48 places in 148 ms of which 1 ms to minimize.
[2021-05-09 21:05:08] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 6536 ms
[2021-05-09 21:05:08] [INFO ] Added : 285 causal constraints over 58 iterations in 13574 ms. Result :sat
Minimization took 2608 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Interrupted Parikh walk after 15879426 steps, including 1756621 resets, run timeout after 30001 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:05:40] [INFO ] Computed 64 place invariants in 55 ms
[2021-05-09 21:05:41] [INFO ] Implicit Places using invariants in 413 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 414 ms to find 3 implicit places.
[2021-05-09 21:05:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 418 cols
[2021-05-09 21:05:41] [INFO ] Invariants computation overflowed in 29 ms
[2021-05-09 21:05:41] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Starting structural reductions, iteration 1 : 418/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 418 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 415 transition count 437
Applied a total of 6 rules in 16 ms. Remains 415 /418 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:05:41] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:05:41] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:05:41] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:05:41] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:05:44] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 415/421 places, 437/440 transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:05:44] [INFO ] Invariants computation overflowed in 24 ms
Incomplete random walk after 1000000 steps, including 156355 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96132 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:05:47] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:05:47] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-09 21:05:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:05:47] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2021-05-09 21:05:47] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:05:48] [INFO ] [Nat]Added 88 Read/Feed constraints in 18 ms returned sat
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2021-05-09 21:05:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 772 ms
[2021-05-09 21:05:48] [INFO ] Computed and/alt/rep : 318/2164/318 causal constraints (skipped 118 transitions) in 20 ms.
[2021-05-09 21:05:54] [INFO ] Added : 274 causal constraints over 55 iterations in 5377 ms. Result :sat
Minimization took 1101 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Interrupted Parikh walk after 16369918 steps, including 3060439 resets, run timeout after 30001 ms. (steps per millisecond=545 ) properties (out of 1) seen :0
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:06:25] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:06:25] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:06:25] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:06:25] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:06:28] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 2804 ms to find 0 implicit places.
[2021-05-09 21:06:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:06:28] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:06:28] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 132924 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:06:28] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1257 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 854 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:06:28] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 21:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:06:28] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2021-05-09 21:06:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:06:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:06:29] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2021-05-09 21:06:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:06:29] [INFO ] [Nat]Added 73 Read/Feed constraints in 67 ms returned sat
[2021-05-09 21:06:29] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 21:06:33] [INFO ] Added : 260 causal constraints over 52 iterations in 4464 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 444 transition count 455
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 434 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 38 place count 429 transition count 448
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 45 place count 429 transition count 441
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 52 place count 422 transition count 441
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 441
Applied a total of 54 rules in 38 ms. Remains 422 /448 variables (removed 26) and now considering 441/459 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 441/459 transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:06:33] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 156524 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95873 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:06:36] [INFO ] Invariants computation overflowed in 37 ms
[2021-05-09 21:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:06:36] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2021-05-09 21:06:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:06:37] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2021-05-09 21:06:37] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:06:37] [INFO ] [Nat]Added 88 Read/Feed constraints in 40 ms returned sat
[2021-05-09 21:06:37] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 1 ms to minimize.
[2021-05-09 21:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2021-05-09 21:06:37] [INFO ] Computed and/alt/rep : 323/2186/323 causal constraints (skipped 117 transitions) in 25 ms.
[2021-05-09 21:06:42] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:06:42] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:06:42] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:06:43] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:06:43] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2021-05-09 21:06:43] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:06:43] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:06:43] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 1 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 151 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 156 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:06:44] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:06:45] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:06:45] [INFO ] Deduced a trap composed of 158 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:06:45] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:06:45] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:06:45] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 1 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 172 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 163 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:06:46] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:06:47] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2021-05-09 21:06:47] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:47] [INFO ] Deduced a trap composed of 159 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:47] [INFO ] Deduced a trap composed of 162 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:47] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:48] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:49] [INFO ] Deduced a trap composed of 165 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:06:49] [INFO ] Deduced a trap composed of 167 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:49] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:49] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:49] [INFO ] Deduced a trap composed of 133 places in 123 ms of which 1 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 139 places in 123 ms of which 1 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 163 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 1 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 155 places in 125 ms of which 1 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 1 ms to minimize.
[2021-05-09 21:06:50] [INFO ] Deduced a trap composed of 165 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:06:51] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:06:51] [INFO ] Deduced a trap composed of 136 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:51] [INFO ] Deduced a trap composed of 141 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:51] [INFO ] Deduced a trap composed of 163 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:51] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 167 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 152 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 137 places in 125 ms of which 1 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 139 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:52] [INFO ] Deduced a trap composed of 145 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 143 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 141 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 168 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:06:53] [INFO ] Deduced a trap composed of 158 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:54] [INFO ] Deduced a trap composed of 147 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:06:54] [INFO ] Deduced a trap composed of 144 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:06:54] [INFO ] Deduced a trap composed of 172 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:06:54] [INFO ] Deduced a trap composed of 170 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:06:54] [INFO ] Deduced a trap composed of 164 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:55] [INFO ] Deduced a trap composed of 151 places in 122 ms of which 0 ms to minimize.
[2021-05-09 21:06:55] [INFO ] Deduced a trap composed of 167 places in 122 ms of which 0 ms to minimize.
[2021-05-09 21:06:55] [INFO ] Deduced a trap composed of 168 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:55] [INFO ] Deduced a trap composed of 170 places in 123 ms of which 1 ms to minimize.
[2021-05-09 21:06:55] [INFO ] Deduced a trap composed of 169 places in 122 ms of which 1 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Deduced a trap composed of 166 places in 120 ms of which 1 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Deduced a trap composed of 164 places in 123 ms of which 0 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Deduced a trap composed of 167 places in 121 ms of which 1 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Deduced a trap composed of 141 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 80/79 trap constraints in 14520 ms
[2021-05-09 21:06:56] [INFO ] Added : 287 causal constraints over 58 iterations in 19726 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 441/441 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 441/441 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 441/441 (removed 0) transitions.
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:07:00] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-09 21:07:00] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 441 rows 422 cols
[2021-05-09 21:07:00] [INFO ] Invariants computation overflowed in 38 ms
[2021-05-09 21:07:00] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:07:03] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3651 ms to find 3 implicit places.
[2021-05-09 21:07:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 441 rows 419 cols
[2021-05-09 21:07:03] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:07:03] [INFO ] Dead Transitions using invariants and state equation in 197 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 441/441 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 438
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 438
Applied a total of 6 rules in 15 ms. Remains 416 /419 variables (removed 3) and now considering 438/441 (removed 3) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:03] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:07:04] [INFO ] Implicit Places using invariants in 262 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:04] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:07:04] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:07:05] [INFO ] Implicit Places using invariants and state equation in 1760 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 438/441 transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:05] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 156286 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95824 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:08] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:07:08] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-09 21:07:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:07:09] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2021-05-09 21:07:09] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:07:09] [INFO ] [Nat]Added 88 Read/Feed constraints in 48 ms returned sat
[2021-05-09 21:07:09] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2021-05-09 21:07:09] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2021-05-09 21:07:09] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2021-05-09 21:07:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2021-05-09 21:07:09] [INFO ] Computed and/alt/rep : 319/2172/319 causal constraints (skipped 118 transitions) in 25 ms.
[2021-05-09 21:07:16] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2021-05-09 21:07:16] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2021-05-09 21:07:16] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2021-05-09 21:07:16] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 0 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 0 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 0 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 0 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 0 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2021-05-09 21:07:17] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 0 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 0 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 1 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 0 ms to minimize.
[2021-05-09 21:07:18] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2021-05-09 21:07:19] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 0 ms to minimize.
[2021-05-09 21:07:20] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3843 ms
[2021-05-09 21:07:20] [INFO ] Added : 290 causal constraints over 59 iterations in 10707 ms. Result :sat
Minimization took 2414 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15779362 steps, including 2950154 resets, run timeout after 30001 ms. (steps per millisecond=525 ) properties (out of 1) seen :0
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:52] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:07:52] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:52] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:07:53] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:07:54] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2021-05-09 21:07:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 438 rows 416 cols
[2021-05-09 21:07:54] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:07:54] [INFO ] Dead Transitions using invariants and state equation in 198 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 86604 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:07:54] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1238 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:07:54] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:07:55] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-09 21:07:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:07:56] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2021-05-09 21:07:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:07:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 34 ms returned sat
[2021-05-09 21:07:56] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2021-05-09 21:07:56] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2021-05-09 21:07:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2021-05-09 21:07:56] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 21:08:00] [INFO ] Added : 225 causal constraints over 45 iterations in 3988 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 444 transition count 455
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 434 transition count 445
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 38 place count 429 transition count 448
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 429 transition count 440
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 39 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:08:00] [INFO ] Computed 64 place invariants in 54 ms
Incomplete random walk after 1000000 steps, including 156324 resets, run finished after 1669 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96184 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:08:03] [INFO ] Computed 64 place invariants in 53 ms
[2021-05-09 21:08:03] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 21:08:03] [INFO ] [Real]Absence check using 3 positive and 61 generalized place invariants in 14 ms returned sat
[2021-05-09 21:08:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:08:03] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-09 21:08:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:08:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-09 21:08:03] [INFO ] [Nat]Absence check using 3 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-09 21:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:08:03] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2021-05-09 21:08:03] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:08:04] [INFO ] [Nat]Added 88 Read/Feed constraints in 70 ms returned sat
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 132 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 0 ms to minimize.
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:04] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 121 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 125 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 0 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 132 places in 144 ms of which 0 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 0 ms to minimize.
[2021-05-09 21:08:05] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 118 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:06] [INFO ] Deduced a trap composed of 121 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:07] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:07] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:07] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3152 ms
[2021-05-09 21:08:07] [INFO ] Computed and/alt/rep : 325/2192/325 causal constraints (skipped 114 transitions) in 25 ms.
[2021-05-09 21:08:14] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:08:14] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2021-05-09 21:08:15] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:08:15] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:08:15] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2021-05-09 21:08:15] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:08:15] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 1 ms to minimize.
[2021-05-09 21:08:16] [INFO ] Deduced a trap composed of 128 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:16] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:08:16] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 0 ms to minimize.
[2021-05-09 21:08:16] [INFO ] Deduced a trap composed of 123 places in 149 ms of which 0 ms to minimize.
[2021-05-09 21:08:16] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:08:17] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:17] [INFO ] Deduced a trap composed of 130 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:08:17] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:17] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:17] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:18] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:18] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:08:18] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:08:19] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:08:19] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 1 ms to minimize.
[2021-05-09 21:08:19] [INFO ] Deduced a trap composed of 137 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:19] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2021-05-09 21:08:19] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:20] [INFO ] Deduced a trap composed of 148 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:08:20] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:08:20] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:08:21] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:08:21] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:08:21] [INFO ] Deduced a trap composed of 137 places in 133 ms of which 0 ms to minimize.
[2021-05-09 21:08:21] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:08:21] [INFO ] Deduced a trap composed of 148 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:08:22] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:08:22] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:08:22] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:08:22] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:08:22] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:08:23] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:08:23] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:08:24] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:08:24] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:08:24] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:08:24] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:08:24] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:08:25] [INFO ] Deduced a trap composed of 55 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:08:25] [INFO ] Deduced a trap composed of 139 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:08:25] [INFO ] Deduced a trap composed of 162 places in 134 ms of which 1 ms to minimize.
[2021-05-09 21:08:25] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:08:25] [INFO ] Deduced a trap composed of 134 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:08:26] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 11515 ms
[2021-05-09 21:08:26] [INFO ] Added : 276 causal constraints over 56 iterations in 18925 ms. Result :sat
Minimization took 1456 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 15872279 steps, including 1755700 resets, run timeout after 30001 ms. (steps per millisecond=529 ) properties (out of 1) seen :0
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:08:57] [INFO ] Computed 64 place invariants in 53 ms
[2021-05-09 21:08:58] [INFO ] Implicit Places using invariants in 419 ms returned [203, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 420 ms to find 2 implicit places.
[2021-05-09 21:08:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 21:08:58] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:08:58] [INFO ] Dead Transitions using invariants and state equation in 199 ms returned []
Starting structural reductions, iteration 1 : 419/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 438
Applied a total of 4 rules in 18 ms. Remains 417 /419 variables (removed 2) and now considering 438/440 (removed 2) transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:08:58] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:08:58] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:08:58] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-09 21:08:58] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:09:01] [INFO ] Implicit Places using invariants and state equation in 2962 ms returned []
Implicit Place search using SMT with State Equation took 3219 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 417/421 places, 438/440 transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:09:01] [INFO ] Invariants computation overflowed in 23 ms
Incomplete random walk after 1000000 steps, including 156395 resets, run finished after 1674 ms. (steps per millisecond=597 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96133 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 1) seen :0
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:09:04] [INFO ] Invariants computation overflowed in 23 ms
[2021-05-09 21:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:09:04] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2021-05-09 21:09:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:09:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:09:05] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2021-05-09 21:09:05] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:09:05] [INFO ] [Nat]Added 88 Read/Feed constraints in 20 ms returned sat
[2021-05-09 21:09:05] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:09:05] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2021-05-09 21:09:05] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 0 ms to minimize.
[2021-05-09 21:09:05] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 0 ms to minimize.
[2021-05-09 21:09:06] [INFO ] Deduced a trap composed of 126 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:09:06] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:09:06] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:09:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1056 ms
[2021-05-09 21:09:06] [INFO ] Computed and/alt/rep : 322/2179/322 causal constraints (skipped 115 transitions) in 24 ms.
[2021-05-09 21:09:13] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 0 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 0 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 0 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 0 ms to minimize.
[2021-05-09 21:09:14] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2021-05-09 21:09:15] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2076 ms
[2021-05-09 21:09:16] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2021-05-09 21:09:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2021-05-09 21:09:16] [INFO ] Added : 305 causal constraints over 62 iterations in 9951 ms. Result :sat
Minimization took 1267 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16342516 steps, including 3055213 resets, run timeout after 30001 ms. (steps per millisecond=544 ) properties (out of 1) seen :0
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 438/438 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 438/438 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 438/438 transitions.
Applied a total of 0 rules in 7 ms. Remains 417 /417 variables (removed 0) and now considering 438/438 (removed 0) transitions.
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:09:47] [INFO ] Invariants computation overflowed in 23 ms
[2021-05-09 21:09:47] [INFO ] Implicit Places using invariants in 256 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:09:47] [INFO ] Invariants computation overflowed in 23 ms
[2021-05-09 21:09:48] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:09:50] [INFO ] Implicit Places using invariants and state equation in 2963 ms returned []
Implicit Place search using SMT with State Equation took 3220 ms to find 0 implicit places.
[2021-05-09 21:09:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 438 rows 417 cols
[2021-05-09 21:09:50] [INFO ] Invariants computation overflowed in 23 ms
[2021-05-09 21:09:51] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 438/438 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 116148 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:09:51] [INFO ] Invariants computation overflowed in 26 ms
Incomplete random walk after 10000 steps, including 1250 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:09:51] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:09:51] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-09 21:09:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:09:51] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-09 21:09:51] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:09:51] [INFO ] [Nat]Added 73 Read/Feed constraints in 31 ms returned sat
[2021-05-09 21:09:51] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2021-05-09 21:09:51] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2021-05-09 21:09:52] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 0 ms to minimize.
[2021-05-09 21:09:52] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2021-05-09 21:09:52] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 0 ms to minimize.
[2021-05-09 21:09:52] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 0 ms to minimize.
[2021-05-09 21:09:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 481 ms
[2021-05-09 21:09:52] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 21:09:56] [INFO ] Added : 240 causal constraints over 48 iterations in 4153 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16354836 steps, including 2255691 resets, run timeout after 30001 ms. (steps per millisecond=545 ) properties (out of 1) seen :0
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 436 transition count 447
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -2
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 34 place count 431 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 431 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 422 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 440
Applied a total of 54 rules in 39 ms. Remains 422 /448 variables (removed 26) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 21:10:26] [INFO ] Invariants computation overflowed in 28 ms
Incomplete random walk after 1000000 steps, including 156632 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95880 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 21:10:29] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:10:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:10:29] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2021-05-09 21:10:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:10:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:10:29] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2021-05-09 21:10:29] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:10:29] [INFO ] [Nat]Added 86 Read/Feed constraints in 25 ms returned sat
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:10:30] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Deduced a trap composed of 113 places in 147 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 0 ms to minimize.
[2021-05-09 21:10:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1694 ms
[2021-05-09 21:10:31] [INFO ] Computed and/alt/rep : 322/2140/322 causal constraints (skipped 117 transitions) in 25 ms.
[2021-05-09 21:10:39] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2021-05-09 21:10:39] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2021-05-09 21:10:39] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 0 ms to minimize.
[2021-05-09 21:10:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 623 ms
[2021-05-09 21:10:39] [INFO ] Added : 290 causal constraints over 58 iterations in 8438 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 21:10:43] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 21:10:43] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 440 rows 422 cols
[2021-05-09 21:10:43] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-09 21:10:43] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:10:46] [INFO ] Implicit Places using invariants and state equation in 3196 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3479 ms to find 3 implicit places.
[2021-05-09 21:10:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 419 cols
[2021-05-09 21:10:46] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:10:46] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 437
Applied a total of 6 rules in 15 ms. Remains 416 /419 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:10:46] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:10:46] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:10:46] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:10:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:10:50] [INFO ] Implicit Places using invariants and state equation in 3233 ms returned []
Implicit Place search using SMT with State Equation took 3499 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 437/440 transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:10:50] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 155943 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96191 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:10:53] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:10:53] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-09 21:10:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:10:53] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-09 21:10:53] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:10:53] [INFO ] [Nat]Added 86 Read/Feed constraints in 34 ms returned sat
[2021-05-09 21:10:53] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 0 ms to minimize.
[2021-05-09 21:10:53] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 1 ms to minimize.
[2021-05-09 21:10:54] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 0 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:10:55] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2021-05-09 21:10:56] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2021-05-09 21:10:56] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 0 ms to minimize.
[2021-05-09 21:10:56] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2021-05-09 21:10:56] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2021-05-09 21:10:56] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2651 ms
[2021-05-09 21:10:56] [INFO ] Computed and/alt/rep : 318/2126/318 causal constraints (skipped 118 transitions) in 24 ms.
[2021-05-09 21:11:06] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 1 ms to minimize.
[2021-05-09 21:11:07] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 1 ms to minimize.
[2021-05-09 21:11:07] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 0 ms to minimize.
[2021-05-09 21:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 603 ms
[2021-05-09 21:11:07] [INFO ] Added : 280 causal constraints over 56 iterations in 11067 ms. Result :sat
Minimization took 1882 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:11:09] [INFO ] Invariants computation overflowed in 32 ms
[2021-05-09 21:11:09] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:11:09] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:11:09] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 21:11:12] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
[2021-05-09 21:11:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 416 cols
[2021-05-09 21:11:12] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:11:12] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 81351 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-14
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:11:12] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1253 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 813 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:11:12] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:11:12] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-05-09 21:11:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:11:13] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2021-05-09 21:11:13] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:11:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 49 ms returned sat
[2021-05-09 21:11:13] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:11:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2021-05-09 21:11:13] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 23 ms.
[2021-05-09 21:11:17] [INFO ] Added : 240 causal constraints over 48 iterations in 4539 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16468750 steps, including 2440111 resets, run timeout after 30001 ms. (steps per millisecond=548 ) properties (out of 1) seen :0
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 455
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 444 transition count 455
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 36 place count 430 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 430 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 54 place count 421 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 421 transition count 440
Applied a total of 56 rules in 42 ms. Remains 421 /448 variables (removed 27) and now considering 440/459 (removed 19) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/448 places, 440/459 transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:11:47] [INFO ] Computed 64 place invariants in 54 ms
Incomplete random walk after 1000000 steps, including 156016 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96063 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:11:50] [INFO ] Computed 64 place invariants in 54 ms
[2021-05-09 21:11:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-09 21:11:50] [INFO ] [Real]Absence check using 3 positive and 61 generalized place invariants in 12 ms returned sat
[2021-05-09 21:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:11:50] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2021-05-09 21:11:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:11:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-09 21:11:51] [INFO ] [Nat]Absence check using 3 positive and 61 generalized place invariants in 13 ms returned sat
[2021-05-09 21:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:11:51] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-09 21:11:51] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:11:51] [INFO ] [Nat]Added 88 Read/Feed constraints in 21 ms returned sat
[2021-05-09 21:11:51] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:11:51] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:11:51] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:11:51] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:11:52] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 0 ms to minimize.
[2021-05-09 21:11:53] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:11:53] [INFO ] Deduced a trap composed of 111 places in 151 ms of which 1 ms to minimize.
[2021-05-09 21:11:53] [INFO ] Deduced a trap composed of 120 places in 145 ms of which 0 ms to minimize.
[2021-05-09 21:11:53] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 1 ms to minimize.
[2021-05-09 21:11:53] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2421 ms
[2021-05-09 21:11:53] [INFO ] Computed and/alt/rep : 322/2166/322 causal constraints (skipped 117 transitions) in 25 ms.
[2021-05-09 21:12:00] [INFO ] Added : 287 causal constraints over 58 iterations in 7205 ms. Result :sat
Minimization took 1690 ms.
Current structural bounds on expressions (after SMT) : [216] Max seen :[0]
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 8 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 421/421 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 421/421 places, 440/440 transitions.
Applied a total of 0 rules in 7 ms. Remains 421 /421 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 421 cols
[2021-05-09 21:12:02] [INFO ] Computed 64 place invariants in 54 ms
[2021-05-09 21:12:02] [INFO ] Implicit Places using invariants in 414 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 415 ms to find 3 implicit places.
[2021-05-09 21:12:03] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 440 rows 418 cols
[2021-05-09 21:12:03] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-09 21:12:03] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Starting structural reductions, iteration 1 : 418/421 places, 440/440 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 418 transition count 437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 415 transition count 437
Applied a total of 6 rules in 15 ms. Remains 415 /418 variables (removed 3) and now considering 437/440 (removed 3) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:03] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:12:03] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:03] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:12:03] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:12:06] [INFO ] Implicit Places using invariants and state equation in 3377 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 415/421 places, 437/440 transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:06] [INFO ] Invariants computation overflowed in 25 ms
Incomplete random walk after 1000000 steps, including 155800 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95887 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 1) seen :0
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:09] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:12:09] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2021-05-09 21:12:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:12:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:12:10] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2021-05-09 21:12:10] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:12:10] [INFO ] [Nat]Added 88 Read/Feed constraints in 31 ms returned sat
[2021-05-09 21:12:10] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:12:10] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 1 ms to minimize.
[2021-05-09 21:12:10] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:12:10] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 0 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 112 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 135 places in 124 ms of which 1 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 126 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:11] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 1 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 1 ms to minimize.
[2021-05-09 21:12:12] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 0 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 121 places in 146 ms of which 0 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:13] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 113 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 132 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:14] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 113 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 114 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 114 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 119 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 1 ms to minimize.
[2021-05-09 21:12:15] [INFO ] Deduced a trap composed of 139 places in 135 ms of which 0 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 130 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 123 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:16] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 114 places in 139 ms of which 1 ms to minimize.
[2021-05-09 21:12:17] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 125 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:18] [INFO ] Deduced a trap composed of 119 places in 140 ms of which 1 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 1 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 1 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 122 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:19] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 127 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 0 ms to minimize.
[2021-05-09 21:12:20] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 114 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 1 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 1 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:12:21] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:22] [INFO ] Deduced a trap composed of 130 places in 139 ms of which 0 ms to minimize.
[2021-05-09 21:12:22] [INFO ] Trap strengthening (SAT) tested/added 77/76 trap constraints in 11837 ms
[2021-05-09 21:12:22] [INFO ] Computed and/alt/rep : 318/2152/318 causal constraints (skipped 118 transitions) in 24 ms.
[2021-05-09 21:12:28] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:29] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:12:29] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:29] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:29] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:29] [INFO ] Deduced a trap composed of 145 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 141 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 144 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 147 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:30] [INFO ] Deduced a trap composed of 131 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:31] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:31] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:31] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 0 ms to minimize.
[2021-05-09 21:12:31] [INFO ] Deduced a trap composed of 151 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:31] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:32] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 0 ms to minimize.
[2021-05-09 21:12:32] [INFO ] Deduced a trap composed of 154 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:32] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:32] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:32] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 0 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 138 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 143 places in 143 ms of which 0 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 147 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:33] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:34] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:34] [INFO ] Deduced a trap composed of 156 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:34] [INFO ] Deduced a trap composed of 145 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:34] [INFO ] Deduced a trap composed of 151 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:34] [INFO ] Deduced a trap composed of 139 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 142 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:12:35] [INFO ] Deduced a trap composed of 141 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:36] [INFO ] Deduced a trap composed of 147 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:36] [INFO ] Deduced a trap composed of 146 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:36] [INFO ] Deduced a trap composed of 148 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:36] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:36] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:12:37] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 1 ms to minimize.
[2021-05-09 21:12:37] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:37] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 0 ms to minimize.
[2021-05-09 21:12:37] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:37] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:38] [INFO ] Deduced a trap composed of 139 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:38] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:12:38] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 1 ms to minimize.
[2021-05-09 21:12:38] [INFO ] Deduced a trap composed of 141 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:38] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:39] [INFO ] Deduced a trap composed of 149 places in 133 ms of which 0 ms to minimize.
[2021-05-09 21:12:39] [INFO ] Deduced a trap composed of 149 places in 136 ms of which 1 ms to minimize.
[2021-05-09 21:12:39] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:39] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:12:40] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:12:40] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:40] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:12:40] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:12:40] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:12:41] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:12:41] [INFO ] Deduced a trap composed of 127 places in 132 ms of which 0 ms to minimize.
[2021-05-09 21:12:41] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 1 ms to minimize.
[2021-05-09 21:12:41] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 0 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 0 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 151 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 151 places in 129 ms of which 1 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 135 places in 130 ms of which 0 ms to minimize.
[2021-05-09 21:12:42] [INFO ] Deduced a trap composed of 135 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:12:43] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 0 ms to minimize.
[2021-05-09 21:12:43] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2021-05-09 21:12:43] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2021-05-09 21:12:43] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 1 ms to minimize.
[2021-05-09 21:12:44] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 1 ms to minimize.
[2021-05-09 21:12:44] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:12:44] [INFO ] Deduced a trap composed of 156 places in 126 ms of which 0 ms to minimize.
[2021-05-09 21:12:45] [INFO ] Deduced a trap composed of 145 places in 123 ms of which 1 ms to minimize.
[2021-05-09 21:12:45] [INFO ] Deduced a trap composed of 151 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:12:45] [INFO ] Deduced a trap composed of 49 places in 41 ms of which 0 ms to minimize.
[2021-05-09 21:12:46] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 0 ms to minimize.
[2021-05-09 21:12:46] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 0 ms to minimize.
[2021-05-09 21:12:46] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:46] [INFO ] Deduced a trap composed of 143 places in 130 ms of which 1 ms to minimize.
[2021-05-09 21:12:47] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2021-05-09 21:12:47] [INFO ] Deduced a trap composed of 134 places in 131 ms of which 0 ms to minimize.
[2021-05-09 21:12:47] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 56 places in 37 ms of which 1 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 139 places in 126 ms of which 1 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 71 places in 35 ms of which 0 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 145 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:12:48] [INFO ] Deduced a trap composed of 149 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 140 places in 128 ms of which 1 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 62 places in 34 ms of which 0 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 146 places in 126 ms of which 1 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 149 places in 127 ms of which 0 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 145 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:12:49] [INFO ] Deduced a trap composed of 55 places in 34 ms of which 0 ms to minimize.
[2021-05-09 21:12:50] [INFO ] Deduced a trap composed of 139 places in 124 ms of which 0 ms to minimize.
[2021-05-09 21:12:50] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 0 ms to minimize.
[2021-05-09 21:12:50] [INFO ] Deduced a trap composed of 54 places in 31 ms of which 0 ms to minimize.
[2021-05-09 21:12:55] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2021-05-09 21:12:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [216] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Starting structural reductions, iteration 0 : 415/415 places, 437/437 transitions.
Applied a total of 0 rules in 7 ms. Remains 415 /415 variables (removed 0) and now considering 437/437 (removed 0) transitions.
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:55] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 21:12:55] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:55] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-09 21:12:55] [INFO ] State equation strengthened by 88 read => feed constraints.
[2021-05-09 21:12:58] [INFO ] Implicit Places using invariants and state equation in 3063 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
[2021-05-09 21:12:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 437 rows 415 cols
[2021-05-09 21:12:58] [INFO ] Invariants computation overflowed in 25 ms
[2021-05-09 21:12:58] [INFO ] Dead Transitions using invariants and state equation in 188 ms returned []
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 437/437 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-14 in 106256 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-15
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:12:58] [INFO ] Invariants computation overflowed in 27 ms
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 839 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 459 rows 448 cols
[2021-05-09 21:12:58] [INFO ] Invariants computation overflowed in 27 ms
[2021-05-09 21:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:12:59] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-09 21:12:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:13:00] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2021-05-09 21:13:00] [INFO ] State equation strengthened by 73 read => feed constraints.
[2021-05-09 21:13:00] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2021-05-09 21:13:00] [INFO ] Computed and/alt/rep : 380/2243/380 causal constraints (skipped 78 transitions) in 24 ms.
[2021-05-09 21:13:04] [INFO ] Deduced a trap composed of 2 places in 158 ms of which 1 ms to minimize.
[2021-05-09 21:13:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 459/459 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 448 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 446 transition count 457
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 446 transition count 456
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 6 place count 445 transition count 456
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 435 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 431 transition count 448
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 43 place count 431 transition count 439
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 52 place count 422 transition count 439
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 422 transition count 439
Applied a total of 54 rules in 43 ms. Remains 422 /448 variables (removed 26) and now considering 439/459 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/448 places, 439/459 transitions.
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:13:04] [INFO ] Invariants computation overflowed in 30 ms
Incomplete random walk after 1000000 steps, including 156494 resets, run finished after 1671 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96160 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:13:07] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:13:08] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2021-05-09 21:13:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:13:09] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2021-05-09 21:13:09] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:13:09] [INFO ] [Nat]Added 87 Read/Feed constraints in 27 ms returned sat
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
[2021-05-09 21:13:09] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 0 ms to minimize.
[2021-05-09 21:13:10] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 0 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2021-05-09 21:13:11] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2688 ms
[2021-05-09 21:13:11] [INFO ] Computed and/alt/rep : 325/2172/325 causal constraints (skipped 113 transitions) in 25 ms.
[2021-05-09 21:13:26] [INFO ] Added : 322 causal constraints over 65 iterations in 14703 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 422/422 places, 439/439 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 422/422 places, 439/439 transitions.
Starting structural reductions, iteration 0 : 422/422 places, 439/439 transitions.
Applied a total of 0 rules in 7 ms. Remains 422 /422 variables (removed 0) and now considering 439/439 (removed 0) transitions.
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:13:29] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:13:29] [INFO ] Implicit Places using invariants in 286 ms returned []
// Phase 1: matrix 439 rows 422 cols
[2021-05-09 21:13:29] [INFO ] Invariants computation overflowed in 34 ms
[2021-05-09 21:13:29] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:13:33] [INFO ] Implicit Places using invariants and state equation in 3260 ms returned [203, 273, 298]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 3548 ms to find 3 implicit places.
[2021-05-09 21:13:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 439 rows 419 cols
[2021-05-09 21:13:33] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:13:33] [INFO ] Dead Transitions using invariants and state equation in 206 ms returned []
Starting structural reductions, iteration 1 : 419/422 places, 439/439 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 419 transition count 436
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 416 transition count 436
Applied a total of 6 rules in 15 ms. Remains 416 /419 variables (removed 3) and now considering 436/439 (removed 3) transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:13:33] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:13:33] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:13:33] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:13:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:13:36] [INFO ] Implicit Places using invariants and state equation in 2583 ms returned []
Implicit Place search using SMT with State Equation took 2851 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 416/422 places, 436/439 transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:13:36] [INFO ] Invariants computation overflowed in 31 ms
Incomplete random walk after 1000000 steps, including 156160 resets, run finished after 1664 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96092 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:13:38] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:13:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 21:13:39] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2021-05-09 21:13:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 21:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 21:13:39] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2021-05-09 21:13:39] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:13:39] [INFO ] [Nat]Added 87 Read/Feed constraints in 23 ms returned sat
[2021-05-09 21:13:40] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2021-05-09 21:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2021-05-09 21:13:40] [INFO ] Computed and/alt/rep : 321/2158/321 causal constraints (skipped 114 transitions) in 24 ms.
[2021-05-09 21:13:48] [INFO ] Deduced a trap composed of 119 places in 143 ms of which 1 ms to minimize.
[2021-05-09 21:13:48] [INFO ] Deduced a trap composed of 125 places in 140 ms of which 0 ms to minimize.
[2021-05-09 21:13:48] [INFO ] Deduced a trap composed of 130 places in 141 ms of which 1 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 130 places in 146 ms of which 1 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 0 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 0 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2021-05-09 21:13:49] [INFO ] Deduced a trap composed of 140 places in 138 ms of which 0 ms to minimize.
[2021-05-09 21:13:50] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2021-05-09 21:13:50] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2021-05-09 21:13:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2575 ms
[2021-05-09 21:13:50] [INFO ] Added : 279 causal constraints over 56 iterations in 10886 ms. Result :sat
Minimization took 1663 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Interrupted Parikh walk after 16309509 steps, including 2787797 resets, run timeout after 30001 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Starting structural reductions, iteration 0 : 416/416 places, 436/436 transitions.
Applied a total of 0 rules in 8 ms. Remains 416 /416 variables (removed 0) and now considering 436/436 (removed 0) transitions.
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:14:22] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:14:22] [INFO ] Implicit Places using invariants in 271 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:14:22] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-09 21:14:23] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 21:14:25] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3101 ms to find 0 implicit places.
[2021-05-09 21:14:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 436 rows 416 cols
[2021-05-09 21:14:25] [INFO ] Invariants computation overflowed in 30 ms
[2021-05-09 21:14:25] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 436/436 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-15 in 87298 ms.
[2021-05-09 21:14:26] [INFO ] Flatten gal took : 96 ms
[2021-05-09 21:14:26] [INFO ] Applying decomposition
[2021-05-09 21:14:26] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10622007587051261104.txt, -o, /tmp/graph10622007587051261104.bin, -w, /tmp/graph10622007587051261104.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10622007587051261104.bin, -l, -1, -v, -w, /tmp/graph10622007587051261104.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 21:14:26] [INFO ] Decomposing Gal with order
[2021-05-09 21:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 21:14:26] [INFO ] Removed a total of 205 redundant transitions.
[2021-05-09 21:14:26] [INFO ] Flatten gal took : 107 ms
[2021-05-09 21:14:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 198 labels/synchronizations in 22 ms.
[2021-05-09 21:14:26] [INFO ] Time to serialize gal into /tmp/UpperBounds2614780504151770959.gal : 12 ms
[2021-05-09 21:14:26] [INFO ] Time to serialize properties into /tmp/UpperBounds452742293965298736.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2614780504151770959.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds452742293965298736.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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