Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 5.9M May 10 09:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652591588926

Running Version 0
[2022-05-15 05:13:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 05:13:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:13:10] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2022-05-15 05:13:10] [INFO ] Transformed 500 places.
[2022-05-15 05:13:10] [INFO ] Transformed 10200 transitions.
[2022-05-15 05:13:10] [INFO ] Found NUPN structural information;
[2022-05-15 05:13:10] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 518 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 100 ms.
FORMULA Dekker-PT-100-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 05:13:11] [INFO ] Computed 300 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 10) seen :8
FORMULA Dekker-PT-100-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
[2022-05-15 05:13:11] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 05:13:11] [INFO ] Computed 300 place invariants in 16 ms
[2022-05-15 05:13:11] [INFO ] [Real]Absence check using 200 positive place invariants in 42 ms returned sat
[2022-05-15 05:13:11] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 14 ms returned sat
[2022-05-15 05:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:12] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-05-15 05:13:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-15 05:13:12] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 13 ms returned sat
[2022-05-15 05:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:12] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-05-15 05:13:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:13:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 31 ms returned sat
[2022-05-15 05:13:12] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 8 ms to minimize.
[2022-05-15 05:13:13] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 2 ms to minimize.
[2022-05-15 05:13:13] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2022-05-15 05:13:13] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 2 ms to minimize.
[2022-05-15 05:13:14] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2022-05-15 05:13:14] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2022-05-15 05:13:14] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2022-05-15 05:13:14] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-05-15 05:13:14] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 0 ms to minimize.
[2022-05-15 05:13:15] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2022-05-15 05:13:15] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2022-05-15 05:13:15] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2022-05-15 05:13:15] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2022-05-15 05:13:16] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-05-15 05:13:16] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2022-05-15 05:13:16] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2022-05-15 05:13:16] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2022-05-15 05:13:16] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2022-05-15 05:13:17] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2022-05-15 05:13:17] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2022-05-15 05:13:17] [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:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:13:17] [INFO ] [Real]Absence check using 200 positive place invariants in 37 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 13 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:17] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Real]Added 100 Read/Feed constraints in 31 ms returned sat
[2022-05-15 05:13:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:17] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 13 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:17] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-05-15 05:13:17] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2022-05-15 05:13:18] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2022-05-15 05:13:18] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2022-05-15 05:13:18] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2022-05-15 05:13:18] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2022-05-15 05:13:19] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2022-05-15 05:13:20] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2022-05-15 05:13:21] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2022-05-15 05:13:22] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-15 05:13:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1102 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 05:13:23] [INFO ] Computed 300 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21492 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3349 ms. (steps per millisecond=298 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3313 ms. (steps per millisecond=301 ) properties (out of 2) seen :0
[2022-05-15 05:13:51] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 05:13:51] [INFO ] Computed 300 place invariants in 13 ms
[2022-05-15 05:13:52] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2022-05-15 05:13:52] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 14 ms returned sat
[2022-05-15 05:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:52] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-05-15 05:13:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:13:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2022-05-15 05:13:52] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 17 ms returned sat
[2022-05-15 05:13:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:13:52] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-15 05:13:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:13:52] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2022-05-15 05:13:52] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2022-05-15 05:13:53] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2022-05-15 05:13:53] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2022-05-15 05:13:53] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2022-05-15 05:13:53] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2022-05-15 05:13:54] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2022-05-15 05:13:54] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2022-05-15 05:13:54] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2022-05-15 05:13:54] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2022-05-15 05:13:55] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2022-05-15 05:13:55] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2022-05-15 05:13:55] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2022-05-15 05:13:55] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2022-05-15 05:13:55] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 0 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 15 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-15 05:13:56] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 1 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-15 05:13:57] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 8 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2022-05-15 05:13:58] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:13:59] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2022-05-15 05:14:00] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2022-05-15 05:14:00] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2022-05-15 05:14:00] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2022-05-15 05:14:00] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2022-05-15 05:14:01] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 5 ms to minimize.
[2022-05-15 05:14:02] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 0 ms to minimize.
[2022-05-15 05:14:02] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2022-05-15 05:14:02] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:02] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 1 ms to minimize.
[2022-05-15 05:14:02] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 0 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-05-15 05:14:03] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:14:04] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:05] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:06] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:14:07] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2022-05-15 05:14:08] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2022-05-15 05:14:08] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2022-05-15 05:14:08] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2022-05-15 05:14:08] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2022-05-15 05:14:08] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 1 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2022-05-15 05:14:09] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2022-05-15 05:14:10] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2022-05-15 05:14:10] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2022-05-15 05:14:10] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2022-05-15 05:14:10] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2022-05-15 05:14:10] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:14:11] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 0 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-15 05:14:12] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2022-05-15 05:14:13] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2022-05-15 05:14:14] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 0 ms to minimize.
[2022-05-15 05:14:15] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:14:16] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:17] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2022-05-15 05:14:18] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:14:19] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 1 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
[2022-05-15 05:14:20] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:14:21] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:22] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:14:23] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 05:14:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 2 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:25] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 3 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:14:26] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:14:27] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:14:28] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:14:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 0 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-15 05:14:30] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:14:31] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:32] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 05:14:33] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:14:34] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:14:35] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-05-15 05:14:36] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 05:14:37] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:37] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2022-05-15 05:14:37] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:37] [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:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:14:37] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 12 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:37] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Real]Added 100 Read/Feed constraints in 32 ms returned sat
[2022-05-15 05:14:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:14:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 12 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:14:37] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-15 05:14:37] [INFO ] [Nat]Added 100 Read/Feed constraints in 29 ms returned sat
[2022-05-15 05:14:38] [INFO ] Deduced a trap composed of 6 places in 218 ms of which 0 ms to minimize.
[2022-05-15 05:14:38] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2022-05-15 05:14:38] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2022-05-15 05:14:38] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2022-05-15 05:14:39] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2022-05-15 05:14:39] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2022-05-15 05:14:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2022-05-15 05:14:39] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2022-05-15 05:14:39] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2022-05-15 05:14:40] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2022-05-15 05:14:40] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2022-05-15 05:14:40] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2022-05-15 05:14:40] [INFO ] Deduced a trap composed of 5 places in 168 ms of which 1 ms to minimize.
[2022-05-15 05:14:40] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2022-05-15 05:14:41] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2022-05-15 05:14:42] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:43] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:14:44] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:14:45] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:14:46] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:14:47] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2022-05-15 05:14:48] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:14:49] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:14:50] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:14:51] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2022-05-15 05:14:52] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 0 ms to minimize.
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 4 places in 169 ms of which 0 ms to minimize.
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 6 places in 165 ms of which 0 ms to minimize.
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2022-05-15 05:14:53] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 0 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 1 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2022-05-15 05:14:54] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2022-05-15 05:14:55] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2022-05-15 05:14:56] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2022-05-15 05:14:57] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 1 ms to minimize.
[2022-05-15 05:14:58] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:14:59] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 18 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2022-05-15 05:15:00] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-15 05:15:01] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:15:02] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2022-05-15 05:15:03] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:15:04] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:15:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:15:06] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-05-15 05:15:07] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-05-15 05:15:08] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:15:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:10] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:15:11] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:15:12] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:15:13] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-05-15 05:15:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:15:15] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-15 05:15:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:15:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:15:18] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2022-05-15 05:15:19] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:15:20] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:15:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:15:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 462 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 551 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 05:15:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2022-05-15 05:15:23] [INFO ] Computed 300 place invariants in 2 ms
[2022-05-15 05:15:31] [INFO ] Implicit Places using invariants in 7553 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 365, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 7569 ms to find 100 implicit places.
[2022-05-15 05:15:31] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:15:31] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 05:15:34] [INFO ] Dead Transitions using invariants and state equation in 3038 ms returned []
Starting structural reductions, iteration 1 : 400/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 389 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 05:15:34] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:15:34] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-15 05:15:37] [INFO ] Dead Transitions using invariants and state equation in 2886 ms returned []
Finished structural reductions, in 2 iterations. Remains : 400/500 places, 10200/10200 transitions.
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:15:37] [INFO ] Computed 200 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21612 ms. (steps per millisecond=46 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2827 ms. (steps per millisecond=353 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2845 ms. (steps per millisecond=351 ) properties (out of 2) seen :0
[2022-05-15 05:16:04] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:16:04] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-15 05:16:04] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2022-05-15 05:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:05] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-05-15 05:16:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:16:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 31 ms returned sat
[2022-05-15 05:16:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:05] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-15 05:16:05] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:16:05] [INFO ] [Nat]Added 100 Read/Feed constraints in 38 ms returned sat
[2022-05-15 05:16:05] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2022-05-15 05:16:05] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2022-05-15 05:16:05] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2022-05-15 05:16:05] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2022-05-15 05:16:06] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:16:07] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:08] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:16:11] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 6605 ms
[2022-05-15 05:16:12] [INFO ] Computed and/alt/rep : 200/300/200 causal constraints (skipped 100 transitions) in 170 ms.
[2022-05-15 05:16:12] [INFO ] Added : 1 causal constraints over 1 iterations in 244 ms. Result :sat
Minimization took 112 ms.
[2022-05-15 05:16:12] [INFO ] [Real]Absence check using 200 positive place invariants in 24 ms returned sat
[2022-05-15 05:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:12] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-15 05:16:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:16:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:16:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:12] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-15 05:16:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2022-05-15 05:16:12] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2022-05-15 05:16:13] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 1 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:16:14] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:16] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:16:18] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:20] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:16:22] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:24] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:16:25] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:26] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:28] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:16:29] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:30] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:16:31] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:32] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 5 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-05-15 05:16:33] [INFO ] Trap strengthening (SAT) tested/added 278/277 trap constraints in 20761 ms
[2022-05-15 05:16:33] [INFO ] Computed and/alt/rep : 200/300/200 causal constraints (skipped 100 transitions) in 126 ms.
[2022-05-15 05:16:33] [INFO ] Added : 1 causal constraints over 1 iterations in 203 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 30100 steps, including 98 resets, run finished after 1571 ms. (steps per millisecond=19 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30100 steps, including 98 resets, run finished after 1581 ms. (steps per millisecond=19 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 389 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Starting structural reductions, iteration 0 : 400/400 places, 10200/10200 transitions.
Applied a total of 0 rules in 379 ms. Remains 400 /400 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2022-05-15 05:16:37] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:16:37] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 05:16:39] [INFO ] Implicit Places using invariants in 1526 ms returned []
Implicit Place search using SMT only with invariants took 1526 ms to find 0 implicit places.
[2022-05-15 05:16:39] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:16:39] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 05:16:42] [INFO ] Dead Transitions using invariants and state equation in 2787 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10200/10200 transitions.
Starting property specific reduction for Dekker-PT-100-UpperBounds-00
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:16:42] [INFO ] Computed 200 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-05-15 05:16:42] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:16:42] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-15 05:16:42] [INFO ] [Real]Absence check using 200 positive place invariants in 25 ms returned sat
[2022-05-15 05:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:42] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2022-05-15 05:16:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:16:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:16:42] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-15 05:16:42] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:16:42] [INFO ] [Nat]Added 100 Read/Feed constraints in 37 ms returned sat
[2022-05-15 05:16:42] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2022-05-15 05:16:43] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:16:44] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:45] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:16:46] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:16:47] [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 400 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 364 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Normalized transition count is 399 out of 10199 initially.
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:16:48] [INFO ] Computed 200 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21504 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2883 ms. (steps per millisecond=346 ) properties (out of 1) seen :0
[2022-05-15 05:17:12] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:17:12] [INFO ] Computed 200 place invariants in 3 ms
[2022-05-15 05:17:12] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:12] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-15 05:17:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:17:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:12] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-05-15 05:17:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:17:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 34 ms returned sat
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-15 05:17:13] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2022-05-15 05:17:14] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:17:15] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:17:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:17:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:17:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-05-15 05:17:19] [INFO ] Trap strengthening (SAT) tested/added 71/70 trap constraints in 6573 ms
[2022-05-15 05:17:19] [INFO ] Computed and/alt/rep : 199/298/199 causal constraints (skipped 100 transitions) in 123 ms.
[2022-05-15 05:17:19] [INFO ] Added : 1 causal constraints over 1 iterations in 195 ms. Result :sat
Minimization took 114 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 30100 steps, including 98 resets, run finished after 1629 ms. (steps per millisecond=18 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 365 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 369 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
[2022-05-15 05:17:22] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:17:22] [INFO ] Computed 200 place invariants in 4 ms
[2022-05-15 05:17:23] [INFO ] Implicit Places using invariants in 1662 ms returned []
Implicit Place search using SMT only with invariants took 1663 ms to find 0 implicit places.
[2022-05-15 05:17:23] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:17:23] [INFO ] Computed 200 place invariants in 1 ms
[2022-05-15 05:17:26] [INFO ] Dead Transitions using invariants and state equation in 2808 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Ending property specific reduction for Dekker-PT-100-UpperBounds-00 in 44562 ms.
Starting property specific reduction for Dekker-PT-100-UpperBounds-04
Normalized transition count is 400 out of 10200 initially.
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:17:26] [INFO ] Computed 200 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-05-15 05:17:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 400 cols
[2022-05-15 05:17:26] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 05:17:27] [INFO ] [Real]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-05-15 05:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:27] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2022-05-15 05:17:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:17:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2022-05-15 05:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:27] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-15 05:17:27] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:17:27] [INFO ] [Nat]Added 100 Read/Feed constraints in 35 ms returned sat
[2022-05-15 05:17:27] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2022-05-15 05:17:27] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2022-05-15 05:17:27] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 0 ms to minimize.
[2022-05-15 05:17:27] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:17:28] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:17:29] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:17:30] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-05-15 05:17:31] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:17:32] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:17:32] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:17:33] [INFO ] Deduced a trap composed of 2 places in 965 ms of which 0 ms to minimize.
[2022-05-15 05:17:33] [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 400 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 362 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Normalized transition count is 399 out of 10199 initially.
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:17:33] [INFO ] Computed 200 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 21412 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2902 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
[2022-05-15 05:17:57] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:17:57] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 05:17:57] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:57] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2022-05-15 05:17:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:17:58] [INFO ] [Nat]Absence check using 200 positive place invariants in 26 ms returned sat
[2022-05-15 05:17:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:17:58] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-15 05:17:58] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 05:17:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 36 ms returned sat
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2022-05-15 05:17:58] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:17:59] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:18:00] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:01] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:03] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:04] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:05] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2022-05-15 05:18:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:07] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:08] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-15 05:18:09] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:10] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:11] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:12] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-15 05:18:13] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:14] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:16] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-15 05:18:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-05-15 05:18:18] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2022-05-15 05:18:19] [INFO ] Trap strengthening (SAT) tested/added 278/277 trap constraints in 20784 ms
[2022-05-15 05:18:19] [INFO ] Computed and/alt/rep : 199/298/199 causal constraints (skipped 100 transitions) in 135 ms.
[2022-05-15 05:18:19] [INFO ] Added : 1 causal constraints over 1 iterations in 206 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 30100 steps, including 98 resets, run finished after 1586 ms. (steps per millisecond=18 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 362 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Starting structural reductions, iteration 0 : 400/400 places, 10199/10199 transitions.
Applied a total of 0 rules in 368 ms. Remains 400 /400 variables (removed 0) and now considering 10199/10199 (removed 0) transitions.
[2022-05-15 05:18:21] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:18:21] [INFO ] Computed 200 place invariants in 2 ms
[2022-05-15 05:18:23] [INFO ] Implicit Places using invariants in 1352 ms returned []
Implicit Place search using SMT only with invariants took 1353 ms to find 0 implicit places.
[2022-05-15 05:18:23] [INFO ] Flow matrix only has 399 transitions (discarded 9800 similar events)
// Phase 1: matrix 399 rows 400 cols
[2022-05-15 05:18:23] [INFO ] Computed 200 place invariants in 0 ms
[2022-05-15 05:18:25] [INFO ] Dead Transitions using invariants and state equation in 2844 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/400 places, 10199/10199 transitions.
Ending property specific reduction for Dekker-PT-100-UpperBounds-04 in 59253 ms.
[2022-05-15 05:18:26] [INFO ] Flatten gal took : 690 ms
[2022-05-15 05:18:27] [INFO ] Applying decomposition
[2022-05-15 05:18:27] [INFO ] Flatten gal took : 469 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/graph14489150511406723769.txt, -o, /tmp/graph14489150511406723769.bin, -w, /tmp/graph14489150511406723769.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/graph14489150511406723769.bin, -l, -1, -v, -w, /tmp/graph14489150511406723769.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-15 05:18:28] [INFO ] Decomposing Gal with order
[2022-05-15 05:18:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 05:18:29] [INFO ] Removed a total of 29400 redundant transitions.
[2022-05-15 05:18:29] [INFO ] Flatten gal took : 872 ms
[2022-05-15 05:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 251 ms.
[2022-05-15 05:18:30] [INFO ] Time to serialize gal into /tmp/UpperBounds10573029959744533482.gal : 94 ms
[2022-05-15 05:18:30] [INFO ] Time to serialize properties into /tmp/UpperBounds6654172226363653582.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/UpperBounds10573029959744533482.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6654172226363653582.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/UpperBounds10573029959744533482.gal -t CGAL -reachable-file /tmp/UpperBounds6654172226363653582.prop --nowitness
Loading property file /tmp/UpperBounds6654172226363653582.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.46502e+31,3.26513,41000,203,10,2876,5175,10615,2201,26,5097,0
Total reachable state count : 64650180611639699476331863474176

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-100-UpperBounds-00 :0 <= u68.p3_68 <= 1
FORMULA Dekker-PT-100-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-UpperBounds-00,0,3.28867,41000,1,0,2876,5175,11215,2201,37,5097,5755
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Dekker-PT-100-UpperBounds-04 :0 <= u7.p3_7 <= 1
FORMULA Dekker-PT-100-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-100-UpperBounds-04,0,3.30657,41000,1,0,2876,5175,11447,2201,37,5097,5943

BK_STOP 1652591915069

--------------------
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="Dekker-PT-100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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