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.r132-tall-165271820600221.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-2000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820600221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.5M
-rw-r--r-- 1 mcc users 9.2K Apr 30 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.2M May 10 09:34 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 JoinFreeModules-PT-2000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652758098729

Running Version 202205111006
[2022-05-17 03:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 03:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:28:20] [INFO ] Load time of PNML (sax parser for PT used): 445 ms
[2022-05-17 03:28:20] [INFO ] Transformed 10001 places.
[2022-05-17 03:28:20] [INFO ] Transformed 16001 transitions.
[2022-05-17 03:28:20] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 621 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:20] [INFO ] Computed 2000 place invariants in 109 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=9 ) properties (out of 16) seen :8016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=10 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=10 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 16) seen :8016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 845 ms. (steps per millisecond=11 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 807 ms. (steps per millisecond=12 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=11 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 813 ms. (steps per millisecond=12 ) properties (out of 16) seen :8016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 16) seen :8016
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=12 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 814 ms. (steps per millisecond=12 ) properties (out of 16) seen :8015
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 806 ms. (steps per millisecond=12 ) properties (out of 16) seen :8016
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:35] [INFO ] Computed 2000 place invariants in 41 ms
[2022-05-17 03:28:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 694 ms returned sat
[2022-05-17 03:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:28:40] [INFO ] [Real]Absence check using state equation in 3337 ms returned unknown
[2022-05-17 03:28:42] [INFO ] [Real]Absence check using 2000 positive place invariants in 700 ms returned sat
[2022-05-17 03:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:28:45] [INFO ] [Real]Absence check using state equation in 3399 ms returned unknown
[2022-05-17 03:28:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 787 ms returned sat
[2022-05-17 03:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:28:50] [INFO ] [Real]Absence check using state equation in 3266 ms returned unknown
[2022-05-17 03:28:52] [INFO ] [Real]Absence check using 2000 positive place invariants in 771 ms returned sat
[2022-05-17 03:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:28:55] [INFO ] [Real]Absence check using state equation in 3266 ms returned unknown
[2022-05-17 03:28:57] [INFO ] [Real]Absence check using 2000 positive place invariants in 749 ms returned sat
[2022-05-17 03:28:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:00] [INFO ] [Real]Absence check using state equation in 3240 ms returned unknown
[2022-05-17 03:29:02] [INFO ] [Real]Absence check using 2000 positive place invariants in 767 ms returned sat
[2022-05-17 03:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:05] [INFO ] [Real]Absence check using state equation in 3413 ms returned unknown
[2022-05-17 03:29:07] [INFO ] [Real]Absence check using 2000 positive place invariants in 762 ms returned sat
[2022-05-17 03:29:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:10] [INFO ] [Real]Absence check using state equation in 3302 ms returned unknown
[2022-05-17 03:29:12] [INFO ] [Real]Absence check using 2000 positive place invariants in 725 ms returned sat
[2022-05-17 03:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:15] [INFO ] [Real]Absence check using state equation in 3404 ms returned unknown
[2022-05-17 03:29:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 728 ms returned sat
[2022-05-17 03:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:20] [INFO ] [Real]Absence check using state equation in 3311 ms returned unknown
[2022-05-17 03:29:22] [INFO ] [Real]Absence check using 2000 positive place invariants in 716 ms returned sat
[2022-05-17 03:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:25] [INFO ] [Real]Absence check using state equation in 3412 ms returned unknown
[2022-05-17 03:29:27] [INFO ] [Real]Absence check using 2000 positive place invariants in 738 ms returned sat
[2022-05-17 03:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 03:29:32] [INFO ] [Real]Absence check using 2000 positive place invariants in 720 ms returned sat
[2022-05-17 03:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 03:29:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 731 ms returned sat
[2022-05-17 03:29:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:40] [INFO ] [Real]Absence check using state equation in 3335 ms returned unknown
[2022-05-17 03:29:42] [INFO ] [Real]Absence check using 2000 positive place invariants in 722 ms returned sat
[2022-05-17 03:29:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:45] [INFO ] [Real]Absence check using state equation in 3340 ms returned unknown
[2022-05-17 03:29:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 728 ms returned sat
[2022-05-17 03:29:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:50] [INFO ] [Real]Absence check using state equation in 3359 ms returned unknown
[2022-05-17 03:29:52] [INFO ] [Real]Absence check using 2000 positive place invariants in 732 ms returned sat
[2022-05-17 03:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:29:55] [INFO ] [Real]Absence check using state equation in 3332 ms returned unknown
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[1, 2, 2, 2, 2, 2, 2000, 2000, 2, 2, 1, 2000, 1, 2000, 2, 1]
Support contains 16 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 80 are kept as prefixes of interest. Removing 9920 places using SCC suffix rule.32 ms
Discarding 9920 places :
Also discarding 15872 output transitions
Drop transitions removed 15872 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 103 ms. Remains 80 /10000 variables (removed 9920) and now considering 128/16001 (removed 15873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:29:55] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-17 03:29:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/10000 places, 128/16001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:29:56] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000326 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1042 ) properties (out of 16) seen :30203
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 16) seen :10250
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties (out of 16) seen :8339
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 16) seen :8385
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties (out of 16) seen :8327
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 16) seen :8344
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties (out of 16) seen :10209
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 16) seen :8257
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 16) seen :8248
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties (out of 16) seen :8339
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 16) seen :8367
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 16) seen :10227
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties (out of 16) seen :8239
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 16) seen :9383
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 16) seen :8248
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 16) seen :8320
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 16) seen :9435
// Phase 1: matrix 128 rows 80 cols
[2022-05-17 03:30:15] [INFO ] Computed 16 place invariants in 2 ms
[2022-05-17 03:30:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:15] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 03:30:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-17 03:30:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2022-05-17 03:30:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:15] [INFO ] Added : 47 causal constraints over 10 iterations in 252 ms. Result :sat
Minimization took 59 ms.
[2022-05-17 03:30:15] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2022-05-17 03:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-17 03:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:15] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-05-17 03:30:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-17 03:30:16] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 5 ms to minimize.
[2022-05-17 03:30:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2022-05-17 03:30:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2022-05-17 03:30:16] [INFO ] Added : 58 causal constraints over 14 iterations in 261 ms. Result :sat
Minimization took 40 ms.
[2022-05-17 03:30:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:16] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-17 03:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:16] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-05-17 03:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-17 03:30:16] [INFO ] Added : 42 causal constraints over 10 iterations in 156 ms. Result :sat
Minimization took 120 ms.
[2022-05-17 03:30:16] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:16] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:16] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-17 03:30:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:30:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-05-17 03:30:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:17] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:30:17] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-17 03:30:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2022-05-17 03:30:17] [INFO ] Added : 49 causal constraints over 11 iterations in 269 ms. Result :sat
Minimization took 45 ms.
[2022-05-17 03:30:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:17] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:17] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 20 ms returned sat
[2022-05-17 03:30:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:17] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-05-17 03:30:17] [INFO ] Added : 39 causal constraints over 8 iterations in 192 ms. Result :sat
Minimization took 26 ms.
[2022-05-17 03:30:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:17] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2022-05-17 03:30:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:17] [INFO ] Added : 28 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 37 ms.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:18] [INFO ] Added : 46 causal constraints over 10 iterations in 106 ms. Result :sat
Minimization took 41 ms.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2022-05-17 03:30:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 03:30:18] [INFO ] Added : 42 causal constraints over 9 iterations in 109 ms. Result :sat
Minimization took 47 ms.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:30:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:18] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-17 03:30:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:19] [INFO ] Added : 51 causal constraints over 11 iterations in 159 ms. Result :sat
Minimization took 55 ms.
[2022-05-17 03:30:19] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:30:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:19] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:19] [INFO ] Added : 33 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 63 ms.
[2022-05-17 03:30:19] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:30:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:19] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2022-05-17 03:30:19] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2022-05-17 03:30:19] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 03:30:20] [INFO ] Added : 44 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 65 ms.
[2022-05-17 03:30:20] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:20] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:30:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-05-17 03:30:20] [INFO ] Added : 56 causal constraints over 13 iterations in 259 ms. Result :sat
Minimization took 44 ms.
[2022-05-17 03:30:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:20] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:30:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:20] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-17 03:30:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:20] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-17 03:30:20] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-17 03:30:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 48 ms
[2022-05-17 03:30:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:21] [INFO ] Added : 41 causal constraints over 9 iterations in 197 ms. Result :sat
Minimization took 38 ms.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:30:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:30:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 03:30:21] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-17 03:30:21] [INFO ] Added : 55 causal constraints over 12 iterations in 173 ms. Result :sat
Minimization took 46 ms.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:21] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:30:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-17 03:30:21] [INFO ] Added : 46 causal constraints over 11 iterations in 192 ms. Result :sat
Minimization took 42 ms.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:30:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:22] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2022-05-17 03:30:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:22] [INFO ] Added : 50 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 1747, 1832, 1753, 1936, 2001, 2000, 2000, 1970, 1730, 2000, 2000, 1759, 2000, 1750, 1723]
FORMULA JoinFreeModules-PT-2000-UpperBounds-10 2003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 5 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2022-05-17 03:30:33] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000335 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 15) seen :28630
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 15) seen :10206
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 15) seen :8325
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 15) seen :8341
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 15) seen :8328
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1077 ms. (steps per millisecond=928 ) properties (out of 15) seen :8322
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 15) seen :10175
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 15) seen :8247
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties (out of 15) seen :8237
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 15) seen :8315
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 15) seen :8320
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1082 ms. (steps per millisecond=924 ) properties (out of 15) seen :8228
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1052 ms. (steps per millisecond=950 ) properties (out of 15) seen :9417
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 15) seen :8252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=925 ) properties (out of 15) seen :8330
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1078 ms. (steps per millisecond=927 ) properties (out of 15) seen :9452
// Phase 1: matrix 120 rows 75 cols
[2022-05-17 03:30:50] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-17 03:30:50] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:50] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-17 03:30:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-17 03:30:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 32 ms returned sat
[2022-05-17 03:30:50] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:50] [INFO ] Added : 46 causal constraints over 11 iterations in 156 ms. Result :sat
Minimization took 34 ms.
[2022-05-17 03:30:50] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:50] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:30:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:50] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-17 03:30:50] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:50] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:51] [INFO ] Added : 41 causal constraints over 9 iterations in 133 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:30:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-17 03:30:51] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:51] [INFO ] Added : 29 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 17 ms.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 03:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:51] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:30:51] [INFO ] Added : 34 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 18 ms.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 03:30:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-05-17 03:30:51] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:51] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:51] [INFO ] Added : 21 causal constraints over 6 iterations in 51 ms. Result :sat
Minimization took 24 ms.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:30:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-17 03:30:52] [INFO ] Added : 32 causal constraints over 8 iterations in 189 ms. Result :sat
Minimization took 23 ms.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:52] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-17 03:30:52] [INFO ] Added : 31 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 45 ms.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-17 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:52] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-17 03:30:52] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:52] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:53] [INFO ] Added : 28 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 51 ms.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:53] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:53] [INFO ] Added : 34 causal constraints over 7 iterations in 132 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-17 03:30:53] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-17 03:30:53] [INFO ] Added : 26 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 24 ms.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:53] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2022-05-17 03:30:53] [INFO ] [Nat]Added 15 Read/Feed constraints in 5 ms returned sat
[2022-05-17 03:30:53] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:54] [INFO ] Added : 29 causal constraints over 7 iterations in 93 ms. Result :sat
Minimization took 46 ms.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 03:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:54] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:54] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:30:54] [INFO ] Added : 24 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 48 ms.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:54] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Nat]Added 15 Read/Feed constraints in 6 ms returned sat
[2022-05-17 03:30:54] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-05-17 03:30:54] [INFO ] Added : 33 causal constraints over 8 iterations in 166 ms. Result :sat
Minimization took 47 ms.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 03:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:55] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2022-05-17 03:30:55] [INFO ] [Nat]Added 15 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:30:55] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:55] [INFO ] Added : 47 causal constraints over 11 iterations in 154 ms. Result :sat
Minimization took 36 ms.
[2022-05-17 03:30:55] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 03:30:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:30:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2022-05-17 03:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:30:55] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-17 03:30:55] [INFO ] [Nat]Added 15 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:30:55] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:30:55] [INFO ] Added : 31 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2002, 2002, 2002, 2002, 2001, 2000, 2000, 2002, 2002, 2000, 1996, 2000, 2002, 1999]
FORMULA JoinFreeModules-PT-2000-UpperBounds-00 2003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2022-05-17 03:31:04] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1001441 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=1314 ) properties (out of 14) seen :26433
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 14) seen :8350
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 14) seen :8331
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 14) seen :8384
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 14) seen :8322
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 14) seen :10168
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 14) seen :8255
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 14) seen :8224
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 14) seen :8381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 14) seen :8340
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 14) seen :8252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 14) seen :9445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 14) seen :8250
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 14) seen :8369
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 14) seen :9451
// Phase 1: matrix 112 rows 70 cols
[2022-05-17 03:31:19] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-17 03:31:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:19] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:31:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:31:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:19] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 03:31:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2022-05-17 03:31:19] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:31:19] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:19] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:31:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:31:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:31:20] [INFO ] Added : 18 causal constraints over 4 iterations in 48 ms. Result :sat
Minimization took 14 ms.
[2022-05-17 03:31:20] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:31:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:31:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:20] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-17 03:31:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:31:20] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-17 03:31:20] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:31:20] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:31:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:20] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:20] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 70 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:21] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-17 03:31:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 68 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 77 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 3 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 75 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 65 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 90 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 81 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:24] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2022-05-17 03:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 101 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 84 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 71 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 542 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 543 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 65 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 82 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 66 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 64 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-17 03:31:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 68 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 72 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2022-05-17 03:31:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:29] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 75 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 75 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:30] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 03:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 69 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 63 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 65 ms
[2022-05-17 03:31:31] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 52 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:31:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 53 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 59 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 56 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 6 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:36] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:31:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:31:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:42] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:44] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:45] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:46] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:49] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 5 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 46 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:58] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:31:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:31:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:31:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:32:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 03:32:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 50 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 03:32:05] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:32:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:05] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2022-05-17 03:32:05] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-17 03:32:05] [INFO ] Added : 22 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 34 ms.
[2022-05-17 03:32:05] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:32:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:05] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-17 03:32:05] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:32:05] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:32:06] [INFO ] Added : 35 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 39 ms.
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:32:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 7 ms returned sat
[2022-05-17 03:32:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-17 03:32:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-17 03:32:06] [INFO ] Added : 37 causal constraints over 8 iterations in 119 ms. Result :sat
Minimization took 46 ms.
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-17 03:32:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:32:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:32:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-17 03:32:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:32:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:32:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-17 03:32:07] [INFO ] Added : 34 causal constraints over 7 iterations in 146 ms. Result :sat
Minimization took 18 ms.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-17 03:32:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 22 ms returned sat
[2022-05-17 03:32:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-17 03:32:07] [INFO ] Added : 39 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 59 ms.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-17 03:32:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:32:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:32:07] [INFO ] Added : 30 causal constraints over 7 iterations in 161 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-17 03:32:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:07] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2022-05-17 03:32:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:32:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:32:08] [INFO ] Added : 33 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 42 ms.
[2022-05-17 03:32:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:08] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-17 03:32:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:08] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:32:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:32:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-17 03:32:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-17 03:32:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 8 ms returned sat
[2022-05-17 03:32:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:32:08] [INFO ] Added : 31 causal constraints over 7 iterations in 114 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [2002, 2003, 2002, 2003, 2003, 2003, 2003, 2002, 2003, 2003, 2003, 2003, 2002, 2003] Max seen :[2002, 2002, 2002, 2002, 2001, 2000, 2000, 2002, 2002, 2000, 2000, 2000, 2002, 2001]
FORMULA JoinFreeModules-PT-2000-UpperBounds-14 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-UpperBounds-08 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-UpperBounds-03 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-UpperBounds-01 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 70 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 50 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 4 ms. Remains 50 /70 variables (removed 20) and now considering 80/112 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/70 places, 80/112 transitions.
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:32:11] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1001402 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=1914 ) properties (out of 10) seen :19618
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 10) seen :8437
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 10) seen :8427
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 10) seen :10108
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 10) seen :8248
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 10) seen :8254
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 10) seen :8462
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 10) seen :8270
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 746 ms. (steps per millisecond=1340 ) properties (out of 10) seen :9645
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 10) seen :8278
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 10) seen :9599
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:32:19] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 03:32:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:32:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:20] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-17 03:32:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:32:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:32:20] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:32:20] [INFO ] Added : 23 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 13 ms.
[2022-05-17 03:32:20] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:20] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:32:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:32:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-17 03:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:32:20] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 03:32:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:32:20] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:21] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:22] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:30] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 58 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:38] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 51 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:41] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2022-05-17 03:32:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:42] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 4 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:32:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:32:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:33:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:01] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 55 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:02] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:33:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2022-05-17 03:33:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2022-05-17 03:33:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-05-17 03:33:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2022-05-17 03:33:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2022-05-17 03:33:05] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2022-05-17 03:33:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-17 03:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:05] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:33:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 03:33:05] [INFO ] Added : 30 causal constraints over 9 iterations in 67 ms. Result :sat
Minimization took 32 ms.
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:05] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:33:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:33:05] [INFO ] Added : 35 causal constraints over 8 iterations in 94 ms. Result :sat
Minimization took 34 ms.
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:33:06] [INFO ] Added : 9 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 41 ms.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:33:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:33:06] [INFO ] Added : 27 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 21 ms.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-17 03:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2022-05-17 03:33:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:33:06] [INFO ] Added : 16 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 20 ms.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-17 03:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2022-05-17 03:33:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:33:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:33:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
[2022-05-17 03:33:06] [INFO ] Added : 18 causal constraints over 5 iterations in 104 ms. Result :sat
Minimization took 29 ms.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:33:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:06] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-17 03:33:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:33:06] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:07] [INFO ] Added : 18 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 25 ms.
[2022-05-17 03:33:07] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:07] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-17 03:33:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 19 ms returned sat
[2022-05-17 03:33:07] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:33:07] [INFO ] Added : 16 causal constraints over 5 iterations in 77 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2002, 2001, 2000, 2000, 2002, 2000, 2000, 2000, 2001]
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 80/80 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:09] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 03:33:09] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:09] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-17 03:33:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:09] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 80/80 transitions.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:09] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11261 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1876 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :7
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:09] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-17 03:33:09] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:10] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 03:33:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:10] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:33:10] [INFO ] Added : 24 causal constraints over 6 iterations in 67 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[7]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:10] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:10] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000301 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=10104 ) properties (out of 1) seen :1988
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 03:33:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:11] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:33:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:33:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-02 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02 in 1361 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:11] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :9
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:11] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:11] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-17 03:33:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:11] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2022-05-17 03:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-17 03:33:11] [INFO ] Added : 27 causal constraints over 6 iterations in 123 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[9]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:12] [INFO ] Computed 1 place invariants in 2 ms
Incomplete random walk after 1000613 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10644 ) properties (out of 1) seen :1964
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-17 03:33:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-04 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04 in 1260 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:12] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10413 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1041 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :153
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:12] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:12] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-17 03:33:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:12] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-17 03:33:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:33:12] [INFO ] Added : 18 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[153]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000115 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=10102 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=4444 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 03:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:33:13] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:13] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 03:33:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:13] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05 in 991 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:13] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10259 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1282 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2000
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:13] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:13] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 03:33:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:13] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-17 03:33:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:13] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:33:13] [INFO ] Added : 35 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:13] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000247 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10002 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=6211 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:33:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:33:14] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:14] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 03:33:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06 in 783 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:14] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2000
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:14] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2022-05-17 03:33:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 03:33:14] [INFO ] Added : 9 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000180 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10311 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:33:14] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:14] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:14] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:14] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-17 03:33:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07 in 692 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:15] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :6
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:15] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:15] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:15] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:15] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-17 03:33:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:15] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:15] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 03:33:15] [INFO ] Added : 21 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[6]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:15] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:15] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000161 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=10102 ) properties (out of 1) seen :1979
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 03:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:33:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-05-17 03:33:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-09 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09 in 1166 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:16] [INFO ] Computed 10 place invariants in 0 ms
Incomplete random walk after 11346 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1134 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2000
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:16] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-17 03:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-17 03:33:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:16] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2022-05-17 03:33:16] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:16] [INFO ] Added : 16 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000754 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10317 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:33:16] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:16] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-17 03:33:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11 in 664 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:16] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 11008 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1223 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :140
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:16] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-05-17 03:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:16] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-17 03:33:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:17] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2022-05-17 03:33:17] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 03:33:17] [INFO ] Added : 11 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 148 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:17] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:17] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000068 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10417 ) properties (out of 1) seen :1980
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=7518 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 03:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:17] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-17 03:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-17 03:33:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:33:17] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:17] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-17 03:33:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000101 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10417 ) properties (out of 1) seen :1985
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:18] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:18] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-17 03:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-17 03:33:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-17 03:33:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 03:33:18] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-17 03:33:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:18] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12 in 1893 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:18] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2000
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:18] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:18] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-17 03:33:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2022-05-17 03:33:18] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:18] [INFO ] Added : 18 causal constraints over 5 iterations in 57 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:19] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000606 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10006 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:19] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-17 03:33:19] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:33:19] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:19] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 03:33:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:19] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13 in 712 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:19] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :140
// Phase 1: matrix 80 rows 50 cols
[2022-05-17 03:33:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-17 03:33:19] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-17 03:33:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-17 03:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:19] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-17 03:33:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-17 03:33:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 17 ms returned sat
[2022-05-17 03:33:19] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-17 03:33:19] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[140]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 5 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /50 variables (removed 45) and now considering 8/80 (removed 72) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:20] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/50 places, 8/80 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000134 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10418 ) properties (out of 1) seen :1962
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=7633 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 03:33:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-17 03:33:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-17 03:33:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-17 03:33:20] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1999]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:20] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-17 03:33:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:20] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000285 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=10002 ) properties (out of 1) seen :1995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7299 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:21] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 03:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-17 03:33:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 03:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 03:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 03:33:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 03:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 03:33:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-05-17 03:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-17 03:33:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 03:33:21] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:21] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:21] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 03:33:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-17 03:33:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:33:21] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 03:33:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15 in 2074 ms.
[2022-05-17 03:33:21] [INFO ] Flatten gal took : 30 ms
[2022-05-17 03:33:21] [INFO ] Applying decomposition
[2022-05-17 03:33:21] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13927659878783950679.txt' '-o' '/tmp/graph13927659878783950679.bin' '-w' '/tmp/graph13927659878783950679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13927659878783950679.bin' '-l' '-1' '-v' '-w' '/tmp/graph13927659878783950679.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:33:21] [INFO ] Decomposing Gal with order
[2022-05-17 03:33:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:33:21] [INFO ] Flatten gal took : 6 ms
[2022-05-17 03:33:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-17 03:33:21] [INFO ] Time to serialize gal into /tmp/UpperBounds8998381468233890248.gal : 3 ms
[2022-05-17 03:33:21] [INFO ] Time to serialize properties into /tmp/UpperBounds9221606727189364559.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8998381468233890248.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9221606727189364559.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds9221606727189364559.prop.
Detected timeout of ITS tools.
[2022-05-17 03:55:02] [INFO ] Flatten gal took : 7 ms
[2022-05-17 03:55:02] [INFO ] Time to serialize gal into /tmp/UpperBounds17403990539382043388.gal : 2 ms
[2022-05-17 03:55:02] [INFO ] Time to serialize properties into /tmp/UpperBounds9654414795044076517.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17403990539382043388.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9654414795044076517.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds9654414795044076517.prop.
Detected timeout of ITS tools.
[2022-05-17 04:16:42] [INFO ] Flatten gal took : 6 ms
[2022-05-17 04:16:42] [INFO ] Input system was already deterministic with 80 transitions.
[2022-05-17 04:16:42] [INFO ] Transformed 50 places.
[2022-05-17 04:16:42] [INFO ] Transformed 80 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 04:16:42] [INFO ] Time to serialize gal into /tmp/UpperBounds11653541251741484915.gal : 2 ms
[2022-05-17 04:16:42] [INFO ] Time to serialize properties into /tmp/UpperBounds3162224618880987373.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11653541251741484915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3162224618880987373.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-2000, 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 r132-tall-165271820600221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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